./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix021_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_925c1cd4-f982-4d5f-bd99-97e0141c17d7/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_925c1cd4-f982-4d5f-bd99-97e0141c17d7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_925c1cd4-f982-4d5f-bd99-97e0141c17d7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_925c1cd4-f982-4d5f-bd99-97e0141c17d7/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix021_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_925c1cd4-f982-4d5f-bd99-97e0141c17d7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_925c1cd4-f982-4d5f-bd99-97e0141c17d7/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 c4218459792f9e183ef699cd6d12894d6969673e ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 13:28:54,273 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:28:54,274 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:28:54,282 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:28:54,282 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:28:54,282 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:28:54,283 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:28:54,285 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:28:54,286 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:28:54,286 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:28:54,287 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:28:54,288 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:28:54,288 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:28:54,289 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:28:54,289 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:28:54,290 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:28:54,291 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:28:54,291 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:28:54,293 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:28:54,294 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:28:54,295 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:28:54,296 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:28:54,297 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:28:54,297 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:28:54,299 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:28:54,299 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:28:54,299 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:28:54,300 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:28:54,300 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:28:54,300 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:28:54,301 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:28:54,301 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:28:54,301 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:28:54,302 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:28:54,302 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:28:54,303 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:28:54,303 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:28:54,303 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:28:54,303 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:28:54,304 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:28:54,304 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:28:54,304 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_925c1cd4-f982-4d5f-bd99-97e0141c17d7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 13:28:54,314 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:28:54,314 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:28:54,314 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:28:54,315 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:28:54,315 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 13:28:54,315 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:28:54,315 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:28:54,315 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:28:54,315 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:28:54,315 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:28:54,315 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:28:54,315 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:28:54,316 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:28:54,316 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:28:54,316 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:28:54,316 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:28:54,316 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:28:54,316 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:28:54,316 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 13:28:54,316 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:28:54,316 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:28:54,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:28:54,317 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:28:54,317 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:28:54,317 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:28:54,317 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 13:28:54,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:28:54,317 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:28:54,317 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:28:54,317 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_925c1cd4-f982-4d5f-bd99-97e0141c17d7/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 -> c4218459792f9e183ef699cd6d12894d6969673e [2019-12-07 13:28:54,416 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:28:54,424 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:28:54,427 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:28:54,428 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:28:54,428 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:28:54,429 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_925c1cd4-f982-4d5f-bd99-97e0141c17d7/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix021_tso.opt.i [2019-12-07 13:28:54,467 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_925c1cd4-f982-4d5f-bd99-97e0141c17d7/bin/uautomizer/data/ca5cc9f89/4bda60a5cde9489e99130905008f046d/FLAG4da98e166 [2019-12-07 13:28:54,972 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:28:54,972 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_925c1cd4-f982-4d5f-bd99-97e0141c17d7/sv-benchmarks/c/pthread-wmm/mix021_tso.opt.i [2019-12-07 13:28:54,982 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_925c1cd4-f982-4d5f-bd99-97e0141c17d7/bin/uautomizer/data/ca5cc9f89/4bda60a5cde9489e99130905008f046d/FLAG4da98e166 [2019-12-07 13:28:54,991 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_925c1cd4-f982-4d5f-bd99-97e0141c17d7/bin/uautomizer/data/ca5cc9f89/4bda60a5cde9489e99130905008f046d [2019-12-07 13:28:54,993 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:28:54,994 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:28:54,994 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:28:54,994 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:28:54,996 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:28:54,997 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:28:54" (1/1) ... [2019-12-07 13:28:54,999 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bd599a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:28:54, skipping insertion in model container [2019-12-07 13:28:54,999 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:28:54" (1/1) ... [2019-12-07 13:28:55,004 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:28:55,045 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:28:55,304 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:28:55,311 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:28:55,356 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:28:55,401 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:28:55,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:28:55 WrapperNode [2019-12-07 13:28:55,402 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:28:55,402 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:28:55,402 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:28:55,402 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:28:55,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:28:55" (1/1) ... [2019-12-07 13:28:55,422 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:28:55" (1/1) ... [2019-12-07 13:28:55,444 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:28:55,444 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:28:55,444 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:28:55,444 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:28:55,451 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:28:55" (1/1) ... [2019-12-07 13:28:55,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:28:55" (1/1) ... [2019-12-07 13:28:55,456 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:28:55" (1/1) ... [2019-12-07 13:28:55,456 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:28:55" (1/1) ... [2019-12-07 13:28:55,467 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:28:55" (1/1) ... [2019-12-07 13:28:55,471 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:28:55" (1/1) ... [2019-12-07 13:28:55,473 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:28:55" (1/1) ... [2019-12-07 13:28:55,477 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:28:55,477 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:28:55,477 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:28:55,477 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:28:55,478 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:28:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_925c1cd4-f982-4d5f-bd99-97e0141c17d7/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:28:55,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 13:28:55,523 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 13:28:55,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 13:28:55,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:28:55,523 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 13:28:55,523 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 13:28:55,523 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 13:28:55,523 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 13:28:55,524 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 13:28:55,524 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 13:28:55,524 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 13:28:55,524 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 13:28:55,524 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 13:28:55,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:28:55,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:28:55,526 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 13:28:55,936 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:28:55,937 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 13:28:55,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:28:55 BoogieIcfgContainer [2019-12-07 13:28:55,937 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:28:55,938 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:28:55,938 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:28:55,940 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:28:55,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:28:54" (1/3) ... [2019-12-07 13:28:55,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f331f42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:28:55, skipping insertion in model container [2019-12-07 13:28:55,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:28:55" (2/3) ... [2019-12-07 13:28:55,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f331f42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:28:55, skipping insertion in model container [2019-12-07 13:28:55,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:28:55" (3/3) ... [2019-12-07 13:28:55,942 INFO L109 eAbstractionObserver]: Analyzing ICFG mix021_tso.opt.i [2019-12-07 13:28:55,948 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 13:28:55,948 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:28:55,953 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 13:28:55,953 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 13:28:55,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,982 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,982 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,983 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,983 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,984 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,984 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:55,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,001 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,001 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,001 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,001 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,001 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,001 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,001 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,002 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,002 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,002 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,002 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,002 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,002 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,003 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,003 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,003 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,003 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,003 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,003 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,004 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,004 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,004 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,004 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,004 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,004 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,005 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,005 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,005 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,005 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,005 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,005 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,006 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,006 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,006 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,006 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,006 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,006 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,007 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,007 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,007 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,007 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,007 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,007 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,008 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,008 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,008 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,008 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,008 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,008 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,008 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,009 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,009 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,009 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,009 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,009 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,009 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,010 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,010 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,010 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,010 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,010 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,010 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,010 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,011 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,011 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,011 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,011 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,011 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,011 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,012 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,012 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,012 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,012 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,012 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,012 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,013 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,013 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,013 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,013 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,013 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,013 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,014 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,014 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,014 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,014 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,014 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,014 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,014 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,015 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,015 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,015 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,015 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,015 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,015 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,016 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,016 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,016 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,016 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,016 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,016 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,016 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,017 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,017 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,017 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,017 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,017 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,017 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,017 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,018 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,018 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,018 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,018 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,018 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,018 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,019 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,019 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,019 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,019 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,019 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,019 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,020 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,020 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:28:56,033 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 13:28:56,046 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:28:56,046 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:28:56,046 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:28:56,046 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:28:56,046 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:28:56,046 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:28:56,046 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:28:56,046 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:28:56,058 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 210 places, 253 transitions [2019-12-07 13:28:56,060 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 210 places, 253 transitions [2019-12-07 13:28:56,134 INFO L134 PetriNetUnfolder]: 56/249 cut-off events. [2019-12-07 13:28:56,134 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:28:56,146 INFO L76 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 249 events. 56/249 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 925 event pairs. 12/203 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 13:28:56,169 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 210 places, 253 transitions [2019-12-07 13:28:56,208 INFO L134 PetriNetUnfolder]: 56/249 cut-off events. [2019-12-07 13:28:56,208 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:28:56,217 INFO L76 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 249 events. 56/249 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 925 event pairs. 12/203 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 13:28:56,242 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-07 13:28:56,243 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 13:28:59,917 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-12-07 13:29:00,170 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-07 13:29:00,297 INFO L206 etLargeBlockEncoding]: Checked pairs total: 146481 [2019-12-07 13:29:00,297 INFO L214 etLargeBlockEncoding]: Total number of compositions: 131 [2019-12-07 13:29:00,299 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 115 places, 135 transitions [2019-12-07 13:29:08,813 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 93550 states. [2019-12-07 13:29:08,814 INFO L276 IsEmpty]: Start isEmpty. Operand 93550 states. [2019-12-07 13:29:08,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 13:29:08,819 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:29:08,819 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:29:08,820 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:29:08,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:29:08,823 INFO L82 PathProgramCache]: Analyzing trace with hash 155254263, now seen corresponding path program 1 times [2019-12-07 13:29:08,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:29:08,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214199734] [2019-12-07 13:29:08,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:29:08,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:29:08,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:29:08,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214199734] [2019-12-07 13:29:08,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:29:08,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:29:08,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99087590] [2019-12-07 13:29:08,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:29:08,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:29:08,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:29:08,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:29:08,997 INFO L87 Difference]: Start difference. First operand 93550 states. Second operand 3 states. [2019-12-07 13:29:09,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:29:09,746 INFO L93 Difference]: Finished difference Result 92966 states and 426320 transitions. [2019-12-07 13:29:09,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:29:09,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 13:29:09,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:29:10,275 INFO L225 Difference]: With dead ends: 92966 [2019-12-07 13:29:10,275 INFO L226 Difference]: Without dead ends: 86602 [2019-12-07 13:29:10,276 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:29:11,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86602 states. [2019-12-07 13:29:13,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86602 to 86602. [2019-12-07 13:29:13,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86602 states. [2019-12-07 13:29:15,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86602 states to 86602 states and 396876 transitions. [2019-12-07 13:29:15,178 INFO L78 Accepts]: Start accepts. Automaton has 86602 states and 396876 transitions. Word has length 9 [2019-12-07 13:29:15,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:29:15,179 INFO L462 AbstractCegarLoop]: Abstraction has 86602 states and 396876 transitions. [2019-12-07 13:29:15,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:29:15,179 INFO L276 IsEmpty]: Start isEmpty. Operand 86602 states and 396876 transitions. [2019-12-07 13:29:15,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 13:29:15,184 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:29:15,184 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:29:15,184 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:29:15,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:29:15,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1923219547, now seen corresponding path program 1 times [2019-12-07 13:29:15,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:29:15,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456776393] [2019-12-07 13:29:15,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:29:15,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:29:15,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:29:15,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456776393] [2019-12-07 13:29:15,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:29:15,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:29:15,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091210539] [2019-12-07 13:29:15,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:29:15,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:29:15,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:29:15,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:29:15,247 INFO L87 Difference]: Start difference. First operand 86602 states and 396876 transitions. Second operand 4 states. [2019-12-07 13:29:16,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:29:16,183 INFO L93 Difference]: Finished difference Result 138074 states and 610572 transitions. [2019-12-07 13:29:16,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:29:16,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 13:29:16,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:29:16,583 INFO L225 Difference]: With dead ends: 138074 [2019-12-07 13:29:16,584 INFO L226 Difference]: Without dead ends: 138002 [2019-12-07 13:29:16,584 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:29:18,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138002 states. [2019-12-07 13:29:20,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138002 to 133994. [2019-12-07 13:29:20,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133994 states. [2019-12-07 13:29:21,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133994 states to 133994 states and 595808 transitions. [2019-12-07 13:29:21,061 INFO L78 Accepts]: Start accepts. Automaton has 133994 states and 595808 transitions. Word has length 15 [2019-12-07 13:29:21,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:29:21,062 INFO L462 AbstractCegarLoop]: Abstraction has 133994 states and 595808 transitions. [2019-12-07 13:29:21,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:29:21,062 INFO L276 IsEmpty]: Start isEmpty. Operand 133994 states and 595808 transitions. [2019-12-07 13:29:21,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 13:29:21,069 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:29:21,069 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:29:21,069 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:29:21,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:29:21,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1961000002, now seen corresponding path program 1 times [2019-12-07 13:29:21,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:29:21,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944285948] [2019-12-07 13:29:21,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:29:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:29:21,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:29:21,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944285948] [2019-12-07 13:29:21,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:29:21,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:29:21,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430818766] [2019-12-07 13:29:21,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:29:21,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:29:21,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:29:21,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:29:21,128 INFO L87 Difference]: Start difference. First operand 133994 states and 595808 transitions. Second operand 4 states. [2019-12-07 13:29:22,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:29:22,116 INFO L93 Difference]: Finished difference Result 171690 states and 753612 transitions. [2019-12-07 13:29:22,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:29:22,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 13:29:22,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:29:22,584 INFO L225 Difference]: With dead ends: 171690 [2019-12-07 13:29:22,584 INFO L226 Difference]: Without dead ends: 171630 [2019-12-07 13:29:22,584 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:29:26,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171630 states. [2019-12-07 13:29:28,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171630 to 153202. [2019-12-07 13:29:28,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153202 states. [2019-12-07 13:29:28,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153202 states to 153202 states and 678068 transitions. [2019-12-07 13:29:28,941 INFO L78 Accepts]: Start accepts. Automaton has 153202 states and 678068 transitions. Word has length 18 [2019-12-07 13:29:28,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:29:28,941 INFO L462 AbstractCegarLoop]: Abstraction has 153202 states and 678068 transitions. [2019-12-07 13:29:28,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:29:28,941 INFO L276 IsEmpty]: Start isEmpty. Operand 153202 states and 678068 transitions. [2019-12-07 13:29:28,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 13:29:28,949 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:29:28,949 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 13:29:28,950 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:29:28,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:29:28,950 INFO L82 PathProgramCache]: Analyzing trace with hash 661487434, now seen corresponding path program 1 times [2019-12-07 13:29:28,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:29:28,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908875653] [2019-12-07 13:29:28,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:29:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:29:28,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:29:28,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908875653] [2019-12-07 13:29:28,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:29:28,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:29:28,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364969568] [2019-12-07 13:29:28,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:29:28,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:29:28,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:29:28,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:29:28,978 INFO L87 Difference]: Start difference. First operand 153202 states and 678068 transitions. Second operand 3 states. [2019-12-07 13:29:30,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:29:30,706 INFO L93 Difference]: Finished difference Result 255766 states and 1092468 transitions. [2019-12-07 13:29:30,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:29:30,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 13:29:30,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:29:31,448 INFO L225 Difference]: With dead ends: 255766 [2019-12-07 13:29:31,448 INFO L226 Difference]: Without dead ends: 255766 [2019-12-07 13:29:31,449 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:29:33,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255766 states. [2019-12-07 13:29:39,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255766 to 227670. [2019-12-07 13:29:39,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227670 states. [2019-12-07 13:29:40,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227670 states to 227670 states and 984460 transitions. [2019-12-07 13:29:40,591 INFO L78 Accepts]: Start accepts. Automaton has 227670 states and 984460 transitions. Word has length 19 [2019-12-07 13:29:40,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:29:40,591 INFO L462 AbstractCegarLoop]: Abstraction has 227670 states and 984460 transitions. [2019-12-07 13:29:40,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:29:40,592 INFO L276 IsEmpty]: Start isEmpty. Operand 227670 states and 984460 transitions. [2019-12-07 13:29:40,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 13:29:40,605 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:29:40,606 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:29:40,606 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:29:40,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:29:40,606 INFO L82 PathProgramCache]: Analyzing trace with hash 301900253, now seen corresponding path program 1 times [2019-12-07 13:29:40,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:29:40,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854583133] [2019-12-07 13:29:40,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:29:40,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:29:40,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:29:40,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854583133] [2019-12-07 13:29:40,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:29:40,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:29:40,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130691713] [2019-12-07 13:29:40,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:29:40,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:29:40,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:29:40,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:29:40,672 INFO L87 Difference]: Start difference. First operand 227670 states and 984460 transitions. Second operand 3 states. [2019-12-07 13:29:42,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:29:42,303 INFO L93 Difference]: Finished difference Result 227670 states and 973664 transitions. [2019-12-07 13:29:42,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:29:42,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 13:29:42,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:29:42,950 INFO L225 Difference]: With dead ends: 227670 [2019-12-07 13:29:42,951 INFO L226 Difference]: Without dead ends: 227670 [2019-12-07 13:29:42,951 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:29:45,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227670 states. [2019-12-07 13:29:51,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227670 to 225646. [2019-12-07 13:29:51,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225646 states. [2019-12-07 13:29:52,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225646 states to 225646 states and 965864 transitions. [2019-12-07 13:29:52,173 INFO L78 Accepts]: Start accepts. Automaton has 225646 states and 965864 transitions. Word has length 20 [2019-12-07 13:29:52,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:29:52,173 INFO L462 AbstractCegarLoop]: Abstraction has 225646 states and 965864 transitions. [2019-12-07 13:29:52,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:29:52,174 INFO L276 IsEmpty]: Start isEmpty. Operand 225646 states and 965864 transitions. [2019-12-07 13:29:52,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 13:29:52,182 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:29:52,183 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:29:52,183 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:29:52,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:29:52,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1488828346, now seen corresponding path program 1 times [2019-12-07 13:29:52,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:29:52,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795862714] [2019-12-07 13:29:52,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:29:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:29:52,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:29:52,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795862714] [2019-12-07 13:29:52,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:29:52,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:29:52,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322936354] [2019-12-07 13:29:52,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:29:52,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:29:52,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:29:52,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:29:52,250 INFO L87 Difference]: Start difference. First operand 225646 states and 965864 transitions. Second operand 3 states. [2019-12-07 13:29:54,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:29:54,119 INFO L93 Difference]: Finished difference Result 392289 states and 1609867 transitions. [2019-12-07 13:29:54,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:29:54,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 13:29:54,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:29:55,894 INFO L225 Difference]: With dead ends: 392289 [2019-12-07 13:29:55,894 INFO L226 Difference]: Without dead ends: 390867 [2019-12-07 13:29:55,894 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:29:58,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390867 states. [2019-12-07 13:30:08,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390867 to 376641. [2019-12-07 13:30:08,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376641 states. [2019-12-07 13:30:09,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376641 states to 376641 states and 1560668 transitions. [2019-12-07 13:30:09,703 INFO L78 Accepts]: Start accepts. Automaton has 376641 states and 1560668 transitions. Word has length 20 [2019-12-07 13:30:09,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:09,703 INFO L462 AbstractCegarLoop]: Abstraction has 376641 states and 1560668 transitions. [2019-12-07 13:30:09,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:30:09,704 INFO L276 IsEmpty]: Start isEmpty. Operand 376641 states and 1560668 transitions. [2019-12-07 13:30:09,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 13:30:09,724 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:09,724 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:30:09,724 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:30:09,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:09,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1251839182, now seen corresponding path program 1 times [2019-12-07 13:30:09,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:09,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574165267] [2019-12-07 13:30:09,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:09,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:09,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:30:09,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574165267] [2019-12-07 13:30:09,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:09,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:30:09,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467855606] [2019-12-07 13:30:09,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:30:09,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:09,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:30:09,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:30:09,755 INFO L87 Difference]: Start difference. First operand 376641 states and 1560668 transitions. Second operand 4 states. [2019-12-07 13:30:12,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:12,774 INFO L93 Difference]: Finished difference Result 465181 states and 1907392 transitions. [2019-12-07 13:30:12,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:30:12,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 13:30:12,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:14,121 INFO L225 Difference]: With dead ends: 465181 [2019-12-07 13:30:14,121 INFO L226 Difference]: Without dead ends: 465109 [2019-12-07 13:30:14,121 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:30:21,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465109 states. [2019-12-07 13:30:27,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465109 to 381324. [2019-12-07 13:30:27,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381324 states. [2019-12-07 13:30:29,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381324 states to 381324 states and 1579994 transitions. [2019-12-07 13:30:29,485 INFO L78 Accepts]: Start accepts. Automaton has 381324 states and 1579994 transitions. Word has length 21 [2019-12-07 13:30:29,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:29,485 INFO L462 AbstractCegarLoop]: Abstraction has 381324 states and 1579994 transitions. [2019-12-07 13:30:29,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:30:29,485 INFO L276 IsEmpty]: Start isEmpty. Operand 381324 states and 1579994 transitions. [2019-12-07 13:30:29,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 13:30:29,506 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:29,506 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:30:29,506 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:30:29,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:29,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1027281216, now seen corresponding path program 1 times [2019-12-07 13:30:29,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:29,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222125903] [2019-12-07 13:30:29,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:29,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:29,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:30:29,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222125903] [2019-12-07 13:30:29,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:29,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:30:29,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101726568] [2019-12-07 13:30:29,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:30:29,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:29,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:30:29,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:30:29,566 INFO L87 Difference]: Start difference. First operand 381324 states and 1579994 transitions. Second operand 4 states. [2019-12-07 13:30:32,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:32,149 INFO L93 Difference]: Finished difference Result 381504 states and 1566191 transitions. [2019-12-07 13:30:32,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:30:32,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 13:30:32,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:33,169 INFO L225 Difference]: With dead ends: 381504 [2019-12-07 13:30:33,169 INFO L226 Difference]: Without dead ends: 381030 [2019-12-07 13:30:33,169 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 13:30:36,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381030 states. [2019-12-07 13:30:45,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381030 to 376114. [2019-12-07 13:30:45,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376114 states. [2019-12-07 13:30:47,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376114 states to 376114 states and 1552929 transitions. [2019-12-07 13:30:47,241 INFO L78 Accepts]: Start accepts. Automaton has 376114 states and 1552929 transitions. Word has length 21 [2019-12-07 13:30:47,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:47,241 INFO L462 AbstractCegarLoop]: Abstraction has 376114 states and 1552929 transitions. [2019-12-07 13:30:47,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:30:47,241 INFO L276 IsEmpty]: Start isEmpty. Operand 376114 states and 1552929 transitions. [2019-12-07 13:30:47,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 13:30:47,264 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:47,264 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:30:47,264 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:30:47,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:47,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1200590819, now seen corresponding path program 1 times [2019-12-07 13:30:47,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:47,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585960840] [2019-12-07 13:30:47,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:47,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:47,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:30:47,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585960840] [2019-12-07 13:30:47,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:47,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:30:47,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209601963] [2019-12-07 13:30:47,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:30:47,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:47,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:30:47,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:30:47,297 INFO L87 Difference]: Start difference. First operand 376114 states and 1552929 transitions. Second operand 4 states. [2019-12-07 13:30:47,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:47,801 INFO L93 Difference]: Finished difference Result 127287 states and 424553 transitions. [2019-12-07 13:30:47,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:30:47,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-07 13:30:47,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:48,050 INFO L225 Difference]: With dead ends: 127287 [2019-12-07 13:30:48,051 INFO L226 Difference]: Without dead ends: 127287 [2019-12-07 13:30:48,051 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:30:48,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127287 states. [2019-12-07 13:30:50,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127287 to 122927. [2019-12-07 13:30:50,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122927 states. [2019-12-07 13:30:50,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122927 states to 122927 states and 409209 transitions. [2019-12-07 13:30:50,836 INFO L78 Accepts]: Start accepts. Automaton has 122927 states and 409209 transitions. Word has length 22 [2019-12-07 13:30:50,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:50,836 INFO L462 AbstractCegarLoop]: Abstraction has 122927 states and 409209 transitions. [2019-12-07 13:30:50,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:30:50,836 INFO L276 IsEmpty]: Start isEmpty. Operand 122927 states and 409209 transitions. [2019-12-07 13:30:50,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 13:30:50,845 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:50,845 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] [2019-12-07 13:30:50,845 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:30:50,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:50,845 INFO L82 PathProgramCache]: Analyzing trace with hash 608760049, now seen corresponding path program 1 times [2019-12-07 13:30:50,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:50,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346025236] [2019-12-07 13:30:50,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:50,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:50,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:30:50,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346025236] [2019-12-07 13:30:50,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:50,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:30:50,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645922115] [2019-12-07 13:30:50,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:30:50,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:50,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:30:50,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:30:50,875 INFO L87 Difference]: Start difference. First operand 122927 states and 409209 transitions. Second operand 5 states. [2019-12-07 13:30:50,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:50,955 INFO L93 Difference]: Finished difference Result 23109 states and 70515 transitions. [2019-12-07 13:30:50,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:30:50,955 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-07 13:30:50,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:50,983 INFO L225 Difference]: With dead ends: 23109 [2019-12-07 13:30:50,983 INFO L226 Difference]: Without dead ends: 23109 [2019-12-07 13:30:50,984 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:30:51,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23109 states. [2019-12-07 13:30:51,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23109 to 18549. [2019-12-07 13:30:51,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18549 states. [2019-12-07 13:30:51,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18549 states to 18549 states and 57419 transitions. [2019-12-07 13:30:51,256 INFO L78 Accepts]: Start accepts. Automaton has 18549 states and 57419 transitions. Word has length 23 [2019-12-07 13:30:51,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:51,256 INFO L462 AbstractCegarLoop]: Abstraction has 18549 states and 57419 transitions. [2019-12-07 13:30:51,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:30:51,256 INFO L276 IsEmpty]: Start isEmpty. Operand 18549 states and 57419 transitions. [2019-12-07 13:30:51,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 13:30:51,269 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:51,269 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] [2019-12-07 13:30:51,269 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:30:51,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:51,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1657235238, now seen corresponding path program 1 times [2019-12-07 13:30:51,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:51,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625937292] [2019-12-07 13:30:51,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:51,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:30:51,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625937292] [2019-12-07 13:30:51,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:51,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:30:51,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698148616] [2019-12-07 13:30:51,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:30:51,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:51,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:30:51,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:30:51,316 INFO L87 Difference]: Start difference. First operand 18549 states and 57419 transitions. Second operand 5 states. [2019-12-07 13:30:51,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:51,598 INFO L93 Difference]: Finished difference Result 24583 states and 73609 transitions. [2019-12-07 13:30:51,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:30:51,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-07 13:30:51,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:51,632 INFO L225 Difference]: With dead ends: 24583 [2019-12-07 13:30:51,632 INFO L226 Difference]: Without dead ends: 24582 [2019-12-07 13:30:51,632 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:30:51,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24582 states. [2019-12-07 13:30:52,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24582 to 22952. [2019-12-07 13:30:52,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22952 states. [2019-12-07 13:30:52,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22952 states to 22952 states and 69832 transitions. [2019-12-07 13:30:52,078 INFO L78 Accepts]: Start accepts. Automaton has 22952 states and 69832 transitions. Word has length 34 [2019-12-07 13:30:52,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:52,078 INFO L462 AbstractCegarLoop]: Abstraction has 22952 states and 69832 transitions. [2019-12-07 13:30:52,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:30:52,079 INFO L276 IsEmpty]: Start isEmpty. Operand 22952 states and 69832 transitions. [2019-12-07 13:30:52,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 13:30:52,094 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:52,094 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 13:30:52,094 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:30:52,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:52,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1227997864, now seen corresponding path program 1 times [2019-12-07 13:30:52,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:52,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970893140] [2019-12-07 13:30:52,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:52,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:30:52,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970893140] [2019-12-07 13:30:52,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:52,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:30:52,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348626635] [2019-12-07 13:30:52,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:30:52,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:52,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:30:52,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:30:52,123 INFO L87 Difference]: Start difference. First operand 22952 states and 69832 transitions. Second operand 3 states. [2019-12-07 13:30:52,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:52,234 INFO L93 Difference]: Finished difference Result 24115 states and 69458 transitions. [2019-12-07 13:30:52,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:30:52,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-12-07 13:30:52,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:52,261 INFO L225 Difference]: With dead ends: 24115 [2019-12-07 13:30:52,261 INFO L226 Difference]: Without dead ends: 24115 [2019-12-07 13:30:52,262 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:30:52,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24115 states. [2019-12-07 13:30:52,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24115 to 22954. [2019-12-07 13:30:52,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22954 states. [2019-12-07 13:30:52,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22954 states to 22954 states and 66772 transitions. [2019-12-07 13:30:52,554 INFO L78 Accepts]: Start accepts. Automaton has 22954 states and 66772 transitions. Word has length 37 [2019-12-07 13:30:52,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:52,554 INFO L462 AbstractCegarLoop]: Abstraction has 22954 states and 66772 transitions. [2019-12-07 13:30:52,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:30:52,554 INFO L276 IsEmpty]: Start isEmpty. Operand 22954 states and 66772 transitions. [2019-12-07 13:30:52,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 13:30:52,571 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:52,571 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:30:52,571 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:30:52,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:52,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1861511259, now seen corresponding path program 1 times [2019-12-07 13:30:52,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:52,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504255307] [2019-12-07 13:30:52,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:52,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:30:52,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504255307] [2019-12-07 13:30:52,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:52,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:30:52,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231764435] [2019-12-07 13:30:52,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:30:52,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:52,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:30:52,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:30:52,618 INFO L87 Difference]: Start difference. First operand 22954 states and 66772 transitions. Second operand 6 states. [2019-12-07 13:30:52,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:52,697 INFO L93 Difference]: Finished difference Result 18136 states and 56327 transitions. [2019-12-07 13:30:52,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:30:52,698 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-07 13:30:52,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:52,720 INFO L225 Difference]: With dead ends: 18136 [2019-12-07 13:30:52,720 INFO L226 Difference]: Without dead ends: 18058 [2019-12-07 13:30:52,720 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:30:52,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18058 states. [2019-12-07 13:30:52,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18058 to 14413. [2019-12-07 13:30:52,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14413 states. [2019-12-07 13:30:52,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14413 states to 14413 states and 46705 transitions. [2019-12-07 13:30:52,942 INFO L78 Accepts]: Start accepts. Automaton has 14413 states and 46705 transitions. Word has length 39 [2019-12-07 13:30:52,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:52,942 INFO L462 AbstractCegarLoop]: Abstraction has 14413 states and 46705 transitions. [2019-12-07 13:30:52,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:30:52,943 INFO L276 IsEmpty]: Start isEmpty. Operand 14413 states and 46705 transitions. [2019-12-07 13:30:52,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 13:30:52,957 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:52,957 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] [2019-12-07 13:30:52,957 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:30:52,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:52,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1839454534, now seen corresponding path program 1 times [2019-12-07 13:30:52,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:52,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207610480] [2019-12-07 13:30:52,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:52,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:53,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:30:53,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207610480] [2019-12-07 13:30:53,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:53,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:30:53,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727651255] [2019-12-07 13:30:53,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:30:53,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:53,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:30:53,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:30:53,025 INFO L87 Difference]: Start difference. First operand 14413 states and 46705 transitions. Second operand 4 states. [2019-12-07 13:30:53,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:53,113 INFO L93 Difference]: Finished difference Result 24177 states and 75346 transitions. [2019-12-07 13:30:53,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:30:53,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 13:30:53,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:53,142 INFO L225 Difference]: With dead ends: 24177 [2019-12-07 13:30:53,143 INFO L226 Difference]: Without dead ends: 22069 [2019-12-07 13:30:53,143 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:30:53,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22069 states. [2019-12-07 13:30:53,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22069 to 13237. [2019-12-07 13:30:53,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13237 states. [2019-12-07 13:30:53,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13237 states to 13237 states and 42623 transitions. [2019-12-07 13:30:53,372 INFO L78 Accepts]: Start accepts. Automaton has 13237 states and 42623 transitions. Word has length 65 [2019-12-07 13:30:53,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:53,372 INFO L462 AbstractCegarLoop]: Abstraction has 13237 states and 42623 transitions. [2019-12-07 13:30:53,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:30:53,372 INFO L276 IsEmpty]: Start isEmpty. Operand 13237 states and 42623 transitions. [2019-12-07 13:30:53,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 13:30:53,387 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:53,387 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] [2019-12-07 13:30:53,387 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:30:53,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:53,387 INFO L82 PathProgramCache]: Analyzing trace with hash 836099454, now seen corresponding path program 2 times [2019-12-07 13:30:53,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:53,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486223185] [2019-12-07 13:30:53,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:53,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:30:53,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486223185] [2019-12-07 13:30:53,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:53,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:30:53,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647911622] [2019-12-07 13:30:53,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:30:53,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:53,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:30:53,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:30:53,462 INFO L87 Difference]: Start difference. First operand 13237 states and 42623 transitions. Second operand 5 states. [2019-12-07 13:30:53,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:53,551 INFO L93 Difference]: Finished difference Result 23985 states and 73470 transitions. [2019-12-07 13:30:53,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:30:53,552 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-07 13:30:53,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:53,567 INFO L225 Difference]: With dead ends: 23985 [2019-12-07 13:30:53,567 INFO L226 Difference]: Without dead ends: 12701 [2019-12-07 13:30:53,567 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:30:53,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12701 states. [2019-12-07 13:30:53,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12701 to 8511. [2019-12-07 13:30:53,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8511 states. [2019-12-07 13:30:53,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8511 states to 8511 states and 24877 transitions. [2019-12-07 13:30:53,692 INFO L78 Accepts]: Start accepts. Automaton has 8511 states and 24877 transitions. Word has length 65 [2019-12-07 13:30:53,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:53,693 INFO L462 AbstractCegarLoop]: Abstraction has 8511 states and 24877 transitions. [2019-12-07 13:30:53,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:30:53,693 INFO L276 IsEmpty]: Start isEmpty. Operand 8511 states and 24877 transitions. [2019-12-07 13:30:53,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 13:30:53,700 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:53,700 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] [2019-12-07 13:30:53,700 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:30:53,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:53,701 INFO L82 PathProgramCache]: Analyzing trace with hash 302779914, now seen corresponding path program 3 times [2019-12-07 13:30:53,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:53,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956728826] [2019-12-07 13:30:53,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:53,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:30:53,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956728826] [2019-12-07 13:30:53,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:53,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:30:53,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567802036] [2019-12-07 13:30:53,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:30:53,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:53,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:30:53,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:30:53,762 INFO L87 Difference]: Start difference. First operand 8511 states and 24877 transitions. Second operand 4 states. [2019-12-07 13:30:53,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:53,809 INFO L93 Difference]: Finished difference Result 13216 states and 36201 transitions. [2019-12-07 13:30:53,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:30:53,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 13:30:53,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:53,816 INFO L225 Difference]: With dead ends: 13216 [2019-12-07 13:30:53,816 INFO L226 Difference]: Without dead ends: 5684 [2019-12-07 13:30:53,816 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:30:53,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5684 states. [2019-12-07 13:30:53,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5684 to 5216. [2019-12-07 13:30:53,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5216 states. [2019-12-07 13:30:53,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5216 states to 5216 states and 13319 transitions. [2019-12-07 13:30:53,877 INFO L78 Accepts]: Start accepts. Automaton has 5216 states and 13319 transitions. Word has length 65 [2019-12-07 13:30:53,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:53,877 INFO L462 AbstractCegarLoop]: Abstraction has 5216 states and 13319 transitions. [2019-12-07 13:30:53,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:30:53,877 INFO L276 IsEmpty]: Start isEmpty. Operand 5216 states and 13319 transitions. [2019-12-07 13:30:53,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 13:30:53,880 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:53,881 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] [2019-12-07 13:30:53,881 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:30:53,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:53,881 INFO L82 PathProgramCache]: Analyzing trace with hash -48561928, now seen corresponding path program 4 times [2019-12-07 13:30:53,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:53,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480245574] [2019-12-07 13:30:53,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:53,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:53,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:30:53,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480245574] [2019-12-07 13:30:53,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:53,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:30:53,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992918382] [2019-12-07 13:30:53,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:30:53,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:53,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:30:53,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:30:53,941 INFO L87 Difference]: Start difference. First operand 5216 states and 13319 transitions. Second operand 4 states. [2019-12-07 13:30:54,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:54,105 INFO L93 Difference]: Finished difference Result 5603 states and 13993 transitions. [2019-12-07 13:30:54,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:30:54,106 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 13:30:54,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:54,110 INFO L225 Difference]: With dead ends: 5603 [2019-12-07 13:30:54,110 INFO L226 Difference]: Without dead ends: 5603 [2019-12-07 13:30:54,111 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:30:54,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5603 states. [2019-12-07 13:30:54,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5603 to 5483. [2019-12-07 13:30:54,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5483 states. [2019-12-07 13:30:54,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5483 states to 5483 states and 13756 transitions. [2019-12-07 13:30:54,180 INFO L78 Accepts]: Start accepts. Automaton has 5483 states and 13756 transitions. Word has length 65 [2019-12-07 13:30:54,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:54,180 INFO L462 AbstractCegarLoop]: Abstraction has 5483 states and 13756 transitions. [2019-12-07 13:30:54,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:30:54,180 INFO L276 IsEmpty]: Start isEmpty. Operand 5483 states and 13756 transitions. [2019-12-07 13:30:54,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 13:30:54,183 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:54,184 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] [2019-12-07 13:30:54,184 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:30:54,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:54,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1919672036, now seen corresponding path program 5 times [2019-12-07 13:30:54,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:54,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499704829] [2019-12-07 13:30:54,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:54,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:30:54,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499704829] [2019-12-07 13:30:54,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:54,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:30:54,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299341686] [2019-12-07 13:30:54,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:30:54,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:54,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:30:54,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:30:54,243 INFO L87 Difference]: Start difference. First operand 5483 states and 13756 transitions. Second operand 4 states. [2019-12-07 13:30:54,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:54,275 INFO L93 Difference]: Finished difference Result 6466 states and 16323 transitions. [2019-12-07 13:30:54,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:30:54,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 13:30:54,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:54,276 INFO L225 Difference]: With dead ends: 6466 [2019-12-07 13:30:54,276 INFO L226 Difference]: Without dead ends: 599 [2019-12-07 13:30:54,276 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:30:54,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-12-07 13:30:54,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-12-07 13:30:54,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-12-07 13:30:54,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 1226 transitions. [2019-12-07 13:30:54,282 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 1226 transitions. Word has length 65 [2019-12-07 13:30:54,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:54,282 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 1226 transitions. [2019-12-07 13:30:54,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:30:54,282 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 1226 transitions. [2019-12-07 13:30:54,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 13:30:54,283 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:54,283 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 13:30:54,283 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:30:54,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:54,283 INFO L82 PathProgramCache]: Analyzing trace with hash 977277596, now seen corresponding path program 1 times [2019-12-07 13:30:54,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:54,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723931626] [2019-12-07 13:30:54,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:54,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:54,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:30:54,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723931626] [2019-12-07 13:30:54,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:54,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 13:30:54,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352218062] [2019-12-07 13:30:54,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 13:30:54,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:54,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 13:30:54,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-12-07 13:30:54,529 INFO L87 Difference]: Start difference. First operand 599 states and 1226 transitions. Second operand 13 states. [2019-12-07 13:30:55,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:55,635 INFO L93 Difference]: Finished difference Result 1346 states and 2707 transitions. [2019-12-07 13:30:55,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 13:30:55,635 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-12-07 13:30:55,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:55,636 INFO L225 Difference]: With dead ends: 1346 [2019-12-07 13:30:55,636 INFO L226 Difference]: Without dead ends: 754 [2019-12-07 13:30:55,636 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=173, Invalid=757, Unknown=0, NotChecked=0, Total=930 [2019-12-07 13:30:55,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-12-07 13:30:55,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 646. [2019-12-07 13:30:55,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-12-07 13:30:55,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 1315 transitions. [2019-12-07 13:30:55,642 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 1315 transitions. Word has length 66 [2019-12-07 13:30:55,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:55,642 INFO L462 AbstractCegarLoop]: Abstraction has 646 states and 1315 transitions. [2019-12-07 13:30:55,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 13:30:55,642 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 1315 transitions. [2019-12-07 13:30:55,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 13:30:55,643 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:55,643 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 13:30:55,643 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 13:30:55,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:55,643 INFO L82 PathProgramCache]: Analyzing trace with hash 692970332, now seen corresponding path program 2 times [2019-12-07 13:30:55,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:55,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079532423] [2019-12-07 13:30:55,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:55,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:55,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:30:55,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079532423] [2019-12-07 13:30:55,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:55,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 13:30:55,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011230917] [2019-12-07 13:30:55,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 13:30:55,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:55,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 13:30:55,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-12-07 13:30:55,828 INFO L87 Difference]: Start difference. First operand 646 states and 1315 transitions. Second operand 13 states. [2019-12-07 13:30:56,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:56,772 INFO L93 Difference]: Finished difference Result 1173 states and 2344 transitions. [2019-12-07 13:30:56,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 13:30:56,773 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-12-07 13:30:56,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:56,773 INFO L225 Difference]: With dead ends: 1173 [2019-12-07 13:30:56,773 INFO L226 Difference]: Without dead ends: 755 [2019-12-07 13:30:56,774 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=659, Unknown=0, NotChecked=0, Total=812 [2019-12-07 13:30:56,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-12-07 13:30:56,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 647. [2019-12-07 13:30:56,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-12-07 13:30:56,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 1316 transitions. [2019-12-07 13:30:56,779 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 1316 transitions. Word has length 66 [2019-12-07 13:30:56,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:56,779 INFO L462 AbstractCegarLoop]: Abstraction has 647 states and 1316 transitions. [2019-12-07 13:30:56,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 13:30:56,779 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1316 transitions. [2019-12-07 13:30:56,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 13:30:56,780 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:56,780 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 13:30:56,780 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 13:30:56,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:56,780 INFO L82 PathProgramCache]: Analyzing trace with hash -11935942, now seen corresponding path program 3 times [2019-12-07 13:30:56,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:56,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993350325] [2019-12-07 13:30:56,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:56,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:30:56,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993350325] [2019-12-07 13:30:56,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:56,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 13:30:56,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185614952] [2019-12-07 13:30:56,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 13:30:56,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:56,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 13:30:56,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-07 13:30:56,996 INFO L87 Difference]: Start difference. First operand 647 states and 1316 transitions. Second operand 14 states. [2019-12-07 13:30:57,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:57,795 INFO L93 Difference]: Finished difference Result 988 states and 1988 transitions. [2019-12-07 13:30:57,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 13:30:57,796 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2019-12-07 13:30:57,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:57,796 INFO L225 Difference]: With dead ends: 988 [2019-12-07 13:30:57,796 INFO L226 Difference]: Without dead ends: 754 [2019-12-07 13:30:57,797 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=570, Unknown=0, NotChecked=0, Total=702 [2019-12-07 13:30:57,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-12-07 13:30:57,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 646. [2019-12-07 13:30:57,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-12-07 13:30:57,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 1314 transitions. [2019-12-07 13:30:57,802 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 1314 transitions. Word has length 66 [2019-12-07 13:30:57,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:57,802 INFO L462 AbstractCegarLoop]: Abstraction has 646 states and 1314 transitions. [2019-12-07 13:30:57,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 13:30:57,803 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 1314 transitions. [2019-12-07 13:30:57,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 13:30:57,803 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:57,803 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 13:30:57,803 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 13:30:57,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:57,803 INFO L82 PathProgramCache]: Analyzing trace with hash -168593422, now seen corresponding path program 4 times [2019-12-07 13:30:57,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:57,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042072197] [2019-12-07 13:30:57,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:57,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:57,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:30:57,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042072197] [2019-12-07 13:30:57,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:57,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 13:30:57,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986238904] [2019-12-07 13:30:57,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 13:30:57,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:57,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 13:30:57,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:30:57,883 INFO L87 Difference]: Start difference. First operand 646 states and 1314 transitions. Second operand 8 states. [2019-12-07 13:30:58,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:58,057 INFO L93 Difference]: Finished difference Result 1086 states and 2184 transitions. [2019-12-07 13:30:58,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 13:30:58,057 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-07 13:30:58,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:58,058 INFO L225 Difference]: With dead ends: 1086 [2019-12-07 13:30:58,058 INFO L226 Difference]: Without dead ends: 755 [2019-12-07 13:30:58,058 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2019-12-07 13:30:58,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-12-07 13:30:58,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 683. [2019-12-07 13:30:58,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 683 states. [2019-12-07 13:30:58,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 1356 transitions. [2019-12-07 13:30:58,064 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 1356 transitions. Word has length 66 [2019-12-07 13:30:58,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:58,064 INFO L462 AbstractCegarLoop]: Abstraction has 683 states and 1356 transitions. [2019-12-07 13:30:58,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 13:30:58,064 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 1356 transitions. [2019-12-07 13:30:58,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 13:30:58,064 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:58,065 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 13:30:58,065 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 13:30:58,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:58,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1081052920, now seen corresponding path program 5 times [2019-12-07 13:30:58,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:58,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405955465] [2019-12-07 13:30:58,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:30:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:30:58,146 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:30:58,146 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:30:58,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1055] [1055] ULTIMATE.startENTRY-->L849: Formula: (let ((.cse0 (store |v_#valid_92| 0 0))) (and (= 0 v_~x~0_105) (= 0 v_~z$flush_delayed~0_384) (= v_~z$w_buff1_used~0_989 0) (= 0 v_~__unbuffered_p2_EAX~0_146) (= |v_#NULL.offset_7| 0) (= 0 v_~z$mem_tmp~0_347) (= |v_#valid_90| (store .cse0 |v_ULTIMATE.start_main_~#t581~0.base_37| 1)) (= v_~z$r_buff1_thd2~0_303 0) (< 0 |v_#StackHeapBarrier_21|) (= 0 v_~z$r_buff0_thd3~0_515) (= v_~z$r_buff0_thd2~0_71 0) (= v_~__unbuffered_p3_EAX~0_112 0) (= v_~z$w_buff0_used~0_1397 0) (= v_~main$tmp_guard1~0_91 0) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t581~0.base_37| 4)) (= v_~weak$$choice2~0_438 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff0_thd1~0_71 0) (= v_~z$r_buff1_thd0~0_430 0) (= v_~z$r_buff1_thd1~0_299 0) (= 0 v_~weak$$choice0~0_336) (= v_~__unbuffered_cnt~0_142 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t581~0.base_37|) (= v_~z$read_delayed_var~0.base_7 0) (= v_~y~0_119 0) (= v_~z$read_delayed~0_7 0) (= v_~z$w_buff1~0_562 0) (= 0 |v_#NULL.base_7|) (= 0 v_~__unbuffered_p3_EBX~0_93) (= v_~a~0_37 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t581~0.base_37| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t581~0.base_37|) |v_ULTIMATE.start_main_~#t581~0.offset_25| 0)) |v_#memory_int_23|) (= (select .cse0 |v_ULTIMATE.start_main_~#t581~0.base_37|) 0) (= 0 |v_ULTIMATE.start_main_~#t581~0.offset_25|) (= 0 v_~z$r_buff0_thd4~0_677) (= v_~main$tmp_guard0~0_22 0) (= v_~z~0_307 0) (= 0 v_~z$r_buff1_thd4~0_523) (= v_~z$w_buff0~0_773 0) (= v_~z$r_buff0_thd0~0_170 0) (= 0 v_~z$r_buff1_thd3~0_601))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_92|, #memory_int=|v_#memory_int_24|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_10|, ULTIMATE.start_main_~#t581~0.offset=|v_ULTIMATE.start_main_~#t581~0.offset_25|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ULTIMATE.start_main_~#t584~0.offset=|v_ULTIMATE.start_main_~#t584~0.offset_18|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_303, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_184|, ~a~0=v_~a~0_37, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_170, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_677, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_112, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_146, ULTIMATE.start_main_~#t582~0.base=|v_ULTIMATE.start_main_~#t582~0.base_30|, ~z$mem_tmp~0=v_~z$mem_tmp~0_347, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_989, ~z$flush_delayed~0=v_~z$flush_delayed~0_384, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_37|, ~weak$$choice0~0=v_~weak$$choice0~0_336, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_409|, ULTIMATE.start_main_~#t581~0.base=|v_ULTIMATE.start_main_~#t581~0.base_37|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_299, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_515, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_142, ~x~0=v_~x~0_105, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_523, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_21|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_562, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_91, ULTIMATE.start_main_~#t584~0.base=|v_ULTIMATE.start_main_~#t584~0.base_23|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_430, ~y~0=v_~y~0_119, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_71, ULTIMATE.start_main_~#t583~0.base=|v_ULTIMATE.start_main_~#t583~0.base_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1397, ~z$w_buff0~0=v_~z$w_buff0~0_773, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_601, ULTIMATE.start_main_~#t583~0.offset=|v_ULTIMATE.start_main_~#t583~0.offset_18|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_43|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_93, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_45|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_67|, ULTIMATE.start_main_~#t582~0.offset=|v_ULTIMATE.start_main_~#t582~0.offset_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_57|, #valid=|v_#valid_90|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_307, ~weak$$choice2~0=v_~weak$$choice2~0_438, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_71} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t581~0.offset, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t584~0.offset, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t582~0.base, ~z$mem_tmp~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_~#t581~0.base, ~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, ULTIMATE.start_main_~#t584~0.base, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t583~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t583~0.offset, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t582~0.offset, 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 13:30:58,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L849-1-->L851: Formula: (and (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t582~0.base_12| 1)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t582~0.base_12|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t582~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t582~0.base_12|) |v_ULTIMATE.start_main_~#t582~0.offset_10| 1)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t582~0.base_12| 0)) (= 0 |v_ULTIMATE.start_main_~#t582~0.offset_10|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t582~0.base_12| 4) |v_#length_21|) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t582~0.base_12|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_14|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t582~0.offset=|v_ULTIMATE.start_main_~#t582~0.offset_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_main_~#t582~0.base=|v_ULTIMATE.start_main_~#t582~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t582~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t582~0.base] because there is no mapped edge [2019-12-07 13:30:58,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L851-1-->L853: Formula: (and (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t583~0.base_12|)) (not (= 0 |v_ULTIMATE.start_main_~#t583~0.base_12|)) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t583~0.base_12| 1)) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t583~0.base_12| 4) |v_#length_19|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t583~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t583~0.base_12|) |v_ULTIMATE.start_main_~#t583~0.offset_11| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t583~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t583~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t583~0.base=|v_ULTIMATE.start_main_~#t583~0.base_12|, #valid=|v_#valid_42|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t583~0.offset=|v_ULTIMATE.start_main_~#t583~0.offset_11|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t583~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t583~0.offset, #length] because there is no mapped edge [2019-12-07 13:30:58,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L853-1-->L855: Formula: (and (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t584~0.base_13| 1)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t584~0.base_13| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t584~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t584~0.base_13|) |v_ULTIMATE.start_main_~#t584~0.offset_11| 3)) |v_#memory_int_15|) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t584~0.base_13|)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t584~0.base_13|) (= |v_ULTIMATE.start_main_~#t584~0.offset_11| 0) (not (= 0 |v_ULTIMATE.start_main_~#t584~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_6|, ULTIMATE.start_main_~#t584~0.offset=|v_ULTIMATE.start_main_~#t584~0.offset_11|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_15|, #length=|v_#length_23|, ULTIMATE.start_main_~#t584~0.base=|v_ULTIMATE.start_main_~#t584~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t584~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t584~0.base] because there is no mapped edge [2019-12-07 13:30:58,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] P3ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0_used~0_216 v_~z$w_buff1_used~0_129) (= v_~z$w_buff0~0_91 v_~z$w_buff1~0_66) (= v_P3Thread1of1ForFork2_~arg.offset_32 |v_P3Thread1of1ForFork2_#in~arg.offset_34|) (= v_~z$w_buff0_used~0_215 1) (= 1 v_~z$w_buff0~0_90) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_32| (ite (not (and (not (= (mod v_~z$w_buff0_used~0_215 256) 0)) (not (= 0 (mod v_~z$w_buff1_used~0_129 256))))) 1 0)) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_34 0)) (= |v_P3Thread1of1ForFork2_#in~arg.base_34| v_P3Thread1of1ForFork2_~arg.base_32) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_34 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_32|)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_216, ~z$w_buff0~0=v_~z$w_buff0~0_91, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_34|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_34|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_34, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_32, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_215, ~z$w_buff0~0=v_~z$w_buff0~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_129, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_34|, ~z$w_buff1~0=v_~z$w_buff1~0_66, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_32|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_32, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_34|} 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 13:30:58,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L811-2-->L811-5: Formula: (let ((.cse0 (= |P3Thread1of1ForFork2_#t~ite29_Out-1875887580| |P3Thread1of1ForFork2_#t~ite28_Out-1875887580|)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-1875887580 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1875887580 256) 0))) (or (and (= |P3Thread1of1ForFork2_#t~ite28_Out-1875887580| ~z$w_buff1~0_In-1875887580) .cse0 (or .cse1 .cse2)) (and (= |P3Thread1of1ForFork2_#t~ite28_Out-1875887580| ~z$w_buff0~0_In-1875887580) .cse0 (not .cse2) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1875887580, ~z$w_buff0~0=~z$w_buff0~0_In-1875887580, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1875887580, ~z$w_buff1~0=~z$w_buff1~0_In-1875887580} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-1875887580|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-1875887580|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1875887580, ~z$w_buff0~0=~z$w_buff0~0_In-1875887580, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1875887580, ~z$w_buff1~0=~z$w_buff1~0_In-1875887580} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 13:30:58,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L816-->L817: Formula: (and (not (= (mod v_~weak$$choice2~0_78 256) 0)) (= v_~z$r_buff0_thd4~0_135 v_~z$r_buff0_thd4~0_134)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_78} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_6|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_78} 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 13:30:58,155 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-809081208 256)))) (or (and .cse0 (= |P3Thread1of1ForFork2_#t~ite48_Out-809081208| ~z~0_In-809081208)) (and (= |P3Thread1of1ForFork2_#t~ite48_Out-809081208| ~z$mem_tmp~0_In-809081208) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-809081208, ~z$flush_delayed~0=~z$flush_delayed~0_In-809081208, ~z~0=~z~0_In-809081208} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-809081208, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out-809081208|, ~z$flush_delayed~0=~z$flush_delayed~0_In-809081208, ~z~0=~z~0_In-809081208} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 13:30:58,155 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1025] [1025] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_96 1) v_~__unbuffered_cnt~0_95) (= v_~a~0_14 1) (= v_~x~0_22 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_10| v_P0Thread1of1ForFork3_~arg.offset_8) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_P0Thread1of1ForFork3_~arg.base_8 |v_P0Thread1of1ForFork3_#in~arg.base_10|)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|} OutVars{~a~0=v_~a~0_14, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_8, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_8, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_22} 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 13:30:58,156 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1018] [1018] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= v_~x~0_15 2) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= v_~y~0_36 1)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~y~0=v_~y~0_36, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, ~x~0=v_~x~0_15} 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 13:30:58,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L827-->L827-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-764361807 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-764361807 256) 0))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite51_Out-764361807|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-764361807 |P3Thread1of1ForFork2_#t~ite51_Out-764361807|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-764361807, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-764361807} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out-764361807|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-764361807, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-764361807} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 13:30:58,163 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L781-->L781-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-1482764218 256) 0))) (or (and (= ~z~0_In-1482764218 |P2Thread1of1ForFork1_#t~ite25_Out-1482764218|) .cse0) (and (not .cse0) (= ~z$mem_tmp~0_In-1482764218 |P2Thread1of1ForFork1_#t~ite25_Out-1482764218|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1482764218, ~z$flush_delayed~0=~z$flush_delayed~0_In-1482764218, ~z~0=~z~0_In-1482764218} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1482764218, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out-1482764218|, ~z$flush_delayed~0=~z$flush_delayed~0_In-1482764218, ~z~0=~z~0_In-1482764218} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 13:30:58,163 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L781-2-->P2EXIT: Formula: (and (= v_~z~0_127 |v_P2Thread1of1ForFork1_#t~ite25_38|) (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 v_~z$flush_delayed~0_91) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_37|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, ~z$flush_delayed~0=v_~z$flush_delayed~0_91, ~z~0=v_~z~0_127, 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 13:30:58,163 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L828-->L828-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd4~0_In-1017203852 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1017203852 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In-1017203852 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1017203852 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite52_Out-1017203852| 0)) (and (or .cse2 .cse3) (= |P3Thread1of1ForFork2_#t~ite52_Out-1017203852| ~z$w_buff1_used~0_In-1017203852) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1017203852, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1017203852, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1017203852, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1017203852} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out-1017203852|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1017203852, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1017203852, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1017203852, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1017203852} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 13:30:58,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L829-->L830: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1567261287 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In1567261287 256))) (.cse0 (= ~z$r_buff0_thd4~0_Out1567261287 ~z$r_buff0_thd4~0_In1567261287))) (or (and .cse0 .cse1) (and (not .cse2) (= ~z$r_buff0_thd4~0_Out1567261287 0) (not .cse1)) (and .cse2 .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1567261287, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1567261287} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out1567261287|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1567261287, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1567261287} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 13:30:58,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] L830-->L830-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-668998924 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-668998924 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In-668998924 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-668998924 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite54_Out-668998924| ~z$r_buff1_thd4~0_In-668998924) (or .cse2 .cse3)) (and (= |P3Thread1of1ForFork2_#t~ite54_Out-668998924| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-668998924, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-668998924, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-668998924, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-668998924} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-668998924|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-668998924, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-668998924, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-668998924, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-668998924} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 13:30:58,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1016] [1016] L830-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63) (= |v_P3Thread1of1ForFork2_#t~ite54_26| v_~z$r_buff1_thd4~0_141)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_25|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_141, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} 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 13:30:58,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [959] [959] L855-1-->L861: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= (ite (= 4 v_~__unbuffered_cnt~0_34) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet58, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 13:30:58,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L861-2-->L861-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite59_Out1925059483| |ULTIMATE.start_main_#t~ite60_Out1925059483|)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1925059483 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1925059483 256)))) (or (and (not .cse0) .cse1 (not .cse2) (= ~z$w_buff1~0_In1925059483 |ULTIMATE.start_main_#t~ite59_Out1925059483|)) (and .cse1 (or .cse2 .cse0) (= |ULTIMATE.start_main_#t~ite59_Out1925059483| ~z~0_In1925059483)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1925059483, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1925059483, ~z$w_buff1~0=~z$w_buff1~0_In1925059483, ~z~0=~z~0_In1925059483} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out1925059483|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1925059483, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1925059483, ~z$w_buff1~0=~z$w_buff1~0_In1925059483, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1925059483|, ~z~0=~z~0_In1925059483} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 13:30:58,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L862-->L862-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1815079399 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1815079399 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite61_Out1815079399| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite61_Out1815079399| ~z$w_buff0_used~0_In1815079399)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1815079399, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1815079399} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1815079399, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1815079399|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1815079399} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 13:30:58,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L863-->L863-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-2031906362 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-2031906362 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-2031906362 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-2031906362 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite62_Out-2031906362| ~z$w_buff1_used~0_In-2031906362)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite62_Out-2031906362| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2031906362, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2031906362, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2031906362, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2031906362} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-2031906362|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2031906362, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2031906362, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2031906362, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2031906362} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 13:30:58,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L864-->L864-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1839874290 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1839874290 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-1839874290 |ULTIMATE.start_main_#t~ite63_Out-1839874290|)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite63_Out-1839874290| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1839874290, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1839874290} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1839874290|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1839874290, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1839874290} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 13:30:58,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L865-->L865-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In2007665059 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In2007665059 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In2007665059 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In2007665059 256)))) (or (and (= |ULTIMATE.start_main_#t~ite64_Out2007665059| ~z$r_buff1_thd0~0_In2007665059) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite64_Out2007665059|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2007665059, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2007665059, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2007665059, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2007665059} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2007665059, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2007665059, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2007665059, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2007665059, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out2007665059|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 13:30:58,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] L865-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~z$r_buff1_thd0~0_182 |v_ULTIMATE.start_main_#t~ite64_46|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~main$tmp_guard1~0_19 (ite (= (ite (not (and (= 0 v_~__unbuffered_p2_EAX~0_48) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~y~0_49 2) (= 1 v_~__unbuffered_p3_EAX~0_33) (= v_~x~0_29 2))) 1 0) 0) 0 1))) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_49, ~x~0=v_~x~0_29, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_46|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_182, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_49, ~x~0=v_~x~0_29, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_45|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} 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 13:30:58,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:30:58 BasicIcfg [2019-12-07 13:30:58,234 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:30:58,234 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:30:58,234 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:30:58,234 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:30:58,235 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:28:55" (3/4) ... [2019-12-07 13:30:58,236 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 13:30:58,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1055] [1055] ULTIMATE.startENTRY-->L849: Formula: (let ((.cse0 (store |v_#valid_92| 0 0))) (and (= 0 v_~x~0_105) (= 0 v_~z$flush_delayed~0_384) (= v_~z$w_buff1_used~0_989 0) (= 0 v_~__unbuffered_p2_EAX~0_146) (= |v_#NULL.offset_7| 0) (= 0 v_~z$mem_tmp~0_347) (= |v_#valid_90| (store .cse0 |v_ULTIMATE.start_main_~#t581~0.base_37| 1)) (= v_~z$r_buff1_thd2~0_303 0) (< 0 |v_#StackHeapBarrier_21|) (= 0 v_~z$r_buff0_thd3~0_515) (= v_~z$r_buff0_thd2~0_71 0) (= v_~__unbuffered_p3_EAX~0_112 0) (= v_~z$w_buff0_used~0_1397 0) (= v_~main$tmp_guard1~0_91 0) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t581~0.base_37| 4)) (= v_~weak$$choice2~0_438 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff0_thd1~0_71 0) (= v_~z$r_buff1_thd0~0_430 0) (= v_~z$r_buff1_thd1~0_299 0) (= 0 v_~weak$$choice0~0_336) (= v_~__unbuffered_cnt~0_142 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t581~0.base_37|) (= v_~z$read_delayed_var~0.base_7 0) (= v_~y~0_119 0) (= v_~z$read_delayed~0_7 0) (= v_~z$w_buff1~0_562 0) (= 0 |v_#NULL.base_7|) (= 0 v_~__unbuffered_p3_EBX~0_93) (= v_~a~0_37 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t581~0.base_37| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t581~0.base_37|) |v_ULTIMATE.start_main_~#t581~0.offset_25| 0)) |v_#memory_int_23|) (= (select .cse0 |v_ULTIMATE.start_main_~#t581~0.base_37|) 0) (= 0 |v_ULTIMATE.start_main_~#t581~0.offset_25|) (= 0 v_~z$r_buff0_thd4~0_677) (= v_~main$tmp_guard0~0_22 0) (= v_~z~0_307 0) (= 0 v_~z$r_buff1_thd4~0_523) (= v_~z$w_buff0~0_773 0) (= v_~z$r_buff0_thd0~0_170 0) (= 0 v_~z$r_buff1_thd3~0_601))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_92|, #memory_int=|v_#memory_int_24|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_10|, ULTIMATE.start_main_~#t581~0.offset=|v_ULTIMATE.start_main_~#t581~0.offset_25|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ULTIMATE.start_main_~#t584~0.offset=|v_ULTIMATE.start_main_~#t584~0.offset_18|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_303, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_184|, ~a~0=v_~a~0_37, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_170, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_677, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_112, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_146, ULTIMATE.start_main_~#t582~0.base=|v_ULTIMATE.start_main_~#t582~0.base_30|, ~z$mem_tmp~0=v_~z$mem_tmp~0_347, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_989, ~z$flush_delayed~0=v_~z$flush_delayed~0_384, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_37|, ~weak$$choice0~0=v_~weak$$choice0~0_336, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_409|, ULTIMATE.start_main_~#t581~0.base=|v_ULTIMATE.start_main_~#t581~0.base_37|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_299, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_515, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_142, ~x~0=v_~x~0_105, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_523, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_21|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_562, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_91, ULTIMATE.start_main_~#t584~0.base=|v_ULTIMATE.start_main_~#t584~0.base_23|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_430, ~y~0=v_~y~0_119, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_71, ULTIMATE.start_main_~#t583~0.base=|v_ULTIMATE.start_main_~#t583~0.base_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1397, ~z$w_buff0~0=v_~z$w_buff0~0_773, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_601, ULTIMATE.start_main_~#t583~0.offset=|v_ULTIMATE.start_main_~#t583~0.offset_18|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_43|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_93, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_45|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_67|, ULTIMATE.start_main_~#t582~0.offset=|v_ULTIMATE.start_main_~#t582~0.offset_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_57|, #valid=|v_#valid_90|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_307, ~weak$$choice2~0=v_~weak$$choice2~0_438, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_71} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t581~0.offset, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t584~0.offset, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t582~0.base, ~z$mem_tmp~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_~#t581~0.base, ~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, ULTIMATE.start_main_~#t584~0.base, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t583~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t583~0.offset, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t582~0.offset, 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 13:30:58,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L849-1-->L851: Formula: (and (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t582~0.base_12| 1)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t582~0.base_12|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t582~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t582~0.base_12|) |v_ULTIMATE.start_main_~#t582~0.offset_10| 1)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t582~0.base_12| 0)) (= 0 |v_ULTIMATE.start_main_~#t582~0.offset_10|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t582~0.base_12| 4) |v_#length_21|) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t582~0.base_12|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_14|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t582~0.offset=|v_ULTIMATE.start_main_~#t582~0.offset_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_main_~#t582~0.base=|v_ULTIMATE.start_main_~#t582~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t582~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t582~0.base] because there is no mapped edge [2019-12-07 13:30:58,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L851-1-->L853: Formula: (and (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t583~0.base_12|)) (not (= 0 |v_ULTIMATE.start_main_~#t583~0.base_12|)) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t583~0.base_12| 1)) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t583~0.base_12| 4) |v_#length_19|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t583~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t583~0.base_12|) |v_ULTIMATE.start_main_~#t583~0.offset_11| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t583~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t583~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t583~0.base=|v_ULTIMATE.start_main_~#t583~0.base_12|, #valid=|v_#valid_42|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t583~0.offset=|v_ULTIMATE.start_main_~#t583~0.offset_11|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t583~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t583~0.offset, #length] because there is no mapped edge [2019-12-07 13:30:58,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L853-1-->L855: Formula: (and (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t584~0.base_13| 1)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t584~0.base_13| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t584~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t584~0.base_13|) |v_ULTIMATE.start_main_~#t584~0.offset_11| 3)) |v_#memory_int_15|) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t584~0.base_13|)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t584~0.base_13|) (= |v_ULTIMATE.start_main_~#t584~0.offset_11| 0) (not (= 0 |v_ULTIMATE.start_main_~#t584~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_6|, ULTIMATE.start_main_~#t584~0.offset=|v_ULTIMATE.start_main_~#t584~0.offset_11|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_15|, #length=|v_#length_23|, ULTIMATE.start_main_~#t584~0.base=|v_ULTIMATE.start_main_~#t584~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t584~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t584~0.base] because there is no mapped edge [2019-12-07 13:30:58,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] P3ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0_used~0_216 v_~z$w_buff1_used~0_129) (= v_~z$w_buff0~0_91 v_~z$w_buff1~0_66) (= v_P3Thread1of1ForFork2_~arg.offset_32 |v_P3Thread1of1ForFork2_#in~arg.offset_34|) (= v_~z$w_buff0_used~0_215 1) (= 1 v_~z$w_buff0~0_90) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_32| (ite (not (and (not (= (mod v_~z$w_buff0_used~0_215 256) 0)) (not (= 0 (mod v_~z$w_buff1_used~0_129 256))))) 1 0)) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_34 0)) (= |v_P3Thread1of1ForFork2_#in~arg.base_34| v_P3Thread1of1ForFork2_~arg.base_32) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_34 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_32|)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_216, ~z$w_buff0~0=v_~z$w_buff0~0_91, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_34|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_34|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_34, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_32, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_215, ~z$w_buff0~0=v_~z$w_buff0~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_129, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_34|, ~z$w_buff1~0=v_~z$w_buff1~0_66, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_32|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_32, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_34|} 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 13:30:58,239 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L811-2-->L811-5: Formula: (let ((.cse0 (= |P3Thread1of1ForFork2_#t~ite29_Out-1875887580| |P3Thread1of1ForFork2_#t~ite28_Out-1875887580|)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-1875887580 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1875887580 256) 0))) (or (and (= |P3Thread1of1ForFork2_#t~ite28_Out-1875887580| ~z$w_buff1~0_In-1875887580) .cse0 (or .cse1 .cse2)) (and (= |P3Thread1of1ForFork2_#t~ite28_Out-1875887580| ~z$w_buff0~0_In-1875887580) .cse0 (not .cse2) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1875887580, ~z$w_buff0~0=~z$w_buff0~0_In-1875887580, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1875887580, ~z$w_buff1~0=~z$w_buff1~0_In-1875887580} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-1875887580|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-1875887580|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1875887580, ~z$w_buff0~0=~z$w_buff0~0_In-1875887580, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1875887580, ~z$w_buff1~0=~z$w_buff1~0_In-1875887580} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 13:30:58,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L816-->L817: Formula: (and (not (= (mod v_~weak$$choice2~0_78 256) 0)) (= v_~z$r_buff0_thd4~0_135 v_~z$r_buff0_thd4~0_134)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_78} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_6|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_78} 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 13:30:58,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-809081208 256)))) (or (and .cse0 (= |P3Thread1of1ForFork2_#t~ite48_Out-809081208| ~z~0_In-809081208)) (and (= |P3Thread1of1ForFork2_#t~ite48_Out-809081208| ~z$mem_tmp~0_In-809081208) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-809081208, ~z$flush_delayed~0=~z$flush_delayed~0_In-809081208, ~z~0=~z~0_In-809081208} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-809081208, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out-809081208|, ~z$flush_delayed~0=~z$flush_delayed~0_In-809081208, ~z~0=~z~0_In-809081208} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 13:30:58,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1025] [1025] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_96 1) v_~__unbuffered_cnt~0_95) (= v_~a~0_14 1) (= v_~x~0_22 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_10| v_P0Thread1of1ForFork3_~arg.offset_8) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_P0Thread1of1ForFork3_~arg.base_8 |v_P0Thread1of1ForFork3_#in~arg.base_10|)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|} OutVars{~a~0=v_~a~0_14, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_8, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_8, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_22} 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 13:30:58,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1018] [1018] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= v_~x~0_15 2) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= v_~y~0_36 1)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~y~0=v_~y~0_36, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, ~x~0=v_~x~0_15} 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 13:30:58,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L827-->L827-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-764361807 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-764361807 256) 0))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite51_Out-764361807|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-764361807 |P3Thread1of1ForFork2_#t~ite51_Out-764361807|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-764361807, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-764361807} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out-764361807|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-764361807, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-764361807} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 13:30:58,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L781-->L781-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-1482764218 256) 0))) (or (and (= ~z~0_In-1482764218 |P2Thread1of1ForFork1_#t~ite25_Out-1482764218|) .cse0) (and (not .cse0) (= ~z$mem_tmp~0_In-1482764218 |P2Thread1of1ForFork1_#t~ite25_Out-1482764218|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1482764218, ~z$flush_delayed~0=~z$flush_delayed~0_In-1482764218, ~z~0=~z~0_In-1482764218} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1482764218, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out-1482764218|, ~z$flush_delayed~0=~z$flush_delayed~0_In-1482764218, ~z~0=~z~0_In-1482764218} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 13:30:58,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L781-2-->P2EXIT: Formula: (and (= v_~z~0_127 |v_P2Thread1of1ForFork1_#t~ite25_38|) (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 v_~z$flush_delayed~0_91) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_37|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, ~z$flush_delayed~0=v_~z$flush_delayed~0_91, ~z~0=v_~z~0_127, 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 13:30:58,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L828-->L828-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd4~0_In-1017203852 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1017203852 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In-1017203852 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1017203852 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite52_Out-1017203852| 0)) (and (or .cse2 .cse3) (= |P3Thread1of1ForFork2_#t~ite52_Out-1017203852| ~z$w_buff1_used~0_In-1017203852) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1017203852, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1017203852, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1017203852, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1017203852} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out-1017203852|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1017203852, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1017203852, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1017203852, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1017203852} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 13:30:58,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L829-->L830: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1567261287 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In1567261287 256))) (.cse0 (= ~z$r_buff0_thd4~0_Out1567261287 ~z$r_buff0_thd4~0_In1567261287))) (or (and .cse0 .cse1) (and (not .cse2) (= ~z$r_buff0_thd4~0_Out1567261287 0) (not .cse1)) (and .cse2 .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1567261287, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1567261287} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out1567261287|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1567261287, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1567261287} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 13:30:58,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] L830-->L830-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-668998924 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-668998924 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In-668998924 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-668998924 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite54_Out-668998924| ~z$r_buff1_thd4~0_In-668998924) (or .cse2 .cse3)) (and (= |P3Thread1of1ForFork2_#t~ite54_Out-668998924| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-668998924, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-668998924, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-668998924, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-668998924} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-668998924|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-668998924, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-668998924, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-668998924, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-668998924} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 13:30:58,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1016] [1016] L830-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63) (= |v_P3Thread1of1ForFork2_#t~ite54_26| v_~z$r_buff1_thd4~0_141)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_25|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_141, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} 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 13:30:58,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [959] [959] L855-1-->L861: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= (ite (= 4 v_~__unbuffered_cnt~0_34) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet58, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 13:30:58,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L861-2-->L861-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite59_Out1925059483| |ULTIMATE.start_main_#t~ite60_Out1925059483|)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1925059483 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1925059483 256)))) (or (and (not .cse0) .cse1 (not .cse2) (= ~z$w_buff1~0_In1925059483 |ULTIMATE.start_main_#t~ite59_Out1925059483|)) (and .cse1 (or .cse2 .cse0) (= |ULTIMATE.start_main_#t~ite59_Out1925059483| ~z~0_In1925059483)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1925059483, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1925059483, ~z$w_buff1~0=~z$w_buff1~0_In1925059483, ~z~0=~z~0_In1925059483} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out1925059483|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1925059483, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1925059483, ~z$w_buff1~0=~z$w_buff1~0_In1925059483, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1925059483|, ~z~0=~z~0_In1925059483} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 13:30:58,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L862-->L862-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1815079399 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1815079399 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite61_Out1815079399| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite61_Out1815079399| ~z$w_buff0_used~0_In1815079399)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1815079399, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1815079399} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1815079399, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1815079399|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1815079399} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 13:30:58,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L863-->L863-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-2031906362 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-2031906362 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-2031906362 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-2031906362 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite62_Out-2031906362| ~z$w_buff1_used~0_In-2031906362)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite62_Out-2031906362| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2031906362, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2031906362, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2031906362, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2031906362} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-2031906362|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2031906362, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2031906362, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2031906362, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2031906362} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 13:30:58,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L864-->L864-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1839874290 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1839874290 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-1839874290 |ULTIMATE.start_main_#t~ite63_Out-1839874290|)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite63_Out-1839874290| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1839874290, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1839874290} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1839874290|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1839874290, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1839874290} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 13:30:58,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L865-->L865-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In2007665059 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In2007665059 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In2007665059 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In2007665059 256)))) (or (and (= |ULTIMATE.start_main_#t~ite64_Out2007665059| ~z$r_buff1_thd0~0_In2007665059) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite64_Out2007665059|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2007665059, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2007665059, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2007665059, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2007665059} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2007665059, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2007665059, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2007665059, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2007665059, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out2007665059|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 13:30:58,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] L865-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~z$r_buff1_thd0~0_182 |v_ULTIMATE.start_main_#t~ite64_46|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~main$tmp_guard1~0_19 (ite (= (ite (not (and (= 0 v_~__unbuffered_p2_EAX~0_48) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~y~0_49 2) (= 1 v_~__unbuffered_p3_EAX~0_33) (= v_~x~0_29 2))) 1 0) 0) 0 1))) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_49, ~x~0=v_~x~0_29, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_46|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_182, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_49, ~x~0=v_~x~0_29, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_45|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} 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 13:30:58,315 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_925c1cd4-f982-4d5f-bd99-97e0141c17d7/bin/uautomizer/witness.graphml [2019-12-07 13:30:58,315 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:30:58,316 INFO L168 Benchmark]: Toolchain (without parser) took 123322.33 ms. Allocated memory was 1.0 GB in the beginning and 9.7 GB in the end (delta: 8.7 GB). Free memory was 939.8 MB in the beginning and 4.4 GB in the end (delta: -3.4 GB). Peak memory consumption was 5.2 GB. Max. memory is 11.5 GB. [2019-12-07 13:30:58,316 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:30:58,316 INFO L168 Benchmark]: CACSL2BoogieTranslator took 407.74 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -125.8 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 13:30:58,317 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.92 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:30:58,317 INFO L168 Benchmark]: Boogie Preprocessor took 32.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:30:58,317 INFO L168 Benchmark]: RCFGBuilder took 460.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 998.5 MB in the end (delta: 61.6 MB). Peak memory consumption was 61.6 MB. Max. memory is 11.5 GB. [2019-12-07 13:30:58,317 INFO L168 Benchmark]: TraceAbstraction took 122296.01 ms. Allocated memory was 1.1 GB in the beginning and 9.7 GB in the end (delta: 8.5 GB). Free memory was 998.5 MB in the beginning and 4.4 GB in the end (delta: -3.4 GB). Peak memory consumption was 5.1 GB. Max. memory is 11.5 GB. [2019-12-07 13:30:58,318 INFO L168 Benchmark]: Witness Printer took 80.54 ms. Allocated memory is still 9.7 GB. Free memory was 4.4 GB in the beginning and 4.4 GB in the end (delta: 38.0 MB). Peak memory consumption was 38.0 MB. Max. memory is 11.5 GB. [2019-12-07 13:30:58,319 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 407.74 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -125.8 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.92 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 32.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 460.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 998.5 MB in the end (delta: 61.6 MB). Peak memory consumption was 61.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 122296.01 ms. Allocated memory was 1.1 GB in the beginning and 9.7 GB in the end (delta: 8.5 GB). Free memory was 998.5 MB in the beginning and 4.4 GB in the end (delta: -3.4 GB). Peak memory consumption was 5.1 GB. Max. memory is 11.5 GB. * Witness Printer took 80.54 ms. Allocated memory is still 9.7 GB. Free memory was 4.4 GB in the beginning and 4.4 GB in the end (delta: 38.0 MB). Peak memory consumption was 38.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 210 ProgramPointsBefore, 115 ProgramPointsAfterwards, 253 TransitionsBefore, 135 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 50 ConcurrentYvCompositions, 28 ChoiceCompositions, 10258 VarBasedMoverChecksPositive, 419 VarBasedMoverChecksNegative, 190 SemBasedMoverChecksPositive, 389 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 146481 CheckedPairsTotal, 131 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L849] FCALL, FORK 0 pthread_create(&t581, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L851] FCALL, FORK 0 pthread_create(&t582, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L853] FCALL, FORK 0 pthread_create(&t583, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L855] FCALL, FORK 0 pthread_create(&t584, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L799] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L800] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L801] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L802] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L803] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L804] 4 z$r_buff0_thd4 = (_Bool)1 [L807] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L808] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L809] 4 z$flush_delayed = weak$$choice2 [L810] 4 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L811] EXPR 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_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] [L811] 4 z = !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) [L812] 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_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] [L812] 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)) [L813] 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_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] [L813] 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)) [L814] 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_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] [L814] 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)) [L815] 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_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] [L815] 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)) [L817] 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_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$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)) [L818] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L819] 4 z = z$flush_delayed ? z$mem_tmp : z [L820] 4 z$flush_delayed = (_Bool)0 [L823] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 3 y = 2 [L769] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 3 z$flush_delayed = weak$$choice2 [L772] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L773] 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=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] [L773] 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) [L774] 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=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] [L774] 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)) [L775] 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=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] [L775] 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)) [L776] 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=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] [L776] 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)) [L777] 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=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] [L777] 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)) [L778] 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=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] [L778] 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)) [L779] 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=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] [L779] 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)) [L780] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L826] 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) [L827] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L828] 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 [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L861] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L862] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L863] 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 [L864] 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, 198 locations, 2 error locations. Result: UNSAFE, OverallTime: 122.1s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 25.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4501 SDtfs, 5489 SDslu, 9940 SDs, 0 SdLazy, 5532 SolverSat, 304 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 32 SyntacticMatches, 11 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=381324occurred 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: 81.8s AutomataMinimizationTime, 22 MinimizatonAttempts, 184845 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 953 NumberOfCodeBlocks, 953 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 865 ConstructedInterpolants, 0 QuantifiedInterpolants, 326331 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...