./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix043_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d36da1c6-2f3b-4120-9476-f1a574350b10/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d36da1c6-2f3b-4120-9476-f1a574350b10/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d36da1c6-2f3b-4120-9476-f1a574350b10/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d36da1c6-2f3b-4120-9476-f1a574350b10/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix043_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_d36da1c6-2f3b-4120-9476-f1a574350b10/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d36da1c6-2f3b-4120-9476-f1a574350b10/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 9f9be1ac45b0dc48a14f528473180913653cf0eb ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 10:59:51,092 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:59:51,094 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:59:51,101 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:59:51,101 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:59:51,102 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:59:51,103 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:59:51,104 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:59:51,105 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:59:51,106 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:59:51,107 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:59:51,108 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:59:51,108 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:59:51,108 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:59:51,109 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:59:51,110 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:59:51,110 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:59:51,111 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:59:51,112 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:59:51,114 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:59:51,115 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:59:51,116 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:59:51,116 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:59:51,117 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:59:51,118 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:59:51,119 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:59:51,119 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:59:51,119 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:59:51,119 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:59:51,120 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:59:51,120 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:59:51,120 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:59:51,121 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:59:51,121 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:59:51,122 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:59:51,122 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:59:51,122 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:59:51,122 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:59:51,123 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:59:51,123 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:59:51,124 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:59:51,124 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d36da1c6-2f3b-4120-9476-f1a574350b10/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 10:59:51,133 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:59:51,133 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:59:51,134 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:59:51,134 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:59:51,134 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:59:51,134 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:59:51,134 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:59:51,134 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:59:51,134 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:59:51,135 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:59:51,135 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:59:51,135 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:59:51,135 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:59:51,135 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:59:51,135 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:59:51,135 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:59:51,135 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:59:51,135 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:59:51,135 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:59:51,136 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:59:51,136 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:59:51,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:59:51,136 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:59:51,136 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:59:51,136 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:59:51,136 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:59:51,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:59:51,137 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:59:51,137 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:59:51,137 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_d36da1c6-2f3b-4120-9476-f1a574350b10/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 -> 9f9be1ac45b0dc48a14f528473180913653cf0eb [2019-12-07 10:59:51,241 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:59:51,251 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:59:51,254 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:59:51,255 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:59:51,255 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:59:51,256 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d36da1c6-2f3b-4120-9476-f1a574350b10/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix043_pso.opt.i [2019-12-07 10:59:51,296 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d36da1c6-2f3b-4120-9476-f1a574350b10/bin/uautomizer/data/02c47c2d0/a8ae9f42d5764885b69363c98368ac80/FLAGc91974e74 [2019-12-07 10:59:51,755 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:59:51,755 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d36da1c6-2f3b-4120-9476-f1a574350b10/sv-benchmarks/c/pthread-wmm/mix043_pso.opt.i [2019-12-07 10:59:51,765 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d36da1c6-2f3b-4120-9476-f1a574350b10/bin/uautomizer/data/02c47c2d0/a8ae9f42d5764885b69363c98368ac80/FLAGc91974e74 [2019-12-07 10:59:52,075 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d36da1c6-2f3b-4120-9476-f1a574350b10/bin/uautomizer/data/02c47c2d0/a8ae9f42d5764885b69363c98368ac80 [2019-12-07 10:59:52,077 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:59:52,078 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:59:52,079 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:59:52,079 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:59:52,082 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:59:52,082 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:59:52" (1/1) ... [2019-12-07 10:59:52,084 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77919ae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:59:52, skipping insertion in model container [2019-12-07 10:59:52,084 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:59:52" (1/1) ... [2019-12-07 10:59:52,089 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:59:52,117 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:59:52,351 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:59:52,358 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:59:52,398 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:59:52,443 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:59:52,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:59:52 WrapperNode [2019-12-07 10:59:52,443 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:59:52,443 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:59:52,443 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:59:52,444 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:59:52,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:59:52" (1/1) ... [2019-12-07 10:59:52,463 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:59:52" (1/1) ... [2019-12-07 10:59:52,484 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:59:52,484 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:59:52,484 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:59:52,484 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:59:52,491 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:59:52" (1/1) ... [2019-12-07 10:59:52,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:59:52" (1/1) ... [2019-12-07 10:59:52,494 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:59:52" (1/1) ... [2019-12-07 10:59:52,494 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:59:52" (1/1) ... [2019-12-07 10:59:52,501 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:59:52" (1/1) ... [2019-12-07 10:59:52,503 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:59:52" (1/1) ... [2019-12-07 10:59:52,506 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:59:52" (1/1) ... [2019-12-07 10:59:52,509 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:59:52,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:59:52,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:59:52,509 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:59:52,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:59:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d36da1c6-2f3b-4120-9476-f1a574350b10/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 10:59:52,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:59:52,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 10:59:52,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:59:52,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:59:52,549 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 10:59:52,549 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 10:59:52,550 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 10:59:52,550 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 10:59:52,550 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 10:59:52,550 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 10:59:52,550 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 10:59:52,550 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 10:59:52,550 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 10:59:52,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:59:52,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:59:52,551 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 10:59:52,910 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:59:52,910 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 10:59:52,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:59:52 BoogieIcfgContainer [2019-12-07 10:59:52,911 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:59:52,912 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:59:52,912 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:59:52,913 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:59:52,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:59:52" (1/3) ... [2019-12-07 10:59:52,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@231b30c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:59:52, skipping insertion in model container [2019-12-07 10:59:52,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:59:52" (2/3) ... [2019-12-07 10:59:52,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@231b30c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:59:52, skipping insertion in model container [2019-12-07 10:59:52,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:59:52" (3/3) ... [2019-12-07 10:59:52,916 INFO L109 eAbstractionObserver]: Analyzing ICFG mix043_pso.opt.i [2019-12-07 10:59:52,922 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 10:59:52,922 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:59:52,927 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 10:59:52,927 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 10:59:52,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,951 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,951 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,952 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,952 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,953 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,953 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,959 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,959 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,959 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,959 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,960 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,960 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,960 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,960 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,960 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,961 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,961 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,961 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,961 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,961 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,962 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,962 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,962 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,962 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,962 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,962 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,962 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,963 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,963 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,963 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,963 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,963 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,964 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,964 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,964 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,964 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,964 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,964 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,965 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,965 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:52,980 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 10:59:52,997 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:59:52,997 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:59:52,997 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:59:52,997 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:59:52,997 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:59:52,997 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:59:52,997 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:59:52,997 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:59:53,008 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 210 transitions [2019-12-07 10:59:53,009 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-07 10:59:53,073 INFO L134 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-07 10:59:53,073 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:59:53,083 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 469 event pairs. 12/175 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-07 10:59:53,096 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-07 10:59:53,124 INFO L134 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-07 10:59:53,124 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:59:53,128 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 469 event pairs. 12/175 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-07 10:59:53,139 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-07 10:59:53,140 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 10:59:56,243 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-07 10:59:56,342 INFO L206 etLargeBlockEncoding]: Checked pairs total: 56592 [2019-12-07 10:59:56,343 INFO L214 etLargeBlockEncoding]: Total number of compositions: 126 [2019-12-07 10:59:56,345 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 97 transitions [2019-12-07 10:59:58,161 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 33838 states. [2019-12-07 10:59:58,163 INFO L276 IsEmpty]: Start isEmpty. Operand 33838 states. [2019-12-07 10:59:58,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 10:59:58,167 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:59:58,167 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:59:58,168 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:59:58,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:59:58,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1752766824, now seen corresponding path program 1 times [2019-12-07 10:59:58,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:59:58,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087979755] [2019-12-07 10:59:58,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:59:58,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:59:58,342 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 10:59:58,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087979755] [2019-12-07 10:59:58,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:59:58,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:59:58,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874900102] [2019-12-07 10:59:58,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:59:58,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:59:58,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:59:58,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:59:58,357 INFO L87 Difference]: Start difference. First operand 33838 states. Second operand 3 states. [2019-12-07 10:59:58,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:59:58,686 INFO L93 Difference]: Finished difference Result 33638 states and 143712 transitions. [2019-12-07 10:59:58,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:59:58,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 10:59:58,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:59:58,913 INFO L225 Difference]: With dead ends: 33638 [2019-12-07 10:59:58,913 INFO L226 Difference]: Without dead ends: 32966 [2019-12-07 10:59:58,914 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 10:59:59,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32966 states. [2019-12-07 10:59:59,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32966 to 32966. [2019-12-07 10:59:59,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32966 states. [2019-12-07 10:59:59,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32966 states to 32966 states and 140968 transitions. [2019-12-07 10:59:59,879 INFO L78 Accepts]: Start accepts. Automaton has 32966 states and 140968 transitions. Word has length 9 [2019-12-07 10:59:59,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:59:59,881 INFO L462 AbstractCegarLoop]: Abstraction has 32966 states and 140968 transitions. [2019-12-07 10:59:59,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:59:59,881 INFO L276 IsEmpty]: Start isEmpty. Operand 32966 states and 140968 transitions. [2019-12-07 10:59:59,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 10:59:59,886 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:59:59,886 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:59:59,887 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:59:59,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:59:59,887 INFO L82 PathProgramCache]: Analyzing trace with hash -666575947, now seen corresponding path program 1 times [2019-12-07 10:59:59,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:59:59,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703413812] [2019-12-07 10:59:59,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:59:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:59:59,956 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 10:59:59,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703413812] [2019-12-07 10:59:59,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:59:59,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:59:59,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415512386] [2019-12-07 10:59:59,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:59:59,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:59:59,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:59:59,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:59:59,958 INFO L87 Difference]: Start difference. First operand 32966 states and 140968 transitions. Second operand 4 states. [2019-12-07 11:00:00,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:00,409 INFO L93 Difference]: Finished difference Result 44494 states and 185824 transitions. [2019-12-07 11:00:00,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:00:00,410 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 11:00:00,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:00,616 INFO L225 Difference]: With dead ends: 44494 [2019-12-07 11:00:00,616 INFO L226 Difference]: Without dead ends: 44494 [2019-12-07 11:00:00,617 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 11:00:00,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44494 states. [2019-12-07 11:00:01,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44494 to 43986. [2019-12-07 11:00:01,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43986 states. [2019-12-07 11:00:01,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43986 states to 43986 states and 183912 transitions. [2019-12-07 11:00:01,615 INFO L78 Accepts]: Start accepts. Automaton has 43986 states and 183912 transitions. Word has length 15 [2019-12-07 11:00:01,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:01,615 INFO L462 AbstractCegarLoop]: Abstraction has 43986 states and 183912 transitions. [2019-12-07 11:00:01,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:00:01,616 INFO L276 IsEmpty]: Start isEmpty. Operand 43986 states and 183912 transitions. [2019-12-07 11:00:01,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 11:00:01,619 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:01,619 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:00:01,619 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:01,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:01,620 INFO L82 PathProgramCache]: Analyzing trace with hash 703479247, now seen corresponding path program 1 times [2019-12-07 11:00:01,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:01,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930477473] [2019-12-07 11:00:01,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:01,676 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 11:00:01,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930477473] [2019-12-07 11:00:01,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:00:01,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:00:01,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402164522] [2019-12-07 11:00:01,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:00:01,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:01,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:00:01,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:00:01,678 INFO L87 Difference]: Start difference. First operand 43986 states and 183912 transitions. Second operand 4 states. [2019-12-07 11:00:02,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:02,075 INFO L93 Difference]: Finished difference Result 62082 states and 254960 transitions. [2019-12-07 11:00:02,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:00:02,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 11:00:02,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:02,206 INFO L225 Difference]: With dead ends: 62082 [2019-12-07 11:00:02,207 INFO L226 Difference]: Without dead ends: 62054 [2019-12-07 11:00:02,207 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 11:00:02,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62054 states. [2019-12-07 11:00:03,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62054 to 51774. [2019-12-07 11:00:03,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51774 states. [2019-12-07 11:00:03,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51774 states to 51774 states and 215576 transitions. [2019-12-07 11:00:03,514 INFO L78 Accepts]: Start accepts. Automaton has 51774 states and 215576 transitions. Word has length 15 [2019-12-07 11:00:03,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:03,514 INFO L462 AbstractCegarLoop]: Abstraction has 51774 states and 215576 transitions. [2019-12-07 11:00:03,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:00:03,514 INFO L276 IsEmpty]: Start isEmpty. Operand 51774 states and 215576 transitions. [2019-12-07 11:00:03,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 11:00:03,525 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:03,526 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 11:00:03,526 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:03,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:03,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1831569488, now seen corresponding path program 1 times [2019-12-07 11:00:03,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:03,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432759749] [2019-12-07 11:00:03,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:03,595 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 11:00:03,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432759749] [2019-12-07 11:00:03,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:00:03,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:00:03,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190981642] [2019-12-07 11:00:03,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:00:03,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:03,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:00:03,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:00:03,596 INFO L87 Difference]: Start difference. First operand 51774 states and 215576 transitions. Second operand 5 states. [2019-12-07 11:00:04,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:04,268 INFO L93 Difference]: Finished difference Result 68854 states and 281988 transitions. [2019-12-07 11:00:04,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:00:04,268 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-07 11:00:04,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:04,415 INFO L225 Difference]: With dead ends: 68854 [2019-12-07 11:00:04,415 INFO L226 Difference]: Without dead ends: 68826 [2019-12-07 11:00:04,416 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:00:04,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68826 states. [2019-12-07 11:00:05,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68826 to 51450. [2019-12-07 11:00:05,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51450 states. [2019-12-07 11:00:06,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51450 states to 51450 states and 213896 transitions. [2019-12-07 11:00:06,827 INFO L78 Accepts]: Start accepts. Automaton has 51450 states and 213896 transitions. Word has length 21 [2019-12-07 11:00:06,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:06,827 INFO L462 AbstractCegarLoop]: Abstraction has 51450 states and 213896 transitions. [2019-12-07 11:00:06,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:00:06,828 INFO L276 IsEmpty]: Start isEmpty. Operand 51450 states and 213896 transitions. [2019-12-07 11:00:06,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 11:00:06,858 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:06,858 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:00:06,858 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:06,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:06,858 INFO L82 PathProgramCache]: Analyzing trace with hash 2027885083, now seen corresponding path program 1 times [2019-12-07 11:00:06,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:06,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924040033] [2019-12-07 11:00:06,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:06,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:06,894 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 11:00:06,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924040033] [2019-12-07 11:00:06,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:00:06,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:00:06,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814575907] [2019-12-07 11:00:06,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:00:06,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:06,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:00:06,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:00:06,895 INFO L87 Difference]: Start difference. First operand 51450 states and 213896 transitions. Second operand 3 states. [2019-12-07 11:00:07,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:07,174 INFO L93 Difference]: Finished difference Result 64130 states and 263832 transitions. [2019-12-07 11:00:07,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:00:07,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-07 11:00:07,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:07,318 INFO L225 Difference]: With dead ends: 64130 [2019-12-07 11:00:07,318 INFO L226 Difference]: Without dead ends: 64130 [2019-12-07 11:00:07,318 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 11:00:07,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64130 states. [2019-12-07 11:00:08,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64130 to 56646. [2019-12-07 11:00:08,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56646 states. [2019-12-07 11:00:08,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56646 states to 56646 states and 234808 transitions. [2019-12-07 11:00:08,583 INFO L78 Accepts]: Start accepts. Automaton has 56646 states and 234808 transitions. Word has length 29 [2019-12-07 11:00:08,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:08,583 INFO L462 AbstractCegarLoop]: Abstraction has 56646 states and 234808 transitions. [2019-12-07 11:00:08,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:00:08,583 INFO L276 IsEmpty]: Start isEmpty. Operand 56646 states and 234808 transitions. [2019-12-07 11:00:08,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 11:00:08,610 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:08,610 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] [2019-12-07 11:00:08,610 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:08,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:08,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1811393886, now seen corresponding path program 1 times [2019-12-07 11:00:08,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:08,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585495795] [2019-12-07 11:00:08,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:08,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:08,659 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 11:00:08,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585495795] [2019-12-07 11:00:08,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:00:08,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:00:08,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130009177] [2019-12-07 11:00:08,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:00:08,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:08,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:00:08,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:00:08,661 INFO L87 Difference]: Start difference. First operand 56646 states and 234808 transitions. Second operand 4 states. [2019-12-07 11:00:08,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:08,825 INFO L93 Difference]: Finished difference Result 45608 states and 173894 transitions. [2019-12-07 11:00:08,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:00:08,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-12-07 11:00:08,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:08,909 INFO L225 Difference]: With dead ends: 45608 [2019-12-07 11:00:08,909 INFO L226 Difference]: Without dead ends: 44500 [2019-12-07 11:00:08,909 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 11:00:09,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44500 states. [2019-12-07 11:00:09,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44500 to 44500. [2019-12-07 11:00:09,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44500 states. [2019-12-07 11:00:09,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44500 states to 44500 states and 170418 transitions. [2019-12-07 11:00:09,696 INFO L78 Accepts]: Start accepts. Automaton has 44500 states and 170418 transitions. Word has length 29 [2019-12-07 11:00:09,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:09,696 INFO L462 AbstractCegarLoop]: Abstraction has 44500 states and 170418 transitions. [2019-12-07 11:00:09,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:00:09,696 INFO L276 IsEmpty]: Start isEmpty. Operand 44500 states and 170418 transitions. [2019-12-07 11:00:09,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 11:00:09,717 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:09,717 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] [2019-12-07 11:00:09,718 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:09,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:09,718 INFO L82 PathProgramCache]: Analyzing trace with hash 125630464, now seen corresponding path program 1 times [2019-12-07 11:00:09,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:09,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38306957] [2019-12-07 11:00:09,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:09,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:09,797 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 11:00:09,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38306957] [2019-12-07 11:00:09,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:00:09,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:00:09,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48433767] [2019-12-07 11:00:09,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:00:09,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:09,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:00:09,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:00:09,798 INFO L87 Difference]: Start difference. First operand 44500 states and 170418 transitions. Second operand 6 states. [2019-12-07 11:00:10,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:10,268 INFO L93 Difference]: Finished difference Result 63217 states and 237355 transitions. [2019-12-07 11:00:10,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:00:10,269 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-12-07 11:00:10,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:10,406 INFO L225 Difference]: With dead ends: 63217 [2019-12-07 11:00:10,406 INFO L226 Difference]: Without dead ends: 63169 [2019-12-07 11:00:10,406 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:00:10,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63169 states. [2019-12-07 11:00:11,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63169 to 51199. [2019-12-07 11:00:11,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51199 states. [2019-12-07 11:00:11,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51199 states to 51199 states and 194909 transitions. [2019-12-07 11:00:11,496 INFO L78 Accepts]: Start accepts. Automaton has 51199 states and 194909 transitions. Word has length 30 [2019-12-07 11:00:11,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:11,496 INFO L462 AbstractCegarLoop]: Abstraction has 51199 states and 194909 transitions. [2019-12-07 11:00:11,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:00:11,496 INFO L276 IsEmpty]: Start isEmpty. Operand 51199 states and 194909 transitions. [2019-12-07 11:00:11,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 11:00:11,539 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:11,539 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] [2019-12-07 11:00:11,539 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:11,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:11,539 INFO L82 PathProgramCache]: Analyzing trace with hash -334372945, now seen corresponding path program 1 times [2019-12-07 11:00:11,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:11,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225815317] [2019-12-07 11:00:11,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:11,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:11,584 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 11:00:11,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225815317] [2019-12-07 11:00:11,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:00:11,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:00:11,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499343551] [2019-12-07 11:00:11,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:00:11,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:11,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:00:11,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:00:11,586 INFO L87 Difference]: Start difference. First operand 51199 states and 194909 transitions. Second operand 3 states. [2019-12-07 11:00:11,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:11,825 INFO L93 Difference]: Finished difference Result 51199 states and 194343 transitions. [2019-12-07 11:00:11,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:00:11,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-12-07 11:00:11,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:11,928 INFO L225 Difference]: With dead ends: 51199 [2019-12-07 11:00:11,928 INFO L226 Difference]: Without dead ends: 51199 [2019-12-07 11:00:11,928 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 11:00:12,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51199 states. [2019-12-07 11:00:12,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51199 to 51199. [2019-12-07 11:00:12,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51199 states. [2019-12-07 11:00:13,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51199 states to 51199 states and 194343 transitions. [2019-12-07 11:00:13,012 INFO L78 Accepts]: Start accepts. Automaton has 51199 states and 194343 transitions. Word has length 36 [2019-12-07 11:00:13,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:13,012 INFO L462 AbstractCegarLoop]: Abstraction has 51199 states and 194343 transitions. [2019-12-07 11:00:13,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:00:13,012 INFO L276 IsEmpty]: Start isEmpty. Operand 51199 states and 194343 transitions. [2019-12-07 11:00:13,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 11:00:13,045 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:13,045 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] [2019-12-07 11:00:13,045 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:13,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:13,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1845178551, now seen corresponding path program 1 times [2019-12-07 11:00:13,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:13,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080335057] [2019-12-07 11:00:13,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:13,090 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 11:00:13,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080335057] [2019-12-07 11:00:13,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:00:13,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:00:13,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186360518] [2019-12-07 11:00:13,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:00:13,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:13,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:00:13,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:00:13,092 INFO L87 Difference]: Start difference. First operand 51199 states and 194343 transitions. Second operand 5 states. [2019-12-07 11:00:13,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:13,193 INFO L93 Difference]: Finished difference Result 21674 states and 68110 transitions. [2019-12-07 11:00:13,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:00:13,194 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-12-07 11:00:13,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:13,217 INFO L225 Difference]: With dead ends: 21674 [2019-12-07 11:00:13,217 INFO L226 Difference]: Without dead ends: 20798 [2019-12-07 11:00:13,217 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 11:00:13,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20798 states. [2019-12-07 11:00:13,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20798 to 20798. [2019-12-07 11:00:13,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20798 states. [2019-12-07 11:00:13,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20798 states to 20798 states and 65312 transitions. [2019-12-07 11:00:13,492 INFO L78 Accepts]: Start accepts. Automaton has 20798 states and 65312 transitions. Word has length 36 [2019-12-07 11:00:13,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:13,492 INFO L462 AbstractCegarLoop]: Abstraction has 20798 states and 65312 transitions. [2019-12-07 11:00:13,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:00:13,492 INFO L276 IsEmpty]: Start isEmpty. Operand 20798 states and 65312 transitions. [2019-12-07 11:00:13,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 11:00:13,501 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:13,502 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] [2019-12-07 11:00:13,502 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:13,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:13,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1740346428, now seen corresponding path program 1 times [2019-12-07 11:00:13,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:13,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650695871] [2019-12-07 11:00:13,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:13,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:13,559 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 11:00:13,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650695871] [2019-12-07 11:00:13,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:00:13,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:00:13,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400304400] [2019-12-07 11:00:13,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:00:13,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:13,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:00:13,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:00:13,561 INFO L87 Difference]: Start difference. First operand 20798 states and 65312 transitions. Second operand 6 states. [2019-12-07 11:00:13,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:13,616 INFO L93 Difference]: Finished difference Result 3436 states and 8734 transitions. [2019-12-07 11:00:13,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:00:13,617 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-12-07 11:00:13,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:13,619 INFO L225 Difference]: With dead ends: 3436 [2019-12-07 11:00:13,620 INFO L226 Difference]: Without dead ends: 3067 [2019-12-07 11:00:13,620 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 11:00:13,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3067 states. [2019-12-07 11:00:13,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3067 to 3067. [2019-12-07 11:00:13,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3067 states. [2019-12-07 11:00:13,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3067 states to 3067 states and 7696 transitions. [2019-12-07 11:00:13,650 INFO L78 Accepts]: Start accepts. Automaton has 3067 states and 7696 transitions. Word has length 37 [2019-12-07 11:00:13,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:13,650 INFO L462 AbstractCegarLoop]: Abstraction has 3067 states and 7696 transitions. [2019-12-07 11:00:13,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:00:13,650 INFO L276 IsEmpty]: Start isEmpty. Operand 3067 states and 7696 transitions. [2019-12-07 11:00:13,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 11:00:13,652 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:13,652 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] [2019-12-07 11:00:13,652 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:13,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:13,653 INFO L82 PathProgramCache]: Analyzing trace with hash 239744664, now seen corresponding path program 1 times [2019-12-07 11:00:13,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:13,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518206583] [2019-12-07 11:00:13,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:13,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:13,709 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 11:00:13,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518206583] [2019-12-07 11:00:13,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:00:13,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:00:13,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452878151] [2019-12-07 11:00:13,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:00:13,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:13,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:00:13,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:00:13,710 INFO L87 Difference]: Start difference. First operand 3067 states and 7696 transitions. Second operand 7 states. [2019-12-07 11:00:13,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:13,778 INFO L93 Difference]: Finished difference Result 1341 states and 3749 transitions. [2019-12-07 11:00:13,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:00:13,778 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-12-07 11:00:13,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:13,780 INFO L225 Difference]: With dead ends: 1341 [2019-12-07 11:00:13,780 INFO L226 Difference]: Without dead ends: 1292 [2019-12-07 11:00:13,780 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 11:00:13,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2019-12-07 11:00:13,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1180. [2019-12-07 11:00:13,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1180 states. [2019-12-07 11:00:13,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 3333 transitions. [2019-12-07 11:00:13,793 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 3333 transitions. Word has length 43 [2019-12-07 11:00:13,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:13,793 INFO L462 AbstractCegarLoop]: Abstraction has 1180 states and 3333 transitions. [2019-12-07 11:00:13,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:00:13,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 3333 transitions. [2019-12-07 11:00:13,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 11:00:13,794 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:13,794 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:00:13,794 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:13,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:13,794 INFO L82 PathProgramCache]: Analyzing trace with hash -734644091, now seen corresponding path program 1 times [2019-12-07 11:00:13,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:13,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548376515] [2019-12-07 11:00:13,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:13,844 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 11:00:13,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548376515] [2019-12-07 11:00:13,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:00:13,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:00:13,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523964717] [2019-12-07 11:00:13,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:00:13,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:13,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:00:13,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:00:13,845 INFO L87 Difference]: Start difference. First operand 1180 states and 3333 transitions. Second operand 3 states. [2019-12-07 11:00:13,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:13,857 INFO L93 Difference]: Finished difference Result 1132 states and 3141 transitions. [2019-12-07 11:00:13,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:00:13,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-07 11:00:13,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:13,859 INFO L225 Difference]: With dead ends: 1132 [2019-12-07 11:00:13,859 INFO L226 Difference]: Without dead ends: 1132 [2019-12-07 11:00:13,859 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 11:00:13,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2019-12-07 11:00:13,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1132. [2019-12-07 11:00:13,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1132 states. [2019-12-07 11:00:13,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 3141 transitions. [2019-12-07 11:00:13,869 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 3141 transitions. Word has length 59 [2019-12-07 11:00:13,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:13,870 INFO L462 AbstractCegarLoop]: Abstraction has 1132 states and 3141 transitions. [2019-12-07 11:00:13,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:00:13,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 3141 transitions. [2019-12-07 11:00:13,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 11:00:13,871 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:13,871 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:00:13,871 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:13,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:13,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1028151268, now seen corresponding path program 1 times [2019-12-07 11:00:13,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:13,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738496299] [2019-12-07 11:00:13,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:13,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:14,046 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 11:00:14,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738496299] [2019-12-07 11:00:14,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:00:14,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 11:00:14,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348497393] [2019-12-07 11:00:14,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 11:00:14,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:14,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 11:00:14,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:00:14,047 INFO L87 Difference]: Start difference. First operand 1132 states and 3141 transitions. Second operand 12 states. [2019-12-07 11:00:14,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:14,486 INFO L93 Difference]: Finished difference Result 2212 states and 5581 transitions. [2019-12-07 11:00:14,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 11:00:14,486 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-12-07 11:00:14,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:14,488 INFO L225 Difference]: With dead ends: 2212 [2019-12-07 11:00:14,488 INFO L226 Difference]: Without dead ends: 1150 [2019-12-07 11:00:14,488 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2019-12-07 11:00:14,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2019-12-07 11:00:14,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1006. [2019-12-07 11:00:14,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1006 states. [2019-12-07 11:00:14,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 2717 transitions. [2019-12-07 11:00:14,499 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 2717 transitions. Word has length 60 [2019-12-07 11:00:14,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:14,499 INFO L462 AbstractCegarLoop]: Abstraction has 1006 states and 2717 transitions. [2019-12-07 11:00:14,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 11:00:14,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 2717 transitions. [2019-12-07 11:00:14,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 11:00:14,500 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:14,500 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:00:14,500 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:14,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:14,500 INFO L82 PathProgramCache]: Analyzing trace with hash -311204278, now seen corresponding path program 2 times [2019-12-07 11:00:14,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:14,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320370915] [2019-12-07 11:00:14,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:14,582 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 11:00:14,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320370915] [2019-12-07 11:00:14,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:00:14,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:00:14,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227031826] [2019-12-07 11:00:14,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:00:14,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:14,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:00:14,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:00:14,583 INFO L87 Difference]: Start difference. First operand 1006 states and 2717 transitions. Second operand 6 states. [2019-12-07 11:00:14,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:14,628 INFO L93 Difference]: Finished difference Result 1511 states and 3814 transitions. [2019-12-07 11:00:14,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:00:14,628 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-07 11:00:14,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:14,629 INFO L225 Difference]: With dead ends: 1511 [2019-12-07 11:00:14,629 INFO L226 Difference]: Without dead ends: 566 [2019-12-07 11:00:14,629 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:00:14,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2019-12-07 11:00:14,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2019-12-07 11:00:14,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-12-07 11:00:14,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 1234 transitions. [2019-12-07 11:00:14,634 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 1234 transitions. Word has length 60 [2019-12-07 11:00:14,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:14,634 INFO L462 AbstractCegarLoop]: Abstraction has 566 states and 1234 transitions. [2019-12-07 11:00:14,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:00:14,634 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 1234 transitions. [2019-12-07 11:00:14,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 11:00:14,635 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:14,635 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:00:14,635 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:14,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:14,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1384719400, now seen corresponding path program 3 times [2019-12-07 11:00:14,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:14,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988207290] [2019-12-07 11:00:14,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:14,821 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 11:00:14,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988207290] [2019-12-07 11:00:14,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:00:14,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 11:00:14,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103806619] [2019-12-07 11:00:14,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 11:00:14,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:14,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 11:00:14,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:00:14,822 INFO L87 Difference]: Start difference. First operand 566 states and 1234 transitions. Second operand 12 states. [2019-12-07 11:00:15,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:15,035 INFO L93 Difference]: Finished difference Result 955 states and 2119 transitions. [2019-12-07 11:00:15,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 11:00:15,036 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-12-07 11:00:15,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:15,036 INFO L225 Difference]: With dead ends: 955 [2019-12-07 11:00:15,036 INFO L226 Difference]: Without dead ends: 921 [2019-12-07 11:00:15,037 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2019-12-07 11:00:15,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2019-12-07 11:00:15,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 777. [2019-12-07 11:00:15,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2019-12-07 11:00:15,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1706 transitions. [2019-12-07 11:00:15,043 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1706 transitions. Word has length 60 [2019-12-07 11:00:15,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:15,043 INFO L462 AbstractCegarLoop]: Abstraction has 777 states and 1706 transitions. [2019-12-07 11:00:15,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 11:00:15,043 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1706 transitions. [2019-12-07 11:00:15,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 11:00:15,044 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:15,044 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:00:15,044 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:15,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:15,044 INFO L82 PathProgramCache]: Analyzing trace with hash 483952232, now seen corresponding path program 4 times [2019-12-07 11:00:15,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:15,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356475302] [2019-12-07 11:00:15,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:15,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:00:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:00:15,154 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:00:15,154 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:00:15,157 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= v_~z$r_buff1_thd1~0_136 0) (= 0 v_~__unbuffered_p3_EBX~0_151) (= 0 v_~__unbuffered_p0_EAX~0_45) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_7| 0) (= v_~__unbuffered_p3_EAX~0_151 0) (= v_~__unbuffered_cnt~0_172 0) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1141~0.base_21| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1141~0.base_21|) |v_ULTIMATE.start_main_~#t1141~0.offset_16| 0)) |v_#memory_int_27|) (= v_~main$tmp_guard0~0_29 0) (= v_~z$r_buff1_thd0~0_320 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t1141~0.base_21| 1)) (= v_~y~0_38 0) (= v_~z$w_buff1~0_115 0) (= 0 v_~weak$$choice0~0_17) (= v_~z$mem_tmp~0_24 0) (= v_~z$read_delayed~0_5 0) (= v_~z$r_buff0_thd2~0_135 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t1141~0.base_21| 4)) (= 0 v_~z$r_buff1_thd3~0_221) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff1_thd2~0_136 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1141~0.base_21|)) (= v_~z$w_buff1_used~0_340 0) (= v_~main$tmp_guard1~0_28 0) (= 0 v_~z$flush_delayed~0_43) (= v_~z$w_buff0_used~0_571 0) (= v_~b~0_164 0) (= 0 v_~z$r_buff0_thd3~0_200) (< 0 |v_#StackHeapBarrier_20|) (= |v_ULTIMATE.start_main_~#t1141~0.offset_16| 0) (= 0 |v_#NULL.base_7|) (= v_~z~0_188 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1141~0.base_21|) (= v_~weak$$choice2~0_123 0) (= v_~a~0_136 0) (= v_~z$r_buff0_thd0~0_374 0) (= v_~z$r_buff0_thd1~0_137 0) (= 0 v_~__unbuffered_p1_EAX~0_36) (= 0 v_~z$r_buff1_thd4~0_193) (= v_~z$w_buff0~0_113 0) (= v_~x~0_47 0) (= 0 v_~z$r_buff0_thd4~0_323))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_28|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_80|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_136, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_40|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_35|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t1144~0.offset=|v_ULTIMATE.start_main_~#t1144~0.offset_16|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_27|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_16|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_32|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_49|, ~a~0=v_~a~0_136, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_374, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_45, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ULTIMATE.start_main_~#t1142~0.base=|v_ULTIMATE.start_main_~#t1142~0.base_22|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_323, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_151, #length=|v_#length_27|, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_73|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_105|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_340, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_192|, ~z$flush_delayed~0=v_~z$flush_delayed~0_43, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_18|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_28|, ~weak$$choice0~0=v_~weak$$choice0~0_17, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_44|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_136, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, ~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_200, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_172, ~x~0=v_~x~0_47, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_193, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_27|, ULTIMATE.start_main_~#t1144~0.base=|v_ULTIMATE.start_main_~#t1144~0.base_22|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~z$w_buff1~0=v_~z$w_buff1~0_115, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_42|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t1141~0.base=|v_ULTIMATE.start_main_~#t1141~0.base_21|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_22|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_32|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_35|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_33|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_320, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_26|, ULTIMATE.start_main_~#t1143~0.offset=|v_ULTIMATE.start_main_~#t1143~0.offset_16|, ~y~0=v_~y~0_38, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_135, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_571, ~z$w_buff0~0=v_~z$w_buff0~0_113, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_30|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_26|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_221, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_120|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_30|, ULTIMATE.start_main_~#t1142~0.offset=|v_ULTIMATE.start_main_~#t1142~0.offset_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_151, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_27|, ULTIMATE.start_main_~#t1141~0.offset=|v_ULTIMATE.start_main_~#t1141~0.offset_16|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_24|, ~b~0=v_~b~0_164, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, ULTIMATE.start_main_~#t1143~0.base=|v_ULTIMATE.start_main_~#t1143~0.base_21|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_15|, ~z~0=v_~z~0_188, ~weak$$choice2~0=v_~weak$$choice2~0_123, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_137} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_~#t1144~0.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1142~0.base, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t1144~0.base, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1141~0.base, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ULTIMATE.start_main_~#t1143~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t1142~0.offset, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_~#t1141~0.offset, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1143~0.base, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 11:00:15,157 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L835-1-->L837: Formula: (and (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1142~0.base_12|) (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1142~0.base_12|)) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1142~0.base_12| 1)) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1142~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1142~0.base_12|) |v_ULTIMATE.start_main_~#t1142~0.offset_10| 1)) |v_#memory_int_21|) (not (= 0 |v_ULTIMATE.start_main_~#t1142~0.base_12|)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1142~0.base_12| 4) |v_#length_21|) (= |v_ULTIMATE.start_main_~#t1142~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t1142~0.base=|v_ULTIMATE.start_main_~#t1142~0.base_12|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1142~0.offset=|v_ULTIMATE.start_main_~#t1142~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1142~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1142~0.offset] because there is no mapped edge [2019-12-07 11:00:15,158 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L837-1-->L839: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1143~0.base_8| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1143~0.base_8| 4)) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1143~0.base_8|) 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1143~0.base_8|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1143~0.base_8| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1143~0.base_8|) |v_ULTIMATE.start_main_~#t1143~0.offset_8| 2)) |v_#memory_int_17|) (= 0 |v_ULTIMATE.start_main_~#t1143~0.offset_8|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1143~0.base_8| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1143~0.base=|v_ULTIMATE.start_main_~#t1143~0.base_8|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_3|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1143~0.offset=|v_ULTIMATE.start_main_~#t1143~0.offset_8|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t1143~0.base, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1143~0.offset] because there is no mapped edge [2019-12-07 11:00:15,158 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L839-1-->L841: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1144~0.base_12|)) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1144~0.base_12| 1)) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1144~0.base_12| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1144~0.base_12|) |v_ULTIMATE.start_main_~#t1144~0.offset_10| 3)) |v_#memory_int_23|) (= |v_ULTIMATE.start_main_~#t1144~0.offset_10| 0) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1144~0.base_12|) 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1144~0.base_12|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1144~0.base_12| 4) |v_#length_23|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1144~0.base=|v_ULTIMATE.start_main_~#t1144~0.base_12|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t1144~0.offset=|v_ULTIMATE.start_main_~#t1144~0.offset_10|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1144~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1144~0.offset, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-07 11:00:15,159 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L4-->L812: Formula: (and (not (= 0 P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-370771109)) (= ~z$r_buff1_thd1~0_Out-370771109 ~z$r_buff0_thd1~0_In-370771109) (= ~z$r_buff0_thd0~0_In-370771109 ~z$r_buff1_thd0~0_Out-370771109) (= ~z$r_buff1_thd2~0_Out-370771109 ~z$r_buff0_thd2~0_In-370771109) (= ~z$r_buff0_thd4~0_Out-370771109 1) (= ~z$r_buff0_thd4~0_In-370771109 ~z$r_buff1_thd4~0_Out-370771109) (= ~a~0_Out-370771109 ~__unbuffered_p3_EAX~0_Out-370771109) (= ~__unbuffered_p3_EBX~0_Out-370771109 ~b~0_In-370771109) (= ~a~0_Out-370771109 1) (= ~z$r_buff1_thd3~0_Out-370771109 ~z$r_buff0_thd3~0_In-370771109)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-370771109, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-370771109, ~b~0=~b~0_In-370771109, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-370771109, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-370771109, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-370771109, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-370771109} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-370771109, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-370771109, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-370771109, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-370771109, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out-370771109, ~a~0=~a~0_Out-370771109, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-370771109, ~b~0=~b~0_In-370771109, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-370771109, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-370771109, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out-370771109, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-370771109, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-370771109, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-370771109, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-370771109} 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 11:00:15,159 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_18 |v_P0Thread1of1ForFork0_#in~arg.base_20|) (= v_P0Thread1of1ForFork0_~arg.offset_18 |v_P0Thread1of1ForFork0_#in~arg.offset_20|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~x~0_33 v_~__unbuffered_p0_EAX~0_26) (= v_~b~0_72 1) (= v_~__unbuffered_cnt~0_115 (+ v_~__unbuffered_cnt~0_116 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_20|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116, ~x~0=v_~x~0_33} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_20|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~b~0=v_~b~0_72, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_20|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_18, ~x~0=v_~x~0_33, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_18} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 11:00:15,160 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] P1ENTRY-->P1EXIT: Formula: (and (= v_P1Thread1of1ForFork1_~arg.offset_8 |v_P1Thread1of1ForFork1_#in~arg.offset_10|) (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_P1Thread1of1ForFork1_~arg.base_8 |v_P1Thread1of1ForFork1_#in~arg.base_10|) (= v_~y~0_25 v_~__unbuffered_p1_EAX~0_14) (= v_~x~0_18 1) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_10|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~y~0=v_~y~0_25} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_8, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_8, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_10|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, ~y~0=v_~y~0_25, ~x~0=v_~x~0_18, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 11:00:15,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In2142808242 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In2142808242 256)))) (or (and (not .cse0) (= |P3Thread1of1ForFork3_#t~ite11_Out2142808242| 0) (not .cse1)) (and (= |P3Thread1of1ForFork3_#t~ite11_Out2142808242| ~z$w_buff0_used~0_In2142808242) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2142808242, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2142808242} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2142808242, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2142808242, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out2142808242|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-07 11:00:15,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L776-2-->L776-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In671253950 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In671253950 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite3_Out671253950| ~z~0_In671253950)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite3_Out671253950| ~z$w_buff1~0_In671253950)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In671253950, ~z$w_buff1_used~0=~z$w_buff1_used~0_In671253950, ~z$w_buff1~0=~z$w_buff1~0_In671253950, ~z~0=~z~0_In671253950} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out671253950|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In671253950, ~z$w_buff1_used~0=~z$w_buff1_used~0_In671253950, ~z$w_buff1~0=~z$w_buff1~0_In671253950, ~z~0=~z~0_In671253950} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-07 11:00:15,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L776-4-->L777: Formula: (= v_~z~0_18 |v_P2Thread1of1ForFork2_#t~ite3_6|) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_6|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_7|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_5|, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-07 11:00:15,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-434897124 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-434897124 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite5_Out-434897124|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-434897124 |P2Thread1of1ForFork2_#t~ite5_Out-434897124|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-434897124, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-434897124} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-434897124|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-434897124, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-434897124} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-07 11:00:15,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In2049038153 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In2049038153 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In2049038153 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd3~0_In2049038153 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite6_Out2049038153|)) (and (= ~z$w_buff1_used~0_In2049038153 |P2Thread1of1ForFork2_#t~ite6_Out2049038153|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2049038153, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2049038153, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2049038153, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2049038153} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out2049038153|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2049038153, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2049038153, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2049038153, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2049038153} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-07 11:00:15,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1175998438 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1175998438 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite7_Out1175998438| ~z$r_buff0_thd3~0_In1175998438) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite7_Out1175998438| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1175998438, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1175998438} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1175998438, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1175998438, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out1175998438|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-07 11:00:15,163 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L780-->L780-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In1360458393 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd3~0_In1360458393 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1360458393 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1360458393 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In1360458393 |P2Thread1of1ForFork2_#t~ite8_Out1360458393|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork2_#t~ite8_Out1360458393| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1360458393, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1360458393, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1360458393, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1360458393} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1360458393, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1360458393, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1360458393, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1360458393, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out1360458393|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-07 11:00:15,163 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L780-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite8_42| v_~z$r_buff1_thd3~0_114) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_83 1) v_~__unbuffered_cnt~0_82)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_42|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_114, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_41|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-07 11:00:15,163 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L814-->L814-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd4~0_In1652636296 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1652636296 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In1652636296 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1652636296 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1652636296 |P3Thread1of1ForFork3_#t~ite12_Out1652636296|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork3_#t~ite12_Out1652636296|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1652636296, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1652636296, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1652636296, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1652636296} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1652636296, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1652636296, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1652636296, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1652636296, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out1652636296|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-07 11:00:15,163 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L815-->L816: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1819525218 256) 0)) (.cse0 (= ~z$r_buff0_thd4~0_Out-1819525218 ~z$r_buff0_thd4~0_In-1819525218)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In-1819525218 256) 0))) (or (and .cse0 .cse1) (and (not .cse2) (= ~z$r_buff0_thd4~0_Out-1819525218 0) (not .cse1)) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1819525218, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1819525218} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1819525218, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1819525218, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out-1819525218|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-07 11:00:15,163 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L816-->L816-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1291782453 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1291782453 256))) (.cse2 (= (mod ~z$r_buff1_thd4~0_In-1291782453 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1291782453 256)))) (or (and (= |P3Thread1of1ForFork3_#t~ite14_Out-1291782453| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd4~0_In-1291782453 |P3Thread1of1ForFork3_#t~ite14_Out-1291782453|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1291782453, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1291782453, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1291782453, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1291782453} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1291782453, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1291782453, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out-1291782453|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1291782453, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1291782453} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-07 11:00:15,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L816-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#t~ite14_46| v_~z$r_buff1_thd4~0_102) (= v_~__unbuffered_cnt~0_106 (+ v_~__unbuffered_cnt~0_107 1)) (= 0 |v_P3Thread1of1ForFork3_#res.base_3|) (= 0 |v_P3Thread1of1ForFork3_#res.offset_3|)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_46|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_102, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_45|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_3|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-07 11:00:15,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L845-->L847-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_79 256)) (= (mod v_~z$r_buff0_thd0~0_53 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_53, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_53, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 11:00:15,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L847-2-->L847-5: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In1006539149 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite20_Out1006539149| |ULTIMATE.start_main_#t~ite19_Out1006539149|)) (.cse1 (= (mod ~z$w_buff1_used~0_In1006539149 256) 0))) (or (and (= ~z~0_In1006539149 |ULTIMATE.start_main_#t~ite19_Out1006539149|) (or .cse0 .cse1) .cse2) (and (not .cse0) (= ~z$w_buff1~0_In1006539149 |ULTIMATE.start_main_#t~ite19_Out1006539149|) .cse2 (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1006539149, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1006539149, ~z$w_buff1~0=~z$w_buff1~0_In1006539149, ~z~0=~z~0_In1006539149} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1006539149|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1006539149, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1006539149, ~z$w_buff1~0=~z$w_buff1~0_In1006539149, ~z~0=~z~0_In1006539149, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1006539149|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-07 11:00:15,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-815794344 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-815794344 256)))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out-815794344| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-815794344| ~z$w_buff0_used~0_In-815794344)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-815794344, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-815794344} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-815794344, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-815794344, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-815794344|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-07 11:00:15,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L849-->L849-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In544928346 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In544928346 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In544928346 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In544928346 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out544928346| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite22_Out544928346| ~z$w_buff1_used~0_In544928346) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In544928346, ~z$w_buff0_used~0=~z$w_buff0_used~0_In544928346, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In544928346, ~z$w_buff1_used~0=~z$w_buff1_used~0_In544928346} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In544928346, ~z$w_buff0_used~0=~z$w_buff0_used~0_In544928346, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In544928346, ~z$w_buff1_used~0=~z$w_buff1_used~0_In544928346, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out544928346|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-07 11:00:15,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L850-->L850-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1318357289 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1318357289 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite23_Out-1318357289| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In-1318357289 |ULTIMATE.start_main_#t~ite23_Out-1318357289|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1318357289, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1318357289} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1318357289, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1318357289, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1318357289|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-07 11:00:15,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L851-->L851-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In-1694654860 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1694654860 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1694654860 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1694654860 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite24_Out-1694654860| ~z$r_buff1_thd0~0_In-1694654860) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite24_Out-1694654860| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1694654860, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1694654860, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1694654860, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1694654860} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1694654860, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1694654860, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1694654860, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1694654860|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1694654860} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-07 11:00:15,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L861-->L861-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1570440699 256)))) (or (and (= |ULTIMATE.start_main_#t~ite36_Out-1570440699| |ULTIMATE.start_main_#t~ite37_Out-1570440699|) (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1570440699 256) 0))) (or (= (mod ~z$w_buff0_used~0_In-1570440699 256) 0) (and .cse0 (= (mod ~z$w_buff1_used~0_In-1570440699 256) 0)) (and (= (mod ~z$r_buff1_thd0~0_In-1570440699 256) 0) .cse0))) (= |ULTIMATE.start_main_#t~ite36_Out-1570440699| ~z$w_buff0_used~0_In-1570440699) .cse1) (and (= |ULTIMATE.start_main_#t~ite36_In-1570440699| |ULTIMATE.start_main_#t~ite36_Out-1570440699|) (= ~z$w_buff0_used~0_In-1570440699 |ULTIMATE.start_main_#t~ite37_Out-1570440699|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1570440699, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1570440699, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1570440699, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1570440699, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_In-1570440699|, ~weak$$choice2~0=~weak$$choice2~0_In-1570440699} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1570440699, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1570440699, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1570440699, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1570440699, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1570440699|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1570440699|, ~weak$$choice2~0=~weak$$choice2~0_In-1570440699} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 11:00:15,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L862-->L862-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-428985245 256)))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out-428985245| ~z$w_buff1_used~0_In-428985245) (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-428985245 256) 0))) (or (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In-428985245 256))) (= (mod ~z$w_buff0_used~0_In-428985245 256) 0) (and .cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-428985245 256))))) (= |ULTIMATE.start_main_#t~ite40_Out-428985245| |ULTIMATE.start_main_#t~ite39_Out-428985245|) .cse1) (and (= |ULTIMATE.start_main_#t~ite40_Out-428985245| ~z$w_buff1_used~0_In-428985245) (= |ULTIMATE.start_main_#t~ite39_In-428985245| |ULTIMATE.start_main_#t~ite39_Out-428985245|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-428985245, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-428985245, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In-428985245|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-428985245, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-428985245, ~weak$$choice2~0=~weak$$choice2~0_In-428985245} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-428985245, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-428985245|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-428985245|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-428985245, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-428985245, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-428985245, ~weak$$choice2~0=~weak$$choice2~0_In-428985245} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 11:00:15,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L863-->L864: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_24 256))) (= v_~z$r_buff0_thd0~0_79 v_~z$r_buff0_thd0~0_80)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_80, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_79, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_8|, ~weak$$choice2~0=v_~weak$$choice2~0_24, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 11:00:15,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L866-->L4: Formula: (and (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (not (= (mod v_~z$flush_delayed~0_29 256) 0)) (= v_~z$mem_tmp~0_15 v_~z~0_103) (= 0 v_~z$flush_delayed~0_28)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_29} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_15, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_23|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_28, ~z~0=v_~z~0_103, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:00:15,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 11:00:15,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:00:15 BasicIcfg [2019-12-07 11:00:15,228 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:00:15,228 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:00:15,228 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:00:15,228 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:00:15,228 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:59:52" (3/4) ... [2019-12-07 11:00:15,230 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 11:00:15,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= v_~z$r_buff1_thd1~0_136 0) (= 0 v_~__unbuffered_p3_EBX~0_151) (= 0 v_~__unbuffered_p0_EAX~0_45) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_7| 0) (= v_~__unbuffered_p3_EAX~0_151 0) (= v_~__unbuffered_cnt~0_172 0) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1141~0.base_21| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1141~0.base_21|) |v_ULTIMATE.start_main_~#t1141~0.offset_16| 0)) |v_#memory_int_27|) (= v_~main$tmp_guard0~0_29 0) (= v_~z$r_buff1_thd0~0_320 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t1141~0.base_21| 1)) (= v_~y~0_38 0) (= v_~z$w_buff1~0_115 0) (= 0 v_~weak$$choice0~0_17) (= v_~z$mem_tmp~0_24 0) (= v_~z$read_delayed~0_5 0) (= v_~z$r_buff0_thd2~0_135 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t1141~0.base_21| 4)) (= 0 v_~z$r_buff1_thd3~0_221) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff1_thd2~0_136 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1141~0.base_21|)) (= v_~z$w_buff1_used~0_340 0) (= v_~main$tmp_guard1~0_28 0) (= 0 v_~z$flush_delayed~0_43) (= v_~z$w_buff0_used~0_571 0) (= v_~b~0_164 0) (= 0 v_~z$r_buff0_thd3~0_200) (< 0 |v_#StackHeapBarrier_20|) (= |v_ULTIMATE.start_main_~#t1141~0.offset_16| 0) (= 0 |v_#NULL.base_7|) (= v_~z~0_188 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1141~0.base_21|) (= v_~weak$$choice2~0_123 0) (= v_~a~0_136 0) (= v_~z$r_buff0_thd0~0_374 0) (= v_~z$r_buff0_thd1~0_137 0) (= 0 v_~__unbuffered_p1_EAX~0_36) (= 0 v_~z$r_buff1_thd4~0_193) (= v_~z$w_buff0~0_113 0) (= v_~x~0_47 0) (= 0 v_~z$r_buff0_thd4~0_323))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_28|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_80|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_136, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_40|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_35|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t1144~0.offset=|v_ULTIMATE.start_main_~#t1144~0.offset_16|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_27|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_16|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_32|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_49|, ~a~0=v_~a~0_136, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_374, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_45, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ULTIMATE.start_main_~#t1142~0.base=|v_ULTIMATE.start_main_~#t1142~0.base_22|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_323, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_151, #length=|v_#length_27|, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_73|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_105|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_340, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_192|, ~z$flush_delayed~0=v_~z$flush_delayed~0_43, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_18|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_28|, ~weak$$choice0~0=v_~weak$$choice0~0_17, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_44|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_136, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, ~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_200, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_172, ~x~0=v_~x~0_47, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_193, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_27|, ULTIMATE.start_main_~#t1144~0.base=|v_ULTIMATE.start_main_~#t1144~0.base_22|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~z$w_buff1~0=v_~z$w_buff1~0_115, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_42|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t1141~0.base=|v_ULTIMATE.start_main_~#t1141~0.base_21|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_22|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_32|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_35|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_33|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_320, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_26|, ULTIMATE.start_main_~#t1143~0.offset=|v_ULTIMATE.start_main_~#t1143~0.offset_16|, ~y~0=v_~y~0_38, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_135, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_571, ~z$w_buff0~0=v_~z$w_buff0~0_113, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_30|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_26|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_221, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_120|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_30|, ULTIMATE.start_main_~#t1142~0.offset=|v_ULTIMATE.start_main_~#t1142~0.offset_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_151, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_27|, ULTIMATE.start_main_~#t1141~0.offset=|v_ULTIMATE.start_main_~#t1141~0.offset_16|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_24|, ~b~0=v_~b~0_164, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, ULTIMATE.start_main_~#t1143~0.base=|v_ULTIMATE.start_main_~#t1143~0.base_21|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_15|, ~z~0=v_~z~0_188, ~weak$$choice2~0=v_~weak$$choice2~0_123, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_137} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_~#t1144~0.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1142~0.base, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t1144~0.base, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1141~0.base, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ULTIMATE.start_main_~#t1143~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t1142~0.offset, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_~#t1141~0.offset, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1143~0.base, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 11:00:15,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L835-1-->L837: Formula: (and (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1142~0.base_12|) (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1142~0.base_12|)) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1142~0.base_12| 1)) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1142~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1142~0.base_12|) |v_ULTIMATE.start_main_~#t1142~0.offset_10| 1)) |v_#memory_int_21|) (not (= 0 |v_ULTIMATE.start_main_~#t1142~0.base_12|)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1142~0.base_12| 4) |v_#length_21|) (= |v_ULTIMATE.start_main_~#t1142~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t1142~0.base=|v_ULTIMATE.start_main_~#t1142~0.base_12|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1142~0.offset=|v_ULTIMATE.start_main_~#t1142~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1142~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1142~0.offset] because there is no mapped edge [2019-12-07 11:00:15,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L837-1-->L839: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1143~0.base_8| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1143~0.base_8| 4)) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1143~0.base_8|) 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1143~0.base_8|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1143~0.base_8| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1143~0.base_8|) |v_ULTIMATE.start_main_~#t1143~0.offset_8| 2)) |v_#memory_int_17|) (= 0 |v_ULTIMATE.start_main_~#t1143~0.offset_8|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1143~0.base_8| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1143~0.base=|v_ULTIMATE.start_main_~#t1143~0.base_8|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_3|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1143~0.offset=|v_ULTIMATE.start_main_~#t1143~0.offset_8|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t1143~0.base, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1143~0.offset] because there is no mapped edge [2019-12-07 11:00:15,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L839-1-->L841: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1144~0.base_12|)) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1144~0.base_12| 1)) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1144~0.base_12| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1144~0.base_12|) |v_ULTIMATE.start_main_~#t1144~0.offset_10| 3)) |v_#memory_int_23|) (= |v_ULTIMATE.start_main_~#t1144~0.offset_10| 0) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1144~0.base_12|) 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1144~0.base_12|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1144~0.base_12| 4) |v_#length_23|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1144~0.base=|v_ULTIMATE.start_main_~#t1144~0.base_12|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t1144~0.offset=|v_ULTIMATE.start_main_~#t1144~0.offset_10|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1144~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1144~0.offset, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-07 11:00:15,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L4-->L812: Formula: (and (not (= 0 P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-370771109)) (= ~z$r_buff1_thd1~0_Out-370771109 ~z$r_buff0_thd1~0_In-370771109) (= ~z$r_buff0_thd0~0_In-370771109 ~z$r_buff1_thd0~0_Out-370771109) (= ~z$r_buff1_thd2~0_Out-370771109 ~z$r_buff0_thd2~0_In-370771109) (= ~z$r_buff0_thd4~0_Out-370771109 1) (= ~z$r_buff0_thd4~0_In-370771109 ~z$r_buff1_thd4~0_Out-370771109) (= ~a~0_Out-370771109 ~__unbuffered_p3_EAX~0_Out-370771109) (= ~__unbuffered_p3_EBX~0_Out-370771109 ~b~0_In-370771109) (= ~a~0_Out-370771109 1) (= ~z$r_buff1_thd3~0_Out-370771109 ~z$r_buff0_thd3~0_In-370771109)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-370771109, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-370771109, ~b~0=~b~0_In-370771109, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-370771109, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-370771109, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-370771109, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-370771109} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-370771109, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-370771109, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-370771109, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-370771109, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out-370771109, ~a~0=~a~0_Out-370771109, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-370771109, ~b~0=~b~0_In-370771109, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-370771109, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-370771109, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out-370771109, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-370771109, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-370771109, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-370771109, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-370771109} 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 11:00:15,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_18 |v_P0Thread1of1ForFork0_#in~arg.base_20|) (= v_P0Thread1of1ForFork0_~arg.offset_18 |v_P0Thread1of1ForFork0_#in~arg.offset_20|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~x~0_33 v_~__unbuffered_p0_EAX~0_26) (= v_~b~0_72 1) (= v_~__unbuffered_cnt~0_115 (+ v_~__unbuffered_cnt~0_116 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_20|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116, ~x~0=v_~x~0_33} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_20|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~b~0=v_~b~0_72, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_20|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_18, ~x~0=v_~x~0_33, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_18} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 11:00:15,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] P1ENTRY-->P1EXIT: Formula: (and (= v_P1Thread1of1ForFork1_~arg.offset_8 |v_P1Thread1of1ForFork1_#in~arg.offset_10|) (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_P1Thread1of1ForFork1_~arg.base_8 |v_P1Thread1of1ForFork1_#in~arg.base_10|) (= v_~y~0_25 v_~__unbuffered_p1_EAX~0_14) (= v_~x~0_18 1) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_10|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~y~0=v_~y~0_25} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_8, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_8, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_10|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, ~y~0=v_~y~0_25, ~x~0=v_~x~0_18, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 11:00:15,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In2142808242 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In2142808242 256)))) (or (and (not .cse0) (= |P3Thread1of1ForFork3_#t~ite11_Out2142808242| 0) (not .cse1)) (and (= |P3Thread1of1ForFork3_#t~ite11_Out2142808242| ~z$w_buff0_used~0_In2142808242) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2142808242, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2142808242} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2142808242, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2142808242, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out2142808242|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-07 11:00:15,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L776-2-->L776-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In671253950 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In671253950 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite3_Out671253950| ~z~0_In671253950)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite3_Out671253950| ~z$w_buff1~0_In671253950)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In671253950, ~z$w_buff1_used~0=~z$w_buff1_used~0_In671253950, ~z$w_buff1~0=~z$w_buff1~0_In671253950, ~z~0=~z~0_In671253950} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out671253950|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In671253950, ~z$w_buff1_used~0=~z$w_buff1_used~0_In671253950, ~z$w_buff1~0=~z$w_buff1~0_In671253950, ~z~0=~z~0_In671253950} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-07 11:00:15,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L776-4-->L777: Formula: (= v_~z~0_18 |v_P2Thread1of1ForFork2_#t~ite3_6|) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_6|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_7|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_5|, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-07 11:00:15,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-434897124 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-434897124 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite5_Out-434897124|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-434897124 |P2Thread1of1ForFork2_#t~ite5_Out-434897124|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-434897124, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-434897124} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-434897124|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-434897124, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-434897124} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-07 11:00:15,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In2049038153 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In2049038153 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In2049038153 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd3~0_In2049038153 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite6_Out2049038153|)) (and (= ~z$w_buff1_used~0_In2049038153 |P2Thread1of1ForFork2_#t~ite6_Out2049038153|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2049038153, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2049038153, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2049038153, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2049038153} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out2049038153|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2049038153, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2049038153, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2049038153, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2049038153} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-07 11:00:15,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1175998438 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1175998438 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite7_Out1175998438| ~z$r_buff0_thd3~0_In1175998438) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite7_Out1175998438| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1175998438, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1175998438} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1175998438, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1175998438, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out1175998438|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-07 11:00:15,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L780-->L780-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In1360458393 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd3~0_In1360458393 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1360458393 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1360458393 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In1360458393 |P2Thread1of1ForFork2_#t~ite8_Out1360458393|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork2_#t~ite8_Out1360458393| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1360458393, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1360458393, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1360458393, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1360458393} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1360458393, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1360458393, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1360458393, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1360458393, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out1360458393|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-07 11:00:15,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L780-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite8_42| v_~z$r_buff1_thd3~0_114) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_83 1) v_~__unbuffered_cnt~0_82)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_42|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_114, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_41|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-07 11:00:15,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L814-->L814-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd4~0_In1652636296 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1652636296 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In1652636296 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1652636296 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1652636296 |P3Thread1of1ForFork3_#t~ite12_Out1652636296|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork3_#t~ite12_Out1652636296|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1652636296, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1652636296, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1652636296, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1652636296} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1652636296, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1652636296, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1652636296, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1652636296, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out1652636296|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-07 11:00:15,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L815-->L816: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1819525218 256) 0)) (.cse0 (= ~z$r_buff0_thd4~0_Out-1819525218 ~z$r_buff0_thd4~0_In-1819525218)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In-1819525218 256) 0))) (or (and .cse0 .cse1) (and (not .cse2) (= ~z$r_buff0_thd4~0_Out-1819525218 0) (not .cse1)) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1819525218, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1819525218} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1819525218, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1819525218, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out-1819525218|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-07 11:00:15,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L816-->L816-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1291782453 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1291782453 256))) (.cse2 (= (mod ~z$r_buff1_thd4~0_In-1291782453 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1291782453 256)))) (or (and (= |P3Thread1of1ForFork3_#t~ite14_Out-1291782453| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd4~0_In-1291782453 |P3Thread1of1ForFork3_#t~ite14_Out-1291782453|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1291782453, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1291782453, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1291782453, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1291782453} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1291782453, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1291782453, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out-1291782453|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1291782453, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1291782453} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-07 11:00:15,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L816-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#t~ite14_46| v_~z$r_buff1_thd4~0_102) (= v_~__unbuffered_cnt~0_106 (+ v_~__unbuffered_cnt~0_107 1)) (= 0 |v_P3Thread1of1ForFork3_#res.base_3|) (= 0 |v_P3Thread1of1ForFork3_#res.offset_3|)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_46|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_102, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_45|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_3|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-07 11:00:15,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L845-->L847-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_79 256)) (= (mod v_~z$r_buff0_thd0~0_53 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_53, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_53, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 11:00:15,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L847-2-->L847-5: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In1006539149 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite20_Out1006539149| |ULTIMATE.start_main_#t~ite19_Out1006539149|)) (.cse1 (= (mod ~z$w_buff1_used~0_In1006539149 256) 0))) (or (and (= ~z~0_In1006539149 |ULTIMATE.start_main_#t~ite19_Out1006539149|) (or .cse0 .cse1) .cse2) (and (not .cse0) (= ~z$w_buff1~0_In1006539149 |ULTIMATE.start_main_#t~ite19_Out1006539149|) .cse2 (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1006539149, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1006539149, ~z$w_buff1~0=~z$w_buff1~0_In1006539149, ~z~0=~z~0_In1006539149} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1006539149|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1006539149, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1006539149, ~z$w_buff1~0=~z$w_buff1~0_In1006539149, ~z~0=~z~0_In1006539149, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1006539149|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-07 11:00:15,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-815794344 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-815794344 256)))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out-815794344| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-815794344| ~z$w_buff0_used~0_In-815794344)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-815794344, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-815794344} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-815794344, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-815794344, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-815794344|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-07 11:00:15,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L849-->L849-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In544928346 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In544928346 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In544928346 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In544928346 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out544928346| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite22_Out544928346| ~z$w_buff1_used~0_In544928346) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In544928346, ~z$w_buff0_used~0=~z$w_buff0_used~0_In544928346, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In544928346, ~z$w_buff1_used~0=~z$w_buff1_used~0_In544928346} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In544928346, ~z$w_buff0_used~0=~z$w_buff0_used~0_In544928346, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In544928346, ~z$w_buff1_used~0=~z$w_buff1_used~0_In544928346, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out544928346|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-07 11:00:15,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L850-->L850-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1318357289 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1318357289 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite23_Out-1318357289| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In-1318357289 |ULTIMATE.start_main_#t~ite23_Out-1318357289|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1318357289, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1318357289} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1318357289, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1318357289, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1318357289|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-07 11:00:15,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L851-->L851-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In-1694654860 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1694654860 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1694654860 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1694654860 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite24_Out-1694654860| ~z$r_buff1_thd0~0_In-1694654860) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite24_Out-1694654860| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1694654860, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1694654860, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1694654860, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1694654860} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1694654860, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1694654860, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1694654860, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1694654860|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1694654860} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-07 11:00:15,239 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L861-->L861-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1570440699 256)))) (or (and (= |ULTIMATE.start_main_#t~ite36_Out-1570440699| |ULTIMATE.start_main_#t~ite37_Out-1570440699|) (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1570440699 256) 0))) (or (= (mod ~z$w_buff0_used~0_In-1570440699 256) 0) (and .cse0 (= (mod ~z$w_buff1_used~0_In-1570440699 256) 0)) (and (= (mod ~z$r_buff1_thd0~0_In-1570440699 256) 0) .cse0))) (= |ULTIMATE.start_main_#t~ite36_Out-1570440699| ~z$w_buff0_used~0_In-1570440699) .cse1) (and (= |ULTIMATE.start_main_#t~ite36_In-1570440699| |ULTIMATE.start_main_#t~ite36_Out-1570440699|) (= ~z$w_buff0_used~0_In-1570440699 |ULTIMATE.start_main_#t~ite37_Out-1570440699|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1570440699, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1570440699, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1570440699, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1570440699, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_In-1570440699|, ~weak$$choice2~0=~weak$$choice2~0_In-1570440699} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1570440699, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1570440699, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1570440699, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1570440699, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1570440699|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1570440699|, ~weak$$choice2~0=~weak$$choice2~0_In-1570440699} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 11:00:15,239 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L862-->L862-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-428985245 256)))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out-428985245| ~z$w_buff1_used~0_In-428985245) (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-428985245 256) 0))) (or (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In-428985245 256))) (= (mod ~z$w_buff0_used~0_In-428985245 256) 0) (and .cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-428985245 256))))) (= |ULTIMATE.start_main_#t~ite40_Out-428985245| |ULTIMATE.start_main_#t~ite39_Out-428985245|) .cse1) (and (= |ULTIMATE.start_main_#t~ite40_Out-428985245| ~z$w_buff1_used~0_In-428985245) (= |ULTIMATE.start_main_#t~ite39_In-428985245| |ULTIMATE.start_main_#t~ite39_Out-428985245|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-428985245, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-428985245, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In-428985245|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-428985245, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-428985245, ~weak$$choice2~0=~weak$$choice2~0_In-428985245} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-428985245, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-428985245|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-428985245|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-428985245, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-428985245, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-428985245, ~weak$$choice2~0=~weak$$choice2~0_In-428985245} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 11:00:15,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L863-->L864: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_24 256))) (= v_~z$r_buff0_thd0~0_79 v_~z$r_buff0_thd0~0_80)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_80, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_79, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_8|, ~weak$$choice2~0=v_~weak$$choice2~0_24, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 11:00:15,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L866-->L4: Formula: (and (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (not (= (mod v_~z$flush_delayed~0_29 256) 0)) (= v_~z$mem_tmp~0_15 v_~z~0_103) (= 0 v_~z$flush_delayed~0_28)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_29} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_15, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_23|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_28, ~z~0=v_~z~0_103, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:00:15,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 11:00:15,293 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d36da1c6-2f3b-4120-9476-f1a574350b10/bin/uautomizer/witness.graphml [2019-12-07 11:00:15,293 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:00:15,294 INFO L168 Benchmark]: Toolchain (without parser) took 23215.49 ms. Allocated memory was 1.0 GB in the beginning and 4.2 GB in the end (delta: 3.2 GB). Free memory was 939.3 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2019-12-07 11:00:15,294 INFO L168 Benchmark]: CDTParser took 0.17 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 11:00:15,294 INFO L168 Benchmark]: CACSL2BoogieTranslator took 363.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -129.8 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:00:15,295 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.68 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 11:00:15,295 INFO L168 Benchmark]: Boogie Preprocessor took 24.56 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 11:00:15,295 INFO L168 Benchmark]: RCFGBuilder took 402.11 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: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. [2019-12-07 11:00:15,295 INFO L168 Benchmark]: TraceAbstraction took 22316.04 ms. Allocated memory was 1.1 GB in the beginning and 4.2 GB in the end (delta: 3.1 GB). Free memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2019-12-07 11:00:15,295 INFO L168 Benchmark]: Witness Printer took 65.03 ms. Allocated memory is still 4.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2019-12-07 11:00:15,297 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.17 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 363.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -129.8 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.68 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.56 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 402.11 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: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22316.04 ms. Allocated memory was 1.1 GB in the beginning and 4.2 GB in the end (delta: 3.1 GB). Free memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. * Witness Printer took 65.03 ms. Allocated memory is still 4.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 182 ProgramPointsBefore, 90 ProgramPointsAfterwards, 210 TransitionsBefore, 97 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 26 ChoiceCompositions, 4720 VarBasedMoverChecksPositive, 197 VarBasedMoverChecksNegative, 35 SemBasedMoverChecksPositive, 226 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 0 MoverChecksTotal, 56592 CheckedPairsTotal, 126 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t1141, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L837] FCALL, FORK 0 pthread_create(&t1142, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L839] FCALL, FORK 0 pthread_create(&t1143, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L841] FCALL, FORK 0 pthread_create(&t1144, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L790] 4 z$w_buff1 = z$w_buff0 [L791] 4 z$w_buff0 = 2 [L792] 4 z$w_buff1_used = z$w_buff0_used [L793] 4 z$w_buff0_used = (_Bool)1 [L812] 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_p0_EAX=0, __unbuffered_p1_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=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=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 1 [L773] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_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=0, weak$$choice2=0, x=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 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) [L776] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_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=0, weak$$choice2=0, x=1, y=1, z=2, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L778] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L779] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] 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 [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_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=0, weak$$choice2=0, x=1, y=1, z=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 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) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 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 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 22.1s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1856 SDtfs, 2546 SDslu, 4288 SDs, 0 SdLazy, 1747 SolverSat, 191 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 17 SyntacticMatches, 10 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56646occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 48018 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 599 NumberOfCodeBlocks, 599 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 524 ConstructedInterpolants, 0 QuantifiedInterpolants, 118669 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...