./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix037_rmo.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_9e2d84d3-321c-47ad-b707-74cb7c4c84bc/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9e2d84d3-321c-47ad-b707-74cb7c4c84bc/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9e2d84d3-321c-47ad-b707-74cb7c4c84bc/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9e2d84d3-321c-47ad-b707-74cb7c4c84bc/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix037_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_9e2d84d3-321c-47ad-b707-74cb7c4c84bc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9e2d84d3-321c-47ad-b707-74cb7c4c84bc/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 5c87feab65412219305273f851142414e6a2443e ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 13:36:09,491 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:36:09,492 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:36:09,500 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:36:09,500 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:36:09,501 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:36:09,502 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:36:09,504 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:36:09,506 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:36:09,506 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:36:09,507 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:36:09,508 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:36:09,508 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:36:09,509 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:36:09,509 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:36:09,510 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:36:09,511 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:36:09,512 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:36:09,513 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:36:09,515 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:36:09,516 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:36:09,517 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:36:09,517 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:36:09,518 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:36:09,520 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:36:09,520 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:36:09,520 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:36:09,520 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:36:09,521 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:36:09,521 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:36:09,521 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:36:09,522 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:36:09,522 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:36:09,523 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:36:09,524 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:36:09,524 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:36:09,524 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:36:09,525 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:36:09,525 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:36:09,526 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:36:09,526 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:36:09,527 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9e2d84d3-321c-47ad-b707-74cb7c4c84bc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 13:36:09,540 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:36:09,540 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:36:09,541 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:36:09,541 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:36:09,541 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 13:36:09,542 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:36:09,542 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:36:09,542 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:36:09,542 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:36:09,542 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:36:09,543 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:36:09,543 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:36:09,543 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:36:09,543 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:36:09,543 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:36:09,543 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:36:09,544 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:36:09,544 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:36:09,544 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 13:36:09,544 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:36:09,545 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:36:09,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:36:09,545 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:36:09,545 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:36:09,545 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:36:09,546 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 13:36:09,546 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:36:09,546 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:36:09,546 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:36:09,546 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_9e2d84d3-321c-47ad-b707-74cb7c4c84bc/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 -> 5c87feab65412219305273f851142414e6a2443e [2019-12-07 13:36:09,651 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:36:09,661 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:36:09,664 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:36:09,665 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:36:09,665 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:36:09,666 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9e2d84d3-321c-47ad-b707-74cb7c4c84bc/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix037_rmo.opt.i [2019-12-07 13:36:09,714 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9e2d84d3-321c-47ad-b707-74cb7c4c84bc/bin/uautomizer/data/fa2897399/e41cbcc6b898428ba5cecf7c42734f4d/FLAG35077e96d [2019-12-07 13:36:10,164 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:36:10,165 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9e2d84d3-321c-47ad-b707-74cb7c4c84bc/sv-benchmarks/c/pthread-wmm/mix037_rmo.opt.i [2019-12-07 13:36:10,175 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9e2d84d3-321c-47ad-b707-74cb7c4c84bc/bin/uautomizer/data/fa2897399/e41cbcc6b898428ba5cecf7c42734f4d/FLAG35077e96d [2019-12-07 13:36:10,183 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9e2d84d3-321c-47ad-b707-74cb7c4c84bc/bin/uautomizer/data/fa2897399/e41cbcc6b898428ba5cecf7c42734f4d [2019-12-07 13:36:10,185 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:36:10,186 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:36:10,187 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:36:10,187 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:36:10,189 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:36:10,189 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:36:10" (1/1) ... [2019-12-07 13:36:10,191 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a2ff042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:36:10, skipping insertion in model container [2019-12-07 13:36:10,191 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:36:10" (1/1) ... [2019-12-07 13:36:10,196 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:36:10,224 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:36:10,473 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:36:10,482 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:36:10,536 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:36:10,587 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:36:10,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:36:10 WrapperNode [2019-12-07 13:36:10,587 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:36:10,588 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:36:10,588 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:36:10,588 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:36:10,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:36:10" (1/1) ... [2019-12-07 13:36:10,609 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:36:10" (1/1) ... [2019-12-07 13:36:10,627 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:36:10,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:36:10,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:36:10,628 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:36:10,634 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:36:10" (1/1) ... [2019-12-07 13:36:10,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:36:10" (1/1) ... [2019-12-07 13:36:10,637 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:36:10" (1/1) ... [2019-12-07 13:36:10,638 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:36:10" (1/1) ... [2019-12-07 13:36:10,644 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:36:10" (1/1) ... [2019-12-07 13:36:10,646 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:36:10" (1/1) ... [2019-12-07 13:36:10,649 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:36:10" (1/1) ... [2019-12-07 13:36:10,652 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:36:10,652 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:36:10,652 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:36:10,652 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:36:10,653 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:36:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e2d84d3-321c-47ad-b707-74cb7c4c84bc/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 13:36:10,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 13:36:10,692 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 13:36:10,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 13:36:10,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:36:10,692 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 13:36:10,692 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 13:36:10,692 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 13:36:10,693 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 13:36:10,693 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 13:36:10,693 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 13:36:10,693 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 13:36:10,693 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 13:36:10,693 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 13:36:10,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:36:10,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:36:10,694 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 13:36:11,031 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:36:11,031 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 13:36:11,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:36:11 BoogieIcfgContainer [2019-12-07 13:36:11,032 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:36:11,032 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:36:11,032 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:36:11,034 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:36:11,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:36:10" (1/3) ... [2019-12-07 13:36:11,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2de8782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:36:11, skipping insertion in model container [2019-12-07 13:36:11,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:36:10" (2/3) ... [2019-12-07 13:36:11,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2de8782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:36:11, skipping insertion in model container [2019-12-07 13:36:11,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:36:11" (3/3) ... [2019-12-07 13:36:11,036 INFO L109 eAbstractionObserver]: Analyzing ICFG mix037_rmo.opt.i [2019-12-07 13:36:11,042 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 13:36:11,042 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:36:11,047 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 13:36:11,047 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 13:36:11,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,072 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,072 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,073 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,073 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,075 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,075 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,089 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,090 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,090 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,090 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,090 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,090 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,090 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,090 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,091 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,091 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,091 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,091 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,091 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,091 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,091 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,091 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,091 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,092 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,092 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,092 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,092 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,092 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,092 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,092 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,092 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,093 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,093 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,093 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,093 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,093 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,093 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,093 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,093 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,093 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:36:11,105 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 13:36:11,118 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:36:11,119 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:36:11,119 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:36:11,119 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:36:11,119 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:36:11,119 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:36:11,119 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:36:11,119 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:36:11,132 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 192 transitions [2019-12-07 13:36:11,133 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-07 13:36:11,195 INFO L134 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-07 13:36:11,195 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:36:11,206 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 575 event pairs. 12/163 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-07 13:36:11,217 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-07 13:36:11,246 INFO L134 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-07 13:36:11,246 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:36:11,250 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 575 event pairs. 12/163 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-07 13:36:11,261 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-07 13:36:11,262 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 13:36:14,149 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-12-07 13:36:14,393 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-07 13:36:14,489 INFO L206 etLargeBlockEncoding]: Checked pairs total: 44168 [2019-12-07 13:36:14,489 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-07 13:36:14,492 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 78 transitions [2019-12-07 13:36:15,478 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 21398 states. [2019-12-07 13:36:15,480 INFO L276 IsEmpty]: Start isEmpty. Operand 21398 states. [2019-12-07 13:36:15,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 13:36:15,484 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:36:15,485 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:36:15,485 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:36:15,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:36:15,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1244651740, now seen corresponding path program 1 times [2019-12-07 13:36:15,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:36:15,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423784975] [2019-12-07 13:36:15,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:36:15,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:36:15,650 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 13:36:15,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423784975] [2019-12-07 13:36:15,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:36:15,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:36:15,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003628759] [2019-12-07 13:36:15,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:36:15,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:36:15,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:36:15,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:36:15,672 INFO L87 Difference]: Start difference. First operand 21398 states. Second operand 3 states. [2019-12-07 13:36:15,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:36:15,952 INFO L93 Difference]: Finished difference Result 20958 states and 90416 transitions. [2019-12-07 13:36:15,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:36:15,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 13:36:15,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:36:16,080 INFO L225 Difference]: With dead ends: 20958 [2019-12-07 13:36:16,081 INFO L226 Difference]: Without dead ends: 19662 [2019-12-07 13:36:16,081 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 13:36:16,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19662 states. [2019-12-07 13:36:16,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19662 to 19662. [2019-12-07 13:36:16,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19662 states. [2019-12-07 13:36:16,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19662 states to 19662 states and 84692 transitions. [2019-12-07 13:36:16,845 INFO L78 Accepts]: Start accepts. Automaton has 19662 states and 84692 transitions. Word has length 9 [2019-12-07 13:36:16,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:36:16,846 INFO L462 AbstractCegarLoop]: Abstraction has 19662 states and 84692 transitions. [2019-12-07 13:36:16,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:36:16,846 INFO L276 IsEmpty]: Start isEmpty. Operand 19662 states and 84692 transitions. [2019-12-07 13:36:16,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 13:36:16,851 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:36:16,851 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:36:16,851 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:36:16,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:36:16,851 INFO L82 PathProgramCache]: Analyzing trace with hash -6792795, now seen corresponding path program 1 times [2019-12-07 13:36:16,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:36:16,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879164085] [2019-12-07 13:36:16,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:36:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:36:16,909 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 13:36:16,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879164085] [2019-12-07 13:36:16,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:36:16,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:36:16,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562236260] [2019-12-07 13:36:16,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:36:16,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:36:16,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:36:16,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:36:16,912 INFO L87 Difference]: Start difference. First operand 19662 states and 84692 transitions. Second operand 4 states. [2019-12-07 13:36:17,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:36:17,192 INFO L93 Difference]: Finished difference Result 30494 states and 126452 transitions. [2019-12-07 13:36:17,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:36:17,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 13:36:17,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:36:17,361 INFO L225 Difference]: With dead ends: 30494 [2019-12-07 13:36:17,361 INFO L226 Difference]: Without dead ends: 30438 [2019-12-07 13:36:17,362 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 13:36:17,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30438 states. [2019-12-07 13:36:17,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30438 to 27742. [2019-12-07 13:36:17,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27742 states. [2019-12-07 13:36:17,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27742 states to 27742 states and 116300 transitions. [2019-12-07 13:36:17,951 INFO L78 Accepts]: Start accepts. Automaton has 27742 states and 116300 transitions. Word has length 15 [2019-12-07 13:36:17,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:36:17,951 INFO L462 AbstractCegarLoop]: Abstraction has 27742 states and 116300 transitions. [2019-12-07 13:36:17,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:36:17,951 INFO L276 IsEmpty]: Start isEmpty. Operand 27742 states and 116300 transitions. [2019-12-07 13:36:17,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 13:36:17,956 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:36:17,956 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:36:17,956 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:36:17,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:36:17,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1479332799, now seen corresponding path program 1 times [2019-12-07 13:36:17,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:36:17,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906811422] [2019-12-07 13:36:17,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:36:17,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:36:18,011 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 13:36:18,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906811422] [2019-12-07 13:36:18,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:36:18,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:36:18,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135837842] [2019-12-07 13:36:18,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:36:18,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:36:18,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:36:18,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:36:18,012 INFO L87 Difference]: Start difference. First operand 27742 states and 116300 transitions. Second operand 4 states. [2019-12-07 13:36:18,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:36:18,372 INFO L93 Difference]: Finished difference Result 35230 states and 146308 transitions. [2019-12-07 13:36:18,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:36:18,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 13:36:18,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:36:18,443 INFO L225 Difference]: With dead ends: 35230 [2019-12-07 13:36:18,443 INFO L226 Difference]: Without dead ends: 35182 [2019-12-07 13:36:18,443 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 13:36:18,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35182 states. [2019-12-07 13:36:18,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35182 to 30378. [2019-12-07 13:36:18,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30378 states. [2019-12-07 13:36:19,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30378 states to 30378 states and 127172 transitions. [2019-12-07 13:36:19,206 INFO L78 Accepts]: Start accepts. Automaton has 30378 states and 127172 transitions. Word has length 18 [2019-12-07 13:36:19,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:36:19,206 INFO L462 AbstractCegarLoop]: Abstraction has 30378 states and 127172 transitions. [2019-12-07 13:36:19,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:36:19,206 INFO L276 IsEmpty]: Start isEmpty. Operand 30378 states and 127172 transitions. [2019-12-07 13:36:19,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 13:36:19,213 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:36:19,213 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] [2019-12-07 13:36:19,213 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:36:19,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:36:19,214 INFO L82 PathProgramCache]: Analyzing trace with hash -45820751, now seen corresponding path program 1 times [2019-12-07 13:36:19,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:36:19,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546646576] [2019-12-07 13:36:19,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:36:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:36:19,273 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 13:36:19,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546646576] [2019-12-07 13:36:19,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:36:19,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:36:19,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590795145] [2019-12-07 13:36:19,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:36:19,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:36:19,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:36:19,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:36:19,274 INFO L87 Difference]: Start difference. First operand 30378 states and 127172 transitions. Second operand 4 states. [2019-12-07 13:36:19,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:36:19,379 INFO L93 Difference]: Finished difference Result 26024 states and 100213 transitions. [2019-12-07 13:36:19,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:36:19,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-07 13:36:19,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:36:19,424 INFO L225 Difference]: With dead ends: 26024 [2019-12-07 13:36:19,424 INFO L226 Difference]: Without dead ends: 24072 [2019-12-07 13:36:19,424 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 13:36:19,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24072 states. [2019-12-07 13:36:19,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24072 to 24072. [2019-12-07 13:36:19,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24072 states. [2019-12-07 13:36:19,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24072 states to 24072 states and 93462 transitions. [2019-12-07 13:36:19,816 INFO L78 Accepts]: Start accepts. Automaton has 24072 states and 93462 transitions. Word has length 20 [2019-12-07 13:36:19,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:36:19,816 INFO L462 AbstractCegarLoop]: Abstraction has 24072 states and 93462 transitions. [2019-12-07 13:36:19,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:36:19,816 INFO L276 IsEmpty]: Start isEmpty. Operand 24072 states and 93462 transitions. [2019-12-07 13:36:19,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 13:36:19,821 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:36:19,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] [2019-12-07 13:36:19,821 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:36:19,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:36:19,821 INFO L82 PathProgramCache]: Analyzing trace with hash -129088173, now seen corresponding path program 1 times [2019-12-07 13:36:19,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:36:19,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632801450] [2019-12-07 13:36:19,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:36:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:36:19,868 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 13:36:19,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632801450] [2019-12-07 13:36:19,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:36:19,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:36:19,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058168941] [2019-12-07 13:36:19,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:36:19,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:36:19,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:36:19,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:36:19,869 INFO L87 Difference]: Start difference. First operand 24072 states and 93462 transitions. Second operand 5 states. [2019-12-07 13:36:19,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:36:19,937 INFO L93 Difference]: Finished difference Result 12278 states and 40771 transitions. [2019-12-07 13:36:19,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:36:19,938 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-07 13:36:19,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:36:19,952 INFO L225 Difference]: With dead ends: 12278 [2019-12-07 13:36:19,952 INFO L226 Difference]: Without dead ends: 10729 [2019-12-07 13:36:19,952 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 13:36:19,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10729 states. [2019-12-07 13:36:20,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10729 to 10729. [2019-12-07 13:36:20,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10729 states. [2019-12-07 13:36:20,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10729 states to 10729 states and 35320 transitions. [2019-12-07 13:36:20,198 INFO L78 Accepts]: Start accepts. Automaton has 10729 states and 35320 transitions. Word has length 21 [2019-12-07 13:36:20,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:36:20,198 INFO L462 AbstractCegarLoop]: Abstraction has 10729 states and 35320 transitions. [2019-12-07 13:36:20,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:36:20,198 INFO L276 IsEmpty]: Start isEmpty. Operand 10729 states and 35320 transitions. [2019-12-07 13:36:20,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 13:36:20,201 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:36:20,201 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] [2019-12-07 13:36:20,201 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:36:20,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:36:20,201 INFO L82 PathProgramCache]: Analyzing trace with hash -2097022487, now seen corresponding path program 1 times [2019-12-07 13:36:20,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:36:20,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728795521] [2019-12-07 13:36:20,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:36:20,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:36:20,235 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 13:36:20,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728795521] [2019-12-07 13:36:20,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:36:20,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:36:20,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245515076] [2019-12-07 13:36:20,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:36:20,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:36:20,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:36:20,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:36:20,236 INFO L87 Difference]: Start difference. First operand 10729 states and 35320 transitions. Second operand 3 states. [2019-12-07 13:36:20,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:36:20,278 INFO L93 Difference]: Finished difference Result 10729 states and 34882 transitions. [2019-12-07 13:36:20,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:36:20,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-07 13:36:20,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:36:20,292 INFO L225 Difference]: With dead ends: 10729 [2019-12-07 13:36:20,292 INFO L226 Difference]: Without dead ends: 10729 [2019-12-07 13:36:20,292 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 13:36:20,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10729 states. [2019-12-07 13:36:20,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10729 to 10431. [2019-12-07 13:36:20,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10431 states. [2019-12-07 13:36:20,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10431 states to 10431 states and 33896 transitions. [2019-12-07 13:36:20,433 INFO L78 Accepts]: Start accepts. Automaton has 10431 states and 33896 transitions. Word has length 22 [2019-12-07 13:36:20,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:36:20,433 INFO L462 AbstractCegarLoop]: Abstraction has 10431 states and 33896 transitions. [2019-12-07 13:36:20,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:36:20,433 INFO L276 IsEmpty]: Start isEmpty. Operand 10431 states and 33896 transitions. [2019-12-07 13:36:20,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 13:36:20,436 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:36:20,436 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] [2019-12-07 13:36:20,436 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:36:20,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:36:20,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1838174912, now seen corresponding path program 1 times [2019-12-07 13:36:20,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:36:20,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60038396] [2019-12-07 13:36:20,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:36:20,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:36:20,488 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 13:36:20,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60038396] [2019-12-07 13:36:20,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:36:20,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:36:20,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588046271] [2019-12-07 13:36:20,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:36:20,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:36:20,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:36:20,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:36:20,490 INFO L87 Difference]: Start difference. First operand 10431 states and 33896 transitions. Second operand 6 states. [2019-12-07 13:36:20,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:36:20,554 INFO L93 Difference]: Finished difference Result 3272 states and 10004 transitions. [2019-12-07 13:36:20,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:36:20,554 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 13:36:20,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:36:20,557 INFO L225 Difference]: With dead ends: 3272 [2019-12-07 13:36:20,557 INFO L226 Difference]: Without dead ends: 2708 [2019-12-07 13:36:20,558 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:36:20,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2708 states. [2019-12-07 13:36:20,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2708 to 2708. [2019-12-07 13:36:20,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2708 states. [2019-12-07 13:36:20,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2708 states to 2708 states and 8195 transitions. [2019-12-07 13:36:20,586 INFO L78 Accepts]: Start accepts. Automaton has 2708 states and 8195 transitions. Word has length 22 [2019-12-07 13:36:20,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:36:20,586 INFO L462 AbstractCegarLoop]: Abstraction has 2708 states and 8195 transitions. [2019-12-07 13:36:20,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:36:20,586 INFO L276 IsEmpty]: Start isEmpty. Operand 2708 states and 8195 transitions. [2019-12-07 13:36:20,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 13:36:20,589 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:36:20,589 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] [2019-12-07 13:36:20,589 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:36:20,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:36:20,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1619810495, now seen corresponding path program 1 times [2019-12-07 13:36:20,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:36:20,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660431978] [2019-12-07 13:36:20,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:36:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:36:20,614 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 13:36:20,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660431978] [2019-12-07 13:36:20,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:36:20,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:36:20,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947368184] [2019-12-07 13:36:20,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:36:20,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:36:20,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:36:20,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:36:20,615 INFO L87 Difference]: Start difference. First operand 2708 states and 8195 transitions. Second operand 3 states. [2019-12-07 13:36:20,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:36:20,654 INFO L93 Difference]: Finished difference Result 4106 states and 12338 transitions. [2019-12-07 13:36:20,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:36:20,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-07 13:36:20,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:36:20,659 INFO L225 Difference]: With dead ends: 4106 [2019-12-07 13:36:20,659 INFO L226 Difference]: Without dead ends: 4106 [2019-12-07 13:36:20,659 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 13:36:20,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2019-12-07 13:36:20,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 3200. [2019-12-07 13:36:20,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3200 states. [2019-12-07 13:36:20,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3200 states to 3200 states and 9811 transitions. [2019-12-07 13:36:20,700 INFO L78 Accepts]: Start accepts. Automaton has 3200 states and 9811 transitions. Word has length 32 [2019-12-07 13:36:20,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:36:20,700 INFO L462 AbstractCegarLoop]: Abstraction has 3200 states and 9811 transitions. [2019-12-07 13:36:20,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:36:20,700 INFO L276 IsEmpty]: Start isEmpty. Operand 3200 states and 9811 transitions. [2019-12-07 13:36:20,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 13:36:20,703 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:36:20,704 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] [2019-12-07 13:36:20,704 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:36:20,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:36:20,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1082300219, now seen corresponding path program 1 times [2019-12-07 13:36:20,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:36:20,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496037196] [2019-12-07 13:36:20,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:36:20,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:36:20,760 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 13:36:20,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496037196] [2019-12-07 13:36:20,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:36:20,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:36:20,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630419162] [2019-12-07 13:36:20,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:36:20,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:36:20,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:36:20,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:36:20,762 INFO L87 Difference]: Start difference. First operand 3200 states and 9811 transitions. Second operand 6 states. [2019-12-07 13:36:21,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:36:21,022 INFO L93 Difference]: Finished difference Result 6768 states and 19665 transitions. [2019-12-07 13:36:21,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 13:36:21,022 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-07 13:36:21,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:36:21,029 INFO L225 Difference]: With dead ends: 6768 [2019-12-07 13:36:21,029 INFO L226 Difference]: Without dead ends: 6764 [2019-12-07 13:36:21,030 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:36:21,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6764 states. [2019-12-07 13:36:21,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6764 to 3476. [2019-12-07 13:36:21,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3476 states. [2019-12-07 13:36:21,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3476 states to 3476 states and 10586 transitions. [2019-12-07 13:36:21,078 INFO L78 Accepts]: Start accepts. Automaton has 3476 states and 10586 transitions. Word has length 32 [2019-12-07 13:36:21,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:36:21,078 INFO L462 AbstractCegarLoop]: Abstraction has 3476 states and 10586 transitions. [2019-12-07 13:36:21,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:36:21,078 INFO L276 IsEmpty]: Start isEmpty. Operand 3476 states and 10586 transitions. [2019-12-07 13:36:21,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 13:36:21,081 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:36:21,081 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] [2019-12-07 13:36:21,082 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:36:21,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:36:21,082 INFO L82 PathProgramCache]: Analyzing trace with hash -345264620, now seen corresponding path program 1 times [2019-12-07 13:36:21,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:36:21,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231187248] [2019-12-07 13:36:21,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:36:21,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:36:21,133 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 13:36:21,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231187248] [2019-12-07 13:36:21,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:36:21,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:36:21,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916144359] [2019-12-07 13:36:21,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:36:21,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:36:21,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:36:21,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:36:21,134 INFO L87 Difference]: Start difference. First operand 3476 states and 10586 transitions. Second operand 6 states. [2019-12-07 13:36:21,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:36:21,380 INFO L93 Difference]: Finished difference Result 6621 states and 19118 transitions. [2019-12-07 13:36:21,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 13:36:21,380 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-07 13:36:21,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:36:21,387 INFO L225 Difference]: With dead ends: 6621 [2019-12-07 13:36:21,387 INFO L226 Difference]: Without dead ends: 6619 [2019-12-07 13:36:21,387 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 13:36:21,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6619 states. [2019-12-07 13:36:21,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6619 to 3328. [2019-12-07 13:36:21,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3328 states. [2019-12-07 13:36:21,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3328 states to 3328 states and 10212 transitions. [2019-12-07 13:36:21,433 INFO L78 Accepts]: Start accepts. Automaton has 3328 states and 10212 transitions. Word has length 33 [2019-12-07 13:36:21,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:36:21,433 INFO L462 AbstractCegarLoop]: Abstraction has 3328 states and 10212 transitions. [2019-12-07 13:36:21,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:36:21,433 INFO L276 IsEmpty]: Start isEmpty. Operand 3328 states and 10212 transitions. [2019-12-07 13:36:21,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 13:36:21,436 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:36:21,436 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] [2019-12-07 13:36:21,436 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:36:21,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:36:21,437 INFO L82 PathProgramCache]: Analyzing trace with hash 452387979, now seen corresponding path program 1 times [2019-12-07 13:36:21,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:36:21,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870720275] [2019-12-07 13:36:21,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:36:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:36:21,494 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 13:36:21,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870720275] [2019-12-07 13:36:21,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:36:21,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:36:21,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213944526] [2019-12-07 13:36:21,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:36:21,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:36:21,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:36:21,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:36:21,495 INFO L87 Difference]: Start difference. First operand 3328 states and 10212 transitions. Second operand 7 states. [2019-12-07 13:36:21,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:36:21,563 INFO L93 Difference]: Finished difference Result 2519 states and 8206 transitions. [2019-12-07 13:36:21,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:36:21,563 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-07 13:36:21,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:36:21,566 INFO L225 Difference]: With dead ends: 2519 [2019-12-07 13:36:21,566 INFO L226 Difference]: Without dead ends: 2442 [2019-12-07 13:36:21,566 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:36:21,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2019-12-07 13:36:21,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2370. [2019-12-07 13:36:21,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2370 states. [2019-12-07 13:36:21,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2370 states to 2370 states and 7792 transitions. [2019-12-07 13:36:21,629 INFO L78 Accepts]: Start accepts. Automaton has 2370 states and 7792 transitions. Word has length 33 [2019-12-07 13:36:21,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:36:21,629 INFO L462 AbstractCegarLoop]: Abstraction has 2370 states and 7792 transitions. [2019-12-07 13:36:21,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:36:21,629 INFO L276 IsEmpty]: Start isEmpty. Operand 2370 states and 7792 transitions. [2019-12-07 13:36:21,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 13:36:21,632 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:36:21,632 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] [2019-12-07 13:36:21,632 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:36:21,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:36:21,633 INFO L82 PathProgramCache]: Analyzing trace with hash -754041251, now seen corresponding path program 1 times [2019-12-07 13:36:21,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:36:21,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007590998] [2019-12-07 13:36:21,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:36:21,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:36:21,707 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 13:36:21,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007590998] [2019-12-07 13:36:21,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:36:21,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:36:21,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302136168] [2019-12-07 13:36:21,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:36:21,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:36:21,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:36:21,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:36:21,708 INFO L87 Difference]: Start difference. First operand 2370 states and 7792 transitions. Second operand 6 states. [2019-12-07 13:36:21,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:36:21,921 INFO L93 Difference]: Finished difference Result 9526 states and 29591 transitions. [2019-12-07 13:36:21,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 13:36:21,922 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-12-07 13:36:21,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:36:21,930 INFO L225 Difference]: With dead ends: 9526 [2019-12-07 13:36:21,930 INFO L226 Difference]: Without dead ends: 7666 [2019-12-07 13:36:21,930 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-07 13:36:21,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7666 states. [2019-12-07 13:36:21,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7666 to 3194. [2019-12-07 13:36:21,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3194 states. [2019-12-07 13:36:21,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3194 states to 3194 states and 10217 transitions. [2019-12-07 13:36:21,982 INFO L78 Accepts]: Start accepts. Automaton has 3194 states and 10217 transitions. Word has length 48 [2019-12-07 13:36:21,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:36:21,982 INFO L462 AbstractCegarLoop]: Abstraction has 3194 states and 10217 transitions. [2019-12-07 13:36:21,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:36:21,982 INFO L276 IsEmpty]: Start isEmpty. Operand 3194 states and 10217 transitions. [2019-12-07 13:36:21,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 13:36:21,986 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:36:21,986 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] [2019-12-07 13:36:21,986 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:36:21,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:36:21,986 INFO L82 PathProgramCache]: Analyzing trace with hash -231356835, now seen corresponding path program 2 times [2019-12-07 13:36:21,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:36:21,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443737353] [2019-12-07 13:36:21,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:36:21,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:36:22,054 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 13:36:22,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443737353] [2019-12-07 13:36:22,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:36:22,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:36:22,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357739116] [2019-12-07 13:36:22,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:36:22,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:36:22,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:36:22,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:36:22,056 INFO L87 Difference]: Start difference. First operand 3194 states and 10217 transitions. Second operand 5 states. [2019-12-07 13:36:22,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:36:22,105 INFO L93 Difference]: Finished difference Result 5235 states and 15549 transitions. [2019-12-07 13:36:22,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:36:22,106 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-07 13:36:22,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:36:22,109 INFO L225 Difference]: With dead ends: 5235 [2019-12-07 13:36:22,110 INFO L226 Difference]: Without dead ends: 3428 [2019-12-07 13:36:22,110 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:36:22,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3428 states. [2019-12-07 13:36:22,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3428 to 2898. [2019-12-07 13:36:22,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2898 states. [2019-12-07 13:36:22,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 9136 transitions. [2019-12-07 13:36:22,144 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 9136 transitions. Word has length 48 [2019-12-07 13:36:22,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:36:22,144 INFO L462 AbstractCegarLoop]: Abstraction has 2898 states and 9136 transitions. [2019-12-07 13:36:22,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:36:22,144 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 9136 transitions. [2019-12-07 13:36:22,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 13:36:22,148 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:36:22,148 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] [2019-12-07 13:36:22,148 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:36:22,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:36:22,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1878148035, now seen corresponding path program 3 times [2019-12-07 13:36:22,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:36:22,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8899279] [2019-12-07 13:36:22,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:36:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:36:22,214 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 13:36:22,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8899279] [2019-12-07 13:36:22,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:36:22,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:36:22,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118870240] [2019-12-07 13:36:22,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:36:22,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:36:22,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:36:22,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:36:22,215 INFO L87 Difference]: Start difference. First operand 2898 states and 9136 transitions. Second operand 4 states. [2019-12-07 13:36:22,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:36:22,233 INFO L93 Difference]: Finished difference Result 3450 states and 10403 transitions. [2019-12-07 13:36:22,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:36:22,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-12-07 13:36:22,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:36:22,236 INFO L225 Difference]: With dead ends: 3450 [2019-12-07 13:36:22,236 INFO L226 Difference]: Without dead ends: 2299 [2019-12-07 13:36:22,237 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 13:36:22,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2299 states. [2019-12-07 13:36:22,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2299 to 2299. [2019-12-07 13:36:22,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2299 states. [2019-12-07 13:36:22,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2299 states to 2299 states and 6689 transitions. [2019-12-07 13:36:22,260 INFO L78 Accepts]: Start accepts. Automaton has 2299 states and 6689 transitions. Word has length 48 [2019-12-07 13:36:22,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:36:22,261 INFO L462 AbstractCegarLoop]: Abstraction has 2299 states and 6689 transitions. [2019-12-07 13:36:22,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:36:22,261 INFO L276 IsEmpty]: Start isEmpty. Operand 2299 states and 6689 transitions. [2019-12-07 13:36:22,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 13:36:22,263 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:36:22,264 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] [2019-12-07 13:36:22,264 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:36:22,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:36:22,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1908529501, now seen corresponding path program 4 times [2019-12-07 13:36:22,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:36:22,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673964214] [2019-12-07 13:36:22,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:36:22,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:36:22,323 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 13:36:22,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673964214] [2019-12-07 13:36:22,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:36:22,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:36:22,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068711888] [2019-12-07 13:36:22,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:36:22,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:36:22,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:36:22,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:36:22,325 INFO L87 Difference]: Start difference. First operand 2299 states and 6689 transitions. Second operand 4 states. [2019-12-07 13:36:22,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:36:22,353 INFO L93 Difference]: Finished difference Result 2803 states and 7859 transitions. [2019-12-07 13:36:22,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:36:22,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-12-07 13:36:22,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:36:22,355 INFO L225 Difference]: With dead ends: 2803 [2019-12-07 13:36:22,355 INFO L226 Difference]: Without dead ends: 2025 [2019-12-07 13:36:22,355 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 13:36:22,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2025 states. [2019-12-07 13:36:22,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2025 to 1639. [2019-12-07 13:36:22,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1639 states. [2019-12-07 13:36:22,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1639 states and 4715 transitions. [2019-12-07 13:36:22,373 INFO L78 Accepts]: Start accepts. Automaton has 1639 states and 4715 transitions. Word has length 48 [2019-12-07 13:36:22,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:36:22,373 INFO L462 AbstractCegarLoop]: Abstraction has 1639 states and 4715 transitions. [2019-12-07 13:36:22,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:36:22,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1639 states and 4715 transitions. [2019-12-07 13:36:22,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 13:36:22,376 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:36:22,376 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] [2019-12-07 13:36:22,376 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:36:22,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:36:22,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1923718495, now seen corresponding path program 5 times [2019-12-07 13:36:22,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:36:22,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412569158] [2019-12-07 13:36:22,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:36:22,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:36:22,439 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 13:36:22,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412569158] [2019-12-07 13:36:22,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:36:22,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:36:22,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049917697] [2019-12-07 13:36:22,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:36:22,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:36:22,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:36:22,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:36:22,440 INFO L87 Difference]: Start difference. First operand 1639 states and 4715 transitions. Second operand 5 states. [2019-12-07 13:36:22,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:36:22,473 INFO L93 Difference]: Finished difference Result 2095 states and 5741 transitions. [2019-12-07 13:36:22,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:36:22,473 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-07 13:36:22,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:36:22,474 INFO L225 Difference]: With dead ends: 2095 [2019-12-07 13:36:22,474 INFO L226 Difference]: Without dead ends: 504 [2019-12-07 13:36:22,474 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:36:22,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-12-07 13:36:22,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2019-12-07 13:36:22,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-12-07 13:36:22,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1111 transitions. [2019-12-07 13:36:22,478 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 1111 transitions. Word has length 48 [2019-12-07 13:36:22,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:36:22,478 INFO L462 AbstractCegarLoop]: Abstraction has 504 states and 1111 transitions. [2019-12-07 13:36:22,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:36:22,478 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 1111 transitions. [2019-12-07 13:36:22,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 13:36:22,479 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:36:22,479 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] [2019-12-07 13:36:22,479 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:36:22,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:36:22,479 INFO L82 PathProgramCache]: Analyzing trace with hash -126758993, now seen corresponding path program 6 times [2019-12-07 13:36:22,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:36:22,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726368626] [2019-12-07 13:36:22,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:36:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:36:22,703 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 13:36:22,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726368626] [2019-12-07 13:36:22,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:36:22,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 13:36:22,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31056714] [2019-12-07 13:36:22,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 13:36:22,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:36:22,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 13:36:22,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-07 13:36:22,704 INFO L87 Difference]: Start difference. First operand 504 states and 1111 transitions. Second operand 12 states. [2019-12-07 13:36:23,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:36:23,243 INFO L93 Difference]: Finished difference Result 730 states and 1553 transitions. [2019-12-07 13:36:23,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 13:36:23,244 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-07 13:36:23,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:36:23,244 INFO L225 Difference]: With dead ends: 730 [2019-12-07 13:36:23,244 INFO L226 Difference]: Without dead ends: 540 [2019-12-07 13:36:23,245 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=430, Unknown=0, NotChecked=0, Total=552 [2019-12-07 13:36:23,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-12-07 13:36:23,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 512. [2019-12-07 13:36:23,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-12-07 13:36:23,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 1125 transitions. [2019-12-07 13:36:23,249 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 1125 transitions. Word has length 48 [2019-12-07 13:36:23,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:36:23,249 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 1125 transitions. [2019-12-07 13:36:23,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 13:36:23,249 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 1125 transitions. [2019-12-07 13:36:23,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 13:36:23,250 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:36:23,250 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] [2019-12-07 13:36:23,250 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:36:23,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:36:23,250 INFO L82 PathProgramCache]: Analyzing trace with hash -723486791, now seen corresponding path program 7 times [2019-12-07 13:36:23,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:36:23,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810027615] [2019-12-07 13:36:23,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:36:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:36:23,321 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 13:36:23,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810027615] [2019-12-07 13:36:23,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:36:23,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:36:23,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775402717] [2019-12-07 13:36:23,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:36:23,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:36:23,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:36:23,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:36:23,323 INFO L87 Difference]: Start difference. First operand 512 states and 1125 transitions. Second operand 7 states. [2019-12-07 13:36:23,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:36:23,423 INFO L93 Difference]: Finished difference Result 868 states and 1884 transitions. [2019-12-07 13:36:23,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 13:36:23,423 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-07 13:36:23,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:36:23,423 INFO L225 Difference]: With dead ends: 868 [2019-12-07 13:36:23,423 INFO L226 Difference]: Without dead ends: 570 [2019-12-07 13:36:23,424 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:36:23,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-12-07 13:36:23,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 512. [2019-12-07 13:36:23,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-12-07 13:36:23,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 1123 transitions. [2019-12-07 13:36:23,428 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 1123 transitions. Word has length 48 [2019-12-07 13:36:23,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:36:23,428 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 1123 transitions. [2019-12-07 13:36:23,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:36:23,428 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 1123 transitions. [2019-12-07 13:36:23,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 13:36:23,429 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:36:23,429 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] [2019-12-07 13:36:23,429 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:36:23,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:36:23,430 INFO L82 PathProgramCache]: Analyzing trace with hash 24927743, now seen corresponding path program 8 times [2019-12-07 13:36:23,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:36:23,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101674741] [2019-12-07 13:36:23,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:36:23,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:36:23,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:36:23,498 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:36:23,498 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:36:23,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_107| 0 0))) (and (= v_~x~0_71 0) (= 0 v_~weak$$choice0~0_10) (= v_~z$w_buff0_used~0_514 0) (= |v_#memory_int_27| (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t989~0.base_59| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t989~0.base_59|) |v_ULTIMATE.start_main_~#t989~0.offset_37| 0))) (= 0 v_~z$r_buff1_thd3~0_207) (= v_~main$tmp_guard0~0_30 0) (= v_~main$tmp_guard1~0_44 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~a~0_59 0) (= 0 v_~z$flush_delayed~0_37) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t989~0.base_59| 4)) (= v_~z$mem_tmp~0_16 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t989~0.base_59|)) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$r_buff0_thd0~0_119 0) (= 0 v_~z$r_buff1_thd4~0_110) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t989~0.base_59|) (= v_~y~0_19 0) (= v_~z$w_buff0~0_183 0) (= 0 |v_ULTIMATE.start_main_~#t989~0.offset_37|) (= 0 v_~z$r_buff1_thd1~0_59) (= (store .cse0 |v_ULTIMATE.start_main_~#t989~0.base_59| 1) |v_#valid_105|) (= 0 v_~z$r_buff0_thd4~0_166) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~__unbuffered_p3_EAX~0_87) (= 0 v_~z$r_buff1_thd2~0_58) (= v_~z$r_buff0_thd1~0_58 0) (= v_~z$r_buff0_thd2~0_57 0) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd0~0_132 0) (= |v_#NULL.offset_5| 0) (= v_~z~0_116 0) (= 0 v_~__unbuffered_p2_EAX~0_54) (= 0 v_~__unbuffered_p1_EAX~0_49) (= 0 v_~z$r_buff0_thd3~0_266) (= 0 v_~__unbuffered_p3_EBX~0_88) (= 0 v_~weak$$choice2~0_95) (= v_~z$w_buff1_used~0_298 0) (= 0 |v_#NULL.base_5|) (= v_~z$w_buff1~0_123 0) (= v_~b~0_79 0) (= v_~__unbuffered_cnt~0_126 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_107|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_~#t991~0.offset=|v_ULTIMATE.start_main_~#t991~0.offset_23|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_58, #NULL.offset=|v_#NULL.offset_5|, ~a~0=v_~a~0_59, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_119, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_166, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_87, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_54, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_81|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_298, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_72|, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ULTIMATE.start_main_~#t990~0.base=|v_ULTIMATE.start_main_~#t990~0.base_56|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_37|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_59, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_266, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, ~x~0=v_~x~0_71, ULTIMATE.start_main_~#t989~0.base=|v_ULTIMATE.start_main_~#t989~0.base_59|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_110, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_18|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t990~0.offset=|v_ULTIMATE.start_main_~#t990~0.offset_35|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_132, ULTIMATE.start_main_~#t991~0.base=|v_ULTIMATE.start_main_~#t991~0.base_32|, ~y~0=v_~y~0_19, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_57, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_514, ~z$w_buff0~0=v_~z$w_buff0~0_183, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_207, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_45|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_141|, ULTIMATE.start_main_~#t992~0.base=|v_ULTIMATE.start_main_~#t992~0.base_32|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_88, ULTIMATE.start_main_~#t989~0.offset=|v_ULTIMATE.start_main_~#t989~0.offset_37|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_91|, ~b~0=v_~b~0_79, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_38|, #valid=|v_#valid_105|, #memory_int=|v_#memory_int_27|, ~z~0=v_~z~0_116, ~weak$$choice2~0=v_~weak$$choice2~0_95, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_58, ULTIMATE.start_main_~#t992~0.offset=|v_ULTIMATE.start_main_~#t992~0.offset_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t991~0.offset, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_~#t990~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t989~0.base, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t990~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t991~0.base, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t992~0.base, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t989~0.offset, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t992~0.offset] because there is no mapped edge [2019-12-07 13:36:23,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t990~0.base_11| 1)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t990~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t990~0.offset_10| 0) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t990~0.base_11|)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t990~0.base_11|) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t990~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t990~0.base_11|) |v_ULTIMATE.start_main_~#t990~0.offset_10| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t990~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t990~0.base=|v_ULTIMATE.start_main_~#t990~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t990~0.offset=|v_ULTIMATE.start_main_~#t990~0.offset_10|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t990~0.base, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t990~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 13:36:23,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L845-1-->L847: Formula: (and (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t991~0.base_12| 1) |v_#valid_46|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t991~0.base_12| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t991~0.base_12|)) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t991~0.base_12|) 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t991~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t991~0.base_12|) |v_ULTIMATE.start_main_~#t991~0.offset_11| 2)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t991~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t991~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t991~0.offset=|v_ULTIMATE.start_main_~#t991~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t991~0.base=|v_ULTIMATE.start_main_~#t991~0.base_12|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t991~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t991~0.base, #length] because there is no mapped edge [2019-12-07 13:36:23,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L849: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t992~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t992~0.base_12|) |v_ULTIMATE.start_main_~#t992~0.offset_10| 3)) |v_#memory_int_15|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t992~0.base_12| 4)) (not (= |v_ULTIMATE.start_main_~#t992~0.base_12| 0)) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t992~0.base_12| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t992~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t992~0.offset_10|) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t992~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, #length=|v_#length_19|, ULTIMATE.start_main_~#t992~0.base=|v_ULTIMATE.start_main_~#t992~0.base_12|, ULTIMATE.start_main_~#t992~0.offset=|v_ULTIMATE.start_main_~#t992~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, #length, ULTIMATE.start_main_~#t992~0.base, ULTIMATE.start_main_~#t992~0.offset] because there is no mapped edge [2019-12-07 13:36:23,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L4-->L820: Formula: (and (= ~z$r_buff0_thd1~0_In1762638813 ~z$r_buff1_thd1~0_Out1762638813) (= ~z$r_buff1_thd3~0_Out1762638813 ~z$r_buff0_thd3~0_In1762638813) (= ~z$r_buff0_thd0~0_In1762638813 ~z$r_buff1_thd0~0_Out1762638813) (not (= 0 P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1762638813)) (= ~z$r_buff1_thd4~0_Out1762638813 ~z$r_buff0_thd4~0_In1762638813) (= ~z$r_buff1_thd2~0_Out1762638813 ~z$r_buff0_thd2~0_In1762638813) (= ~a~0_Out1762638813 1) (= ~b~0_In1762638813 ~__unbuffered_p3_EBX~0_Out1762638813) (= ~a~0_Out1762638813 ~__unbuffered_p3_EAX~0_Out1762638813) (= 1 ~z$r_buff0_thd4~0_Out1762638813)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1762638813, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1762638813, ~b~0=~b~0_In1762638813, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1762638813, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1762638813, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1762638813, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1762638813} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1762638813, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out1762638813, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out1762638813, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out1762638813, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out1762638813, ~a~0=~a~0_Out1762638813, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1762638813, ~b~0=~b~0_In1762638813, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1762638813, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out1762638813, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out1762638813, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1762638813, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1762638813, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1762638813, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1762638813} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-07 13:36:23,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork3_~arg.base_20 |v_P0Thread1of1ForFork3_#in~arg.base_22|) (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_22| v_P0Thread1of1ForFork3_~arg.offset_20) (= v_~x~0_36 1) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= v_~b~0_48 1) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|} OutVars{~b~0=v_~b~0_48, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_20, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_20, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_36} AuxVars[] AssignedVars[~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-07 13:36:23,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] P1ENTRY-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#in~arg.base_11| v_P1Thread1of1ForFork0_~arg.base_9) (= v_~y~0_15 v_~__unbuffered_p1_EAX~0_14) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= v_~x~0_23 2) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= |v_P1Thread1of1ForFork0_#in~arg.offset_11| v_P1Thread1of1ForFork0_~arg.offset_9)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, ~y~0=v_~y~0_15} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_9, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_15, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 13:36:23,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L778-->L778-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1590328055 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite9_Out-1590328055| |P2Thread1of1ForFork1_#t~ite8_Out-1590328055|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1590328055 256)))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1590328055 256))) (= 0 (mod ~z$w_buff0_used~0_In-1590328055 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In-1590328055 256) 0)))) (= ~z$w_buff0~0_In-1590328055 |P2Thread1of1ForFork1_#t~ite8_Out-1590328055|)) (and (not .cse0) (= ~z$w_buff0~0_In-1590328055 |P2Thread1of1ForFork1_#t~ite9_Out-1590328055|) (= |P2Thread1of1ForFork1_#t~ite8_In-1590328055| |P2Thread1of1ForFork1_#t~ite8_Out-1590328055|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1590328055, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1590328055, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1590328055, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1590328055, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1590328055, ~weak$$choice2~0=~weak$$choice2~0_In-1590328055, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In-1590328055|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In-1590328055, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1590328055, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1590328055, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1590328055, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1590328055, ~weak$$choice2~0=~weak$$choice2~0_In-1590328055, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out-1590328055|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out-1590328055|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 13:36:23,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L779-->L779-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1874553667 256)))) (or (and .cse0 (= ~z$w_buff1~0_In1874553667 |P2Thread1of1ForFork1_#t~ite11_Out1874553667|) (= |P2Thread1of1ForFork1_#t~ite12_Out1874553667| |P2Thread1of1ForFork1_#t~ite11_Out1874553667|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1874553667 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In1874553667 256)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In1874553667 256))) (and (= 0 (mod ~z$r_buff1_thd3~0_In1874553667 256)) .cse1)))) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite12_Out1874553667| ~z$w_buff1~0_In1874553667) (= |P2Thread1of1ForFork1_#t~ite11_In1874553667| |P2Thread1of1ForFork1_#t~ite11_Out1874553667|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1874553667, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1874553667, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_In1874553667|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1874553667, ~z$w_buff1~0=~z$w_buff1~0_In1874553667, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1874553667, ~weak$$choice2~0=~weak$$choice2~0_In1874553667} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1874553667, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out1874553667|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1874553667, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out1874553667|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1874553667, ~z$w_buff1~0=~z$w_buff1~0_In1874553667, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1874553667, ~weak$$choice2~0=~weak$$choice2~0_In1874553667} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 13:36:23,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L780-->L780-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1210292619 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite14_In1210292619| |P2Thread1of1ForFork1_#t~ite14_Out1210292619|) (= ~z$w_buff0_used~0_In1210292619 |P2Thread1of1ForFork1_#t~ite15_Out1210292619|)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1210292619 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In1210292619 256)) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1210292619 256))) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In1210292619 256))))) (= |P2Thread1of1ForFork1_#t~ite14_Out1210292619| |P2Thread1of1ForFork1_#t~ite15_Out1210292619|) (= |P2Thread1of1ForFork1_#t~ite14_Out1210292619| ~z$w_buff0_used~0_In1210292619) .cse0))) InVars {P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_In1210292619|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1210292619, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1210292619, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1210292619, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1210292619, ~weak$$choice2~0=~weak$$choice2~0_In1210292619} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out1210292619|, P2Thread1of1ForFork1_#t~ite15=|P2Thread1of1ForFork1_#t~ite15_Out1210292619|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1210292619, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1210292619, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1210292619, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1210292619, ~weak$$choice2~0=~weak$$choice2~0_In1210292619} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, P2Thread1of1ForFork1_#t~ite15] because there is no mapped edge [2019-12-07 13:36:23,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L782-->L783: Formula: (and (= v_~z$r_buff0_thd3~0_90 v_~z$r_buff0_thd3~0_89) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_90, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_9|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_89, ~weak$$choice2~0=v_~weak$$choice2~0_22, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_6|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-07 13:36:23,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L783-->L783-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-60958231 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork1_#t~ite23_Out-60958231| |P2Thread1of1ForFork1_#t~ite24_Out-60958231|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-60958231 256)))) (or (= (mod ~z$w_buff0_used~0_In-60958231 256) 0) (and (= (mod ~z$w_buff1_used~0_In-60958231 256) 0) .cse1) (and (= 0 (mod ~z$r_buff1_thd3~0_In-60958231 256)) .cse1))) (= |P2Thread1of1ForFork1_#t~ite23_Out-60958231| ~z$r_buff1_thd3~0_In-60958231)) (and (= ~z$r_buff1_thd3~0_In-60958231 |P2Thread1of1ForFork1_#t~ite24_Out-60958231|) (= |P2Thread1of1ForFork1_#t~ite23_In-60958231| |P2Thread1of1ForFork1_#t~ite23_Out-60958231|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-60958231, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-60958231, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_In-60958231|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-60958231, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-60958231, ~weak$$choice2~0=~weak$$choice2~0_In-60958231} OutVars{P2Thread1of1ForFork1_#t~ite24=|P2Thread1of1ForFork1_#t~ite24_Out-60958231|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-60958231, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-60958231, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_Out-60958231|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-60958231, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-60958231, ~weak$$choice2~0=~weak$$choice2~0_In-60958231} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite23] because there is no mapped edge [2019-12-07 13:36:23,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L785-->L793: Formula: (and (= 0 v_~z$flush_delayed~0_8) (= v_~z~0_22 v_~z$mem_tmp~0_6) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (not (= 0 (mod v_~z$flush_delayed~0_9 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_9} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_5|, ~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_8, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 13:36:23,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1050210907 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-1050210907 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite28_Out-1050210907| ~z$w_buff0_used~0_In-1050210907)) (and (not .cse1) (= 0 |P3Thread1of1ForFork2_#t~ite28_Out-1050210907|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1050210907, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1050210907} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-1050210907|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1050210907, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1050210907} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 13:36:23,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L822-->L822-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd4~0_In-1401843794 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1401843794 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-1401843794 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-1401843794 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1401843794 |P3Thread1of1ForFork2_#t~ite29_Out-1401843794|)) (and (= |P3Thread1of1ForFork2_#t~ite29_Out-1401843794| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1401843794, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1401843794, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1401843794, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1401843794} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-1401843794|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1401843794, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1401843794, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1401843794, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1401843794} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 13:36:23,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L823-->L824: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In815910660 256) 0)) (.cse0 (= ~z$r_buff0_thd4~0_Out815910660 ~z$r_buff0_thd4~0_In815910660)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In815910660 256)))) (or (and .cse0 .cse1) (and (= ~z$r_buff0_thd4~0_Out815910660 0) (not .cse1) (not .cse2)) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In815910660, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In815910660} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In815910660, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out815910660, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out815910660|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-07 13:36:23,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L824-->L824-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1852831118 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-1852831118 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1852831118 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1852831118 256)))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite31_Out-1852831118|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$r_buff1_thd4~0_In-1852831118 |P3Thread1of1ForFork2_#t~ite31_Out-1852831118|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1852831118, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1852831118, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1852831118, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1852831118} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1852831118, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1852831118, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1852831118, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1852831118, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out-1852831118|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 13:36:23,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L824-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= |v_P3Thread1of1ForFork2_#t~ite31_42| v_~z$r_buff1_thd4~0_62) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_42|} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_62, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_41|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 13:36:23,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L853-->L855-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_93 256)) (= 0 (mod v_~z$r_buff0_thd0~0_15 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 13:36:23,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L855-2-->L855-5: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1376465572 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1376465572 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite37_Out-1376465572| |ULTIMATE.start_main_#t~ite36_Out-1376465572|))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite36_Out-1376465572| ~z$w_buff1~0_In-1376465572) .cse1 (not .cse2)) (and (= ~z~0_In-1376465572 |ULTIMATE.start_main_#t~ite36_Out-1376465572|) (or .cse2 .cse0) .cse1))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1376465572, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1376465572, ~z$w_buff1~0=~z$w_buff1~0_In-1376465572, ~z~0=~z~0_In-1376465572} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1376465572, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1376465572, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1376465572|, ~z$w_buff1~0=~z$w_buff1~0_In-1376465572, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1376465572|, ~z~0=~z~0_In-1376465572} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 13:36:23,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-484439986 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-484439986 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-484439986 |ULTIMATE.start_main_#t~ite38_Out-484439986|)) (and (= 0 |ULTIMATE.start_main_#t~ite38_Out-484439986|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-484439986, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-484439986} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-484439986, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-484439986, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-484439986|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 13:36:23,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L857-->L857-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In2096769610 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In2096769610 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In2096769610 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In2096769610 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out2096769610| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite39_Out2096769610| ~z$w_buff1_used~0_In2096769610) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2096769610, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2096769610, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2096769610, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2096769610} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2096769610, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out2096769610|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2096769610, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2096769610, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2096769610} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 13:36:23,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L858-->L858-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-163914762 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-163914762 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite40_Out-163914762|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-163914762 |ULTIMATE.start_main_#t~ite40_Out-163914762|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-163914762, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-163914762} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-163914762, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-163914762|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-163914762} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 13:36:23,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L859-->L859-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In528227422 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In528227422 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In528227422 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In528227422 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite41_Out528227422|)) (and (= ~z$r_buff1_thd0~0_In528227422 |ULTIMATE.start_main_#t~ite41_Out528227422|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In528227422, ~z$w_buff0_used~0=~z$w_buff0_used~0_In528227422, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In528227422, ~z$w_buff1_used~0=~z$w_buff1_used~0_In528227422} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out528227422|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In528227422, ~z$w_buff0_used~0=~z$w_buff0_used~0_In528227422, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In528227422, ~z$w_buff1_used~0=~z$w_buff1_used~0_In528227422} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 13:36:23,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= |v_ULTIMATE.start_main_#t~ite41_31| v_~z$r_buff1_thd0~0_73) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~main$tmp_guard1~0_13 (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_21) (= 1 v_~__unbuffered_p3_EAX~0_43) (= 0 v_~__unbuffered_p3_EBX~0_41) (= v_~x~0_41 2) (= 0 v_~__unbuffered_p2_EAX~0_17))) 1 0) 0) 0 1))) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_31|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~x~0=v_~x~0_41} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_30|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_73, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~x~0=v_~x~0_41, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:36:23,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:36:23 BasicIcfg [2019-12-07 13:36:23,559 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:36:23,559 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:36:23,559 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:36:23,559 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:36:23,560 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:36:11" (3/4) ... [2019-12-07 13:36:23,562 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 13:36:23,562 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_107| 0 0))) (and (= v_~x~0_71 0) (= 0 v_~weak$$choice0~0_10) (= v_~z$w_buff0_used~0_514 0) (= |v_#memory_int_27| (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t989~0.base_59| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t989~0.base_59|) |v_ULTIMATE.start_main_~#t989~0.offset_37| 0))) (= 0 v_~z$r_buff1_thd3~0_207) (= v_~main$tmp_guard0~0_30 0) (= v_~main$tmp_guard1~0_44 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~a~0_59 0) (= 0 v_~z$flush_delayed~0_37) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t989~0.base_59| 4)) (= v_~z$mem_tmp~0_16 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t989~0.base_59|)) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$r_buff0_thd0~0_119 0) (= 0 v_~z$r_buff1_thd4~0_110) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t989~0.base_59|) (= v_~y~0_19 0) (= v_~z$w_buff0~0_183 0) (= 0 |v_ULTIMATE.start_main_~#t989~0.offset_37|) (= 0 v_~z$r_buff1_thd1~0_59) (= (store .cse0 |v_ULTIMATE.start_main_~#t989~0.base_59| 1) |v_#valid_105|) (= 0 v_~z$r_buff0_thd4~0_166) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~__unbuffered_p3_EAX~0_87) (= 0 v_~z$r_buff1_thd2~0_58) (= v_~z$r_buff0_thd1~0_58 0) (= v_~z$r_buff0_thd2~0_57 0) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd0~0_132 0) (= |v_#NULL.offset_5| 0) (= v_~z~0_116 0) (= 0 v_~__unbuffered_p2_EAX~0_54) (= 0 v_~__unbuffered_p1_EAX~0_49) (= 0 v_~z$r_buff0_thd3~0_266) (= 0 v_~__unbuffered_p3_EBX~0_88) (= 0 v_~weak$$choice2~0_95) (= v_~z$w_buff1_used~0_298 0) (= 0 |v_#NULL.base_5|) (= v_~z$w_buff1~0_123 0) (= v_~b~0_79 0) (= v_~__unbuffered_cnt~0_126 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_107|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_~#t991~0.offset=|v_ULTIMATE.start_main_~#t991~0.offset_23|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_58, #NULL.offset=|v_#NULL.offset_5|, ~a~0=v_~a~0_59, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_119, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_166, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_87, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_54, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_81|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_298, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_72|, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ULTIMATE.start_main_~#t990~0.base=|v_ULTIMATE.start_main_~#t990~0.base_56|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_37|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_59, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_266, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, ~x~0=v_~x~0_71, ULTIMATE.start_main_~#t989~0.base=|v_ULTIMATE.start_main_~#t989~0.base_59|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_110, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_18|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t990~0.offset=|v_ULTIMATE.start_main_~#t990~0.offset_35|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_132, ULTIMATE.start_main_~#t991~0.base=|v_ULTIMATE.start_main_~#t991~0.base_32|, ~y~0=v_~y~0_19, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_57, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_514, ~z$w_buff0~0=v_~z$w_buff0~0_183, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_207, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_45|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_141|, ULTIMATE.start_main_~#t992~0.base=|v_ULTIMATE.start_main_~#t992~0.base_32|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_88, ULTIMATE.start_main_~#t989~0.offset=|v_ULTIMATE.start_main_~#t989~0.offset_37|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_91|, ~b~0=v_~b~0_79, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_38|, #valid=|v_#valid_105|, #memory_int=|v_#memory_int_27|, ~z~0=v_~z~0_116, ~weak$$choice2~0=v_~weak$$choice2~0_95, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_58, ULTIMATE.start_main_~#t992~0.offset=|v_ULTIMATE.start_main_~#t992~0.offset_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t991~0.offset, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_~#t990~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t989~0.base, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t990~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t991~0.base, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t992~0.base, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t989~0.offset, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t992~0.offset] because there is no mapped edge [2019-12-07 13:36:23,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t990~0.base_11| 1)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t990~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t990~0.offset_10| 0) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t990~0.base_11|)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t990~0.base_11|) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t990~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t990~0.base_11|) |v_ULTIMATE.start_main_~#t990~0.offset_10| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t990~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t990~0.base=|v_ULTIMATE.start_main_~#t990~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t990~0.offset=|v_ULTIMATE.start_main_~#t990~0.offset_10|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t990~0.base, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t990~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 13:36:23,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L845-1-->L847: Formula: (and (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t991~0.base_12| 1) |v_#valid_46|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t991~0.base_12| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t991~0.base_12|)) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t991~0.base_12|) 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t991~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t991~0.base_12|) |v_ULTIMATE.start_main_~#t991~0.offset_11| 2)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t991~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t991~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t991~0.offset=|v_ULTIMATE.start_main_~#t991~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t991~0.base=|v_ULTIMATE.start_main_~#t991~0.base_12|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t991~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t991~0.base, #length] because there is no mapped edge [2019-12-07 13:36:23,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L849: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t992~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t992~0.base_12|) |v_ULTIMATE.start_main_~#t992~0.offset_10| 3)) |v_#memory_int_15|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t992~0.base_12| 4)) (not (= |v_ULTIMATE.start_main_~#t992~0.base_12| 0)) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t992~0.base_12| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t992~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t992~0.offset_10|) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t992~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, #length=|v_#length_19|, ULTIMATE.start_main_~#t992~0.base=|v_ULTIMATE.start_main_~#t992~0.base_12|, ULTIMATE.start_main_~#t992~0.offset=|v_ULTIMATE.start_main_~#t992~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, #length, ULTIMATE.start_main_~#t992~0.base, ULTIMATE.start_main_~#t992~0.offset] because there is no mapped edge [2019-12-07 13:36:23,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L4-->L820: Formula: (and (= ~z$r_buff0_thd1~0_In1762638813 ~z$r_buff1_thd1~0_Out1762638813) (= ~z$r_buff1_thd3~0_Out1762638813 ~z$r_buff0_thd3~0_In1762638813) (= ~z$r_buff0_thd0~0_In1762638813 ~z$r_buff1_thd0~0_Out1762638813) (not (= 0 P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1762638813)) (= ~z$r_buff1_thd4~0_Out1762638813 ~z$r_buff0_thd4~0_In1762638813) (= ~z$r_buff1_thd2~0_Out1762638813 ~z$r_buff0_thd2~0_In1762638813) (= ~a~0_Out1762638813 1) (= ~b~0_In1762638813 ~__unbuffered_p3_EBX~0_Out1762638813) (= ~a~0_Out1762638813 ~__unbuffered_p3_EAX~0_Out1762638813) (= 1 ~z$r_buff0_thd4~0_Out1762638813)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1762638813, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1762638813, ~b~0=~b~0_In1762638813, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1762638813, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1762638813, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1762638813, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1762638813} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1762638813, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out1762638813, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out1762638813, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out1762638813, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out1762638813, ~a~0=~a~0_Out1762638813, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1762638813, ~b~0=~b~0_In1762638813, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1762638813, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out1762638813, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out1762638813, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1762638813, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1762638813, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1762638813, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1762638813} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-07 13:36:23,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork3_~arg.base_20 |v_P0Thread1of1ForFork3_#in~arg.base_22|) (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_22| v_P0Thread1of1ForFork3_~arg.offset_20) (= v_~x~0_36 1) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= v_~b~0_48 1) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|} OutVars{~b~0=v_~b~0_48, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_20, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_20, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_36} AuxVars[] AssignedVars[~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-07 13:36:23,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] P1ENTRY-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#in~arg.base_11| v_P1Thread1of1ForFork0_~arg.base_9) (= v_~y~0_15 v_~__unbuffered_p1_EAX~0_14) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= v_~x~0_23 2) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= |v_P1Thread1of1ForFork0_#in~arg.offset_11| v_P1Thread1of1ForFork0_~arg.offset_9)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, ~y~0=v_~y~0_15} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_9, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_15, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 13:36:23,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L778-->L778-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1590328055 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite9_Out-1590328055| |P2Thread1of1ForFork1_#t~ite8_Out-1590328055|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1590328055 256)))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1590328055 256))) (= 0 (mod ~z$w_buff0_used~0_In-1590328055 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In-1590328055 256) 0)))) (= ~z$w_buff0~0_In-1590328055 |P2Thread1of1ForFork1_#t~ite8_Out-1590328055|)) (and (not .cse0) (= ~z$w_buff0~0_In-1590328055 |P2Thread1of1ForFork1_#t~ite9_Out-1590328055|) (= |P2Thread1of1ForFork1_#t~ite8_In-1590328055| |P2Thread1of1ForFork1_#t~ite8_Out-1590328055|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1590328055, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1590328055, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1590328055, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1590328055, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1590328055, ~weak$$choice2~0=~weak$$choice2~0_In-1590328055, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In-1590328055|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In-1590328055, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1590328055, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1590328055, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1590328055, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1590328055, ~weak$$choice2~0=~weak$$choice2~0_In-1590328055, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out-1590328055|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out-1590328055|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 13:36:23,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L779-->L779-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1874553667 256)))) (or (and .cse0 (= ~z$w_buff1~0_In1874553667 |P2Thread1of1ForFork1_#t~ite11_Out1874553667|) (= |P2Thread1of1ForFork1_#t~ite12_Out1874553667| |P2Thread1of1ForFork1_#t~ite11_Out1874553667|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1874553667 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In1874553667 256)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In1874553667 256))) (and (= 0 (mod ~z$r_buff1_thd3~0_In1874553667 256)) .cse1)))) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite12_Out1874553667| ~z$w_buff1~0_In1874553667) (= |P2Thread1of1ForFork1_#t~ite11_In1874553667| |P2Thread1of1ForFork1_#t~ite11_Out1874553667|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1874553667, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1874553667, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_In1874553667|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1874553667, ~z$w_buff1~0=~z$w_buff1~0_In1874553667, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1874553667, ~weak$$choice2~0=~weak$$choice2~0_In1874553667} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1874553667, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out1874553667|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1874553667, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out1874553667|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1874553667, ~z$w_buff1~0=~z$w_buff1~0_In1874553667, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1874553667, ~weak$$choice2~0=~weak$$choice2~0_In1874553667} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 13:36:23,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L780-->L780-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1210292619 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite14_In1210292619| |P2Thread1of1ForFork1_#t~ite14_Out1210292619|) (= ~z$w_buff0_used~0_In1210292619 |P2Thread1of1ForFork1_#t~ite15_Out1210292619|)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1210292619 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In1210292619 256)) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1210292619 256))) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In1210292619 256))))) (= |P2Thread1of1ForFork1_#t~ite14_Out1210292619| |P2Thread1of1ForFork1_#t~ite15_Out1210292619|) (= |P2Thread1of1ForFork1_#t~ite14_Out1210292619| ~z$w_buff0_used~0_In1210292619) .cse0))) InVars {P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_In1210292619|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1210292619, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1210292619, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1210292619, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1210292619, ~weak$$choice2~0=~weak$$choice2~0_In1210292619} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out1210292619|, P2Thread1of1ForFork1_#t~ite15=|P2Thread1of1ForFork1_#t~ite15_Out1210292619|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1210292619, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1210292619, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1210292619, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1210292619, ~weak$$choice2~0=~weak$$choice2~0_In1210292619} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, P2Thread1of1ForFork1_#t~ite15] because there is no mapped edge [2019-12-07 13:36:23,571 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L782-->L783: Formula: (and (= v_~z$r_buff0_thd3~0_90 v_~z$r_buff0_thd3~0_89) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_90, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_9|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_89, ~weak$$choice2~0=v_~weak$$choice2~0_22, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_6|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-07 13:36:23,571 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L783-->L783-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-60958231 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork1_#t~ite23_Out-60958231| |P2Thread1of1ForFork1_#t~ite24_Out-60958231|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-60958231 256)))) (or (= (mod ~z$w_buff0_used~0_In-60958231 256) 0) (and (= (mod ~z$w_buff1_used~0_In-60958231 256) 0) .cse1) (and (= 0 (mod ~z$r_buff1_thd3~0_In-60958231 256)) .cse1))) (= |P2Thread1of1ForFork1_#t~ite23_Out-60958231| ~z$r_buff1_thd3~0_In-60958231)) (and (= ~z$r_buff1_thd3~0_In-60958231 |P2Thread1of1ForFork1_#t~ite24_Out-60958231|) (= |P2Thread1of1ForFork1_#t~ite23_In-60958231| |P2Thread1of1ForFork1_#t~ite23_Out-60958231|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-60958231, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-60958231, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_In-60958231|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-60958231, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-60958231, ~weak$$choice2~0=~weak$$choice2~0_In-60958231} OutVars{P2Thread1of1ForFork1_#t~ite24=|P2Thread1of1ForFork1_#t~ite24_Out-60958231|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-60958231, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-60958231, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_Out-60958231|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-60958231, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-60958231, ~weak$$choice2~0=~weak$$choice2~0_In-60958231} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite23] because there is no mapped edge [2019-12-07 13:36:23,571 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L785-->L793: Formula: (and (= 0 v_~z$flush_delayed~0_8) (= v_~z~0_22 v_~z$mem_tmp~0_6) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (not (= 0 (mod v_~z$flush_delayed~0_9 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_9} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_5|, ~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_8, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 13:36:23,572 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1050210907 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-1050210907 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite28_Out-1050210907| ~z$w_buff0_used~0_In-1050210907)) (and (not .cse1) (= 0 |P3Thread1of1ForFork2_#t~ite28_Out-1050210907|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1050210907, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1050210907} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-1050210907|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1050210907, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1050210907} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 13:36:23,573 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L822-->L822-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd4~0_In-1401843794 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1401843794 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-1401843794 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-1401843794 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1401843794 |P3Thread1of1ForFork2_#t~ite29_Out-1401843794|)) (and (= |P3Thread1of1ForFork2_#t~ite29_Out-1401843794| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1401843794, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1401843794, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1401843794, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1401843794} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-1401843794|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1401843794, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1401843794, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1401843794, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1401843794} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 13:36:23,573 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L823-->L824: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In815910660 256) 0)) (.cse0 (= ~z$r_buff0_thd4~0_Out815910660 ~z$r_buff0_thd4~0_In815910660)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In815910660 256)))) (or (and .cse0 .cse1) (and (= ~z$r_buff0_thd4~0_Out815910660 0) (not .cse1) (not .cse2)) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In815910660, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In815910660} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In815910660, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out815910660, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out815910660|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-07 13:36:23,574 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L824-->L824-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1852831118 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-1852831118 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1852831118 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1852831118 256)))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite31_Out-1852831118|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$r_buff1_thd4~0_In-1852831118 |P3Thread1of1ForFork2_#t~ite31_Out-1852831118|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1852831118, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1852831118, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1852831118, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1852831118} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1852831118, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1852831118, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1852831118, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1852831118, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out-1852831118|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 13:36:23,574 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L824-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= |v_P3Thread1of1ForFork2_#t~ite31_42| v_~z$r_buff1_thd4~0_62) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_42|} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_62, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_41|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 13:36:23,574 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L853-->L855-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_93 256)) (= 0 (mod v_~z$r_buff0_thd0~0_15 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 13:36:23,574 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L855-2-->L855-5: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1376465572 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1376465572 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite37_Out-1376465572| |ULTIMATE.start_main_#t~ite36_Out-1376465572|))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite36_Out-1376465572| ~z$w_buff1~0_In-1376465572) .cse1 (not .cse2)) (and (= ~z~0_In-1376465572 |ULTIMATE.start_main_#t~ite36_Out-1376465572|) (or .cse2 .cse0) .cse1))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1376465572, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1376465572, ~z$w_buff1~0=~z$w_buff1~0_In-1376465572, ~z~0=~z~0_In-1376465572} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1376465572, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1376465572, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1376465572|, ~z$w_buff1~0=~z$w_buff1~0_In-1376465572, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1376465572|, ~z~0=~z~0_In-1376465572} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 13:36:23,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-484439986 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-484439986 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-484439986 |ULTIMATE.start_main_#t~ite38_Out-484439986|)) (and (= 0 |ULTIMATE.start_main_#t~ite38_Out-484439986|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-484439986, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-484439986} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-484439986, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-484439986, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-484439986|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 13:36:23,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L857-->L857-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In2096769610 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In2096769610 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In2096769610 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In2096769610 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out2096769610| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite39_Out2096769610| ~z$w_buff1_used~0_In2096769610) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2096769610, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2096769610, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2096769610, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2096769610} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2096769610, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out2096769610|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2096769610, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2096769610, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2096769610} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 13:36:23,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L858-->L858-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-163914762 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-163914762 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite40_Out-163914762|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-163914762 |ULTIMATE.start_main_#t~ite40_Out-163914762|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-163914762, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-163914762} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-163914762, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-163914762|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-163914762} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 13:36:23,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L859-->L859-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In528227422 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In528227422 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In528227422 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In528227422 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite41_Out528227422|)) (and (= ~z$r_buff1_thd0~0_In528227422 |ULTIMATE.start_main_#t~ite41_Out528227422|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In528227422, ~z$w_buff0_used~0=~z$w_buff0_used~0_In528227422, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In528227422, ~z$w_buff1_used~0=~z$w_buff1_used~0_In528227422} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out528227422|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In528227422, ~z$w_buff0_used~0=~z$w_buff0_used~0_In528227422, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In528227422, ~z$w_buff1_used~0=~z$w_buff1_used~0_In528227422} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 13:36:23,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= |v_ULTIMATE.start_main_#t~ite41_31| v_~z$r_buff1_thd0~0_73) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~main$tmp_guard1~0_13 (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_21) (= 1 v_~__unbuffered_p3_EAX~0_43) (= 0 v_~__unbuffered_p3_EBX~0_41) (= v_~x~0_41 2) (= 0 v_~__unbuffered_p2_EAX~0_17))) 1 0) 0) 0 1))) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_31|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~x~0=v_~x~0_41} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_30|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_73, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~x~0=v_~x~0_41, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:36:23,645 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9e2d84d3-321c-47ad-b707-74cb7c4c84bc/bin/uautomizer/witness.graphml [2019-12-07 13:36:23,645 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:36:23,646 INFO L168 Benchmark]: Toolchain (without parser) took 13460.05 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 1.0 GB). Free memory was 940.7 MB in the beginning and 877.1 MB in the end (delta: 63.6 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-12-07 13:36:23,647 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:36:23,647 INFO L168 Benchmark]: CACSL2BoogieTranslator took 401.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.9 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -122.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:36:23,647 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.48 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 13:36:23,648 INFO L168 Benchmark]: Boogie Preprocessor took 24.46 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 13:36:23,648 INFO L168 Benchmark]: RCFGBuilder took 379.57 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: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. [2019-12-07 13:36:23,648 INFO L168 Benchmark]: TraceAbstraction took 12526.45 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 912.8 MB). Free memory was 1.0 GB in the beginning and 903.0 MB in the end (delta: 97.9 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2019-12-07 13:36:23,649 INFO L168 Benchmark]: Witness Printer took 85.80 ms. Allocated memory is still 2.0 GB. Free memory was 903.0 MB in the beginning and 877.1 MB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-12-07 13:36:23,650 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 401.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.9 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -122.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.48 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.46 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 379.57 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: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12526.45 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 912.8 MB). Free memory was 1.0 GB in the beginning and 903.0 MB in the end (delta: 97.9 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. * Witness Printer took 85.80 ms. Allocated memory is still 2.0 GB. Free memory was 903.0 MB in the beginning and 877.1 MB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 170 ProgramPointsBefore, 74 ProgramPointsAfterwards, 192 TransitionsBefore, 78 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 23 ChoiceCompositions, 5751 VarBasedMoverChecksPositive, 155 VarBasedMoverChecksNegative, 25 SemBasedMoverChecksPositive, 169 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.6s, 0 MoverChecksTotal, 44168 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L843] FCALL, FORK 0 pthread_create(&t989, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t990, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t991, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t992, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 1 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L820] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 1 [L773] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 3 z$flush_delayed = weak$$choice2 [L776] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L778] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L779] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L780] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L781] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L783] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L784] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L821] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L822] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L858] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 158 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.3s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2185 SDtfs, 3339 SDslu, 4230 SDs, 0 SdLazy, 1660 SolverSat, 235 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30378occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 20829 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 641 NumberOfCodeBlocks, 641 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 575 ConstructedInterpolants, 0 QuantifiedInterpolants, 149708 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...