./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi007_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_75f2ac59-561f-4adb-b260-b43772382174/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_75f2ac59-561f-4adb-b260-b43772382174/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_75f2ac59-561f-4adb-b260-b43772382174/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_75f2ac59-561f-4adb-b260-b43772382174/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi007_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_75f2ac59-561f-4adb-b260-b43772382174/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_75f2ac59-561f-4adb-b260-b43772382174/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ba285cceecb5b920bb647903ab6e1e54ede4b67e .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 12:50:26,687 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:50:26,689 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:50:26,696 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:50:26,697 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:50:26,697 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:50:26,698 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:50:26,700 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:50:26,701 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:50:26,701 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:50:26,702 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:50:26,703 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:50:26,703 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:50:26,704 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:50:26,704 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:50:26,705 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:50:26,706 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:50:26,707 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:50:26,708 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:50:26,709 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:50:26,710 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:50:26,711 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:50:26,712 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:50:26,712 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:50:26,714 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:50:26,714 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:50:26,714 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:50:26,714 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:50:26,715 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:50:26,715 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:50:26,716 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:50:26,716 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:50:26,716 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:50:26,717 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:50:26,717 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:50:26,718 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:50:26,718 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:50:26,718 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:50:26,718 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:50:26,719 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:50:26,719 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:50:26,720 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_75f2ac59-561f-4adb-b260-b43772382174/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 12:50:26,729 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:50:26,729 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:50:26,730 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:50:26,730 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:50:26,730 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:50:26,731 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:50:26,731 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:50:26,731 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:50:26,731 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:50:26,731 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:50:26,731 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:50:26,731 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:50:26,732 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:50:26,732 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:50:26,732 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:50:26,732 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:50:26,732 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:50:26,732 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:50:26,732 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:50:26,732 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:50:26,733 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:50:26,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:50:26,733 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:50:26,733 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:50:26,733 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:50:26,733 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 12:50:26,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:50:26,733 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:50:26,734 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:50:26,734 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_75f2ac59-561f-4adb-b260-b43772382174/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ba285cceecb5b920bb647903ab6e1e54ede4b67e [2019-12-07 12:50:26,832 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:50:26,841 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:50:26,843 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:50:26,844 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:50:26,844 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:50:26,845 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_75f2ac59-561f-4adb-b260-b43772382174/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi007_pso.opt.i [2019-12-07 12:50:26,884 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_75f2ac59-561f-4adb-b260-b43772382174/bin/uautomizer/data/d09d9403e/a965720678b444fe8ddbceb611e4d61c/FLAG37d6039d2 [2019-12-07 12:50:27,380 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:50:27,381 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_75f2ac59-561f-4adb-b260-b43772382174/sv-benchmarks/c/pthread-wmm/rfi007_pso.opt.i [2019-12-07 12:50:27,391 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_75f2ac59-561f-4adb-b260-b43772382174/bin/uautomizer/data/d09d9403e/a965720678b444fe8ddbceb611e4d61c/FLAG37d6039d2 [2019-12-07 12:50:27,400 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_75f2ac59-561f-4adb-b260-b43772382174/bin/uautomizer/data/d09d9403e/a965720678b444fe8ddbceb611e4d61c [2019-12-07 12:50:27,402 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:50:27,403 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:50:27,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:50:27,403 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:50:27,406 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:50:27,406 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:50:27" (1/1) ... [2019-12-07 12:50:27,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@551fb3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:50:27, skipping insertion in model container [2019-12-07 12:50:27,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:50:27" (1/1) ... [2019-12-07 12:50:27,413 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:50:27,440 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:50:27,690 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:50:27,697 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:50:27,737 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:50:27,781 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:50:27,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:50:27 WrapperNode [2019-12-07 12:50:27,781 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:50:27,782 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:50:27,782 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:50:27,782 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:50:27,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:50:27" (1/1) ... [2019-12-07 12:50:27,800 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:50:27" (1/1) ... [2019-12-07 12:50:27,819 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:50:27,820 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:50:27,820 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:50:27,820 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:50:27,826 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:50:27" (1/1) ... [2019-12-07 12:50:27,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:50:27" (1/1) ... [2019-12-07 12:50:27,830 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:50:27" (1/1) ... [2019-12-07 12:50:27,830 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:50:27" (1/1) ... [2019-12-07 12:50:27,836 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:50:27" (1/1) ... [2019-12-07 12:50:27,839 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:50:27" (1/1) ... [2019-12-07 12:50:27,841 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:50:27" (1/1) ... [2019-12-07 12:50:27,844 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:50:27,845 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:50:27,845 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:50:27,845 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:50:27,845 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:50:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_75f2ac59-561f-4adb-b260-b43772382174/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:50:27,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 12:50:27,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 12:50:27,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:50:27,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 12:50:27,891 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 12:50:27,891 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 12:50:27,891 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 12:50:27,891 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 12:50:27,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 12:50:27,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:50:27,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:50:27,893 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 12:50:28,240 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:50:28,240 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 12:50:28,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:50:28 BoogieIcfgContainer [2019-12-07 12:50:28,241 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:50:28,242 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:50:28,242 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:50:28,244 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:50:28,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:50:27" (1/3) ... [2019-12-07 12:50:28,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e03c1c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:50:28, skipping insertion in model container [2019-12-07 12:50:28,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:50:27" (2/3) ... [2019-12-07 12:50:28,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e03c1c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:50:28, skipping insertion in model container [2019-12-07 12:50:28,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:50:28" (3/3) ... [2019-12-07 12:50:28,246 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi007_pso.opt.i [2019-12-07 12:50:28,252 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 12:50:28,252 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:50:28,257 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 12:50:28,257 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 12:50:28,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,280 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,280 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,280 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,280 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,281 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,286 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,286 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:28,310 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 12:50:28,322 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:50:28,322 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:50:28,322 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:50:28,322 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:50:28,322 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:50:28,323 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:50:28,323 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:50:28,323 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:50:28,332 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-07 12:50:28,334 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-07 12:50:28,380 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-07 12:50:28,381 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:50:28,389 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 560 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 12:50:28,402 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-07 12:50:28,425 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-07 12:50:28,425 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:50:28,428 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 560 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 12:50:28,439 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-07 12:50:28,439 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 12:50:31,051 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-07 12:50:31,346 INFO L206 etLargeBlockEncoding]: Checked pairs total: 76691 [2019-12-07 12:50:31,346 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-07 12:50:31,349 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 90 transitions [2019-12-07 12:50:31,737 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9438 states. [2019-12-07 12:50:31,738 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states. [2019-12-07 12:50:31,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 12:50:31,742 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:31,743 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 12:50:31,743 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:50:31,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:31,747 INFO L82 PathProgramCache]: Analyzing trace with hash 790297, now seen corresponding path program 1 times [2019-12-07 12:50:31,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:31,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621495148] [2019-12-07 12:50:31,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:31,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:31,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:50:31,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621495148] [2019-12-07 12:50:31,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:31,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:50:31,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272949194] [2019-12-07 12:50:31,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:50:31,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:31,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:50:31,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:50:31,950 INFO L87 Difference]: Start difference. First operand 9438 states. Second operand 3 states. [2019-12-07 12:50:32,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:32,151 INFO L93 Difference]: Finished difference Result 9266 states and 29920 transitions. [2019-12-07 12:50:32,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:50:32,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 12:50:32,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:32,214 INFO L225 Difference]: With dead ends: 9266 [2019-12-07 12:50:32,214 INFO L226 Difference]: Without dead ends: 8258 [2019-12-07 12:50:32,215 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:50:32,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8258 states. [2019-12-07 12:50:32,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8258 to 8258. [2019-12-07 12:50:32,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8258 states. [2019-12-07 12:50:32,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8258 states to 8258 states and 26572 transitions. [2019-12-07 12:50:32,496 INFO L78 Accepts]: Start accepts. Automaton has 8258 states and 26572 transitions. Word has length 3 [2019-12-07 12:50:32,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:32,497 INFO L462 AbstractCegarLoop]: Abstraction has 8258 states and 26572 transitions. [2019-12-07 12:50:32,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:50:32,497 INFO L276 IsEmpty]: Start isEmpty. Operand 8258 states and 26572 transitions. [2019-12-07 12:50:32,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 12:50:32,499 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:32,499 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:32,500 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:50:32,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:32,500 INFO L82 PathProgramCache]: Analyzing trace with hash 316025548, now seen corresponding path program 1 times [2019-12-07 12:50:32,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:32,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33568837] [2019-12-07 12:50:32,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:32,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:50:32,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33568837] [2019-12-07 12:50:32,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:32,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:50:32,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133028588] [2019-12-07 12:50:32,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:50:32,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:32,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:50:32,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:50:32,619 INFO L87 Difference]: Start difference. First operand 8258 states and 26572 transitions. Second operand 4 states. [2019-12-07 12:50:32,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:32,667 INFO L93 Difference]: Finished difference Result 1877 states and 4722 transitions. [2019-12-07 12:50:32,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:50:32,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 12:50:32,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:32,674 INFO L225 Difference]: With dead ends: 1877 [2019-12-07 12:50:32,674 INFO L226 Difference]: Without dead ends: 1373 [2019-12-07 12:50:32,675 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:50:32,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2019-12-07 12:50:32,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1373. [2019-12-07 12:50:32,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1373 states. [2019-12-07 12:50:32,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 3108 transitions. [2019-12-07 12:50:32,698 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 3108 transitions. Word has length 11 [2019-12-07 12:50:32,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:32,698 INFO L462 AbstractCegarLoop]: Abstraction has 1373 states and 3108 transitions. [2019-12-07 12:50:32,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:50:32,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 3108 transitions. [2019-12-07 12:50:32,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 12:50:32,700 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:32,700 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:32,700 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:50:32,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:32,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1209477957, now seen corresponding path program 1 times [2019-12-07 12:50:32,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:32,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885457397] [2019-12-07 12:50:32,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:32,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:32,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:50:32,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885457397] [2019-12-07 12:50:32,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:32,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:50:32,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60748643] [2019-12-07 12:50:32,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:50:32,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:32,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:50:32,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:50:32,761 INFO L87 Difference]: Start difference. First operand 1373 states and 3108 transitions. Second operand 4 states. [2019-12-07 12:50:32,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:32,881 INFO L93 Difference]: Finished difference Result 1700 states and 3783 transitions. [2019-12-07 12:50:32,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:50:32,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 12:50:32,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:32,889 INFO L225 Difference]: With dead ends: 1700 [2019-12-07 12:50:32,889 INFO L226 Difference]: Without dead ends: 1700 [2019-12-07 12:50:32,889 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:50:32,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2019-12-07 12:50:32,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1636. [2019-12-07 12:50:32,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1636 states. [2019-12-07 12:50:32,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 3659 transitions. [2019-12-07 12:50:32,916 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 3659 transitions. Word has length 14 [2019-12-07 12:50:32,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:32,917 INFO L462 AbstractCegarLoop]: Abstraction has 1636 states and 3659 transitions. [2019-12-07 12:50:32,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:50:32,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 3659 transitions. [2019-12-07 12:50:32,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 12:50:32,920 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:32,920 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:32,920 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:50:32,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:32,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1133745070, now seen corresponding path program 1 times [2019-12-07 12:50:32,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:32,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421754848] [2019-12-07 12:50:32,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:32,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:33,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:50:33,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421754848] [2019-12-07 12:50:33,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:33,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:50:33,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162489818] [2019-12-07 12:50:33,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:50:33,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:33,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:50:33,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:50:33,021 INFO L87 Difference]: Start difference. First operand 1636 states and 3659 transitions. Second operand 6 states. [2019-12-07 12:50:33,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:33,442 INFO L93 Difference]: Finished difference Result 4529 states and 10000 transitions. [2019-12-07 12:50:33,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 12:50:33,442 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-07 12:50:33,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:33,461 INFO L225 Difference]: With dead ends: 4529 [2019-12-07 12:50:33,461 INFO L226 Difference]: Without dead ends: 4494 [2019-12-07 12:50:33,461 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:50:33,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4494 states. [2019-12-07 12:50:33,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4494 to 2196. [2019-12-07 12:50:33,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2196 states. [2019-12-07 12:50:33,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2196 states to 2196 states and 4963 transitions. [2019-12-07 12:50:33,508 INFO L78 Accepts]: Start accepts. Automaton has 2196 states and 4963 transitions. Word has length 25 [2019-12-07 12:50:33,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:33,509 INFO L462 AbstractCegarLoop]: Abstraction has 2196 states and 4963 transitions. [2019-12-07 12:50:33,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:50:33,509 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 4963 transitions. [2019-12-07 12:50:33,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 12:50:33,510 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:33,510 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:33,511 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:50:33,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:33,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1415860500, now seen corresponding path program 1 times [2019-12-07 12:50:33,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:33,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723860501] [2019-12-07 12:50:33,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:33,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:33,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:50:33,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723860501] [2019-12-07 12:50:33,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:33,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:50:33,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803633468] [2019-12-07 12:50:33,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:50:33,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:33,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:50:33,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:50:33,564 INFO L87 Difference]: Start difference. First operand 2196 states and 4963 transitions. Second operand 5 states. [2019-12-07 12:50:33,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:33,851 INFO L93 Difference]: Finished difference Result 3181 states and 7039 transitions. [2019-12-07 12:50:33,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:50:33,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 12:50:33,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:33,866 INFO L225 Difference]: With dead ends: 3181 [2019-12-07 12:50:33,866 INFO L226 Difference]: Without dead ends: 3181 [2019-12-07 12:50:33,867 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:50:33,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3181 states. [2019-12-07 12:50:33,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3181 to 2680. [2019-12-07 12:50:33,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2680 states. [2019-12-07 12:50:33,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2680 states to 2680 states and 6006 transitions. [2019-12-07 12:50:33,918 INFO L78 Accepts]: Start accepts. Automaton has 2680 states and 6006 transitions. Word has length 26 [2019-12-07 12:50:33,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:33,919 INFO L462 AbstractCegarLoop]: Abstraction has 2680 states and 6006 transitions. [2019-12-07 12:50:33,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:50:33,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2680 states and 6006 transitions. [2019-12-07 12:50:33,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 12:50:33,921 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:33,921 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:33,921 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:50:33,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:33,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1963896570, now seen corresponding path program 1 times [2019-12-07 12:50:33,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:33,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82075725] [2019-12-07 12:50:33,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:33,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:33,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:50:33,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82075725] [2019-12-07 12:50:33,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:33,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:50:33,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330593276] [2019-12-07 12:50:33,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:50:33,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:33,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:50:33,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:50:33,989 INFO L87 Difference]: Start difference. First operand 2680 states and 6006 transitions. Second operand 6 states. [2019-12-07 12:50:34,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:34,391 INFO L93 Difference]: Finished difference Result 5594 states and 12164 transitions. [2019-12-07 12:50:34,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 12:50:34,391 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-07 12:50:34,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:34,398 INFO L225 Difference]: With dead ends: 5594 [2019-12-07 12:50:34,398 INFO L226 Difference]: Without dead ends: 5565 [2019-12-07 12:50:34,398 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:50:34,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5565 states. [2019-12-07 12:50:34,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5565 to 2655. [2019-12-07 12:50:34,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2655 states. [2019-12-07 12:50:34,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2655 states to 2655 states and 5972 transitions. [2019-12-07 12:50:34,443 INFO L78 Accepts]: Start accepts. Automaton has 2655 states and 5972 transitions. Word has length 26 [2019-12-07 12:50:34,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:34,443 INFO L462 AbstractCegarLoop]: Abstraction has 2655 states and 5972 transitions. [2019-12-07 12:50:34,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:50:34,443 INFO L276 IsEmpty]: Start isEmpty. Operand 2655 states and 5972 transitions. [2019-12-07 12:50:34,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 12:50:34,446 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:34,446 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:34,446 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:50:34,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:34,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1348947066, now seen corresponding path program 1 times [2019-12-07 12:50:34,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:34,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895252688] [2019-12-07 12:50:34,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:34,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:50:34,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895252688] [2019-12-07 12:50:34,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:34,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:50:34,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852160794] [2019-12-07 12:50:34,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:50:34,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:34,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:50:34,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:50:34,493 INFO L87 Difference]: Start difference. First operand 2655 states and 5972 transitions. Second operand 4 states. [2019-12-07 12:50:34,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:34,514 INFO L93 Difference]: Finished difference Result 4830 states and 10881 transitions. [2019-12-07 12:50:34,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:50:34,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-07 12:50:34,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:34,520 INFO L225 Difference]: With dead ends: 4830 [2019-12-07 12:50:34,520 INFO L226 Difference]: Without dead ends: 4090 [2019-12-07 12:50:34,521 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:50:34,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4090 states. [2019-12-07 12:50:34,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4090 to 4074. [2019-12-07 12:50:34,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4074 states. [2019-12-07 12:50:34,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4074 states to 4074 states and 9253 transitions. [2019-12-07 12:50:34,567 INFO L78 Accepts]: Start accepts. Automaton has 4074 states and 9253 transitions. Word has length 27 [2019-12-07 12:50:34,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:34,567 INFO L462 AbstractCegarLoop]: Abstraction has 4074 states and 9253 transitions. [2019-12-07 12:50:34,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:50:34,567 INFO L276 IsEmpty]: Start isEmpty. Operand 4074 states and 9253 transitions. [2019-12-07 12:50:34,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 12:50:34,571 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:34,571 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:34,571 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:50:34,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:34,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1234551102, now seen corresponding path program 1 times [2019-12-07 12:50:34,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:34,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956871885] [2019-12-07 12:50:34,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:34,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:50:34,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956871885] [2019-12-07 12:50:34,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:34,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:50:34,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099837601] [2019-12-07 12:50:34,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:50:34,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:34,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:50:34,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:50:34,625 INFO L87 Difference]: Start difference. First operand 4074 states and 9253 transitions. Second operand 5 states. [2019-12-07 12:50:34,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:34,661 INFO L93 Difference]: Finished difference Result 2472 states and 5394 transitions. [2019-12-07 12:50:34,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:50:34,661 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 12:50:34,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:34,666 INFO L225 Difference]: With dead ends: 2472 [2019-12-07 12:50:34,666 INFO L226 Difference]: Without dead ends: 2204 [2019-12-07 12:50:34,666 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:50:34,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2204 states. [2019-12-07 12:50:34,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2204 to 1329. [2019-12-07 12:50:34,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1329 states. [2019-12-07 12:50:34,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 2903 transitions. [2019-12-07 12:50:34,693 INFO L78 Accepts]: Start accepts. Automaton has 1329 states and 2903 transitions. Word has length 28 [2019-12-07 12:50:34,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:34,694 INFO L462 AbstractCegarLoop]: Abstraction has 1329 states and 2903 transitions. [2019-12-07 12:50:34,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:50:34,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 2903 transitions. [2019-12-07 12:50:34,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 12:50:34,697 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:34,697 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:34,698 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:50:34,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:34,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1528690992, now seen corresponding path program 1 times [2019-12-07 12:50:34,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:34,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970047886] [2019-12-07 12:50:34,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:34,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:34,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:50:34,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970047886] [2019-12-07 12:50:34,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:34,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:50:34,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588093422] [2019-12-07 12:50:34,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:50:34,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:34,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:50:34,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:50:34,749 INFO L87 Difference]: Start difference. First operand 1329 states and 2903 transitions. Second operand 3 states. [2019-12-07 12:50:34,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:34,790 INFO L93 Difference]: Finished difference Result 1722 states and 3715 transitions. [2019-12-07 12:50:34,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:50:34,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-07 12:50:34,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:34,793 INFO L225 Difference]: With dead ends: 1722 [2019-12-07 12:50:34,793 INFO L226 Difference]: Without dead ends: 1722 [2019-12-07 12:50:34,793 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:50:34,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2019-12-07 12:50:34,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1397. [2019-12-07 12:50:34,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1397 states. [2019-12-07 12:50:34,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 3065 transitions. [2019-12-07 12:50:34,818 INFO L78 Accepts]: Start accepts. Automaton has 1397 states and 3065 transitions. Word has length 51 [2019-12-07 12:50:34,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:34,818 INFO L462 AbstractCegarLoop]: Abstraction has 1397 states and 3065 transitions. [2019-12-07 12:50:34,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:50:34,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 3065 transitions. [2019-12-07 12:50:34,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 12:50:34,821 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:34,821 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:34,821 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:50:34,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:34,822 INFO L82 PathProgramCache]: Analyzing trace with hash 321225319, now seen corresponding path program 1 times [2019-12-07 12:50:34,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:34,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427155493] [2019-12-07 12:50:34,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:34,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:50:34,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427155493] [2019-12-07 12:50:34,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:34,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 12:50:34,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347588627] [2019-12-07 12:50:34,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 12:50:34,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:34,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 12:50:34,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:50:34,924 INFO L87 Difference]: Start difference. First operand 1397 states and 3065 transitions. Second operand 8 states. [2019-12-07 12:50:35,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:35,819 INFO L93 Difference]: Finished difference Result 3003 states and 6360 transitions. [2019-12-07 12:50:35,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 12:50:35,819 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-12-07 12:50:35,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:35,821 INFO L225 Difference]: With dead ends: 3003 [2019-12-07 12:50:35,821 INFO L226 Difference]: Without dead ends: 3003 [2019-12-07 12:50:35,822 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2019-12-07 12:50:35,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3003 states. [2019-12-07 12:50:35,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3003 to 1408. [2019-12-07 12:50:35,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1408 states. [2019-12-07 12:50:35,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1408 states to 1408 states and 3075 transitions. [2019-12-07 12:50:35,855 INFO L78 Accepts]: Start accepts. Automaton has 1408 states and 3075 transitions. Word has length 52 [2019-12-07 12:50:35,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:35,856 INFO L462 AbstractCegarLoop]: Abstraction has 1408 states and 3075 transitions. [2019-12-07 12:50:35,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 12:50:35,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 3075 transitions. [2019-12-07 12:50:35,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 12:50:35,857 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:35,858 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:35,858 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:50:35,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:35,858 INFO L82 PathProgramCache]: Analyzing trace with hash 586569126, now seen corresponding path program 1 times [2019-12-07 12:50:35,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:35,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743229610] [2019-12-07 12:50:35,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:35,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:35,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:50:35,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743229610] [2019-12-07 12:50:35,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:35,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 12:50:35,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876176087] [2019-12-07 12:50:35,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:50:35,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:35,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:50:35,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:50:35,935 INFO L87 Difference]: Start difference. First operand 1408 states and 3075 transitions. Second operand 7 states. [2019-12-07 12:50:36,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:36,579 INFO L93 Difference]: Finished difference Result 2798 states and 5847 transitions. [2019-12-07 12:50:36,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 12:50:36,579 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-07 12:50:36,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:36,581 INFO L225 Difference]: With dead ends: 2798 [2019-12-07 12:50:36,581 INFO L226 Difference]: Without dead ends: 2798 [2019-12-07 12:50:36,581 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-07 12:50:36,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2798 states. [2019-12-07 12:50:36,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2798 to 1443. [2019-12-07 12:50:36,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1443 states. [2019-12-07 12:50:36,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 3154 transitions. [2019-12-07 12:50:36,599 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 3154 transitions. Word has length 52 [2019-12-07 12:50:36,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:36,599 INFO L462 AbstractCegarLoop]: Abstraction has 1443 states and 3154 transitions. [2019-12-07 12:50:36,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:50:36,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 3154 transitions. [2019-12-07 12:50:36,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 12:50:36,601 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:36,601 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:36,601 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:50:36,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:36,601 INFO L82 PathProgramCache]: Analyzing trace with hash -428994519, now seen corresponding path program 2 times [2019-12-07 12:50:36,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:36,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399109416] [2019-12-07 12:50:36,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:36,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:50:36,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399109416] [2019-12-07 12:50:36,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:36,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:50:36,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976108777] [2019-12-07 12:50:36,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:50:36,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:36,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:50:36,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:50:36,646 INFO L87 Difference]: Start difference. First operand 1443 states and 3154 transitions. Second operand 3 states. [2019-12-07 12:50:36,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:36,657 INFO L93 Difference]: Finished difference Result 1442 states and 3152 transitions. [2019-12-07 12:50:36,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:50:36,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 12:50:36,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:36,659 INFO L225 Difference]: With dead ends: 1442 [2019-12-07 12:50:36,659 INFO L226 Difference]: Without dead ends: 1442 [2019-12-07 12:50:36,659 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:50:36,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2019-12-07 12:50:36,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1019. [2019-12-07 12:50:36,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1019 states. [2019-12-07 12:50:36,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 2258 transitions. [2019-12-07 12:50:36,670 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 2258 transitions. Word has length 52 [2019-12-07 12:50:36,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:36,670 INFO L462 AbstractCegarLoop]: Abstraction has 1019 states and 2258 transitions. [2019-12-07 12:50:36,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:50:36,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 2258 transitions. [2019-12-07 12:50:36,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 12:50:36,671 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:36,671 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:36,671 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:50:36,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:36,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1774994823, now seen corresponding path program 1 times [2019-12-07 12:50:36,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:36,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914278323] [2019-12-07 12:50:36,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:36,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:36,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:50:36,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914278323] [2019-12-07 12:50:36,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:36,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:50:36,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169231731] [2019-12-07 12:50:36,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:50:36,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:36,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:50:36,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:50:36,727 INFO L87 Difference]: Start difference. First operand 1019 states and 2258 transitions. Second operand 7 states. [2019-12-07 12:50:36,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:36,873 INFO L93 Difference]: Finished difference Result 2920 states and 6303 transitions. [2019-12-07 12:50:36,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 12:50:36,873 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-07 12:50:36,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:36,874 INFO L225 Difference]: With dead ends: 2920 [2019-12-07 12:50:36,874 INFO L226 Difference]: Without dead ends: 1980 [2019-12-07 12:50:36,875 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-07 12:50:36,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1980 states. [2019-12-07 12:50:36,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1980 to 1074. [2019-12-07 12:50:36,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1074 states. [2019-12-07 12:50:36,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 2372 transitions. [2019-12-07 12:50:36,889 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 2372 transitions. Word has length 53 [2019-12-07 12:50:36,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:36,889 INFO L462 AbstractCegarLoop]: Abstraction has 1074 states and 2372 transitions. [2019-12-07 12:50:36,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:50:36,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 2372 transitions. [2019-12-07 12:50:36,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 12:50:36,891 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:36,891 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:36,891 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:50:36,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:36,891 INFO L82 PathProgramCache]: Analyzing trace with hash 238171223, now seen corresponding path program 2 times [2019-12-07 12:50:36,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:36,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825387363] [2019-12-07 12:50:36,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:36,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:50:36,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:50:36,969 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 12:50:36,969 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:50:36,971 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= v_~x$r_buff1_thd1~0_165 0) (= 0 v_~x~0_148) (= v_~x$r_buff0_thd0~0_133 0) (= v_~x$r_buff0_thd1~0_227 0) (= v_~weak$$choice2~0_120 0) (= |v_#NULL.offset_6| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1711~0.base_24|) 0) (= v_~__unbuffered_p1_EBX~0_40 0) (= 0 v_~x$read_delayed_var~0.base_7) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t1711~0.base_24| 1)) (= 0 v_~__unbuffered_cnt~0_63) (= v_~main$tmp_guard1~0_41 0) (= v_~y~0_147 0) (= 0 |v_#NULL.base_6|) (= v_~x$flush_delayed~0_31 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_24 0) (= 0 v_~x$w_buff1_used~0_507) (= 0 v_~weak$$choice0~0_22) (= v_~x$r_buff1_thd0~0_183 0) (= 0 |v_ULTIMATE.start_main_~#t1711~0.offset_18|) (= 0 v_~x$w_buff1~0_317) (= 0 v_~x$w_buff0~0_542) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1711~0.base_24|) (= 0 v_~x$r_buff0_thd2~0_359) (= 0 v_~x$read_delayed_var~0.offset_7) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1711~0.base_24| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1711~0.base_24| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1711~0.base_24|) |v_ULTIMATE.start_main_~#t1711~0.offset_18| 0)) |v_#memory_int_13|) (= 0 v_~x$w_buff0_used~0_792) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~x$r_buff1_thd2~0_331) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_542, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_227, ~x$flush_delayed~0=v_~x$flush_delayed~0_31, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_165, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_24, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_28|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_69|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, #length=|v_#length_13|, ULTIMATE.start_main_~#t1711~0.base=|v_ULTIMATE.start_main_~#t1711~0.base_24|, ULTIMATE.start_main_~#t1711~0.offset=|v_ULTIMATE.start_main_~#t1711~0.offset_18|, ~y~0=v_~y~0_147, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_133, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_317, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_507, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_331, ULTIMATE.start_main_~#t1712~0.offset=|v_ULTIMATE.start_main_~#t1712~0.offset_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_359, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_792, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ULTIMATE.start_main_~#t1712~0.base=|v_ULTIMATE.start_main_~#t1712~0.base_16|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~weak$$choice2~0=v_~weak$$choice2~0_120, ~x~0=v_~x~0_148, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t1711~0.base, ULTIMATE.start_main_~#t1711~0.offset, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t1712~0.offset, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1712~0.base, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 12:50:36,972 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L4-->L738: Formula: (and (= 1 v_~x$r_buff0_thd1~0_40) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72 0)) (= v_~x$r_buff1_thd1~0_23 v_~x$r_buff0_thd1~0_41) (= v_~x$r_buff1_thd2~0_64 v_~x$r_buff0_thd2~0_110) (= v_~y~0_18 1) (= v_~x$r_buff1_thd0~0_37 v_~x$r_buff0_thd0~0_53)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_23, ~y~0=v_~y~0_18, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_37} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 12:50:36,972 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-1-->L799: Formula: (and (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1712~0.base_12| 1) |v_#valid_27|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1712~0.base_12|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1712~0.base_12| 4) |v_#length_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1712~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t1712~0.base_12| 0)) (= 0 |v_ULTIMATE.start_main_~#t1712~0.offset_10|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1712~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1712~0.base_12|) |v_ULTIMATE.start_main_~#t1712~0.offset_10| 1)) |v_#memory_int_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1712~0.base=|v_ULTIMATE.start_main_~#t1712~0.base_12|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1712~0.offset=|v_ULTIMATE.start_main_~#t1712~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1712~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1712~0.offset] because there is no mapped edge [2019-12-07 12:50:36,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L739-->L739-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1616419108 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-1616419108 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-1616419108| 0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-1616419108 |P0Thread1of1ForFork0_#t~ite5_Out-1616419108|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1616419108, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1616419108} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1616419108|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1616419108, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1616419108} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 12:50:36,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L763-->L763-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-431906040 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-431906040 256)))) (or (and (= (mod ~x$r_buff1_thd2~0_In-431906040 256) 0) .cse0) (and (= 0 (mod ~x$w_buff1_used~0_In-431906040 256)) .cse0) (= (mod ~x$w_buff0_used~0_In-431906040 256) 0))) (= ~x$w_buff0~0_In-431906040 |P1Thread1of1ForFork1_#t~ite14_Out-431906040|) .cse1 (= |P1Thread1of1ForFork1_#t~ite15_Out-431906040| |P1Thread1of1ForFork1_#t~ite14_Out-431906040|)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite14_In-431906040| |P1Thread1of1ForFork1_#t~ite14_Out-431906040|) (= |P1Thread1of1ForFork1_#t~ite15_Out-431906040| ~x$w_buff0~0_In-431906040)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-431906040, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-431906040, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-431906040, ~weak$$choice2~0=~weak$$choice2~0_In-431906040, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-431906040, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-431906040|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-431906040} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-431906040, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-431906040, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-431906040, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-431906040|, ~weak$$choice2~0=~weak$$choice2~0_In-431906040, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-431906040, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-431906040|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-431906040} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 12:50:36,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L740-->L740-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In921847424 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In921847424 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In921847424 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In921847424 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In921847424 |P0Thread1of1ForFork0_#t~ite6_Out921847424|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out921847424|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In921847424, ~x$w_buff1_used~0=~x$w_buff1_used~0_In921847424, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In921847424, ~x$w_buff0_used~0=~x$w_buff0_used~0_In921847424} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out921847424|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In921847424, ~x$w_buff1_used~0=~x$w_buff1_used~0_In921847424, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In921847424, ~x$w_buff0_used~0=~x$w_buff0_used~0_In921847424} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 12:50:36,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-1774748054 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1774748054 256))) (.cse1 (= ~x$r_buff0_thd1~0_In-1774748054 ~x$r_buff0_thd1~0_Out-1774748054))) (or (and .cse0 .cse1) (and (not .cse0) (= ~x$r_buff0_thd1~0_Out-1774748054 0) (not .cse2)) (and .cse2 .cse1))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1774748054, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1774748054} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-1774748054, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1774748054|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1774748054} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-07 12:50:36,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-706931676 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-706931676 256))) (.cse3 (= (mod ~x$r_buff0_thd1~0_In-706931676 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-706931676 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-706931676| ~x$r_buff1_thd1~0_In-706931676)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite8_Out-706931676| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-706931676, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-706931676, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-706931676, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-706931676} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-706931676, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-706931676|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-706931676, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-706931676, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-706931676} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 12:50:36,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~x$r_buff1_thd1~0_128 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_128} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-07 12:50:36,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In50821591 256) 0))) (or (and (= ~x$w_buff1~0_In50821591 |P1Thread1of1ForFork1_#t~ite17_Out50821591|) .cse0 (= |P1Thread1of1ForFork1_#t~ite18_Out50821591| |P1Thread1of1ForFork1_#t~ite17_Out50821591|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In50821591 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In50821591 256)) (and .cse1 (= 0 (mod ~x$r_buff1_thd2~0_In50821591 256))) (and .cse1 (= (mod ~x$w_buff1_used~0_In50821591 256) 0))))) (and (= ~x$w_buff1~0_In50821591 |P1Thread1of1ForFork1_#t~ite18_Out50821591|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite17_In50821591| |P1Thread1of1ForFork1_#t~ite17_Out50821591|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In50821591, ~x$w_buff1_used~0=~x$w_buff1_used~0_In50821591, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In50821591, ~weak$$choice2~0=~weak$$choice2~0_In50821591, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In50821591, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In50821591|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In50821591} OutVars{P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out50821591|, ~x$w_buff1~0=~x$w_buff1~0_In50821591, ~x$w_buff1_used~0=~x$w_buff1_used~0_In50821591, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In50821591, ~weak$$choice2~0=~weak$$choice2~0_In50821591, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In50821591, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out50821591|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In50821591} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 12:50:36,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1011290037 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_In1011290037| |P1Thread1of1ForFork1_#t~ite20_Out1011290037|) (not .cse0) (= ~x$w_buff0_used~0_In1011290037 |P1Thread1of1ForFork1_#t~ite21_Out1011290037|)) (and .cse0 (= ~x$w_buff0_used~0_In1011290037 |P1Thread1of1ForFork1_#t~ite20_Out1011290037|) (= |P1Thread1of1ForFork1_#t~ite21_Out1011290037| |P1Thread1of1ForFork1_#t~ite20_Out1011290037|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1011290037 256)))) (or (and (= (mod ~x$w_buff1_used~0_In1011290037 256) 0) .cse1) (= (mod ~x$w_buff0_used~0_In1011290037 256) 0) (and (= (mod ~x$r_buff1_thd2~0_In1011290037 256) 0) .cse1)))))) InVars {P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1011290037|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1011290037, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1011290037, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1011290037, ~weak$$choice2~0=~weak$$choice2~0_In1011290037, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1011290037} OutVars{P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1011290037|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1011290037, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1011290037, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1011290037|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1011290037, ~weak$$choice2~0=~weak$$choice2~0_In1011290037, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1011290037} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 12:50:36,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~x$r_buff0_thd2~0_135 v_~x$r_buff0_thd2~0_134)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_27, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 12:50:36,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-46855129 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out-46855129| ~x$r_buff1_thd2~0_In-46855129) (= |P1Thread1of1ForFork1_#t~ite29_Out-46855129| |P1Thread1of1ForFork1_#t~ite30_Out-46855129|) (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-46855129 256) 0))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-46855129 256))) (= 0 (mod ~x$w_buff0_used~0_In-46855129 256)) (and .cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-46855129 256)))))) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite30_Out-46855129| ~x$r_buff1_thd2~0_In-46855129) (= |P1Thread1of1ForFork1_#t~ite29_In-46855129| |P1Thread1of1ForFork1_#t~ite29_Out-46855129|)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-46855129|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-46855129, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-46855129, ~weak$$choice2~0=~weak$$choice2~0_In-46855129, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-46855129, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-46855129} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-46855129|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-46855129|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-46855129, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-46855129, ~weak$$choice2~0=~weak$$choice2~0_In-46855129, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-46855129, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-46855129} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 12:50:36,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L770-->L774: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_14)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_7, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-12-07 12:50:36,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L774-2-->L774-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In1635833187 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In1635833187 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out1635833187| ~x$w_buff1~0_In1635833187)) (and (or .cse0 .cse1) (= ~x~0_In1635833187 |P1Thread1of1ForFork1_#t~ite32_Out1635833187|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1635833187, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1635833187, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1635833187, ~x~0=~x~0_In1635833187} OutVars{~x$w_buff1~0=~x$w_buff1~0_In1635833187, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1635833187, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1635833187, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1635833187|, ~x~0=~x~0_In1635833187} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 12:50:36,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L774-4-->L775: Formula: (= v_~x~0_29 |v_P1Thread1of1ForFork1_#t~ite32_6|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_6|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_5|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_5|, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 12:50:36,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In666358140 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In666358140 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out666358140| ~x$w_buff0_used~0_In666358140) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out666358140| 0) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In666358140, ~x$w_buff0_used~0=~x$w_buff0_used~0_In666358140} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out666358140|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In666358140, ~x$w_buff0_used~0=~x$w_buff0_used~0_In666358140} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 12:50:36,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-667059654 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-667059654 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-667059654 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-667059654 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out-667059654| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In-667059654 |P1Thread1of1ForFork1_#t~ite35_Out-667059654|) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-667059654, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-667059654, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-667059654, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-667059654} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-667059654, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-667059654, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-667059654|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-667059654, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-667059654} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 12:50:36,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-30281257 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-30281257 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out-30281257| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In-30281257 |P1Thread1of1ForFork1_#t~ite36_Out-30281257|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-30281257, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-30281257} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-30281257, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-30281257|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-30281257} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 12:50:36,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-458749234 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-458749234 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-458749234 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-458749234 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-458749234|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite37_Out-458749234| ~x$r_buff1_thd2~0_In-458749234) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-458749234, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-458749234, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-458749234, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-458749234} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-458749234, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-458749234, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-458749234, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-458749234|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-458749234} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 12:50:36,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L778-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_269 |v_P1Thread1of1ForFork1_#t~ite37_40|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_40|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_269, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_39|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 12:50:36,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= 0 (mod v_~x$r_buff0_thd0~0_64 256)) (= (mod v_~x$w_buff0_used~0_301 256) 0)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 12:50:36,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In71705155 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In71705155 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out71705155| ~x~0_In71705155)) (and (not .cse1) (not .cse0) (= ~x$w_buff1~0_In71705155 |ULTIMATE.start_main_#t~ite40_Out71705155|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In71705155, ~x$w_buff1_used~0=~x$w_buff1_used~0_In71705155, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In71705155, ~x~0=~x~0_In71705155} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out71705155|, ~x$w_buff1~0=~x$w_buff1~0_In71705155, ~x$w_buff1_used~0=~x$w_buff1_used~0_In71705155, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In71705155, ~x~0=~x~0_In71705155} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 12:50:36,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L805-4-->L806: Formula: (= v_~x~0_46 |v_ULTIMATE.start_main_#t~ite40_13|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~x~0=v_~x~0_46} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-12-07 12:50:36,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1732599518 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1732599518 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1732599518 |ULTIMATE.start_main_#t~ite42_Out-1732599518|)) (and (= 0 |ULTIMATE.start_main_#t~ite42_Out-1732599518|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1732599518, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1732599518} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1732599518, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1732599518|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1732599518} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 12:50:36,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L807-->L807-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1081544742 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1081544742 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1081544742 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-1081544742 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite43_Out-1081544742| ~x$w_buff1_used~0_In-1081544742)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite43_Out-1081544742| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1081544742, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1081544742, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1081544742, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1081544742} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1081544742, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1081544742, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1081544742|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1081544742, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1081544742} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 12:50:36,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-18617471 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-18617471 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In-18617471 |ULTIMATE.start_main_#t~ite44_Out-18617471|)) (and (= |ULTIMATE.start_main_#t~ite44_Out-18617471| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-18617471, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-18617471} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-18617471, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-18617471|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-18617471} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 12:50:36,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L809-->L809-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In258948570 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In258948570 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In258948570 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In258948570 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out258948570|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In258948570 |ULTIMATE.start_main_#t~ite45_Out258948570|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In258948570, ~x$w_buff1_used~0=~x$w_buff1_used~0_In258948570, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In258948570, ~x$w_buff0_used~0=~x$w_buff0_used~0_In258948570} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In258948570, ~x$w_buff1_used~0=~x$w_buff1_used~0_In258948570, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In258948570, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out258948570|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In258948570} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 12:50:36,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_27 0) (= v_~y~0_126 2) (= 2 v_~__unbuffered_p1_EAX~0_27))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= v_~x$r_buff1_thd0~0_149 |v_ULTIMATE.start_main_#t~ite45_40|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= (mod v_~main$tmp_guard1~0_20 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~y~0=v_~y~0_126, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y~0=v_~y~0_126, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_149, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:50:37,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:50:37 BasicIcfg [2019-12-07 12:50:37,015 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:50:37,015 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:50:37,015 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:50:37,015 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:50:37,016 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:50:28" (3/4) ... [2019-12-07 12:50:37,017 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 12:50:37,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= v_~x$r_buff1_thd1~0_165 0) (= 0 v_~x~0_148) (= v_~x$r_buff0_thd0~0_133 0) (= v_~x$r_buff0_thd1~0_227 0) (= v_~weak$$choice2~0_120 0) (= |v_#NULL.offset_6| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1711~0.base_24|) 0) (= v_~__unbuffered_p1_EBX~0_40 0) (= 0 v_~x$read_delayed_var~0.base_7) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t1711~0.base_24| 1)) (= 0 v_~__unbuffered_cnt~0_63) (= v_~main$tmp_guard1~0_41 0) (= v_~y~0_147 0) (= 0 |v_#NULL.base_6|) (= v_~x$flush_delayed~0_31 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_24 0) (= 0 v_~x$w_buff1_used~0_507) (= 0 v_~weak$$choice0~0_22) (= v_~x$r_buff1_thd0~0_183 0) (= 0 |v_ULTIMATE.start_main_~#t1711~0.offset_18|) (= 0 v_~x$w_buff1~0_317) (= 0 v_~x$w_buff0~0_542) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1711~0.base_24|) (= 0 v_~x$r_buff0_thd2~0_359) (= 0 v_~x$read_delayed_var~0.offset_7) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1711~0.base_24| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1711~0.base_24| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1711~0.base_24|) |v_ULTIMATE.start_main_~#t1711~0.offset_18| 0)) |v_#memory_int_13|) (= 0 v_~x$w_buff0_used~0_792) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~x$r_buff1_thd2~0_331) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_542, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_227, ~x$flush_delayed~0=v_~x$flush_delayed~0_31, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_165, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_24, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_28|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_69|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, #length=|v_#length_13|, ULTIMATE.start_main_~#t1711~0.base=|v_ULTIMATE.start_main_~#t1711~0.base_24|, ULTIMATE.start_main_~#t1711~0.offset=|v_ULTIMATE.start_main_~#t1711~0.offset_18|, ~y~0=v_~y~0_147, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_133, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_317, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_507, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_331, ULTIMATE.start_main_~#t1712~0.offset=|v_ULTIMATE.start_main_~#t1712~0.offset_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_359, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_792, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ULTIMATE.start_main_~#t1712~0.base=|v_ULTIMATE.start_main_~#t1712~0.base_16|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~weak$$choice2~0=v_~weak$$choice2~0_120, ~x~0=v_~x~0_148, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t1711~0.base, ULTIMATE.start_main_~#t1711~0.offset, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t1712~0.offset, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1712~0.base, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 12:50:37,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L4-->L738: Formula: (and (= 1 v_~x$r_buff0_thd1~0_40) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72 0)) (= v_~x$r_buff1_thd1~0_23 v_~x$r_buff0_thd1~0_41) (= v_~x$r_buff1_thd2~0_64 v_~x$r_buff0_thd2~0_110) (= v_~y~0_18 1) (= v_~x$r_buff1_thd0~0_37 v_~x$r_buff0_thd0~0_53)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_23, ~y~0=v_~y~0_18, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_37} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 12:50:37,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-1-->L799: Formula: (and (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1712~0.base_12| 1) |v_#valid_27|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1712~0.base_12|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1712~0.base_12| 4) |v_#length_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1712~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t1712~0.base_12| 0)) (= 0 |v_ULTIMATE.start_main_~#t1712~0.offset_10|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1712~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1712~0.base_12|) |v_ULTIMATE.start_main_~#t1712~0.offset_10| 1)) |v_#memory_int_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1712~0.base=|v_ULTIMATE.start_main_~#t1712~0.base_12|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1712~0.offset=|v_ULTIMATE.start_main_~#t1712~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1712~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1712~0.offset] because there is no mapped edge [2019-12-07 12:50:37,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L739-->L739-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1616419108 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-1616419108 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-1616419108| 0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-1616419108 |P0Thread1of1ForFork0_#t~ite5_Out-1616419108|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1616419108, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1616419108} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1616419108|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1616419108, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1616419108} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 12:50:37,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L763-->L763-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-431906040 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-431906040 256)))) (or (and (= (mod ~x$r_buff1_thd2~0_In-431906040 256) 0) .cse0) (and (= 0 (mod ~x$w_buff1_used~0_In-431906040 256)) .cse0) (= (mod ~x$w_buff0_used~0_In-431906040 256) 0))) (= ~x$w_buff0~0_In-431906040 |P1Thread1of1ForFork1_#t~ite14_Out-431906040|) .cse1 (= |P1Thread1of1ForFork1_#t~ite15_Out-431906040| |P1Thread1of1ForFork1_#t~ite14_Out-431906040|)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite14_In-431906040| |P1Thread1of1ForFork1_#t~ite14_Out-431906040|) (= |P1Thread1of1ForFork1_#t~ite15_Out-431906040| ~x$w_buff0~0_In-431906040)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-431906040, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-431906040, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-431906040, ~weak$$choice2~0=~weak$$choice2~0_In-431906040, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-431906040, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-431906040|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-431906040} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-431906040, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-431906040, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-431906040, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-431906040|, ~weak$$choice2~0=~weak$$choice2~0_In-431906040, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-431906040, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-431906040|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-431906040} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 12:50:37,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L740-->L740-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In921847424 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In921847424 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In921847424 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In921847424 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In921847424 |P0Thread1of1ForFork0_#t~ite6_Out921847424|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out921847424|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In921847424, ~x$w_buff1_used~0=~x$w_buff1_used~0_In921847424, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In921847424, ~x$w_buff0_used~0=~x$w_buff0_used~0_In921847424} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out921847424|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In921847424, ~x$w_buff1_used~0=~x$w_buff1_used~0_In921847424, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In921847424, ~x$w_buff0_used~0=~x$w_buff0_used~0_In921847424} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 12:50:37,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-1774748054 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1774748054 256))) (.cse1 (= ~x$r_buff0_thd1~0_In-1774748054 ~x$r_buff0_thd1~0_Out-1774748054))) (or (and .cse0 .cse1) (and (not .cse0) (= ~x$r_buff0_thd1~0_Out-1774748054 0) (not .cse2)) (and .cse2 .cse1))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1774748054, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1774748054} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-1774748054, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1774748054|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1774748054} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-07 12:50:37,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-706931676 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-706931676 256))) (.cse3 (= (mod ~x$r_buff0_thd1~0_In-706931676 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-706931676 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-706931676| ~x$r_buff1_thd1~0_In-706931676)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite8_Out-706931676| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-706931676, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-706931676, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-706931676, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-706931676} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-706931676, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-706931676|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-706931676, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-706931676, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-706931676} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 12:50:37,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~x$r_buff1_thd1~0_128 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_128} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-07 12:50:37,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In50821591 256) 0))) (or (and (= ~x$w_buff1~0_In50821591 |P1Thread1of1ForFork1_#t~ite17_Out50821591|) .cse0 (= |P1Thread1of1ForFork1_#t~ite18_Out50821591| |P1Thread1of1ForFork1_#t~ite17_Out50821591|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In50821591 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In50821591 256)) (and .cse1 (= 0 (mod ~x$r_buff1_thd2~0_In50821591 256))) (and .cse1 (= (mod ~x$w_buff1_used~0_In50821591 256) 0))))) (and (= ~x$w_buff1~0_In50821591 |P1Thread1of1ForFork1_#t~ite18_Out50821591|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite17_In50821591| |P1Thread1of1ForFork1_#t~ite17_Out50821591|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In50821591, ~x$w_buff1_used~0=~x$w_buff1_used~0_In50821591, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In50821591, ~weak$$choice2~0=~weak$$choice2~0_In50821591, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In50821591, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In50821591|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In50821591} OutVars{P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out50821591|, ~x$w_buff1~0=~x$w_buff1~0_In50821591, ~x$w_buff1_used~0=~x$w_buff1_used~0_In50821591, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In50821591, ~weak$$choice2~0=~weak$$choice2~0_In50821591, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In50821591, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out50821591|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In50821591} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 12:50:37,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1011290037 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_In1011290037| |P1Thread1of1ForFork1_#t~ite20_Out1011290037|) (not .cse0) (= ~x$w_buff0_used~0_In1011290037 |P1Thread1of1ForFork1_#t~ite21_Out1011290037|)) (and .cse0 (= ~x$w_buff0_used~0_In1011290037 |P1Thread1of1ForFork1_#t~ite20_Out1011290037|) (= |P1Thread1of1ForFork1_#t~ite21_Out1011290037| |P1Thread1of1ForFork1_#t~ite20_Out1011290037|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1011290037 256)))) (or (and (= (mod ~x$w_buff1_used~0_In1011290037 256) 0) .cse1) (= (mod ~x$w_buff0_used~0_In1011290037 256) 0) (and (= (mod ~x$r_buff1_thd2~0_In1011290037 256) 0) .cse1)))))) InVars {P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1011290037|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1011290037, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1011290037, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1011290037, ~weak$$choice2~0=~weak$$choice2~0_In1011290037, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1011290037} OutVars{P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1011290037|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1011290037, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1011290037, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1011290037|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1011290037, ~weak$$choice2~0=~weak$$choice2~0_In1011290037, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1011290037} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 12:50:37,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~x$r_buff0_thd2~0_135 v_~x$r_buff0_thd2~0_134)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_27, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 12:50:37,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-46855129 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out-46855129| ~x$r_buff1_thd2~0_In-46855129) (= |P1Thread1of1ForFork1_#t~ite29_Out-46855129| |P1Thread1of1ForFork1_#t~ite30_Out-46855129|) (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-46855129 256) 0))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-46855129 256))) (= 0 (mod ~x$w_buff0_used~0_In-46855129 256)) (and .cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-46855129 256)))))) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite30_Out-46855129| ~x$r_buff1_thd2~0_In-46855129) (= |P1Thread1of1ForFork1_#t~ite29_In-46855129| |P1Thread1of1ForFork1_#t~ite29_Out-46855129|)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-46855129|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-46855129, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-46855129, ~weak$$choice2~0=~weak$$choice2~0_In-46855129, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-46855129, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-46855129} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-46855129|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-46855129|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-46855129, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-46855129, ~weak$$choice2~0=~weak$$choice2~0_In-46855129, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-46855129, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-46855129} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 12:50:37,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L770-->L774: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_14)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_7, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-12-07 12:50:37,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L774-2-->L774-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In1635833187 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In1635833187 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out1635833187| ~x$w_buff1~0_In1635833187)) (and (or .cse0 .cse1) (= ~x~0_In1635833187 |P1Thread1of1ForFork1_#t~ite32_Out1635833187|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1635833187, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1635833187, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1635833187, ~x~0=~x~0_In1635833187} OutVars{~x$w_buff1~0=~x$w_buff1~0_In1635833187, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1635833187, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1635833187, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1635833187|, ~x~0=~x~0_In1635833187} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 12:50:37,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L774-4-->L775: Formula: (= v_~x~0_29 |v_P1Thread1of1ForFork1_#t~ite32_6|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_6|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_5|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_5|, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 12:50:37,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In666358140 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In666358140 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out666358140| ~x$w_buff0_used~0_In666358140) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out666358140| 0) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In666358140, ~x$w_buff0_used~0=~x$w_buff0_used~0_In666358140} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out666358140|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In666358140, ~x$w_buff0_used~0=~x$w_buff0_used~0_In666358140} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 12:50:37,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-667059654 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-667059654 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-667059654 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-667059654 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out-667059654| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In-667059654 |P1Thread1of1ForFork1_#t~ite35_Out-667059654|) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-667059654, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-667059654, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-667059654, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-667059654} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-667059654, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-667059654, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-667059654|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-667059654, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-667059654} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 12:50:37,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-30281257 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-30281257 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out-30281257| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In-30281257 |P1Thread1of1ForFork1_#t~ite36_Out-30281257|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-30281257, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-30281257} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-30281257, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-30281257|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-30281257} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 12:50:37,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-458749234 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-458749234 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-458749234 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-458749234 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-458749234|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite37_Out-458749234| ~x$r_buff1_thd2~0_In-458749234) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-458749234, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-458749234, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-458749234, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-458749234} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-458749234, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-458749234, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-458749234, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-458749234|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-458749234} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 12:50:37,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L778-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_269 |v_P1Thread1of1ForFork1_#t~ite37_40|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_40|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_269, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_39|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 12:50:37,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= 0 (mod v_~x$r_buff0_thd0~0_64 256)) (= (mod v_~x$w_buff0_used~0_301 256) 0)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 12:50:37,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In71705155 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In71705155 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out71705155| ~x~0_In71705155)) (and (not .cse1) (not .cse0) (= ~x$w_buff1~0_In71705155 |ULTIMATE.start_main_#t~ite40_Out71705155|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In71705155, ~x$w_buff1_used~0=~x$w_buff1_used~0_In71705155, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In71705155, ~x~0=~x~0_In71705155} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out71705155|, ~x$w_buff1~0=~x$w_buff1~0_In71705155, ~x$w_buff1_used~0=~x$w_buff1_used~0_In71705155, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In71705155, ~x~0=~x~0_In71705155} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 12:50:37,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L805-4-->L806: Formula: (= v_~x~0_46 |v_ULTIMATE.start_main_#t~ite40_13|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~x~0=v_~x~0_46} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-12-07 12:50:37,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1732599518 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1732599518 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1732599518 |ULTIMATE.start_main_#t~ite42_Out-1732599518|)) (and (= 0 |ULTIMATE.start_main_#t~ite42_Out-1732599518|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1732599518, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1732599518} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1732599518, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1732599518|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1732599518} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 12:50:37,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L807-->L807-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1081544742 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1081544742 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1081544742 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-1081544742 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite43_Out-1081544742| ~x$w_buff1_used~0_In-1081544742)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite43_Out-1081544742| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1081544742, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1081544742, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1081544742, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1081544742} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1081544742, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1081544742, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1081544742|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1081544742, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1081544742} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 12:50:37,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-18617471 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-18617471 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In-18617471 |ULTIMATE.start_main_#t~ite44_Out-18617471|)) (and (= |ULTIMATE.start_main_#t~ite44_Out-18617471| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-18617471, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-18617471} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-18617471, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-18617471|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-18617471} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 12:50:37,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L809-->L809-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In258948570 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In258948570 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In258948570 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In258948570 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out258948570|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In258948570 |ULTIMATE.start_main_#t~ite45_Out258948570|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In258948570, ~x$w_buff1_used~0=~x$w_buff1_used~0_In258948570, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In258948570, ~x$w_buff0_used~0=~x$w_buff0_used~0_In258948570} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In258948570, ~x$w_buff1_used~0=~x$w_buff1_used~0_In258948570, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In258948570, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out258948570|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In258948570} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 12:50:37,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_27 0) (= v_~y~0_126 2) (= 2 v_~__unbuffered_p1_EAX~0_27))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= v_~x$r_buff1_thd0~0_149 |v_ULTIMATE.start_main_#t~ite45_40|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= (mod v_~main$tmp_guard1~0_20 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~y~0=v_~y~0_126, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y~0=v_~y~0_126, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_149, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:50:37,070 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_75f2ac59-561f-4adb-b260-b43772382174/bin/uautomizer/witness.graphml [2019-12-07 12:50:37,070 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:50:37,071 INFO L168 Benchmark]: Toolchain (without parser) took 9668.55 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 335.5 MB). Free memory was 937.0 MB in the beginning and 940.7 MB in the end (delta: -3.7 MB). Peak memory consumption was 331.8 MB. Max. memory is 11.5 GB. [2019-12-07 12:50:37,071 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:50:37,072 INFO L168 Benchmark]: CACSL2BoogieTranslator took 378.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 937.0 MB in the beginning and 1.1 GB in the end (delta: -132.5 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 12:50:37,072 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:50:37,072 INFO L168 Benchmark]: Boogie Preprocessor took 24.67 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:50:37,072 INFO L168 Benchmark]: RCFGBuilder took 396.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. [2019-12-07 12:50:37,073 INFO L168 Benchmark]: TraceAbstraction took 8773.04 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 236.5 MB). Free memory was 1.0 GB in the beginning and 954.1 MB in the end (delta: 60.2 MB). Peak memory consumption was 296.7 MB. Max. memory is 11.5 GB. [2019-12-07 12:50:37,073 INFO L168 Benchmark]: Witness Printer took 54.88 ms. Allocated memory is still 1.4 GB. Free memory was 954.1 MB in the beginning and 940.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:50:37,074 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 378.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 937.0 MB in the beginning and 1.1 GB in the end (delta: -132.5 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.67 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 396.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8773.04 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 236.5 MB). Free memory was 1.0 GB in the beginning and 954.1 MB in the end (delta: 60.2 MB). Peak memory consumption was 296.7 MB. Max. memory is 11.5 GB. * Witness Printer took 54.88 ms. Allocated memory is still 1.4 GB. Free memory was 954.1 MB in the beginning and 940.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.0s, 147 ProgramPointsBefore, 79 ProgramPointsAfterwards, 181 TransitionsBefore, 90 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 29 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 26 ChoiceCompositions, 4894 VarBasedMoverChecksPositive, 354 VarBasedMoverChecksNegative, 269 SemBasedMoverChecksPositive, 191 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 76691 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t1711, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 1 x$w_buff1 = x$w_buff0 [L725] 1 x$w_buff0 = 1 [L726] 1 x$w_buff1_used = x$w_buff0_used [L727] 1 x$w_buff0_used = (_Bool)1 [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] FCALL, FORK 0 pthread_create(&t1712, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L752] 2 y = 2 [L755] 2 __unbuffered_p1_EAX = y [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 x$flush_delayed = weak$$choice2 [L761] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L762] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L763] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L739] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L740] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L764] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L765] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L807] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L808] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 8.6s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2020 SDtfs, 2422 SDslu, 4739 SDs, 0 SdLazy, 3378 SolverSat, 172 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 23 SyntacticMatches, 11 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9438occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 11268 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 473 NumberOfCodeBlocks, 473 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 407 ConstructedInterpolants, 0 QuantifiedInterpolants, 63817 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...