./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix008_tso.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_930a2e76-8395-4e01-8bea-52a1c8e0ebbe/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_930a2e76-8395-4e01-8bea-52a1c8e0ebbe/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_930a2e76-8395-4e01-8bea-52a1c8e0ebbe/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_930a2e76-8395-4e01-8bea-52a1c8e0ebbe/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix008_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_930a2e76-8395-4e01-8bea-52a1c8e0ebbe/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_930a2e76-8395-4e01-8bea-52a1c8e0ebbe/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 7df7ab3fa6872e8bc6aaee242e2f9da00f9da39e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 11:51:45,350 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:51:45,351 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:51:45,359 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:51:45,359 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:51:45,360 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:51:45,361 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:51:45,362 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:51:45,364 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:51:45,365 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:51:45,365 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:51:45,366 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:51:45,366 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:51:45,367 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:51:45,368 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:51:45,368 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:51:45,369 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:51:45,370 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:51:45,371 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:51:45,373 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:51:45,374 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:51:45,374 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:51:45,375 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:51:45,375 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:51:45,377 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:51:45,377 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:51:45,377 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:51:45,378 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:51:45,378 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:51:45,379 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:51:45,379 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:51:45,379 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:51:45,380 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:51:45,381 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:51:45,381 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:51:45,382 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:51:45,382 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:51:45,382 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:51:45,382 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:51:45,383 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:51:45,384 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:51:45,384 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_930a2e76-8395-4e01-8bea-52a1c8e0ebbe/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 11:51:45,397 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:51:45,397 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:51:45,398 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:51:45,398 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:51:45,398 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:51:45,398 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:51:45,399 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:51:45,399 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:51:45,399 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:51:45,399 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:51:45,399 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:51:45,399 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:51:45,400 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:51:45,400 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:51:45,400 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:51:45,400 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:51:45,400 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:51:45,401 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:51:45,401 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:51:45,401 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:51:45,401 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:51:45,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:51:45,402 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:51:45,402 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:51:45,402 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:51:45,402 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 11:51:45,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:51:45,402 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:51:45,403 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:51:45,403 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_930a2e76-8395-4e01-8bea-52a1c8e0ebbe/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 -> 7df7ab3fa6872e8bc6aaee242e2f9da00f9da39e [2019-12-07 11:51:45,503 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:51:45,511 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:51:45,513 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:51:45,514 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:51:45,514 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:51:45,515 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_930a2e76-8395-4e01-8bea-52a1c8e0ebbe/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix008_tso.opt.i [2019-12-07 11:51:45,552 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_930a2e76-8395-4e01-8bea-52a1c8e0ebbe/bin/uautomizer/data/dd9d0931b/5dd4c83cb8954d7ab52385633927add5/FLAG9e171e189 [2019-12-07 11:51:45,933 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:51:45,933 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_930a2e76-8395-4e01-8bea-52a1c8e0ebbe/sv-benchmarks/c/pthread-wmm/mix008_tso.opt.i [2019-12-07 11:51:45,944 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_930a2e76-8395-4e01-8bea-52a1c8e0ebbe/bin/uautomizer/data/dd9d0931b/5dd4c83cb8954d7ab52385633927add5/FLAG9e171e189 [2019-12-07 11:51:45,953 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_930a2e76-8395-4e01-8bea-52a1c8e0ebbe/bin/uautomizer/data/dd9d0931b/5dd4c83cb8954d7ab52385633927add5 [2019-12-07 11:51:45,955 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:51:45,955 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:51:45,956 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:51:45,956 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:51:45,958 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:51:45,959 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:51:45" (1/1) ... [2019-12-07 11:51:45,961 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a70168a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:51:45, skipping insertion in model container [2019-12-07 11:51:45,961 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:51:45" (1/1) ... [2019-12-07 11:51:45,965 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:51:45,993 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:51:46,281 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:51:46,288 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:51:46,333 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:51:46,379 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:51:46,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:51:46 WrapperNode [2019-12-07 11:51:46,380 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:51:46,380 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:51:46,380 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:51:46,380 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:51:46,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:51:46" (1/1) ... [2019-12-07 11:51:46,399 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:51:46" (1/1) ... [2019-12-07 11:51:46,419 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:51:46,419 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:51:46,419 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:51:46,420 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:51:46,426 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:51:46" (1/1) ... [2019-12-07 11:51:46,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:51:46" (1/1) ... [2019-12-07 11:51:46,429 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:51:46" (1/1) ... [2019-12-07 11:51:46,430 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:51:46" (1/1) ... [2019-12-07 11:51:46,437 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:51:46" (1/1) ... [2019-12-07 11:51:46,440 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:51:46" (1/1) ... [2019-12-07 11:51:46,443 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:51:46" (1/1) ... [2019-12-07 11:51:46,447 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:51:46,447 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:51:46,447 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:51:46,447 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:51:46,448 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:51:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_930a2e76-8395-4e01-8bea-52a1c8e0ebbe/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 11:51:46,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 11:51:46,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 11:51:46,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:51:46,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:51:46,495 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 11:51:46,495 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 11:51:46,495 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 11:51:46,495 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 11:51:46,495 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 11:51:46,495 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 11:51:46,495 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 11:51:46,496 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 11:51:46,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 11:51:46,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:51:46,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:51:46,497 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 11:51:46,894 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:51:46,894 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 11:51:46,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:51:46 BoogieIcfgContainer [2019-12-07 11:51:46,895 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:51:46,896 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:51:46,896 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:51:46,898 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:51:46,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:51:45" (1/3) ... [2019-12-07 11:51:46,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ad5c350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:51:46, skipping insertion in model container [2019-12-07 11:51:46,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:51:46" (2/3) ... [2019-12-07 11:51:46,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ad5c350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:51:46, skipping insertion in model container [2019-12-07 11:51:46,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:51:46" (3/3) ... [2019-12-07 11:51:46,900 INFO L109 eAbstractionObserver]: Analyzing ICFG mix008_tso.opt.i [2019-12-07 11:51:46,906 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 11:51:46,906 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:51:46,911 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 11:51:46,912 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 11:51:46,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,939 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,940 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,940 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,940 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,942 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,942 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,952 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,952 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,953 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,953 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,953 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,953 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,953 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,953 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,953 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,953 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,953 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,953 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,954 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,954 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,954 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,954 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,954 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,954 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,954 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,954 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,954 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,955 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,955 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,955 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,955 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,955 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,955 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,955 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,955 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,955 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,955 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,956 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,956 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,956 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,956 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,956 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,956 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,956 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,956 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,956 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,956 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,957 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,957 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,957 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,957 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,957 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,957 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,957 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,957 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,957 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,957 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,958 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,958 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,958 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,958 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,958 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,958 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,958 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,958 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,958 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,958 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,958 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,959 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,959 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,959 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,959 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,959 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,959 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,959 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,959 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,959 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,959 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,960 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,960 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,960 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,960 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,960 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,960 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,960 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,960 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,960 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,960 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,960 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,961 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,961 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,961 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,961 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,961 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,961 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,961 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,961 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,961 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,962 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,962 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,962 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,962 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,962 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,962 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,962 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,962 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,962 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,962 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,962 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,963 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,963 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,963 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,963 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,963 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,963 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,963 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,963 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,963 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,963 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,963 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,964 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,964 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,964 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,964 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,964 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,964 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,964 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,964 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:46,976 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 11:51:46,988 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:51:46,989 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:51:46,989 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:51:46,989 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:51:46,989 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:51:46,989 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:51:46,989 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:51:46,989 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:51:47,000 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 254 transitions [2019-12-07 11:51:47,002 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 211 places, 254 transitions [2019-12-07 11:51:47,069 INFO L134 PetriNetUnfolder]: 56/250 cut-off events. [2019-12-07 11:51:47,069 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:51:47,080 INFO L76 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 250 events. 56/250 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 940 event pairs. 12/204 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 11:51:47,103 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 211 places, 254 transitions [2019-12-07 11:51:47,145 INFO L134 PetriNetUnfolder]: 56/250 cut-off events. [2019-12-07 11:51:47,145 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:51:47,154 INFO L76 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 250 events. 56/250 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 940 event pairs. 12/204 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 11:51:47,180 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-07 11:51:47,180 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 11:51:50,595 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-12-07 11:51:50,785 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-07 11:51:50,897 INFO L206 etLargeBlockEncoding]: Checked pairs total: 147708 [2019-12-07 11:51:50,898 INFO L214 etLargeBlockEncoding]: Total number of compositions: 132 [2019-12-07 11:51:50,900 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 113 places, 134 transitions [2019-12-07 11:51:58,838 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 92086 states. [2019-12-07 11:51:58,839 INFO L276 IsEmpty]: Start isEmpty. Operand 92086 states. [2019-12-07 11:51:58,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 11:51:58,844 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:51:58,844 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:51:58,844 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:51:58,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:51:58,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1095689236, now seen corresponding path program 1 times [2019-12-07 11:51:58,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:51:58,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089746440] [2019-12-07 11:51:58,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:51:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:51:59,004 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:51:59,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089746440] [2019-12-07 11:51:59,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:51:59,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:51:59,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383235509] [2019-12-07 11:51:59,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:51:59,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:51:59,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:51:59,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:51:59,025 INFO L87 Difference]: Start difference. First operand 92086 states. Second operand 3 states. [2019-12-07 11:51:59,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:51:59,806 INFO L93 Difference]: Finished difference Result 91382 states and 423776 transitions. [2019-12-07 11:51:59,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:51:59,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 11:51:59,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:52:00,310 INFO L225 Difference]: With dead ends: 91382 [2019-12-07 11:52:00,310 INFO L226 Difference]: Without dead ends: 85534 [2019-12-07 11:52:00,311 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 11:52:01,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85534 states. [2019-12-07 11:52:03,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85534 to 85534. [2019-12-07 11:52:03,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85534 states. [2019-12-07 11:52:03,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85534 states to 85534 states and 396416 transitions. [2019-12-07 11:52:03,398 INFO L78 Accepts]: Start accepts. Automaton has 85534 states and 396416 transitions. Word has length 9 [2019-12-07 11:52:03,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:52:03,399 INFO L462 AbstractCegarLoop]: Abstraction has 85534 states and 396416 transitions. [2019-12-07 11:52:03,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:52:03,399 INFO L276 IsEmpty]: Start isEmpty. Operand 85534 states and 396416 transitions. [2019-12-07 11:52:03,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 11:52:03,404 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:52:03,405 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:52:03,405 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:52:03,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:52:03,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1576682706, now seen corresponding path program 1 times [2019-12-07 11:52:03,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:52:03,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994580143] [2019-12-07 11:52:03,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:52:03,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:52:03,473 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:52:03,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994580143] [2019-12-07 11:52:03,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:52:03,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:52:03,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205205700] [2019-12-07 11:52:03,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:52:03,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:52:03,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:52:03,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:52:03,475 INFO L87 Difference]: Start difference. First operand 85534 states and 396416 transitions. Second operand 4 states. [2019-12-07 11:52:05,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:52:05,866 INFO L93 Difference]: Finished difference Result 132766 states and 593324 transitions. [2019-12-07 11:52:05,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:52:05,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 11:52:05,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:52:06,258 INFO L225 Difference]: With dead ends: 132766 [2019-12-07 11:52:06,258 INFO L226 Difference]: Without dead ends: 132702 [2019-12-07 11:52:06,259 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:52:07,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132702 states. [2019-12-07 11:52:09,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132702 to 129166. [2019-12-07 11:52:09,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129166 states. [2019-12-07 11:52:10,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129166 states to 129166 states and 580344 transitions. [2019-12-07 11:52:10,116 INFO L78 Accepts]: Start accepts. Automaton has 129166 states and 580344 transitions. Word has length 15 [2019-12-07 11:52:10,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:52:10,116 INFO L462 AbstractCegarLoop]: Abstraction has 129166 states and 580344 transitions. [2019-12-07 11:52:10,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:52:10,116 INFO L276 IsEmpty]: Start isEmpty. Operand 129166 states and 580344 transitions. [2019-12-07 11:52:10,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 11:52:10,122 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:52:10,122 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:52:10,122 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:52:10,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:52:10,123 INFO L82 PathProgramCache]: Analyzing trace with hash -959167775, now seen corresponding path program 1 times [2019-12-07 11:52:10,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:52:10,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381393682] [2019-12-07 11:52:10,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:52:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:52:10,165 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:52:10,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381393682] [2019-12-07 11:52:10,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:52:10,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:52:10,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160311681] [2019-12-07 11:52:10,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:52:10,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:52:10,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:52:10,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:52:10,167 INFO L87 Difference]: Start difference. First operand 129166 states and 580344 transitions. Second operand 4 states. [2019-12-07 11:52:11,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:52:11,104 INFO L93 Difference]: Finished difference Result 166838 states and 738668 transitions. [2019-12-07 11:52:11,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:52:11,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 11:52:11,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:52:13,472 INFO L225 Difference]: With dead ends: 166838 [2019-12-07 11:52:13,472 INFO L226 Difference]: Without dead ends: 166782 [2019-12-07 11:52:13,473 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:52:15,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166782 states. [2019-12-07 11:52:17,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166782 to 149598. [2019-12-07 11:52:17,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149598 states. [2019-12-07 11:52:17,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149598 states to 149598 states and 668132 transitions. [2019-12-07 11:52:17,826 INFO L78 Accepts]: Start accepts. Automaton has 149598 states and 668132 transitions. Word has length 18 [2019-12-07 11:52:17,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:52:17,826 INFO L462 AbstractCegarLoop]: Abstraction has 149598 states and 668132 transitions. [2019-12-07 11:52:17,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:52:17,826 INFO L276 IsEmpty]: Start isEmpty. Operand 149598 states and 668132 transitions. [2019-12-07 11:52:17,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 11:52:17,835 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:52:17,835 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:52:17,836 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:52:17,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:52:17,836 INFO L82 PathProgramCache]: Analyzing trace with hash 330599914, now seen corresponding path program 1 times [2019-12-07 11:52:17,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:52:17,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419039152] [2019-12-07 11:52:17,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:52:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:52:17,863 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:52:17,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419039152] [2019-12-07 11:52:17,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:52:17,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:52:17,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225650390] [2019-12-07 11:52:17,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:52:17,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:52:17,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:52:17,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:52:17,865 INFO L87 Difference]: Start difference. First operand 149598 states and 668132 transitions. Second operand 3 states. [2019-12-07 11:52:19,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:52:19,464 INFO L93 Difference]: Finished difference Result 254938 states and 1095516 transitions. [2019-12-07 11:52:19,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:52:19,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 11:52:19,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:52:20,204 INFO L225 Difference]: With dead ends: 254938 [2019-12-07 11:52:20,204 INFO L226 Difference]: Without dead ends: 254938 [2019-12-07 11:52:20,204 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:52:22,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254938 states. [2019-12-07 11:52:28,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254938 to 226954. [2019-12-07 11:52:28,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226954 states. [2019-12-07 11:52:29,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226954 states to 226954 states and 987664 transitions. [2019-12-07 11:52:29,713 INFO L78 Accepts]: Start accepts. Automaton has 226954 states and 987664 transitions. Word has length 19 [2019-12-07 11:52:29,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:52:29,713 INFO L462 AbstractCegarLoop]: Abstraction has 226954 states and 987664 transitions. [2019-12-07 11:52:29,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:52:29,713 INFO L276 IsEmpty]: Start isEmpty. Operand 226954 states and 987664 transitions. [2019-12-07 11:52:29,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 11:52:29,726 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:52:29,726 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:52:29,726 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:52:29,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:52:29,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1619055659, now seen corresponding path program 1 times [2019-12-07 11:52:29,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:52:29,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504543393] [2019-12-07 11:52:29,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:52:29,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:52:29,777 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:52:29,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504543393] [2019-12-07 11:52:29,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:52:29,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:52:29,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209131648] [2019-12-07 11:52:29,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:52:29,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:52:29,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:52:29,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:52:29,778 INFO L87 Difference]: Start difference. First operand 226954 states and 987664 transitions. Second operand 4 states. [2019-12-07 11:52:30,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:52:30,628 INFO L93 Difference]: Finished difference Result 189413 states and 757728 transitions. [2019-12-07 11:52:30,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:52:30,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-07 11:52:30,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:52:31,070 INFO L225 Difference]: With dead ends: 189413 [2019-12-07 11:52:31,070 INFO L226 Difference]: Without dead ends: 175973 [2019-12-07 11:52:31,070 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:52:33,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175973 states. [2019-12-07 11:52:35,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175973 to 175973. [2019-12-07 11:52:35,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175973 states. [2019-12-07 11:52:36,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175973 states to 175973 states and 708902 transitions. [2019-12-07 11:52:36,171 INFO L78 Accepts]: Start accepts. Automaton has 175973 states and 708902 transitions. Word has length 20 [2019-12-07 11:52:36,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:52:36,172 INFO L462 AbstractCegarLoop]: Abstraction has 175973 states and 708902 transitions. [2019-12-07 11:52:36,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:52:36,172 INFO L276 IsEmpty]: Start isEmpty. Operand 175973 states and 708902 transitions. [2019-12-07 11:52:36,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 11:52:36,182 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:52:36,182 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:52:36,182 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:52:36,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:52:36,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1634875059, now seen corresponding path program 1 times [2019-12-07 11:52:36,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:52:36,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139196471] [2019-12-07 11:52:36,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:52:36,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:52:36,251 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:52:36,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139196471] [2019-12-07 11:52:36,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:52:36,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:52:36,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030736253] [2019-12-07 11:52:36,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:52:36,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:52:36,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:52:36,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:52:36,253 INFO L87 Difference]: Start difference. First operand 175973 states and 708902 transitions. Second operand 3 states. [2019-12-07 11:52:37,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:52:37,673 INFO L93 Difference]: Finished difference Result 326144 states and 1305347 transitions. [2019-12-07 11:52:37,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:52:37,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 11:52:37,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:52:38,530 INFO L225 Difference]: With dead ends: 326144 [2019-12-07 11:52:38,530 INFO L226 Difference]: Without dead ends: 324461 [2019-12-07 11:52:38,531 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:52:43,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324461 states. [2019-12-07 11:52:47,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324461 to 319507. [2019-12-07 11:52:47,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319507 states. [2019-12-07 11:52:49,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319507 states to 319507 states and 1286450 transitions. [2019-12-07 11:52:49,078 INFO L78 Accepts]: Start accepts. Automaton has 319507 states and 1286450 transitions. Word has length 21 [2019-12-07 11:52:49,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:52:49,078 INFO L462 AbstractCegarLoop]: Abstraction has 319507 states and 1286450 transitions. [2019-12-07 11:52:49,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:52:49,078 INFO L276 IsEmpty]: Start isEmpty. Operand 319507 states and 1286450 transitions. [2019-12-07 11:52:49,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 11:52:49,099 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:52:49,099 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:52:49,099 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:52:49,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:52:49,100 INFO L82 PathProgramCache]: Analyzing trace with hash 2037270664, now seen corresponding path program 1 times [2019-12-07 11:52:49,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:52:49,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865374134] [2019-12-07 11:52:49,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:52:49,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:52:49,132 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:52:49,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865374134] [2019-12-07 11:52:49,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:52:49,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:52:49,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194639320] [2019-12-07 11:52:49,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:52:49,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:52:49,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:52:49,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:52:49,133 INFO L87 Difference]: Start difference. First operand 319507 states and 1286450 transitions. Second operand 4 states. [2019-12-07 11:52:51,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:52:51,813 INFO L93 Difference]: Finished difference Result 397084 states and 1576832 transitions. [2019-12-07 11:52:51,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:52:51,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 11:52:51,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:52:52,988 INFO L225 Difference]: With dead ends: 397084 [2019-12-07 11:52:52,989 INFO L226 Difference]: Without dead ends: 396921 [2019-12-07 11:52:52,989 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:52:55,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396921 states. [2019-12-07 11:53:04,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396921 to 323911. [2019-12-07 11:53:04,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323911 states. [2019-12-07 11:53:05,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323911 states to 323911 states and 1303990 transitions. [2019-12-07 11:53:05,730 INFO L78 Accepts]: Start accepts. Automaton has 323911 states and 1303990 transitions. Word has length 21 [2019-12-07 11:53:05,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:53:05,730 INFO L462 AbstractCegarLoop]: Abstraction has 323911 states and 1303990 transitions. [2019-12-07 11:53:05,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:53:05,730 INFO L276 IsEmpty]: Start isEmpty. Operand 323911 states and 1303990 transitions. [2019-12-07 11:53:05,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 11:53:05,753 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:53:05,753 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:53:05,753 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:53:05,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:53:05,754 INFO L82 PathProgramCache]: Analyzing trace with hash -25687531, now seen corresponding path program 1 times [2019-12-07 11:53:05,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:53:05,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281166293] [2019-12-07 11:53:05,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:53:05,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:53:05,817 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:53:05,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281166293] [2019-12-07 11:53:05,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:53:05,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:53:05,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492564816] [2019-12-07 11:53:05,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:53:05,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:53:05,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:53:05,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:53:05,819 INFO L87 Difference]: Start difference. First operand 323911 states and 1303990 transitions. Second operand 4 states. [2019-12-07 11:53:08,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:53:08,094 INFO L93 Difference]: Finished difference Result 429123 states and 1647448 transitions. [2019-12-07 11:53:08,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:53:08,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-07 11:53:08,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:53:08,893 INFO L225 Difference]: With dead ends: 429123 [2019-12-07 11:53:08,893 INFO L226 Difference]: Without dead ends: 325133 [2019-12-07 11:53:08,893 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:53:11,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325133 states. [2019-12-07 11:53:19,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325133 to 272502. [2019-12-07 11:53:19,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272502 states. [2019-12-07 11:53:19,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272502 states to 272502 states and 978652 transitions. [2019-12-07 11:53:19,768 INFO L78 Accepts]: Start accepts. Automaton has 272502 states and 978652 transitions. Word has length 22 [2019-12-07 11:53:19,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:53:19,769 INFO L462 AbstractCegarLoop]: Abstraction has 272502 states and 978652 transitions. [2019-12-07 11:53:19,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:53:19,769 INFO L276 IsEmpty]: Start isEmpty. Operand 272502 states and 978652 transitions. [2019-12-07 11:53:19,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 11:53:19,789 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:53:19,789 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:53:19,789 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:53:19,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:53:19,789 INFO L82 PathProgramCache]: Analyzing trace with hash -377634868, now seen corresponding path program 1 times [2019-12-07 11:53:19,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:53:19,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250004916] [2019-12-07 11:53:19,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:53:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:53:19,847 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:53:19,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250004916] [2019-12-07 11:53:19,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:53:19,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:53:19,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586425960] [2019-12-07 11:53:19,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:53:19,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:53:19,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:53:19,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:53:19,849 INFO L87 Difference]: Start difference. First operand 272502 states and 978652 transitions. Second operand 4 states. [2019-12-07 11:53:21,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:53:21,259 INFO L93 Difference]: Finished difference Result 281036 states and 1013822 transitions. [2019-12-07 11:53:21,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:53:21,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-07 11:53:21,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:53:21,880 INFO L225 Difference]: With dead ends: 281036 [2019-12-07 11:53:21,880 INFO L226 Difference]: Without dead ends: 281036 [2019-12-07 11:53:21,881 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:53:24,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281036 states. [2019-12-07 11:53:27,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281036 to 196942. [2019-12-07 11:53:27,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196942 states. [2019-12-07 11:53:27,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196942 states to 196942 states and 715719 transitions. [2019-12-07 11:53:27,829 INFO L78 Accepts]: Start accepts. Automaton has 196942 states and 715719 transitions. Word has length 22 [2019-12-07 11:53:27,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:53:27,829 INFO L462 AbstractCegarLoop]: Abstraction has 196942 states and 715719 transitions. [2019-12-07 11:53:27,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:53:27,830 INFO L276 IsEmpty]: Start isEmpty. Operand 196942 states and 715719 transitions. [2019-12-07 11:53:27,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 11:53:27,862 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:53:27,862 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:53:27,862 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:53:27,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:53:27,862 INFO L82 PathProgramCache]: Analyzing trace with hash 287139749, now seen corresponding path program 1 times [2019-12-07 11:53:27,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:53:27,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894682664] [2019-12-07 11:53:27,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:53:27,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:53:27,901 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:53:27,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894682664] [2019-12-07 11:53:27,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:53:27,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:53:27,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024429320] [2019-12-07 11:53:27,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:53:27,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:53:27,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:53:27,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:53:27,902 INFO L87 Difference]: Start difference. First operand 196942 states and 715719 transitions. Second operand 5 states. [2019-12-07 11:53:29,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:53:29,596 INFO L93 Difference]: Finished difference Result 278374 states and 986952 transitions. [2019-12-07 11:53:29,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:53:29,597 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 11:53:29,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:53:30,182 INFO L225 Difference]: With dead ends: 278374 [2019-12-07 11:53:30,182 INFO L226 Difference]: Without dead ends: 278136 [2019-12-07 11:53:30,182 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 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:53:32,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278136 states. [2019-12-07 11:53:37,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278136 to 216065. [2019-12-07 11:53:37,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216065 states. [2019-12-07 11:53:38,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216065 states to 216065 states and 782210 transitions. [2019-12-07 11:53:38,176 INFO L78 Accepts]: Start accepts. Automaton has 216065 states and 782210 transitions. Word has length 25 [2019-12-07 11:53:38,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:53:38,176 INFO L462 AbstractCegarLoop]: Abstraction has 216065 states and 782210 transitions. [2019-12-07 11:53:38,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:53:38,176 INFO L276 IsEmpty]: Start isEmpty. Operand 216065 states and 782210 transitions. [2019-12-07 11:53:38,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 11:53:38,221 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:53:38,221 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:53:38,221 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:53:38,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:53:38,222 INFO L82 PathProgramCache]: Analyzing trace with hash -640922618, now seen corresponding path program 1 times [2019-12-07 11:53:38,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:53:38,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065938245] [2019-12-07 11:53:38,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:53:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:53:38,262 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:53:38,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065938245] [2019-12-07 11:53:38,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:53:38,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:53:38,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142237895] [2019-12-07 11:53:38,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:53:38,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:53:38,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:53:38,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:53:38,263 INFO L87 Difference]: Start difference. First operand 216065 states and 782210 transitions. Second operand 5 states. [2019-12-07 11:53:40,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:53:40,077 INFO L93 Difference]: Finished difference Result 289415 states and 1024846 transitions. [2019-12-07 11:53:40,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:53:40,077 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 11:53:40,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:53:40,697 INFO L225 Difference]: With dead ends: 289415 [2019-12-07 11:53:40,698 INFO L226 Difference]: Without dead ends: 288937 [2019-12-07 11:53:40,698 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 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:53:42,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288937 states. [2019-12-07 11:53:46,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288937 to 200013. [2019-12-07 11:53:46,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200013 states. [2019-12-07 11:53:46,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200013 states to 200013 states and 725206 transitions. [2019-12-07 11:53:46,808 INFO L78 Accepts]: Start accepts. Automaton has 200013 states and 725206 transitions. Word has length 28 [2019-12-07 11:53:46,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:53:46,808 INFO L462 AbstractCegarLoop]: Abstraction has 200013 states and 725206 transitions. [2019-12-07 11:53:46,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:53:46,808 INFO L276 IsEmpty]: Start isEmpty. Operand 200013 states and 725206 transitions. [2019-12-07 11:53:46,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 11:53:46,946 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:53:46,946 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] [2019-12-07 11:53:46,946 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:53:46,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:53:46,946 INFO L82 PathProgramCache]: Analyzing trace with hash -557023879, now seen corresponding path program 1 times [2019-12-07 11:53:46,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:53:46,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521099411] [2019-12-07 11:53:46,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:53:46,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:53:46,986 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:53:46,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521099411] [2019-12-07 11:53:46,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:53:46,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:53:46,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783066241] [2019-12-07 11:53:46,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:53:46,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:53:46,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:53:46,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:53:46,987 INFO L87 Difference]: Start difference. First operand 200013 states and 725206 transitions. Second operand 3 states. [2019-12-07 11:53:48,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:53:48,016 INFO L93 Difference]: Finished difference Result 188042 states and 671771 transitions. [2019-12-07 11:53:48,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:53:48,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-12-07 11:53:48,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:53:48,396 INFO L225 Difference]: With dead ends: 188042 [2019-12-07 11:53:48,397 INFO L226 Difference]: Without dead ends: 188042 [2019-12-07 11:53:48,397 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:53:49,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188042 states. [2019-12-07 11:53:52,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188042 to 186844. [2019-12-07 11:53:52,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186844 states. [2019-12-07 11:53:52,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186844 states to 186844 states and 668099 transitions. [2019-12-07 11:53:52,752 INFO L78 Accepts]: Start accepts. Automaton has 186844 states and 668099 transitions. Word has length 35 [2019-12-07 11:53:52,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:53:52,752 INFO L462 AbstractCegarLoop]: Abstraction has 186844 states and 668099 transitions. [2019-12-07 11:53:52,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:53:52,752 INFO L276 IsEmpty]: Start isEmpty. Operand 186844 states and 668099 transitions. [2019-12-07 11:53:52,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 11:53:52,877 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:53:52,877 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:53:52,877 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:53:52,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:53:52,877 INFO L82 PathProgramCache]: Analyzing trace with hash -664242160, now seen corresponding path program 1 times [2019-12-07 11:53:52,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:53:52,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947201061] [2019-12-07 11:53:52,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:53:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:53:53,210 WARN L192 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 6 [2019-12-07 11:53:53,266 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:53:53,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947201061] [2019-12-07 11:53:53,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:53:53,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:53:53,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828574080] [2019-12-07 11:53:53,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:53:53,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:53:53,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:53:53,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:53:53,267 INFO L87 Difference]: Start difference. First operand 186844 states and 668099 transitions. Second operand 8 states. [2019-12-07 11:53:57,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:53:57,359 INFO L93 Difference]: Finished difference Result 552824 states and 2028182 transitions. [2019-12-07 11:53:57,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 11:53:57,360 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-12-07 11:53:57,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:53:58,627 INFO L225 Difference]: With dead ends: 552824 [2019-12-07 11:53:58,627 INFO L226 Difference]: Without dead ends: 552824 [2019-12-07 11:53:58,627 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2019-12-07 11:54:05,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552824 states. [2019-12-07 11:54:10,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552824 to 275783. [2019-12-07 11:54:10,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275783 states. [2019-12-07 11:54:11,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275783 states to 275783 states and 1004638 transitions. [2019-12-07 11:54:11,253 INFO L78 Accepts]: Start accepts. Automaton has 275783 states and 1004638 transitions. Word has length 36 [2019-12-07 11:54:11,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:54:11,253 INFO L462 AbstractCegarLoop]: Abstraction has 275783 states and 1004638 transitions. [2019-12-07 11:54:11,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:54:11,253 INFO L276 IsEmpty]: Start isEmpty. Operand 275783 states and 1004638 transitions. [2019-12-07 11:54:11,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 11:54:11,465 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:54:11,465 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:54:11,465 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:54:11,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:54:11,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1550311664, now seen corresponding path program 2 times [2019-12-07 11:54:11,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:54:11,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049018582] [2019-12-07 11:54:11,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:54:11,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:54:11,525 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:54:11,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049018582] [2019-12-07 11:54:11,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:54:11,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:54:11,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529459113] [2019-12-07 11:54:11,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:54:11,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:54:11,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:54:11,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:54:11,526 INFO L87 Difference]: Start difference. First operand 275783 states and 1004638 transitions. Second operand 4 states. [2019-12-07 11:54:14,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:54:14,094 INFO L93 Difference]: Finished difference Result 509948 states and 1860000 transitions. [2019-12-07 11:54:14,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:54:14,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-07 11:54:14,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:54:14,444 INFO L225 Difference]: With dead ends: 509948 [2019-12-07 11:54:14,444 INFO L226 Difference]: Without dead ends: 177293 [2019-12-07 11:54:14,445 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:54:15,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177293 states. [2019-12-07 11:54:17,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177293 to 174548. [2019-12-07 11:54:17,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174548 states. [2019-12-07 11:54:18,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174548 states to 174548 states and 576581 transitions. [2019-12-07 11:54:18,347 INFO L78 Accepts]: Start accepts. Automaton has 174548 states and 576581 transitions. Word has length 36 [2019-12-07 11:54:18,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:54:18,347 INFO L462 AbstractCegarLoop]: Abstraction has 174548 states and 576581 transitions. [2019-12-07 11:54:18,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:54:18,348 INFO L276 IsEmpty]: Start isEmpty. Operand 174548 states and 576581 transitions. [2019-12-07 11:54:18,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 11:54:18,479 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:54:18,479 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:54:18,479 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:54:18,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:54:18,479 INFO L82 PathProgramCache]: Analyzing trace with hash 857510202, now seen corresponding path program 1 times [2019-12-07 11:54:18,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:54:18,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821330000] [2019-12-07 11:54:18,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:54:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:54:18,552 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:54:18,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821330000] [2019-12-07 11:54:18,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:54:18,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:54:18,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082367684] [2019-12-07 11:54:18,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:54:18,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:54:18,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:54:18,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:54:18,554 INFO L87 Difference]: Start difference. First operand 174548 states and 576581 transitions. Second operand 8 states. [2019-12-07 11:54:20,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:54:20,389 INFO L93 Difference]: Finished difference Result 307880 states and 1020388 transitions. [2019-12-07 11:54:20,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 11:54:20,390 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2019-12-07 11:54:20,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:54:20,993 INFO L225 Difference]: With dead ends: 307880 [2019-12-07 11:54:20,993 INFO L226 Difference]: Without dead ends: 307880 [2019-12-07 11:54:20,994 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2019-12-07 11:54:22,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307880 states. [2019-12-07 11:54:26,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307880 to 183934. [2019-12-07 11:54:26,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183934 states. [2019-12-07 11:54:26,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183934 states to 183934 states and 608301 transitions. [2019-12-07 11:54:26,452 INFO L78 Accepts]: Start accepts. Automaton has 183934 states and 608301 transitions. Word has length 37 [2019-12-07 11:54:26,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:54:26,453 INFO L462 AbstractCegarLoop]: Abstraction has 183934 states and 608301 transitions. [2019-12-07 11:54:26,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:54:26,453 INFO L276 IsEmpty]: Start isEmpty. Operand 183934 states and 608301 transitions. [2019-12-07 11:54:26,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 11:54:26,607 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:54:26,607 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:54:26,607 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:54:26,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:54:26,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1854671702, now seen corresponding path program 2 times [2019-12-07 11:54:26,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:54:26,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682542831] [2019-12-07 11:54:26,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:54:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:54:26,729 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:54:26,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682542831] [2019-12-07 11:54:26,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:54:26,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:54:26,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449797601] [2019-12-07 11:54:26,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:54:26,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:54:26,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:54:26,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:54:26,730 INFO L87 Difference]: Start difference. First operand 183934 states and 608301 transitions. Second operand 8 states. [2019-12-07 11:54:28,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:54:28,531 INFO L93 Difference]: Finished difference Result 280310 states and 928087 transitions. [2019-12-07 11:54:28,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 11:54:28,531 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2019-12-07 11:54:28,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:54:29,067 INFO L225 Difference]: With dead ends: 280310 [2019-12-07 11:54:29,068 INFO L226 Difference]: Without dead ends: 280310 [2019-12-07 11:54:29,068 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2019-12-07 11:54:30,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280310 states. [2019-12-07 11:54:35,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280310 to 180481. [2019-12-07 11:54:35,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180481 states. [2019-12-07 11:54:35,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180481 states to 180481 states and 595706 transitions. [2019-12-07 11:54:35,933 INFO L78 Accepts]: Start accepts. Automaton has 180481 states and 595706 transitions. Word has length 37 [2019-12-07 11:54:35,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:54:35,934 INFO L462 AbstractCegarLoop]: Abstraction has 180481 states and 595706 transitions. [2019-12-07 11:54:35,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:54:35,934 INFO L276 IsEmpty]: Start isEmpty. Operand 180481 states and 595706 transitions. [2019-12-07 11:54:36,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 11:54:36,079 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:54:36,079 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:54:36,079 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:54:36,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:54:36,079 INFO L82 PathProgramCache]: Analyzing trace with hash -2084736726, now seen corresponding path program 3 times [2019-12-07 11:54:36,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:54:36,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768039092] [2019-12-07 11:54:36,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:54:36,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:54:36,131 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:54:36,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768039092] [2019-12-07 11:54:36,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:54:36,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:54:36,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485572999] [2019-12-07 11:54:36,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:54:36,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:54:36,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:54:36,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:54:36,132 INFO L87 Difference]: Start difference. First operand 180481 states and 595706 transitions. Second operand 5 states. [2019-12-07 11:54:36,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:54:36,511 INFO L93 Difference]: Finished difference Result 107606 states and 343609 transitions. [2019-12-07 11:54:36,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:54:36,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-07 11:54:36,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:54:36,670 INFO L225 Difference]: With dead ends: 107606 [2019-12-07 11:54:36,670 INFO L226 Difference]: Without dead ends: 97870 [2019-12-07 11:54:36,670 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:54:37,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97870 states. [2019-12-07 11:54:38,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97870 to 96367. [2019-12-07 11:54:38,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96367 states. [2019-12-07 11:54:38,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96367 states to 96367 states and 311313 transitions. [2019-12-07 11:54:38,731 INFO L78 Accepts]: Start accepts. Automaton has 96367 states and 311313 transitions. Word has length 37 [2019-12-07 11:54:38,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:54:38,731 INFO L462 AbstractCegarLoop]: Abstraction has 96367 states and 311313 transitions. [2019-12-07 11:54:38,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:54:38,731 INFO L276 IsEmpty]: Start isEmpty. Operand 96367 states and 311313 transitions. [2019-12-07 11:54:38,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 11:54:38,804 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:54:38,805 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] [2019-12-07 11:54:38,805 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:54:38,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:54:38,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1475945544, now seen corresponding path program 1 times [2019-12-07 11:54:38,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:54:38,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455184061] [2019-12-07 11:54:38,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:54:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:54:38,887 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:54:38,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455184061] [2019-12-07 11:54:38,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:54:38,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 11:54:38,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570170470] [2019-12-07 11:54:38,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 11:54:38,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:54:38,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 11:54:38,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:54:38,889 INFO L87 Difference]: Start difference. First operand 96367 states and 311313 transitions. Second operand 9 states. [2019-12-07 11:54:39,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:54:39,791 INFO L93 Difference]: Finished difference Result 163828 states and 528449 transitions. [2019-12-07 11:54:39,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 11:54:39,792 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2019-12-07 11:54:39,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:54:40,025 INFO L225 Difference]: With dead ends: 163828 [2019-12-07 11:54:40,025 INFO L226 Difference]: Without dead ends: 135448 [2019-12-07 11:54:40,026 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2019-12-07 11:54:40,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135448 states. [2019-12-07 11:54:42,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135448 to 118518. [2019-12-07 11:54:42,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118518 states. [2019-12-07 11:54:42,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118518 states to 118518 states and 385200 transitions. [2019-12-07 11:54:42,798 INFO L78 Accepts]: Start accepts. Automaton has 118518 states and 385200 transitions. Word has length 38 [2019-12-07 11:54:42,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:54:42,798 INFO L462 AbstractCegarLoop]: Abstraction has 118518 states and 385200 transitions. [2019-12-07 11:54:42,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 11:54:42,798 INFO L276 IsEmpty]: Start isEmpty. Operand 118518 states and 385200 transitions. [2019-12-07 11:54:42,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 11:54:42,888 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:54:42,888 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] [2019-12-07 11:54:42,888 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:54:42,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:54:42,888 INFO L82 PathProgramCache]: Analyzing trace with hash -384759080, now seen corresponding path program 2 times [2019-12-07 11:54:42,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:54:42,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388650419] [2019-12-07 11:54:42,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:54:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:54:42,943 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:54:42,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388650419] [2019-12-07 11:54:42,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:54:42,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:54:42,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808488904] [2019-12-07 11:54:42,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:54:42,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:54:42,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:54:42,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:54:42,944 INFO L87 Difference]: Start difference. First operand 118518 states and 385200 transitions. Second operand 6 states. [2019-12-07 11:54:43,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:54:43,039 INFO L93 Difference]: Finished difference Result 23703 states and 63270 transitions. [2019-12-07 11:54:43,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:54:43,039 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-12-07 11:54:43,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:54:43,052 INFO L225 Difference]: With dead ends: 23703 [2019-12-07 11:54:43,052 INFO L226 Difference]: Without dead ends: 13682 [2019-12-07 11:54:43,053 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:54:43,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13682 states. [2019-12-07 11:54:43,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13682 to 12699. [2019-12-07 11:54:43,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12699 states. [2019-12-07 11:54:43,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12699 states to 12699 states and 30858 transitions. [2019-12-07 11:54:43,192 INFO L78 Accepts]: Start accepts. Automaton has 12699 states and 30858 transitions. Word has length 38 [2019-12-07 11:54:43,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:54:43,192 INFO L462 AbstractCegarLoop]: Abstraction has 12699 states and 30858 transitions. [2019-12-07 11:54:43,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:54:43,192 INFO L276 IsEmpty]: Start isEmpty. Operand 12699 states and 30858 transitions. [2019-12-07 11:54:43,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 11:54:43,200 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:54:43,201 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:43,201 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:54:43,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:54:43,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1609418528, now seen corresponding path program 1 times [2019-12-07 11:54:43,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:54:43,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768379443] [2019-12-07 11:54:43,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:54:43,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:54:43,233 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:54:43,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768379443] [2019-12-07 11:54:43,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:54:43,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:54:43,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943563520] [2019-12-07 11:54:43,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:54:43,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:54:43,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:54:43,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:54:43,235 INFO L87 Difference]: Start difference. First operand 12699 states and 30858 transitions. Second operand 4 states. [2019-12-07 11:54:43,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:54:43,268 INFO L93 Difference]: Finished difference Result 13757 states and 33239 transitions. [2019-12-07 11:54:43,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:54:43,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-07 11:54:43,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:54:43,277 INFO L225 Difference]: With dead ends: 13757 [2019-12-07 11:54:43,277 INFO L226 Difference]: Without dead ends: 11509 [2019-12-07 11:54:43,277 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:54:43,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11509 states. [2019-12-07 11:54:43,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11509 to 11401. [2019-12-07 11:54:43,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11401 states. [2019-12-07 11:54:43,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11401 states to 11401 states and 27789 transitions. [2019-12-07 11:54:43,582 INFO L78 Accepts]: Start accepts. Automaton has 11401 states and 27789 transitions. Word has length 50 [2019-12-07 11:54:43,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:54:43,583 INFO L462 AbstractCegarLoop]: Abstraction has 11401 states and 27789 transitions. [2019-12-07 11:54:43,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:54:43,583 INFO L276 IsEmpty]: Start isEmpty. Operand 11401 states and 27789 transitions. [2019-12-07 11:54:43,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 11:54:43,590 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:54:43,590 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] [2019-12-07 11:54:43,590 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:54:43,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:54:43,591 INFO L82 PathProgramCache]: Analyzing trace with hash -853821492, now seen corresponding path program 2 times [2019-12-07 11:54:43,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:54:43,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545101933] [2019-12-07 11:54:43,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:54:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:54:43,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:54:43,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545101933] [2019-12-07 11:54:43,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:54:43,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:54:43,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638996511] [2019-12-07 11:54:43,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:54:43,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:54:43,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:54:43,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:54:43,645 INFO L87 Difference]: Start difference. First operand 11401 states and 27789 transitions. Second operand 7 states. [2019-12-07 11:54:43,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:54:43,715 INFO L93 Difference]: Finished difference Result 9735 states and 24046 transitions. [2019-12-07 11:54:43,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:54:43,715 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-07 11:54:43,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:54:43,716 INFO L225 Difference]: With dead ends: 9735 [2019-12-07 11:54:43,716 INFO L226 Difference]: Without dead ends: 575 [2019-12-07 11:54:43,716 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:54:43,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2019-12-07 11:54:43,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2019-12-07 11:54:43,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-12-07 11:54:43,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1247 transitions. [2019-12-07 11:54:43,721 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1247 transitions. Word has length 50 [2019-12-07 11:54:43,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:54:43,721 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 1247 transitions. [2019-12-07 11:54:43,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:54:43,721 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1247 transitions. [2019-12-07 11:54:43,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 11:54:43,721 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:54:43,722 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, 1, 1, 1, 1, 1, 1] [2019-12-07 11:54:43,722 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:54:43,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:54:43,722 INFO L82 PathProgramCache]: Analyzing trace with hash -888097270, now seen corresponding path program 1 times [2019-12-07 11:54:43,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:54:43,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563686601] [2019-12-07 11:54:43,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:54:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:54:43,859 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:54:43,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563686601] [2019-12-07 11:54:43,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:54:43,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 11:54:43,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269037007] [2019-12-07 11:54:43,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 11:54:43,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:54:43,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 11:54:43,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:54:43,860 INFO L87 Difference]: Start difference. First operand 575 states and 1247 transitions. Second operand 12 states. [2019-12-07 11:54:44,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:54:44,308 INFO L93 Difference]: Finished difference Result 997 states and 2126 transitions. [2019-12-07 11:54:44,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 11:54:44,309 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-07 11:54:44,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:54:44,309 INFO L225 Difference]: With dead ends: 997 [2019-12-07 11:54:44,309 INFO L226 Difference]: Without dead ends: 682 [2019-12-07 11:54:44,310 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2019-12-07 11:54:44,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-12-07 11:54:44,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 636. [2019-12-07 11:54:44,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-12-07 11:54:44,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 1339 transitions. [2019-12-07 11:54:44,315 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 1339 transitions. Word has length 66 [2019-12-07 11:54:44,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:54:44,315 INFO L462 AbstractCegarLoop]: Abstraction has 636 states and 1339 transitions. [2019-12-07 11:54:44,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 11:54:44,315 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 1339 transitions. [2019-12-07 11:54:44,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 11:54:44,315 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:54:44,315 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, 1, 1, 1, 1, 1, 1] [2019-12-07 11:54:44,316 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:54:44,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:54:44,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1740782390, now seen corresponding path program 2 times [2019-12-07 11:54:44,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:54:44,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073806268] [2019-12-07 11:54:44,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:54:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:54:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:54:44,397 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:54:44,397 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:54:44,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1057] [1057] ULTIMATE.startENTRY-->L854: Formula: (let ((.cse0 (store |v_#valid_122| 0 0))) (and (= v_~z$r_buff1_thd2~0_128 0) (= 0 v_~z$flush_delayed~0_241) (= v_~z$r_buff0_thd1~0_60 0) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_6| 0) (= v_~z$w_buff1_used~0_546 0) (= 0 v_~__unbuffered_p3_EAX~0_92) (= v_~__unbuffered_cnt~0_193 0) (= v_~z$read_delayed~0_6 0) (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t237~0.base_70| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t237~0.base_70|) |v_ULTIMATE.start_main_~#t237~0.offset_44| 0))) (= v_~z$r_buff1_thd0~0_247 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$w_buff0~0_267 0) (= 0 v_~__unbuffered_p2_EAX~0_115) (= v_~main$tmp_guard0~0_28 0) (= 0 v_~z$r_buff1_thd4~0_282) (= (store .cse0 |v_ULTIMATE.start_main_~#t237~0.base_70| 1) |v_#valid_120|) (= 0 |v_ULTIMATE.start_main_~#t237~0.offset_44|) (= 0 |v_#NULL.base_6|) (= v_~z$r_buff0_thd2~0_59 0) (= 0 v_~__unbuffered_p3_EBX~0_87) (= v_~y~0_120 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t237~0.base_70|) (= v_~z$r_buff1_thd1~0_131 0) (= v_~z$w_buff0_used~0_794 0) (< 0 |v_#StackHeapBarrier_20|) (= v_~a~0_35 0) (= v_~z$r_buff0_thd0~0_129 0) (= v_~z~0_291 0) (= v_~x~0_99 0) (= 0 v_~z$r_buff0_thd3~0_336) (= 0 v_~z$r_buff1_thd3~0_316) (= 0 v_~z$r_buff0_thd4~0_443) (= v_~weak$$choice2~0_248 0) (= 0 v_~z$mem_tmp~0_180) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t237~0.base_70|)) (= 0 v_~weak$$choice0~0_170) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t237~0.base_70| 4)) (= v_~main$tmp_guard1~0_88 0) (= v_~z$w_buff1~0_199 0) (= v_~__unbuffered_p2_EBX~0_117 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_122|, #memory_int=|v_#memory_int_24|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_128, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_171|, ULTIMATE.start_main_~#t239~0.base=|v_ULTIMATE.start_main_~#t239~0.base_24|, ~a~0=v_~a~0_35, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_129, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_443, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_92, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_115, ULTIMATE.start_main_~#t240~0.offset=|v_ULTIMATE.start_main_~#t240~0.offset_18|, ULTIMATE.start_main_~#t238~0.offset=|v_ULTIMATE.start_main_~#t238~0.offset_37|, ULTIMATE.start_main_~#t237~0.base=|v_ULTIMATE.start_main_~#t237~0.base_70|, ~z$mem_tmp~0=v_~z$mem_tmp~0_180, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_117, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_546, ~z$flush_delayed~0=v_~z$flush_delayed~0_241, ULTIMATE.start_main_~#t237~0.offset=|v_ULTIMATE.start_main_~#t237~0.offset_44|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_28|, ~weak$$choice0~0=v_~weak$$choice0~0_170, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_150|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_131, ~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_336, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_193, ~x~0=v_~x~0_99, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_282, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_15|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_199, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_88, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_247, ULTIMATE.start_main_~#t238~0.base=|v_ULTIMATE.start_main_~#t238~0.base_62|, ~y~0=v_~y~0_120, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_59, ULTIMATE.start_main_~#t240~0.base=|v_ULTIMATE.start_main_~#t240~0.base_24|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_794, ~z$w_buff0~0=v_~z$w_buff0~0_267, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_316, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_48|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_87, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t239~0.offset=|v_ULTIMATE.start_main_~#t239~0.offset_18|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_174|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_45|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_45|, #valid=|v_#valid_120|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_291, ~weak$$choice2~0=v_~weak$$choice2~0_248, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_60} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_~#t239~0.base, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t240~0.offset, ULTIMATE.start_main_~#t238~0.offset, ULTIMATE.start_main_~#t237~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t237~0.offset, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t238~0.base, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t240~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_~#t239~0.offset, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 11:54:44,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] L854-1-->L856: Formula: (and (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t238~0.base_11|) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t238~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t238~0.base_11|) |v_ULTIMATE.start_main_~#t238~0.offset_10| 1))) (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t238~0.base_11| 1)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t238~0.base_11| 4)) (= 0 |v_ULTIMATE.start_main_~#t238~0.offset_10|) (not (= 0 |v_ULTIMATE.start_main_~#t238~0.base_11|)) (= (select |v_#valid_51| |v_ULTIMATE.start_main_~#t238~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, ULTIMATE.start_main_~#t238~0.base=|v_ULTIMATE.start_main_~#t238~0.base_11|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_15|, #length=|v_#length_21|, ULTIMATE.start_main_~#t238~0.offset=|v_ULTIMATE.start_main_~#t238~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t238~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t238~0.offset] because there is no mapped edge [2019-12-07 11:54:44,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] L856-1-->L858: Formula: (and (= (store |v_#valid_53| |v_ULTIMATE.start_main_~#t239~0.base_13| 1) |v_#valid_52|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t239~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t239~0.offset_11|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t239~0.base_13| 4) |v_#length_23|) (not (= |v_ULTIMATE.start_main_~#t239~0.base_13| 0)) (= 0 (select |v_#valid_53| |v_ULTIMATE.start_main_~#t239~0.base_13|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t239~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t239~0.base_13|) |v_ULTIMATE.start_main_~#t239~0.offset_11| 2)) |v_#memory_int_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_52|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_17|, #length=|v_#length_23|, ULTIMATE.start_main_~#t239~0.base=|v_ULTIMATE.start_main_~#t239~0.base_13|, ULTIMATE.start_main_~#t239~0.offset=|v_ULTIMATE.start_main_~#t239~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t239~0.base, ULTIMATE.start_main_~#t239~0.offset] because there is no mapped edge [2019-12-07 11:54:44,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L858-1-->L860: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t240~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t240~0.base_10|) |v_ULTIMATE.start_main_~#t240~0.offset_9| 3)) |v_#memory_int_11|) (not (= |v_ULTIMATE.start_main_~#t240~0.base_10| 0)) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t240~0.base_10| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t240~0.base_10|) (= (select |v_#valid_38| |v_ULTIMATE.start_main_~#t240~0.base_10|) 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t240~0.base_10| 4)) (= |v_ULTIMATE.start_main_~#t240~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, ULTIMATE.start_main_~#t240~0.base=|v_ULTIMATE.start_main_~#t240~0.base_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t240~0.offset=|v_ULTIMATE.start_main_~#t240~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t240~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t240~0.offset] because there is no mapped edge [2019-12-07 11:54:44,402 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] P3ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0~0_33 v_~z$w_buff1~0_25) (= (ite (not (and (not (= (mod v_~z$w_buff0_used~0_103 256) 0)) (not (= (mod v_~z$w_buff1_used~0_58 256) 0)))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_8|) (= |v_P3Thread1of1ForFork2_#in~arg.offset_10| v_P3Thread1of1ForFork2_~arg.offset_8) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_10 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_8|) (= v_~z$w_buff0_used~0_104 v_~z$w_buff1_used~0_58) (= v_~z$w_buff0_used~0_103 1) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_10 0)) (= v_P3Thread1of1ForFork2_~arg.base_8 |v_P3Thread1of1ForFork2_#in~arg.base_10|) (= 1 v_~z$w_buff0~0_32)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~z$w_buff0~0=v_~z$w_buff0~0_33, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_10|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_10|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_10, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_8, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_103, ~z$w_buff0~0=v_~z$w_buff0~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_58, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_10|, ~z$w_buff1~0=v_~z$w_buff1~0_25, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_8|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_8, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_10|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 11:54:44,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L816-2-->L816-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-713371497 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-713371497 256) 0))) (or (and (= |P3Thread1of1ForFork2_#t~ite28_Out-713371497| ~z$w_buff1~0_In-713371497) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P3Thread1of1ForFork2_#t~ite28_Out-713371497| ~z$w_buff0~0_In-713371497)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-713371497, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-713371497, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-713371497, ~z$w_buff1~0=~z$w_buff1~0_In-713371497} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-713371497|, ~z$w_buff0~0=~z$w_buff0~0_In-713371497, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-713371497, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-713371497, ~z$w_buff1~0=~z$w_buff1~0_In-713371497} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 11:54:44,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [909] [909] L816-4-->L817: Formula: (= v_~z~0_22 |v_P3Thread1of1ForFork2_#t~ite28_10|) InVars {P3Thread1of1ForFork2_#t~ite28=|v_P3Thread1of1ForFork2_#t~ite28_10|} OutVars{P3Thread1of1ForFork2_#t~ite29=|v_P3Thread1of1ForFork2_#t~ite29_5|, P3Thread1of1ForFork2_#t~ite28=|v_P3Thread1of1ForFork2_#t~ite28_9|, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28, ~z~0] because there is no mapped edge [2019-12-07 11:54:44,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L821-->L822: Formula: (and (= v_~z$r_buff0_thd4~0_68 v_~z$r_buff0_thd4~0_67) (not (= (mod v_~weak$$choice2~0_34 256) 0))) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_34} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_6|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_7|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_34} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 11:54:44,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-898058860 256)))) (or (and .cse0 (= ~z~0_In-898058860 |P3Thread1of1ForFork2_#t~ite48_Out-898058860|)) (and (= ~z$mem_tmp~0_In-898058860 |P3Thread1of1ForFork2_#t~ite48_Out-898058860|) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-898058860, ~z$flush_delayed~0=~z$flush_delayed~0_In-898058860, ~z~0=~z~0_In-898058860} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-898058860, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out-898058860|, ~z$flush_delayed~0=~z$flush_delayed~0_In-898058860, ~z~0=~z~0_In-898058860} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 11:54:44,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= v_P0Thread1of1ForFork3_~arg.base_6 |v_P0Thread1of1ForFork3_#in~arg.base_8|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_8| v_P0Thread1of1ForFork3_~arg.offset_6) (= v_~a~0_12 1) (= (+ v_~__unbuffered_cnt~0_86 1) v_~__unbuffered_cnt~0_85) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_~x~0_28 1)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_8|} OutVars{~a~0=v_~a~0_12, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_8|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_6, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_6, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_8|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-07 11:54:44,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] P1ENTRY-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= v_~x~0_25 2) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_P1Thread1of1ForFork0_~arg.offset_7 |v_P1Thread1of1ForFork0_#in~arg.offset_9|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~y~0_51 1) (= v_P1Thread1of1ForFork0_~arg.base_7 |v_P1Thread1of1ForFork0_#in~arg.base_9|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_9|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_7, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_7, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_9|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_51, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 11:54:44,414 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In935137078 256)))) (or (and (= ~z$mem_tmp~0_In935137078 |P2Thread1of1ForFork1_#t~ite25_Out935137078|) (not .cse0)) (and (= |P2Thread1of1ForFork1_#t~ite25_Out935137078| ~z~0_In935137078) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In935137078, ~z$flush_delayed~0=~z$flush_delayed~0_In935137078, ~z~0=~z~0_In935137078} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In935137078, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out935137078|, ~z$flush_delayed~0=~z$flush_delayed~0_In935137078, ~z~0=~z~0_In935137078} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 11:54:44,414 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1029] [1029] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83) (= v_~z~0_173 |v_P2Thread1of1ForFork1_#t~ite25_50|) (= 0 v_~z$flush_delayed~0_183)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_50|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_49|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, ~z$flush_delayed~0=v_~z$flush_delayed~0_183, ~z~0=v_~z~0_173, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 11:54:44,414 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L832-->L832-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-639155486 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-639155486 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork2_#t~ite51_Out-639155486|)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-639155486 |P3Thread1of1ForFork2_#t~ite51_Out-639155486|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-639155486, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-639155486} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out-639155486|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-639155486, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-639155486} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 11:54:44,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L833-->L833-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd4~0_In362123591 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In362123591 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd4~0_In362123591 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In362123591 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In362123591 |P3Thread1of1ForFork2_#t~ite52_Out362123591|)) (and (= 0 |P3Thread1of1ForFork2_#t~ite52_Out362123591|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In362123591, ~z$w_buff0_used~0=~z$w_buff0_used~0_In362123591, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In362123591, ~z$w_buff1_used~0=~z$w_buff1_used~0_In362123591} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out362123591|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In362123591, ~z$w_buff0_used~0=~z$w_buff0_used~0_In362123591, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In362123591, ~z$w_buff1_used~0=~z$w_buff1_used~0_In362123591} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 11:54:44,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L834-->L835: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In528024381 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In528024381 256) 0)) (.cse2 (= ~z$r_buff0_thd4~0_Out528024381 ~z$r_buff0_thd4~0_In528024381))) (or (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd4~0_Out528024381 0)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In528024381, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In528024381} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out528024381|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In528024381, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out528024381} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 11:54:44,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L835-->L835-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In822724018 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In822724018 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd4~0_In822724018 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In822724018 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork2_#t~ite54_Out822724018|)) (and (= |P3Thread1of1ForFork2_#t~ite54_Out822724018| ~z$r_buff1_thd4~0_In822724018) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In822724018, ~z$w_buff0_used~0=~z$w_buff0_used~0_In822724018, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In822724018, ~z$w_buff1_used~0=~z$w_buff1_used~0_In822724018} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out822724018|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In822724018, ~z$w_buff0_used~0=~z$w_buff0_used~0_In822724018, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In822724018, ~z$w_buff1_used~0=~z$w_buff1_used~0_In822724018} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 11:54:44,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1026] [1026] L835-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= |v_P3Thread1of1ForFork2_#t~ite54_28| v_~z$r_buff1_thd4~0_234) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_27|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_234, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 11:54:44,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L864-->L866-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_175 256)) (= (mod v_~z$r_buff0_thd0~0_16 256) 0)) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_175, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_175, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 11:54:44,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L866-2-->L866-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-932703876 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-932703876 256)))) (or (and (= ~z$w_buff1~0_In-932703876 |ULTIMATE.start_main_#t~ite59_Out-932703876|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite59_Out-932703876| ~z~0_In-932703876)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-932703876, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-932703876, ~z$w_buff1~0=~z$w_buff1~0_In-932703876, ~z~0=~z~0_In-932703876} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-932703876, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-932703876, ~z$w_buff1~0=~z$w_buff1~0_In-932703876, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-932703876|, ~z~0=~z~0_In-932703876} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 11:54:44,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L866-4-->L867: Formula: (= v_~z~0_76 |v_ULTIMATE.start_main_#t~ite59_14|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_14|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_10|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_13|, ~z~0=v_~z~0_76} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 11:54:44,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L867-->L867-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1784486272 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1784486272 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite61_Out-1784486272|)) (and (= ~z$w_buff0_used~0_In-1784486272 |ULTIMATE.start_main_#t~ite61_Out-1784486272|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1784486272, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1784486272} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1784486272, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1784486272|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1784486272} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 11:54:44,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [998] [998] L868-->L868-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1107340835 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1107340835 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1107340835 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1107340835 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite62_Out1107340835|)) (and (= |ULTIMATE.start_main_#t~ite62_Out1107340835| ~z$w_buff1_used~0_In1107340835) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1107340835, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1107340835, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1107340835, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1107340835} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1107340835|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1107340835, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1107340835, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1107340835, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1107340835} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 11:54:44,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L869-->L869-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1753251188 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1753251188 256)))) (or (and (= ~z$r_buff0_thd0~0_In-1753251188 |ULTIMATE.start_main_#t~ite63_Out-1753251188|) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite63_Out-1753251188| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1753251188, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1753251188} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1753251188|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1753251188, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1753251188} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 11:54:44,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L870-->L870-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In69350462 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In69350462 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In69350462 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In69350462 256)))) (or (and (= |ULTIMATE.start_main_#t~ite64_Out69350462| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite64_Out69350462| ~z$r_buff1_thd0~0_In69350462) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In69350462, ~z$w_buff0_used~0=~z$w_buff0_used~0_In69350462, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In69350462, ~z$w_buff1_used~0=~z$w_buff1_used~0_In69350462} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In69350462, ~z$w_buff0_used~0=~z$w_buff0_used~0_In69350462, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In69350462, ~z$w_buff1_used~0=~z$w_buff1_used~0_In69350462, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out69350462|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 11:54:44,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1048] [1048] L870-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= v_~x~0_57 2) (= v_~__unbuffered_p2_EBX~0_70 0) (= 2 v_~__unbuffered_p2_EAX~0_76) (= 0 v_~__unbuffered_p3_EBX~0_50) (= v_~y~0_81 2) (= 1 v_~__unbuffered_p3_EAX~0_55))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_46) (= v_ULTIMATE.start___VERIFIER_assert_~expression_27 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_19|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_19| (mod v_~main$tmp_guard1~0_46 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_27 0) (= v_~z$r_buff1_thd0~0_198 |v_ULTIMATE.start_main_#t~ite64_91|)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_70, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_55, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_76, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_50, ~y~0=v_~y~0_81, ~x~0=v_~x~0_57, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_91|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_27, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_70, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_198, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_55, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_46, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_76, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_50, ~y~0=v_~y~0_81, ~x~0=v_~x~0_57, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_90|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_19|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:54:44,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:54:44 BasicIcfg [2019-12-07 11:54:44,489 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:54:44,490 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:54:44,490 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:54:44,490 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:54:44,490 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:51:46" (3/4) ... [2019-12-07 11:54:44,492 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 11:54:44,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1057] [1057] ULTIMATE.startENTRY-->L854: Formula: (let ((.cse0 (store |v_#valid_122| 0 0))) (and (= v_~z$r_buff1_thd2~0_128 0) (= 0 v_~z$flush_delayed~0_241) (= v_~z$r_buff0_thd1~0_60 0) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_6| 0) (= v_~z$w_buff1_used~0_546 0) (= 0 v_~__unbuffered_p3_EAX~0_92) (= v_~__unbuffered_cnt~0_193 0) (= v_~z$read_delayed~0_6 0) (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t237~0.base_70| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t237~0.base_70|) |v_ULTIMATE.start_main_~#t237~0.offset_44| 0))) (= v_~z$r_buff1_thd0~0_247 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$w_buff0~0_267 0) (= 0 v_~__unbuffered_p2_EAX~0_115) (= v_~main$tmp_guard0~0_28 0) (= 0 v_~z$r_buff1_thd4~0_282) (= (store .cse0 |v_ULTIMATE.start_main_~#t237~0.base_70| 1) |v_#valid_120|) (= 0 |v_ULTIMATE.start_main_~#t237~0.offset_44|) (= 0 |v_#NULL.base_6|) (= v_~z$r_buff0_thd2~0_59 0) (= 0 v_~__unbuffered_p3_EBX~0_87) (= v_~y~0_120 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t237~0.base_70|) (= v_~z$r_buff1_thd1~0_131 0) (= v_~z$w_buff0_used~0_794 0) (< 0 |v_#StackHeapBarrier_20|) (= v_~a~0_35 0) (= v_~z$r_buff0_thd0~0_129 0) (= v_~z~0_291 0) (= v_~x~0_99 0) (= 0 v_~z$r_buff0_thd3~0_336) (= 0 v_~z$r_buff1_thd3~0_316) (= 0 v_~z$r_buff0_thd4~0_443) (= v_~weak$$choice2~0_248 0) (= 0 v_~z$mem_tmp~0_180) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t237~0.base_70|)) (= 0 v_~weak$$choice0~0_170) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t237~0.base_70| 4)) (= v_~main$tmp_guard1~0_88 0) (= v_~z$w_buff1~0_199 0) (= v_~__unbuffered_p2_EBX~0_117 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_122|, #memory_int=|v_#memory_int_24|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_128, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_171|, ULTIMATE.start_main_~#t239~0.base=|v_ULTIMATE.start_main_~#t239~0.base_24|, ~a~0=v_~a~0_35, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_129, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_443, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_92, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_115, ULTIMATE.start_main_~#t240~0.offset=|v_ULTIMATE.start_main_~#t240~0.offset_18|, ULTIMATE.start_main_~#t238~0.offset=|v_ULTIMATE.start_main_~#t238~0.offset_37|, ULTIMATE.start_main_~#t237~0.base=|v_ULTIMATE.start_main_~#t237~0.base_70|, ~z$mem_tmp~0=v_~z$mem_tmp~0_180, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_117, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_546, ~z$flush_delayed~0=v_~z$flush_delayed~0_241, ULTIMATE.start_main_~#t237~0.offset=|v_ULTIMATE.start_main_~#t237~0.offset_44|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_28|, ~weak$$choice0~0=v_~weak$$choice0~0_170, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_150|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_131, ~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_336, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_193, ~x~0=v_~x~0_99, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_282, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_15|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_199, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_88, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_247, ULTIMATE.start_main_~#t238~0.base=|v_ULTIMATE.start_main_~#t238~0.base_62|, ~y~0=v_~y~0_120, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_59, ULTIMATE.start_main_~#t240~0.base=|v_ULTIMATE.start_main_~#t240~0.base_24|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_794, ~z$w_buff0~0=v_~z$w_buff0~0_267, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_316, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_48|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_87, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t239~0.offset=|v_ULTIMATE.start_main_~#t239~0.offset_18|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_174|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_45|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_45|, #valid=|v_#valid_120|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_291, ~weak$$choice2~0=v_~weak$$choice2~0_248, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_60} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_~#t239~0.base, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t240~0.offset, ULTIMATE.start_main_~#t238~0.offset, ULTIMATE.start_main_~#t237~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t237~0.offset, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t238~0.base, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t240~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_~#t239~0.offset, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 11:54:44,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] L854-1-->L856: Formula: (and (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t238~0.base_11|) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t238~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t238~0.base_11|) |v_ULTIMATE.start_main_~#t238~0.offset_10| 1))) (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t238~0.base_11| 1)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t238~0.base_11| 4)) (= 0 |v_ULTIMATE.start_main_~#t238~0.offset_10|) (not (= 0 |v_ULTIMATE.start_main_~#t238~0.base_11|)) (= (select |v_#valid_51| |v_ULTIMATE.start_main_~#t238~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, ULTIMATE.start_main_~#t238~0.base=|v_ULTIMATE.start_main_~#t238~0.base_11|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_15|, #length=|v_#length_21|, ULTIMATE.start_main_~#t238~0.offset=|v_ULTIMATE.start_main_~#t238~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t238~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t238~0.offset] because there is no mapped edge [2019-12-07 11:54:44,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] L856-1-->L858: Formula: (and (= (store |v_#valid_53| |v_ULTIMATE.start_main_~#t239~0.base_13| 1) |v_#valid_52|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t239~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t239~0.offset_11|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t239~0.base_13| 4) |v_#length_23|) (not (= |v_ULTIMATE.start_main_~#t239~0.base_13| 0)) (= 0 (select |v_#valid_53| |v_ULTIMATE.start_main_~#t239~0.base_13|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t239~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t239~0.base_13|) |v_ULTIMATE.start_main_~#t239~0.offset_11| 2)) |v_#memory_int_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_52|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_17|, #length=|v_#length_23|, ULTIMATE.start_main_~#t239~0.base=|v_ULTIMATE.start_main_~#t239~0.base_13|, ULTIMATE.start_main_~#t239~0.offset=|v_ULTIMATE.start_main_~#t239~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t239~0.base, ULTIMATE.start_main_~#t239~0.offset] because there is no mapped edge [2019-12-07 11:54:44,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L858-1-->L860: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t240~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t240~0.base_10|) |v_ULTIMATE.start_main_~#t240~0.offset_9| 3)) |v_#memory_int_11|) (not (= |v_ULTIMATE.start_main_~#t240~0.base_10| 0)) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t240~0.base_10| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t240~0.base_10|) (= (select |v_#valid_38| |v_ULTIMATE.start_main_~#t240~0.base_10|) 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t240~0.base_10| 4)) (= |v_ULTIMATE.start_main_~#t240~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, ULTIMATE.start_main_~#t240~0.base=|v_ULTIMATE.start_main_~#t240~0.base_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t240~0.offset=|v_ULTIMATE.start_main_~#t240~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t240~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t240~0.offset] because there is no mapped edge [2019-12-07 11:54:44,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] P3ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0~0_33 v_~z$w_buff1~0_25) (= (ite (not (and (not (= (mod v_~z$w_buff0_used~0_103 256) 0)) (not (= (mod v_~z$w_buff1_used~0_58 256) 0)))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_8|) (= |v_P3Thread1of1ForFork2_#in~arg.offset_10| v_P3Thread1of1ForFork2_~arg.offset_8) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_10 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_8|) (= v_~z$w_buff0_used~0_104 v_~z$w_buff1_used~0_58) (= v_~z$w_buff0_used~0_103 1) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_10 0)) (= v_P3Thread1of1ForFork2_~arg.base_8 |v_P3Thread1of1ForFork2_#in~arg.base_10|) (= 1 v_~z$w_buff0~0_32)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~z$w_buff0~0=v_~z$w_buff0~0_33, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_10|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_10|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_10, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_8, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_103, ~z$w_buff0~0=v_~z$w_buff0~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_58, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_10|, ~z$w_buff1~0=v_~z$w_buff1~0_25, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_8|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_8, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_10|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 11:54:44,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L816-2-->L816-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-713371497 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-713371497 256) 0))) (or (and (= |P3Thread1of1ForFork2_#t~ite28_Out-713371497| ~z$w_buff1~0_In-713371497) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P3Thread1of1ForFork2_#t~ite28_Out-713371497| ~z$w_buff0~0_In-713371497)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-713371497, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-713371497, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-713371497, ~z$w_buff1~0=~z$w_buff1~0_In-713371497} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-713371497|, ~z$w_buff0~0=~z$w_buff0~0_In-713371497, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-713371497, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-713371497, ~z$w_buff1~0=~z$w_buff1~0_In-713371497} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 11:54:44,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [909] [909] L816-4-->L817: Formula: (= v_~z~0_22 |v_P3Thread1of1ForFork2_#t~ite28_10|) InVars {P3Thread1of1ForFork2_#t~ite28=|v_P3Thread1of1ForFork2_#t~ite28_10|} OutVars{P3Thread1of1ForFork2_#t~ite29=|v_P3Thread1of1ForFork2_#t~ite29_5|, P3Thread1of1ForFork2_#t~ite28=|v_P3Thread1of1ForFork2_#t~ite28_9|, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28, ~z~0] because there is no mapped edge [2019-12-07 11:54:44,497 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L821-->L822: Formula: (and (= v_~z$r_buff0_thd4~0_68 v_~z$r_buff0_thd4~0_67) (not (= (mod v_~weak$$choice2~0_34 256) 0))) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_34} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_6|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_7|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_34} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 11:54:44,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-898058860 256)))) (or (and .cse0 (= ~z~0_In-898058860 |P3Thread1of1ForFork2_#t~ite48_Out-898058860|)) (and (= ~z$mem_tmp~0_In-898058860 |P3Thread1of1ForFork2_#t~ite48_Out-898058860|) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-898058860, ~z$flush_delayed~0=~z$flush_delayed~0_In-898058860, ~z~0=~z~0_In-898058860} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-898058860, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out-898058860|, ~z$flush_delayed~0=~z$flush_delayed~0_In-898058860, ~z~0=~z~0_In-898058860} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 11:54:44,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= v_P0Thread1of1ForFork3_~arg.base_6 |v_P0Thread1of1ForFork3_#in~arg.base_8|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_8| v_P0Thread1of1ForFork3_~arg.offset_6) (= v_~a~0_12 1) (= (+ v_~__unbuffered_cnt~0_86 1) v_~__unbuffered_cnt~0_85) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_~x~0_28 1)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_8|} OutVars{~a~0=v_~a~0_12, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_8|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_6, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_6, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_8|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-07 11:54:44,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] P1ENTRY-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= v_~x~0_25 2) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_P1Thread1of1ForFork0_~arg.offset_7 |v_P1Thread1of1ForFork0_#in~arg.offset_9|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~y~0_51 1) (= v_P1Thread1of1ForFork0_~arg.base_7 |v_P1Thread1of1ForFork0_#in~arg.base_9|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_9|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_7, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_7, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_9|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_51, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 11:54:44,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In935137078 256)))) (or (and (= ~z$mem_tmp~0_In935137078 |P2Thread1of1ForFork1_#t~ite25_Out935137078|) (not .cse0)) (and (= |P2Thread1of1ForFork1_#t~ite25_Out935137078| ~z~0_In935137078) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In935137078, ~z$flush_delayed~0=~z$flush_delayed~0_In935137078, ~z~0=~z~0_In935137078} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In935137078, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out935137078|, ~z$flush_delayed~0=~z$flush_delayed~0_In935137078, ~z~0=~z~0_In935137078} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 11:54:44,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1029] [1029] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83) (= v_~z~0_173 |v_P2Thread1of1ForFork1_#t~ite25_50|) (= 0 v_~z$flush_delayed~0_183)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_50|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_49|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, ~z$flush_delayed~0=v_~z$flush_delayed~0_183, ~z~0=v_~z~0_173, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 11:54:44,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L832-->L832-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-639155486 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-639155486 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork2_#t~ite51_Out-639155486|)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-639155486 |P3Thread1of1ForFork2_#t~ite51_Out-639155486|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-639155486, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-639155486} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out-639155486|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-639155486, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-639155486} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 11:54:44,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L833-->L833-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd4~0_In362123591 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In362123591 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd4~0_In362123591 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In362123591 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In362123591 |P3Thread1of1ForFork2_#t~ite52_Out362123591|)) (and (= 0 |P3Thread1of1ForFork2_#t~ite52_Out362123591|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In362123591, ~z$w_buff0_used~0=~z$w_buff0_used~0_In362123591, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In362123591, ~z$w_buff1_used~0=~z$w_buff1_used~0_In362123591} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out362123591|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In362123591, ~z$w_buff0_used~0=~z$w_buff0_used~0_In362123591, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In362123591, ~z$w_buff1_used~0=~z$w_buff1_used~0_In362123591} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 11:54:44,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L834-->L835: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In528024381 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In528024381 256) 0)) (.cse2 (= ~z$r_buff0_thd4~0_Out528024381 ~z$r_buff0_thd4~0_In528024381))) (or (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd4~0_Out528024381 0)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In528024381, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In528024381} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out528024381|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In528024381, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out528024381} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 11:54:44,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L835-->L835-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In822724018 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In822724018 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd4~0_In822724018 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In822724018 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork2_#t~ite54_Out822724018|)) (and (= |P3Thread1of1ForFork2_#t~ite54_Out822724018| ~z$r_buff1_thd4~0_In822724018) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In822724018, ~z$w_buff0_used~0=~z$w_buff0_used~0_In822724018, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In822724018, ~z$w_buff1_used~0=~z$w_buff1_used~0_In822724018} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out822724018|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In822724018, ~z$w_buff0_used~0=~z$w_buff0_used~0_In822724018, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In822724018, ~z$w_buff1_used~0=~z$w_buff1_used~0_In822724018} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 11:54:44,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1026] [1026] L835-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= |v_P3Thread1of1ForFork2_#t~ite54_28| v_~z$r_buff1_thd4~0_234) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_27|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_234, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 11:54:44,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L864-->L866-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_175 256)) (= (mod v_~z$r_buff0_thd0~0_16 256) 0)) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_175, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_175, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 11:54:44,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L866-2-->L866-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-932703876 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-932703876 256)))) (or (and (= ~z$w_buff1~0_In-932703876 |ULTIMATE.start_main_#t~ite59_Out-932703876|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite59_Out-932703876| ~z~0_In-932703876)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-932703876, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-932703876, ~z$w_buff1~0=~z$w_buff1~0_In-932703876, ~z~0=~z~0_In-932703876} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-932703876, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-932703876, ~z$w_buff1~0=~z$w_buff1~0_In-932703876, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-932703876|, ~z~0=~z~0_In-932703876} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 11:54:44,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L866-4-->L867: Formula: (= v_~z~0_76 |v_ULTIMATE.start_main_#t~ite59_14|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_14|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_10|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_13|, ~z~0=v_~z~0_76} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 11:54:44,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L867-->L867-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1784486272 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1784486272 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite61_Out-1784486272|)) (and (= ~z$w_buff0_used~0_In-1784486272 |ULTIMATE.start_main_#t~ite61_Out-1784486272|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1784486272, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1784486272} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1784486272, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1784486272|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1784486272} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 11:54:44,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [998] [998] L868-->L868-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1107340835 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1107340835 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1107340835 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1107340835 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite62_Out1107340835|)) (and (= |ULTIMATE.start_main_#t~ite62_Out1107340835| ~z$w_buff1_used~0_In1107340835) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1107340835, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1107340835, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1107340835, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1107340835} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1107340835|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1107340835, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1107340835, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1107340835, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1107340835} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 11:54:44,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L869-->L869-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1753251188 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1753251188 256)))) (or (and (= ~z$r_buff0_thd0~0_In-1753251188 |ULTIMATE.start_main_#t~ite63_Out-1753251188|) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite63_Out-1753251188| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1753251188, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1753251188} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1753251188|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1753251188, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1753251188} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 11:54:44,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L870-->L870-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In69350462 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In69350462 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In69350462 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In69350462 256)))) (or (and (= |ULTIMATE.start_main_#t~ite64_Out69350462| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite64_Out69350462| ~z$r_buff1_thd0~0_In69350462) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In69350462, ~z$w_buff0_used~0=~z$w_buff0_used~0_In69350462, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In69350462, ~z$w_buff1_used~0=~z$w_buff1_used~0_In69350462} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In69350462, ~z$w_buff0_used~0=~z$w_buff0_used~0_In69350462, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In69350462, ~z$w_buff1_used~0=~z$w_buff1_used~0_In69350462, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out69350462|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 11:54:44,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1048] [1048] L870-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= v_~x~0_57 2) (= v_~__unbuffered_p2_EBX~0_70 0) (= 2 v_~__unbuffered_p2_EAX~0_76) (= 0 v_~__unbuffered_p3_EBX~0_50) (= v_~y~0_81 2) (= 1 v_~__unbuffered_p3_EAX~0_55))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_46) (= v_ULTIMATE.start___VERIFIER_assert_~expression_27 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_19|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_19| (mod v_~main$tmp_guard1~0_46 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_27 0) (= v_~z$r_buff1_thd0~0_198 |v_ULTIMATE.start_main_#t~ite64_91|)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_70, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_55, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_76, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_50, ~y~0=v_~y~0_81, ~x~0=v_~x~0_57, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_91|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_27, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_70, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_198, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_55, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_46, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_76, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_50, ~y~0=v_~y~0_81, ~x~0=v_~x~0_57, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_90|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_19|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:54:44,577 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_930a2e76-8395-4e01-8bea-52a1c8e0ebbe/bin/uautomizer/witness.graphml [2019-12-07 11:54:44,577 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:54:44,579 INFO L168 Benchmark]: Toolchain (without parser) took 178623.22 ms. Allocated memory was 1.0 GB in the beginning and 8.8 GB in the end (delta: 7.8 GB). Free memory was 934.4 MB in the beginning and 6.6 GB in the end (delta: -5.6 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2019-12-07 11:54:44,579 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:54:44,579 INFO L168 Benchmark]: CACSL2BoogieTranslator took 423.80 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -117.6 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 11:54:44,579 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.20 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:54:44,579 INFO L168 Benchmark]: Boogie Preprocessor took 27.32 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:54:44,580 INFO L168 Benchmark]: RCFGBuilder took 448.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 986.0 MB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. [2019-12-07 11:54:44,580 INFO L168 Benchmark]: TraceAbstraction took 177593.42 ms. Allocated memory was 1.1 GB in the beginning and 8.8 GB in the end (delta: 7.7 GB). Free memory was 986.0 MB in the beginning and 6.6 GB in the end (delta: -5.6 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2019-12-07 11:54:44,580 INFO L168 Benchmark]: Witness Printer took 87.88 ms. Allocated memory is still 8.8 GB. Free memory was 6.6 GB in the beginning and 6.6 GB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. [2019-12-07 11:54:44,582 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 423.80 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -117.6 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.20 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. * Boogie Preprocessor took 27.32 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 448.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 986.0 MB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 177593.42 ms. Allocated memory was 1.1 GB in the beginning and 8.8 GB in the end (delta: 7.7 GB). Free memory was 986.0 MB in the beginning and 6.6 GB in the end (delta: -5.6 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. * Witness Printer took 87.88 ms. Allocated memory is still 8.8 GB. Free memory was 6.6 GB in the beginning and 6.6 GB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 211 ProgramPointsBefore, 113 ProgramPointsAfterwards, 254 TransitionsBefore, 134 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 51 ConcurrentYvCompositions, 27 ChoiceCompositions, 10992 VarBasedMoverChecksPositive, 301 VarBasedMoverChecksNegative, 70 SemBasedMoverChecksPositive, 323 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 0 MoverChecksTotal, 147708 CheckedPairsTotal, 132 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L854] FCALL, FORK 0 pthread_create(&t237, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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] [L856] FCALL, FORK 0 pthread_create(&t238, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0: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] [L858] FCALL, FORK 0 pthread_create(&t239, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0: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] [L860] FCALL, FORK 0 pthread_create(&t240, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0: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] [L804] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L805] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L806] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L807] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L808] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L809] 4 z$r_buff0_thd4 = (_Bool)1 [L812] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 4 z$flush_delayed = weak$$choice2 [L815] 4 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L818] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L819] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L820] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L822] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L823] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] 4 z = z$flush_delayed ? z$mem_tmp : z [L825] 4 z$flush_delayed = (_Bool)0 [L828] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L831] 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 [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 y = 2 [L771] 3 __unbuffered_p2_EAX = y [L774] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 3 z$flush_delayed = weak$$choice2 [L777] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L779] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L780] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L781] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L782] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L783] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L784] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L785] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L831] 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) [L832] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L833] 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 [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L867] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L868] 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 [L869] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 199 locations, 2 error locations. Result: UNSAFE, OverallTime: 177.4s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 43.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6038 SDtfs, 8286 SDslu, 14530 SDs, 0 SdLazy, 5701 SolverSat, 362 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 194 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=323911occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 118.6s AutomataMinimizationTime, 22 MinimizatonAttempts, 938717 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 746 NumberOfCodeBlocks, 746 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 658 ConstructedInterpolants, 0 QuantifiedInterpolants, 159156 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...