./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix008_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_573310ed-20e9-4a30-bf95-244ac88cd2d1/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_573310ed-20e9-4a30-bf95-244ac88cd2d1/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_573310ed-20e9-4a30-bf95-244ac88cd2d1/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_573310ed-20e9-4a30-bf95-244ac88cd2d1/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix008_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_573310ed-20e9-4a30-bf95-244ac88cd2d1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_573310ed-20e9-4a30-bf95-244ac88cd2d1/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 bf85fc4b3ce083afcd24632d2c86a6375d747661 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 17:31:42,394 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:31:42,395 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:31:42,403 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:31:42,403 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:31:42,403 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:31:42,404 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:31:42,406 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:31:42,407 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:31:42,408 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:31:42,408 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:31:42,409 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:31:42,409 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:31:42,410 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:31:42,411 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:31:42,412 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:31:42,412 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:31:42,413 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:31:42,414 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:31:42,416 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:31:42,417 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:31:42,418 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:31:42,419 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:31:42,419 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:31:42,421 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:31:42,421 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:31:42,421 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:31:42,422 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:31:42,422 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:31:42,423 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:31:42,423 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:31:42,423 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:31:42,424 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:31:42,424 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:31:42,425 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:31:42,425 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:31:42,425 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:31:42,425 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:31:42,425 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:31:42,426 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:31:42,426 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:31:42,427 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_573310ed-20e9-4a30-bf95-244ac88cd2d1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:31:42,436 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:31:42,436 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:31:42,437 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:31:42,437 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:31:42,437 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:31:42,437 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:31:42,437 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:31:42,437 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:31:42,437 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:31:42,438 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:31:42,438 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:31:42,438 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:31:42,438 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:31:42,438 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:31:42,438 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:31:42,438 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:31:42,438 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:31:42,439 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:31:42,439 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:31:42,439 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:31:42,439 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:31:42,439 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:31:42,439 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:31:42,439 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:31:42,439 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:31:42,440 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:31:42,440 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:31:42,440 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:31:42,440 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:31:42,440 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_573310ed-20e9-4a30-bf95-244ac88cd2d1/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 -> bf85fc4b3ce083afcd24632d2c86a6375d747661 [2019-12-07 17:31:42,543 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:31:42,553 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:31:42,556 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:31:42,558 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:31:42,558 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:31:42,559 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_573310ed-20e9-4a30-bf95-244ac88cd2d1/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix008_pso.opt.i [2019-12-07 17:31:42,607 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_573310ed-20e9-4a30-bf95-244ac88cd2d1/bin/uautomizer/data/212b19491/55e1342fe0864b4fa2de3558d72d7a98/FLAG5a4257533 [2019-12-07 17:31:43,001 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:31:43,002 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_573310ed-20e9-4a30-bf95-244ac88cd2d1/sv-benchmarks/c/pthread-wmm/mix008_pso.opt.i [2019-12-07 17:31:43,013 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_573310ed-20e9-4a30-bf95-244ac88cd2d1/bin/uautomizer/data/212b19491/55e1342fe0864b4fa2de3558d72d7a98/FLAG5a4257533 [2019-12-07 17:31:43,022 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_573310ed-20e9-4a30-bf95-244ac88cd2d1/bin/uautomizer/data/212b19491/55e1342fe0864b4fa2de3558d72d7a98 [2019-12-07 17:31:43,024 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:31:43,025 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:31:43,026 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:31:43,026 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:31:43,028 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:31:43,029 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:31:43" (1/1) ... [2019-12-07 17:31:43,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25138a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:31:43, skipping insertion in model container [2019-12-07 17:31:43,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:31:43" (1/1) ... [2019-12-07 17:31:43,036 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:31:43,066 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:31:43,317 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:31:43,325 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:31:43,372 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:31:43,418 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:31:43,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:31:43 WrapperNode [2019-12-07 17:31:43,418 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:31:43,419 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:31:43,419 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:31:43,419 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:31:43,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:31:43" (1/1) ... [2019-12-07 17:31:43,439 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:31:43" (1/1) ... [2019-12-07 17:31:43,460 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:31:43,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:31:43,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:31:43,461 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:31:43,467 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:31:43" (1/1) ... [2019-12-07 17:31:43,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:31:43" (1/1) ... [2019-12-07 17:31:43,471 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:31:43" (1/1) ... [2019-12-07 17:31:43,471 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:31:43" (1/1) ... [2019-12-07 17:31:43,480 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:31:43" (1/1) ... [2019-12-07 17:31:43,483 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:31:43" (1/1) ... [2019-12-07 17:31:43,485 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:31:43" (1/1) ... [2019-12-07 17:31:43,489 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:31:43,489 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:31:43,489 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:31:43,489 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:31:43,490 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:31:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_573310ed-20e9-4a30-bf95-244ac88cd2d1/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 17:31:43,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:31:43,531 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 17:31:43,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:31:43,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:31:43,531 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 17:31:43,531 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 17:31:43,531 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 17:31:43,531 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 17:31:43,532 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 17:31:43,532 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 17:31:43,532 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 17:31:43,532 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 17:31:43,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 17:31:43,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:31:43,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:31:43,534 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 17:31:43,960 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:31:43,960 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 17:31:43,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:31:43 BoogieIcfgContainer [2019-12-07 17:31:43,961 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:31:43,962 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:31:43,962 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:31:43,964 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:31:43,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:31:43" (1/3) ... [2019-12-07 17:31:43,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46fed89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:31:43, skipping insertion in model container [2019-12-07 17:31:43,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:31:43" (2/3) ... [2019-12-07 17:31:43,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46fed89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:31:43, skipping insertion in model container [2019-12-07 17:31:43,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:31:43" (3/3) ... [2019-12-07 17:31:43,967 INFO L109 eAbstractionObserver]: Analyzing ICFG mix008_pso.opt.i [2019-12-07 17:31:43,974 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 17:31:43,974 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:31:43,979 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 17:31:43,979 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 17:31:44,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,007 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,007 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,008 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,008 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,009 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,009 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,025 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,025 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,025 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,025 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,026 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,026 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,026 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,026 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,026 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,026 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,027 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,027 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,027 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,027 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,027 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,027 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,028 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,028 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,028 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,028 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,028 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,028 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,029 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,029 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,029 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,029 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,029 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,029 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,030 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,030 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,030 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,030 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,030 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,030 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,031 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,031 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,031 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,031 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,031 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,031 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,031 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,032 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,032 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,032 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,032 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,032 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,032 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,033 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,033 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,033 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,033 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,033 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,033 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,034 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,034 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,034 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,034 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,034 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,034 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,034 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,035 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,035 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,035 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,035 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,035 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,035 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,036 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,036 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,036 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,036 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,036 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,036 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,036 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,037 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,037 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,037 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,037 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,037 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,037 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,038 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,038 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,038 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,038 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,038 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,038 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,038 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,039 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,039 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,039 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,039 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,039 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,039 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,039 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,040 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,040 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,040 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,040 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,040 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,040 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,040 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,041 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,041 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,041 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,041 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,041 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,041 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,041 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,042 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,042 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,042 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,042 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,042 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,042 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,042 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,043 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,043 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,043 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,043 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,043 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,043 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,043 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,044 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:31:44,058 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 17:31:44,070 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:31:44,070 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:31:44,070 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:31:44,070 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:31:44,070 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:31:44,070 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:31:44,070 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:31:44,070 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:31:44,082 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 254 transitions [2019-12-07 17:31:44,083 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 211 places, 254 transitions [2019-12-07 17:31:44,165 INFO L134 PetriNetUnfolder]: 56/250 cut-off events. [2019-12-07 17:31:44,165 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:31:44,176 INFO L76 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 250 events. 56/250 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 940 event pairs. 12/204 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 17:31:44,198 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 211 places, 254 transitions [2019-12-07 17:31:44,240 INFO L134 PetriNetUnfolder]: 56/250 cut-off events. [2019-12-07 17:31:44,240 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:31:44,249 INFO L76 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 250 events. 56/250 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 940 event pairs. 12/204 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 17:31:44,274 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-07 17:31:44,275 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 17:31:47,648 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-12-07 17:31:47,850 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-07 17:31:47,961 INFO L206 etLargeBlockEncoding]: Checked pairs total: 147708 [2019-12-07 17:31:47,961 INFO L214 etLargeBlockEncoding]: Total number of compositions: 132 [2019-12-07 17:31:47,963 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 113 places, 134 transitions [2019-12-07 17:31:55,837 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 92086 states. [2019-12-07 17:31:55,839 INFO L276 IsEmpty]: Start isEmpty. Operand 92086 states. [2019-12-07 17:31:55,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 17:31:55,844 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:31:55,844 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:31:55,844 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:31:55,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:31:55,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1095689236, now seen corresponding path program 1 times [2019-12-07 17:31:55,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:31:55,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344354125] [2019-12-07 17:31:55,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:31:55,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:31:56,006 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 17:31:56,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344354125] [2019-12-07 17:31:56,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:31:56,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:31:56,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40996510] [2019-12-07 17:31:56,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:31:56,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:31:56,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:31:56,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:31:56,021 INFO L87 Difference]: Start difference. First operand 92086 states. Second operand 3 states. [2019-12-07 17:31:56,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:31:56,780 INFO L93 Difference]: Finished difference Result 91382 states and 423776 transitions. [2019-12-07 17:31:56,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:31:56,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 17:31:56,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:31:57,278 INFO L225 Difference]: With dead ends: 91382 [2019-12-07 17:31:57,278 INFO L226 Difference]: Without dead ends: 85534 [2019-12-07 17:31:57,279 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 17:31:58,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85534 states. [2019-12-07 17:31:59,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85534 to 85534. [2019-12-07 17:31:59,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85534 states. [2019-12-07 17:32:00,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85534 states to 85534 states and 396416 transitions. [2019-12-07 17:32:00,265 INFO L78 Accepts]: Start accepts. Automaton has 85534 states and 396416 transitions. Word has length 9 [2019-12-07 17:32:00,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:32:00,266 INFO L462 AbstractCegarLoop]: Abstraction has 85534 states and 396416 transitions. [2019-12-07 17:32:00,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:32:00,266 INFO L276 IsEmpty]: Start isEmpty. Operand 85534 states and 396416 transitions. [2019-12-07 17:32:00,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 17:32:00,273 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:32:00,273 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:32:00,274 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 17:32:00,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:32:00,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1576682706, now seen corresponding path program 1 times [2019-12-07 17:32:00,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:32:00,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535144296] [2019-12-07 17:32:00,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:32:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:32:00,336 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 17:32:00,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535144296] [2019-12-07 17:32:00,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:32:00,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:32:00,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916687098] [2019-12-07 17:32:00,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:32:00,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:32:00,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:32:00,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:32:00,338 INFO L87 Difference]: Start difference. First operand 85534 states and 396416 transitions. Second operand 4 states. [2019-12-07 17:32:02,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:32:02,670 INFO L93 Difference]: Finished difference Result 132766 states and 593324 transitions. [2019-12-07 17:32:02,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:32:02,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 17:32:02,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:32:03,053 INFO L225 Difference]: With dead ends: 132766 [2019-12-07 17:32:03,054 INFO L226 Difference]: Without dead ends: 132702 [2019-12-07 17:32:03,054 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:32:04,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132702 states. [2019-12-07 17:32:06,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132702 to 129166. [2019-12-07 17:32:06,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129166 states. [2019-12-07 17:32:06,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129166 states to 129166 states and 580344 transitions. [2019-12-07 17:32:06,855 INFO L78 Accepts]: Start accepts. Automaton has 129166 states and 580344 transitions. Word has length 15 [2019-12-07 17:32:06,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:32:06,855 INFO L462 AbstractCegarLoop]: Abstraction has 129166 states and 580344 transitions. [2019-12-07 17:32:06,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:32:06,855 INFO L276 IsEmpty]: Start isEmpty. Operand 129166 states and 580344 transitions. [2019-12-07 17:32:06,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 17:32:06,861 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:32:06,861 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 17:32:06,861 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 17:32:06,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:32:06,862 INFO L82 PathProgramCache]: Analyzing trace with hash -959167775, now seen corresponding path program 1 times [2019-12-07 17:32:06,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:32:06,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032988902] [2019-12-07 17:32:06,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:32:06,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:32:06,910 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 17:32:06,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032988902] [2019-12-07 17:32:06,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:32:06,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:32:06,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283242268] [2019-12-07 17:32:06,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:32:06,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:32:06,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:32:06,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:32:06,912 INFO L87 Difference]: Start difference. First operand 129166 states and 580344 transitions. Second operand 4 states. [2019-12-07 17:32:07,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:32:07,816 INFO L93 Difference]: Finished difference Result 166838 states and 738668 transitions. [2019-12-07 17:32:07,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:32:07,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 17:32:07,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:32:10,203 INFO L225 Difference]: With dead ends: 166838 [2019-12-07 17:32:10,204 INFO L226 Difference]: Without dead ends: 166782 [2019-12-07 17:32:10,204 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 17:32:11,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166782 states. [2019-12-07 17:32:13,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166782 to 149598. [2019-12-07 17:32:13,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149598 states. [2019-12-07 17:32:14,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149598 states to 149598 states and 668132 transitions. [2019-12-07 17:32:14,362 INFO L78 Accepts]: Start accepts. Automaton has 149598 states and 668132 transitions. Word has length 18 [2019-12-07 17:32:14,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:32:14,362 INFO L462 AbstractCegarLoop]: Abstraction has 149598 states and 668132 transitions. [2019-12-07 17:32:14,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:32:14,362 INFO L276 IsEmpty]: Start isEmpty. Operand 149598 states and 668132 transitions. [2019-12-07 17:32:14,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 17:32:14,371 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:32:14,371 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 17:32:14,372 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 17:32:14,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:32:14,372 INFO L82 PathProgramCache]: Analyzing trace with hash 330599914, now seen corresponding path program 1 times [2019-12-07 17:32:14,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:32:14,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131491194] [2019-12-07 17:32:14,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:32:14,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:32:14,411 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 17:32:14,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131491194] [2019-12-07 17:32:14,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:32:14,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:32:14,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828230754] [2019-12-07 17:32:14,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:32:14,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:32:14,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:32:14,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:32:14,413 INFO L87 Difference]: Start difference. First operand 149598 states and 668132 transitions. Second operand 3 states. [2019-12-07 17:32:16,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:32:16,004 INFO L93 Difference]: Finished difference Result 254938 states and 1095516 transitions. [2019-12-07 17:32:16,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:32:16,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 17:32:16,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:32:16,749 INFO L225 Difference]: With dead ends: 254938 [2019-12-07 17:32:16,749 INFO L226 Difference]: Without dead ends: 254938 [2019-12-07 17:32:16,749 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 17:32:18,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254938 states. [2019-12-07 17:32:25,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254938 to 226954. [2019-12-07 17:32:25,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226954 states. [2019-12-07 17:32:26,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226954 states to 226954 states and 987664 transitions. [2019-12-07 17:32:26,337 INFO L78 Accepts]: Start accepts. Automaton has 226954 states and 987664 transitions. Word has length 19 [2019-12-07 17:32:26,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:32:26,338 INFO L462 AbstractCegarLoop]: Abstraction has 226954 states and 987664 transitions. [2019-12-07 17:32:26,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:32:26,338 INFO L276 IsEmpty]: Start isEmpty. Operand 226954 states and 987664 transitions. [2019-12-07 17:32:26,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 17:32:26,350 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:32:26,350 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 17:32:26,350 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 17:32:26,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:32:26,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1619055659, now seen corresponding path program 1 times [2019-12-07 17:32:26,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:32:26,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253323979] [2019-12-07 17:32:26,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:32:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:32:26,417 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 17:32:26,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253323979] [2019-12-07 17:32:26,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:32:26,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:32:26,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287189960] [2019-12-07 17:32:26,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:32:26,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:32:26,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:32:26,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:32:26,419 INFO L87 Difference]: Start difference. First operand 226954 states and 987664 transitions. Second operand 3 states. [2019-12-07 17:32:28,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:32:28,731 INFO L93 Difference]: Finished difference Result 394395 states and 1647724 transitions. [2019-12-07 17:32:28,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:32:28,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 17:32:28,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:32:29,732 INFO L225 Difference]: With dead ends: 394395 [2019-12-07 17:32:29,732 INFO L226 Difference]: Without dead ends: 392658 [2019-12-07 17:32:29,732 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 17:32:32,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392658 states. [2019-12-07 17:32:42,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392658 to 379351. [2019-12-07 17:32:42,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379351 states. [2019-12-07 17:32:43,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379351 states to 379351 states and 1599434 transitions. [2019-12-07 17:32:43,511 INFO L78 Accepts]: Start accepts. Automaton has 379351 states and 1599434 transitions. Word has length 20 [2019-12-07 17:32:43,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:32:43,511 INFO L462 AbstractCegarLoop]: Abstraction has 379351 states and 1599434 transitions. [2019-12-07 17:32:43,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:32:43,511 INFO L276 IsEmpty]: Start isEmpty. Operand 379351 states and 1599434 transitions. [2019-12-07 17:32:43,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 17:32:43,534 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:32:43,534 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 17:32:43,535 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 17:32:43,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:32:43,535 INFO L82 PathProgramCache]: Analyzing trace with hash 2037270664, now seen corresponding path program 1 times [2019-12-07 17:32:43,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:32:43,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945017187] [2019-12-07 17:32:43,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:32:43,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:32:43,566 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 17:32:43,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945017187] [2019-12-07 17:32:43,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:32:43,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:32:43,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056669421] [2019-12-07 17:32:43,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:32:43,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:32:43,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:32:43,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:32:43,567 INFO L87 Difference]: Start difference. First operand 379351 states and 1599434 transitions. Second operand 4 states. [2019-12-07 17:32:46,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:32:46,649 INFO L93 Difference]: Finished difference Result 472897 states and 1966828 transitions. [2019-12-07 17:32:46,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:32:46,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 17:32:46,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:32:48,017 INFO L225 Difference]: With dead ends: 472897 [2019-12-07 17:32:48,017 INFO L226 Difference]: Without dead ends: 472829 [2019-12-07 17:32:48,017 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 17:32:52,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472829 states. [2019-12-07 17:33:02,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472829 to 384846. [2019-12-07 17:33:02,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384846 states. [2019-12-07 17:33:04,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384846 states to 384846 states and 1622126 transitions. [2019-12-07 17:33:04,029 INFO L78 Accepts]: Start accepts. Automaton has 384846 states and 1622126 transitions. Word has length 21 [2019-12-07 17:33:04,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:33:04,030 INFO L462 AbstractCegarLoop]: Abstraction has 384846 states and 1622126 transitions. [2019-12-07 17:33:04,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:33:04,030 INFO L276 IsEmpty]: Start isEmpty. Operand 384846 states and 1622126 transitions. [2019-12-07 17:33:04,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 17:33:04,054 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:33:04,054 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 17:33:04,054 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 17:33:04,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:33:04,054 INFO L82 PathProgramCache]: Analyzing trace with hash 2061916919, now seen corresponding path program 1 times [2019-12-07 17:33:04,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:33:04,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378410095] [2019-12-07 17:33:04,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:33:04,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:33:04,093 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 17:33:04,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378410095] [2019-12-07 17:33:04,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:33:04,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:33:04,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343666361] [2019-12-07 17:33:04,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:33:04,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:33:04,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:33:04,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:33:04,094 INFO L87 Difference]: Start difference. First operand 384846 states and 1622126 transitions. Second operand 3 states. [2019-12-07 17:33:06,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:33:06,319 INFO L93 Difference]: Finished difference Result 372822 states and 1568822 transitions. [2019-12-07 17:33:06,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:33:06,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 17:33:06,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:33:07,333 INFO L225 Difference]: With dead ends: 372822 [2019-12-07 17:33:07,333 INFO L226 Difference]: Without dead ends: 372822 [2019-12-07 17:33:07,333 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 17:33:14,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372822 states. [2019-12-07 17:33:18,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372822 to 266931. [2019-12-07 17:33:18,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266931 states. [2019-12-07 17:33:19,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266931 states to 266931 states and 1135828 transitions. [2019-12-07 17:33:19,222 INFO L78 Accepts]: Start accepts. Automaton has 266931 states and 1135828 transitions. Word has length 21 [2019-12-07 17:33:19,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:33:19,222 INFO L462 AbstractCegarLoop]: Abstraction has 266931 states and 1135828 transitions. [2019-12-07 17:33:19,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:33:19,222 INFO L276 IsEmpty]: Start isEmpty. Operand 266931 states and 1135828 transitions. [2019-12-07 17:33:19,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 17:33:19,253 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:33:19,254 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] [2019-12-07 17:33:19,254 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 17:33:19,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:33:19,254 INFO L82 PathProgramCache]: Analyzing trace with hash 984863619, now seen corresponding path program 1 times [2019-12-07 17:33:19,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:33:19,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83217024] [2019-12-07 17:33:19,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:33:19,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:33:19,298 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 17:33:19,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83217024] [2019-12-07 17:33:19,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:33:19,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:33:19,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121559592] [2019-12-07 17:33:19,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:33:19,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:33:19,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:33:19,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:33:19,300 INFO L87 Difference]: Start difference. First operand 266931 states and 1135828 transitions. Second operand 5 states. [2019-12-07 17:33:21,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:33:21,813 INFO L93 Difference]: Finished difference Result 379891 states and 1581694 transitions. [2019-12-07 17:33:21,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:33:21,814 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-07 17:33:21,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:33:22,841 INFO L225 Difference]: With dead ends: 379891 [2019-12-07 17:33:22,842 INFO L226 Difference]: Without dead ends: 379835 [2019-12-07 17:33:22,842 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:33:25,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379835 states. [2019-12-07 17:33:30,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379835 to 290349. [2019-12-07 17:33:30,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290349 states. [2019-12-07 17:33:31,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290349 states to 290349 states and 1231834 transitions. [2019-12-07 17:33:31,813 INFO L78 Accepts]: Start accepts. Automaton has 290349 states and 1231834 transitions. Word has length 24 [2019-12-07 17:33:31,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:33:31,813 INFO L462 AbstractCegarLoop]: Abstraction has 290349 states and 1231834 transitions. [2019-12-07 17:33:31,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:33:31,813 INFO L276 IsEmpty]: Start isEmpty. Operand 290349 states and 1231834 transitions. [2019-12-07 17:33:31,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 17:33:31,878 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:33:31,879 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:33:31,879 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 17:33:31,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:33:31,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1904143208, now seen corresponding path program 1 times [2019-12-07 17:33:31,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:33:31,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825225736] [2019-12-07 17:33:31,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:33:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:33:31,917 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 17:33:31,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825225736] [2019-12-07 17:33:31,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:33:31,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:33:31,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866892161] [2019-12-07 17:33:31,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:33:31,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:33:31,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:33:31,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:33:31,919 INFO L87 Difference]: Start difference. First operand 290349 states and 1231834 transitions. Second operand 5 states. [2019-12-07 17:33:37,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:33:37,354 INFO L93 Difference]: Finished difference Result 395310 states and 1644628 transitions. [2019-12-07 17:33:37,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:33:37,354 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 17:33:37,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:33:38,488 INFO L225 Difference]: With dead ends: 395310 [2019-12-07 17:33:38,488 INFO L226 Difference]: Without dead ends: 395198 [2019-12-07 17:33:38,488 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:33:41,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395198 states. [2019-12-07 17:33:45,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395198 to 270701. [2019-12-07 17:33:45,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270701 states. [2019-12-07 17:33:46,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270701 states to 270701 states and 1150059 transitions. [2019-12-07 17:33:46,829 INFO L78 Accepts]: Start accepts. Automaton has 270701 states and 1150059 transitions. Word has length 27 [2019-12-07 17:33:46,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:33:46,829 INFO L462 AbstractCegarLoop]: Abstraction has 270701 states and 1150059 transitions. [2019-12-07 17:33:46,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:33:46,829 INFO L276 IsEmpty]: Start isEmpty. Operand 270701 states and 1150059 transitions. [2019-12-07 17:33:47,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 17:33:47,020 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:33:47,021 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 17:33:47,021 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 17:33:47,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:33:47,021 INFO L82 PathProgramCache]: Analyzing trace with hash 263757870, now seen corresponding path program 1 times [2019-12-07 17:33:47,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:33:47,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637696380] [2019-12-07 17:33:47,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:33:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:33:47,074 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 17:33:47,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637696380] [2019-12-07 17:33:47,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:33:47,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:33:47,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421448459] [2019-12-07 17:33:47,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:33:47,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:33:47,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:33:47,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:33:47,075 INFO L87 Difference]: Start difference. First operand 270701 states and 1150059 transitions. Second operand 4 states. [2019-12-07 17:33:49,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:33:49,183 INFO L93 Difference]: Finished difference Result 383437 states and 1603979 transitions. [2019-12-07 17:33:49,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:33:49,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-12-07 17:33:49,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:33:50,815 INFO L225 Difference]: With dead ends: 383437 [2019-12-07 17:33:50,815 INFO L226 Difference]: Without dead ends: 383437 [2019-12-07 17:33:50,816 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 17:33:53,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383437 states. [2019-12-07 17:33:58,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383437 to 270365. [2019-12-07 17:33:58,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270365 states. [2019-12-07 17:33:59,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270365 states to 270365 states and 1148709 transitions. [2019-12-07 17:33:59,393 INFO L78 Accepts]: Start accepts. Automaton has 270365 states and 1148709 transitions. Word has length 34 [2019-12-07 17:33:59,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:33:59,393 INFO L462 AbstractCegarLoop]: Abstraction has 270365 states and 1148709 transitions. [2019-12-07 17:33:59,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:33:59,394 INFO L276 IsEmpty]: Start isEmpty. Operand 270365 states and 1148709 transitions. [2019-12-07 17:33:59,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 17:33:59,595 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:33:59,596 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:33:59,596 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 17:33:59,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:33:59,596 INFO L82 PathProgramCache]: Analyzing trace with hash -557023879, now seen corresponding path program 1 times [2019-12-07 17:33:59,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:33:59,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642899761] [2019-12-07 17:33:59,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:33:59,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:33:59,636 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 17:33:59,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642899761] [2019-12-07 17:33:59,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:33:59,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:33:59,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161061411] [2019-12-07 17:33:59,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:33:59,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:33:59,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:33:59,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:33:59,637 INFO L87 Difference]: Start difference. First operand 270365 states and 1148709 transitions. Second operand 5 states. [2019-12-07 17:34:04,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:34:04,203 INFO L93 Difference]: Finished difference Result 417823 states and 1792433 transitions. [2019-12-07 17:34:04,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:34:04,203 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-12-07 17:34:04,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:34:05,132 INFO L225 Difference]: With dead ends: 417823 [2019-12-07 17:34:05,132 INFO L226 Difference]: Without dead ends: 335257 [2019-12-07 17:34:05,133 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:34:07,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335257 states. [2019-12-07 17:34:12,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335257 to 335257. [2019-12-07 17:34:12,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335257 states. [2019-12-07 17:34:13,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335257 states to 335257 states and 1445241 transitions. [2019-12-07 17:34:13,900 INFO L78 Accepts]: Start accepts. Automaton has 335257 states and 1445241 transitions. Word has length 35 [2019-12-07 17:34:13,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:34:13,900 INFO L462 AbstractCegarLoop]: Abstraction has 335257 states and 1445241 transitions. [2019-12-07 17:34:13,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:34:13,900 INFO L276 IsEmpty]: Start isEmpty. Operand 335257 states and 1445241 transitions. [2019-12-07 17:34:14,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 17:34:14,183 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:34:14,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:34:14,184 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 17:34:14,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:34:14,184 INFO L82 PathProgramCache]: Analyzing trace with hash 488202797, now seen corresponding path program 2 times [2019-12-07 17:34:14,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:34:14,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785953907] [2019-12-07 17:34:14,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:34:14,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:34:14,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:34:14,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785953907] [2019-12-07 17:34:14,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:34:14,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:34:14,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819234610] [2019-12-07 17:34:14,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:34:14,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:34:14,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:34:14,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:34:14,236 INFO L87 Difference]: Start difference. First operand 335257 states and 1445241 transitions. Second operand 5 states. [2019-12-07 17:34:14,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:34:14,768 INFO L93 Difference]: Finished difference Result 130602 states and 459908 transitions. [2019-12-07 17:34:14,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:34:14,769 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-12-07 17:34:14,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:34:14,985 INFO L225 Difference]: With dead ends: 130602 [2019-12-07 17:34:14,985 INFO L226 Difference]: Without dead ends: 108441 [2019-12-07 17:34:14,985 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:34:15,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108441 states. [2019-12-07 17:34:17,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108441 to 108112. [2019-12-07 17:34:17,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108112 states. [2019-12-07 17:34:17,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108112 states to 108112 states and 369117 transitions. [2019-12-07 17:34:17,470 INFO L78 Accepts]: Start accepts. Automaton has 108112 states and 369117 transitions. Word has length 35 [2019-12-07 17:34:17,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:34:17,471 INFO L462 AbstractCegarLoop]: Abstraction has 108112 states and 369117 transitions. [2019-12-07 17:34:17,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:34:17,471 INFO L276 IsEmpty]: Start isEmpty. Operand 108112 states and 369117 transitions. [2019-12-07 17:34:17,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 17:34:17,527 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:34:17,528 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:34:17,528 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 17:34:17,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:34:17,528 INFO L82 PathProgramCache]: Analyzing trace with hash 339952843, now seen corresponding path program 1 times [2019-12-07 17:34:17,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:34:17,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723786909] [2019-12-07 17:34:17,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:34:17,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:34:17,565 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 17:34:17,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723786909] [2019-12-07 17:34:17,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:34:17,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:34:17,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554641714] [2019-12-07 17:34:17,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:34:17,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:34:17,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:34:17,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:34:17,567 INFO L87 Difference]: Start difference. First operand 108112 states and 369117 transitions. Second operand 3 states. [2019-12-07 17:34:18,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:34:18,491 INFO L93 Difference]: Finished difference Result 197125 states and 669662 transitions. [2019-12-07 17:34:18,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:34:18,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-12-07 17:34:18,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:34:18,683 INFO L225 Difference]: With dead ends: 197125 [2019-12-07 17:34:18,683 INFO L226 Difference]: Without dead ends: 106377 [2019-12-07 17:34:18,683 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:34:19,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106377 states. [2019-12-07 17:34:20,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106377 to 106084. [2019-12-07 17:34:20,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106084 states. [2019-12-07 17:34:20,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106084 states to 106084 states and 349204 transitions. [2019-12-07 17:34:20,982 INFO L78 Accepts]: Start accepts. Automaton has 106084 states and 349204 transitions. Word has length 36 [2019-12-07 17:34:20,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:34:20,982 INFO L462 AbstractCegarLoop]: Abstraction has 106084 states and 349204 transitions. [2019-12-07 17:34:20,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:34:20,982 INFO L276 IsEmpty]: Start isEmpty. Operand 106084 states and 349204 transitions. [2019-12-07 17:34:21,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 17:34:21,045 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:34:21,045 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:34:21,045 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 17:34:21,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:34:21,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1234924517, now seen corresponding path program 1 times [2019-12-07 17:34:21,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:34:21,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561111010] [2019-12-07 17:34:21,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:34:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:34:21,097 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 17:34:21,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561111010] [2019-12-07 17:34:21,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:34:21,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:34:21,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256766086] [2019-12-07 17:34:21,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:34:21,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:34:21,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:34:21,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:34:21,099 INFO L87 Difference]: Start difference. First operand 106084 states and 349204 transitions. Second operand 6 states. [2019-12-07 17:34:21,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:34:21,228 INFO L93 Difference]: Finished difference Result 30927 states and 89449 transitions. [2019-12-07 17:34:21,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:34:21,228 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-12-07 17:34:21,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:34:21,256 INFO L225 Difference]: With dead ends: 30927 [2019-12-07 17:34:21,256 INFO L226 Difference]: Without dead ends: 24413 [2019-12-07 17:34:21,256 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:34:21,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24413 states. [2019-12-07 17:34:21,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24413 to 22988. [2019-12-07 17:34:21,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22988 states. [2019-12-07 17:34:21,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22988 states to 22988 states and 65023 transitions. [2019-12-07 17:34:21,536 INFO L78 Accepts]: Start accepts. Automaton has 22988 states and 65023 transitions. Word has length 37 [2019-12-07 17:34:21,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:34:21,536 INFO L462 AbstractCegarLoop]: Abstraction has 22988 states and 65023 transitions. [2019-12-07 17:34:21,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:34:21,536 INFO L276 IsEmpty]: Start isEmpty. Operand 22988 states and 65023 transitions. [2019-12-07 17:34:21,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 17:34:21,553 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:34:21,553 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] [2019-12-07 17:34:21,553 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 17:34:21,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:34:21,553 INFO L82 PathProgramCache]: Analyzing trace with hash 234090111, now seen corresponding path program 1 times [2019-12-07 17:34:21,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:34:21,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470182997] [2019-12-07 17:34:21,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:34:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:34:21,599 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 17:34:21,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470182997] [2019-12-07 17:34:21,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:34:21,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:34:21,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380099050] [2019-12-07 17:34:21,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:34:21,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:34:21,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:34:21,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:34:21,601 INFO L87 Difference]: Start difference. First operand 22988 states and 65023 transitions. Second operand 5 states. [2019-12-07 17:34:21,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:34:21,920 INFO L93 Difference]: Finished difference Result 26531 states and 73452 transitions. [2019-12-07 17:34:21,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:34:21,920 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-12-07 17:34:21,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:34:21,949 INFO L225 Difference]: With dead ends: 26531 [2019-12-07 17:34:21,949 INFO L226 Difference]: Without dead ends: 26531 [2019-12-07 17:34:21,949 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:34:22,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26531 states. [2019-12-07 17:34:22,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26531 to 25468. [2019-12-07 17:34:22,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25468 states. [2019-12-07 17:34:22,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25468 states to 25468 states and 71113 transitions. [2019-12-07 17:34:22,272 INFO L78 Accepts]: Start accepts. Automaton has 25468 states and 71113 transitions. Word has length 49 [2019-12-07 17:34:22,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:34:22,272 INFO L462 AbstractCegarLoop]: Abstraction has 25468 states and 71113 transitions. [2019-12-07 17:34:22,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:34:22,272 INFO L276 IsEmpty]: Start isEmpty. Operand 25468 states and 71113 transitions. [2019-12-07 17:34:22,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 17:34:22,293 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:34:22,293 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:34:22,293 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 17:34:22,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:34:22,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1609418528, now seen corresponding path program 1 times [2019-12-07 17:34:22,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:34:22,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558715604] [2019-12-07 17:34:22,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:34:22,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:34:22,363 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 17:34:22,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558715604] [2019-12-07 17:34:22,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:34:22,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:34:22,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924860405] [2019-12-07 17:34:22,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:34:22,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:34:22,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:34:22,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:34:22,364 INFO L87 Difference]: Start difference. First operand 25468 states and 71113 transitions. Second operand 7 states. [2019-12-07 17:34:22,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:34:22,472 INFO L93 Difference]: Finished difference Result 22205 states and 63301 transitions. [2019-12-07 17:34:22,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:34:22,473 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-07 17:34:22,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:34:22,484 INFO L225 Difference]: With dead ends: 22205 [2019-12-07 17:34:22,485 INFO L226 Difference]: Without dead ends: 12056 [2019-12-07 17:34:22,485 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:34:22,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12056 states. [2019-12-07 17:34:22,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12056 to 9968. [2019-12-07 17:34:22,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9968 states. [2019-12-07 17:34:22,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9968 states to 9968 states and 29095 transitions. [2019-12-07 17:34:22,608 INFO L78 Accepts]: Start accepts. Automaton has 9968 states and 29095 transitions. Word has length 50 [2019-12-07 17:34:22,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:34:22,608 INFO L462 AbstractCegarLoop]: Abstraction has 9968 states and 29095 transitions. [2019-12-07 17:34:22,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:34:22,608 INFO L276 IsEmpty]: Start isEmpty. Operand 9968 states and 29095 transitions. [2019-12-07 17:34:22,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-07 17:34:22,616 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:34:22,616 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] [2019-12-07 17:34:22,616 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 17:34:22,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:34:22,616 INFO L82 PathProgramCache]: Analyzing trace with hash 2131155932, now seen corresponding path program 1 times [2019-12-07 17:34:22,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:34:22,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067302368] [2019-12-07 17:34:22,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:34:22,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:34:22,781 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 17:34:22,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067302368] [2019-12-07 17:34:22,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:34:22,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 17:34:22,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791319396] [2019-12-07 17:34:22,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 17:34:22,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:34:22,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 17:34:22,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:34:22,782 INFO L87 Difference]: Start difference. First operand 9968 states and 29095 transitions. Second operand 13 states. [2019-12-07 17:34:23,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:34:23,674 INFO L93 Difference]: Finished difference Result 26854 states and 75740 transitions. [2019-12-07 17:34:23,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 17:34:23,674 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2019-12-07 17:34:23,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:34:23,695 INFO L225 Difference]: With dead ends: 26854 [2019-12-07 17:34:23,695 INFO L226 Difference]: Without dead ends: 20210 [2019-12-07 17:34:23,695 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=583, Unknown=0, NotChecked=0, Total=756 [2019-12-07 17:34:23,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20210 states. [2019-12-07 17:34:23,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20210 to 11338. [2019-12-07 17:34:23,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11338 states. [2019-12-07 17:34:23,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11338 states to 11338 states and 33016 transitions. [2019-12-07 17:34:23,921 INFO L78 Accepts]: Start accepts. Automaton has 11338 states and 33016 transitions. Word has length 64 [2019-12-07 17:34:23,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:34:23,921 INFO L462 AbstractCegarLoop]: Abstraction has 11338 states and 33016 transitions. [2019-12-07 17:34:23,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 17:34:23,921 INFO L276 IsEmpty]: Start isEmpty. Operand 11338 states and 33016 transitions. [2019-12-07 17:34:23,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 17:34:23,930 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:34:23,930 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 17:34:23,930 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 17:34:23,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:34:23,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1641641527, now seen corresponding path program 1 times [2019-12-07 17:34:23,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:34:23,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601529142] [2019-12-07 17:34:23,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:34:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:34:24,002 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 17:34:24,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601529142] [2019-12-07 17:34:24,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:34:24,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:34:24,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395361625] [2019-12-07 17:34:24,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:34:24,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:34:24,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:34:24,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:34:24,004 INFO L87 Difference]: Start difference. First operand 11338 states and 33016 transitions. Second operand 4 states. [2019-12-07 17:34:24,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:34:24,072 INFO L93 Difference]: Finished difference Result 16399 states and 45390 transitions. [2019-12-07 17:34:24,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:34:24,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 17:34:24,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:34:24,083 INFO L225 Difference]: With dead ends: 16399 [2019-12-07 17:34:24,083 INFO L226 Difference]: Without dead ends: 10260 [2019-12-07 17:34:24,083 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 17:34:24,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10260 states. [2019-12-07 17:34:24,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10260 to 7296. [2019-12-07 17:34:24,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7296 states. [2019-12-07 17:34:24,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7296 states to 7296 states and 20795 transitions. [2019-12-07 17:34:24,179 INFO L78 Accepts]: Start accepts. Automaton has 7296 states and 20795 transitions. Word has length 65 [2019-12-07 17:34:24,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:34:24,179 INFO L462 AbstractCegarLoop]: Abstraction has 7296 states and 20795 transitions. [2019-12-07 17:34:24,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:34:24,179 INFO L276 IsEmpty]: Start isEmpty. Operand 7296 states and 20795 transitions. [2019-12-07 17:34:24,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 17:34:24,185 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:34:24,185 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 17:34:24,185 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 17:34:24,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:34:24,185 INFO L82 PathProgramCache]: Analyzing trace with hash -332210821, now seen corresponding path program 1 times [2019-12-07 17:34:24,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:34:24,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830911627] [2019-12-07 17:34:24,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:34:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:34:24,216 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 17:34:24,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830911627] [2019-12-07 17:34:24,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:34:24,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:34:24,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258049589] [2019-12-07 17:34:24,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:34:24,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:34:24,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:34:24,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:34:24,217 INFO L87 Difference]: Start difference. First operand 7296 states and 20795 transitions. Second operand 3 states. [2019-12-07 17:34:24,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:34:24,239 INFO L93 Difference]: Finished difference Result 7295 states and 20793 transitions. [2019-12-07 17:34:24,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:34:24,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-07 17:34:24,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:34:24,247 INFO L225 Difference]: With dead ends: 7295 [2019-12-07 17:34:24,247 INFO L226 Difference]: Without dead ends: 7295 [2019-12-07 17:34:24,247 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 17:34:24,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7295 states. [2019-12-07 17:34:24,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7295 to 6989. [2019-12-07 17:34:24,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6989 states. [2019-12-07 17:34:24,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6989 states to 6989 states and 20096 transitions. [2019-12-07 17:34:24,331 INFO L78 Accepts]: Start accepts. Automaton has 6989 states and 20096 transitions. Word has length 65 [2019-12-07 17:34:24,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:34:24,332 INFO L462 AbstractCegarLoop]: Abstraction has 6989 states and 20096 transitions. [2019-12-07 17:34:24,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:34:24,332 INFO L276 IsEmpty]: Start isEmpty. Operand 6989 states and 20096 transitions. [2019-12-07 17:34:24,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 17:34:24,337 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:34:24,337 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 17:34:24,337 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 17:34:24,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:34:24,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1570951024, now seen corresponding path program 1 times [2019-12-07 17:34:24,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:34:24,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488670711] [2019-12-07 17:34:24,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:34:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:34:24,398 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 17:34:24,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488670711] [2019-12-07 17:34:24,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:34:24,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:34:24,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457217666] [2019-12-07 17:34:24,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:34:24,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:34:24,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:34:24,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:34:24,399 INFO L87 Difference]: Start difference. First operand 6989 states and 20096 transitions. Second operand 5 states. [2019-12-07 17:34:24,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:34:24,459 INFO L93 Difference]: Finished difference Result 11021 states and 29667 transitions. [2019-12-07 17:34:24,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:34:24,459 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-07 17:34:24,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:34:24,464 INFO L225 Difference]: With dead ends: 11021 [2019-12-07 17:34:24,465 INFO L226 Difference]: Without dead ends: 5276 [2019-12-07 17:34:24,465 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 17:34:24,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5276 states. [2019-12-07 17:34:24,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5276 to 4612. [2019-12-07 17:34:24,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4612 states. [2019-12-07 17:34:24,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4612 states to 4612 states and 11912 transitions. [2019-12-07 17:34:24,514 INFO L78 Accepts]: Start accepts. Automaton has 4612 states and 11912 transitions. Word has length 66 [2019-12-07 17:34:24,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:34:24,515 INFO L462 AbstractCegarLoop]: Abstraction has 4612 states and 11912 transitions. [2019-12-07 17:34:24,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:34:24,515 INFO L276 IsEmpty]: Start isEmpty. Operand 4612 states and 11912 transitions. [2019-12-07 17:34:24,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 17:34:24,518 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:34:24,518 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 17:34:24,518 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 17:34:24,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:34:24,518 INFO L82 PathProgramCache]: Analyzing trace with hash 957130744, now seen corresponding path program 2 times [2019-12-07 17:34:24,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:34:24,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389602568] [2019-12-07 17:34:24,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:34:24,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:34:24,571 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 17:34:24,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389602568] [2019-12-07 17:34:24,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:34:24,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:34:24,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602724672] [2019-12-07 17:34:24,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:34:24,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:34:24,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:34:24,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:34:24,572 INFO L87 Difference]: Start difference. First operand 4612 states and 11912 transitions. Second operand 4 states. [2019-12-07 17:34:24,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:34:24,600 INFO L93 Difference]: Finished difference Result 5343 states and 13570 transitions. [2019-12-07 17:34:24,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:34:24,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-07 17:34:24,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:34:24,601 INFO L225 Difference]: With dead ends: 5343 [2019-12-07 17:34:24,602 INFO L226 Difference]: Without dead ends: 797 [2019-12-07 17:34:24,602 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 17:34:24,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2019-12-07 17:34:24,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 797. [2019-12-07 17:34:24,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-12-07 17:34:24,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1733 transitions. [2019-12-07 17:34:24,608 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1733 transitions. Word has length 66 [2019-12-07 17:34:24,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:34:24,609 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 1733 transitions. [2019-12-07 17:34:24,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:34:24,609 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1733 transitions. [2019-12-07 17:34:24,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 17:34:24,609 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:34:24,609 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 17:34:24,610 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 17:34:24,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:34:24,610 INFO L82 PathProgramCache]: Analyzing trace with hash -888097270, now seen corresponding path program 3 times [2019-12-07 17:34:24,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:34:24,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88312031] [2019-12-07 17:34:24,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:34:24,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:34:24,756 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 17:34:24,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88312031] [2019-12-07 17:34:24,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:34:24,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 17:34:24,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721139854] [2019-12-07 17:34:24,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 17:34:24,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:34:24,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 17:34:24,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:34:24,757 INFO L87 Difference]: Start difference. First operand 797 states and 1733 transitions. Second operand 12 states. [2019-12-07 17:34:25,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:34:25,284 INFO L93 Difference]: Finished difference Result 1241 states and 2650 transitions. [2019-12-07 17:34:25,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 17:34:25,284 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-07 17:34:25,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:34:25,285 INFO L225 Difference]: With dead ends: 1241 [2019-12-07 17:34:25,285 INFO L226 Difference]: Without dead ends: 832 [2019-12-07 17:34:25,285 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2019-12-07 17:34:25,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2019-12-07 17:34:25,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 802. [2019-12-07 17:34:25,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2019-12-07 17:34:25,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1715 transitions. [2019-12-07 17:34:25,291 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1715 transitions. Word has length 66 [2019-12-07 17:34:25,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:34:25,291 INFO L462 AbstractCegarLoop]: Abstraction has 802 states and 1715 transitions. [2019-12-07 17:34:25,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 17:34:25,291 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1715 transitions. [2019-12-07 17:34:25,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 17:34:25,292 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:34:25,292 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 17:34:25,292 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 17:34:25,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:34:25,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1740782390, now seen corresponding path program 4 times [2019-12-07 17:34:25,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:34:25,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741575609] [2019-12-07 17:34:25,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:34:25,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:34:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:34:25,377 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:34:25,377 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:34:25,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1057] [1057] ULTIMATE.startENTRY-->L854: Formula: (let ((.cse0 (store |v_#valid_122| 0 0))) (and (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t221~0.base_70|)) (= |v_ULTIMATE.start_main_~#t221~0.offset_44| 0) (= v_~z$r_buff1_thd2~0_128 0) (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t221~0.base_70| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t221~0.base_70|) |v_ULTIMATE.start_main_~#t221~0.offset_44| 0))) (= 0 v_~z$flush_delayed~0_241) (= v_~z$r_buff0_thd1~0_60 0) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_6| 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t221~0.base_70| 4)) (= v_~z$w_buff1_used~0_546 0) (= 0 v_~__unbuffered_p3_EAX~0_92) (= v_~__unbuffered_cnt~0_193 0) (= v_~z$read_delayed~0_6 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t221~0.base_70|) (= v_~z$r_buff1_thd0~0_247 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$w_buff0~0_267 0) (= 0 v_~__unbuffered_p2_EAX~0_115) (= v_~main$tmp_guard0~0_28 0) (= 0 v_~z$r_buff1_thd4~0_282) (= 0 |v_#NULL.base_6|) (= v_~z$r_buff0_thd2~0_59 0) (= 0 v_~__unbuffered_p3_EBX~0_87) (= v_~y~0_120 0) (= v_~z$r_buff1_thd1~0_131 0) (= v_~z$w_buff0_used~0_794 0) (< 0 |v_#StackHeapBarrier_20|) (= v_~a~0_35 0) (= v_~z$r_buff0_thd0~0_129 0) (= v_~z~0_291 0) (= v_~x~0_99 0) (= 0 v_~z$r_buff0_thd3~0_336) (= 0 v_~z$r_buff1_thd3~0_316) (= 0 v_~z$r_buff0_thd4~0_443) (= v_~weak$$choice2~0_248 0) (= 0 v_~z$mem_tmp~0_180) (= 0 v_~weak$$choice0~0_170) (= v_~main$tmp_guard1~0_88 0) (= v_~z$w_buff1~0_199 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t221~0.base_70| 1) |v_#valid_120|) (= v_~__unbuffered_p2_EBX~0_117 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_122|, #memory_int=|v_#memory_int_24|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_9|, ULTIMATE.start_main_~#t221~0.base=|v_ULTIMATE.start_main_~#t221~0.base_70|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_128, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_171|, ~a~0=v_~a~0_35, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_129, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_443, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_92, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_115, ULTIMATE.start_main_~#t224~0.base=|v_ULTIMATE.start_main_~#t224~0.base_24|, ~z$mem_tmp~0=v_~z$mem_tmp~0_180, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_117, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_546, ~z$flush_delayed~0=v_~z$flush_delayed~0_241, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_28|, ~weak$$choice0~0=v_~weak$$choice0~0_170, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_150|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_131, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_336, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_193, ~x~0=v_~x~0_99, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_282, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_15|, ULTIMATE.start_main_~#t221~0.offset=|v_ULTIMATE.start_main_~#t221~0.offset_44|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_199, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_88, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t224~0.offset=|v_ULTIMATE.start_main_~#t224~0.offset_18|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_247, ~y~0=v_~y~0_120, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_59, ULTIMATE.start_main_~#t223~0.offset=|v_ULTIMATE.start_main_~#t223~0.offset_18|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_794, ~z$w_buff0~0=v_~z$w_buff0~0_267, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_316, ULTIMATE.start_main_~#t222~0.base=|v_ULTIMATE.start_main_~#t222~0.base_62|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_48|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_87, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_174|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_45|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_45|, #valid=|v_#valid_120|, ULTIMATE.start_main_~#t222~0.offset=|v_ULTIMATE.start_main_~#t222~0.offset_37|, ULTIMATE.start_main_~#t223~0.base=|v_ULTIMATE.start_main_~#t223~0.base_24|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_291, ~weak$$choice2~0=v_~weak$$choice2~0_248, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_60} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t221~0.base, ULTIMATE.start_main_#t~nondet55, ~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_~#t224~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_~#t221~0.offset, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t224~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t223~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t222~0.base, 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_#res, #valid, ULTIMATE.start_main_~#t222~0.offset, ULTIMATE.start_main_~#t223~0.base, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:34:25,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] L854-1-->L856: Formula: (and (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t222~0.base_11| 4) |v_#length_21|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t222~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t222~0.base_11|) |v_ULTIMATE.start_main_~#t222~0.offset_10| 1)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t222~0.offset_10| 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t222~0.base_11|) (= 0 (select |v_#valid_51| |v_ULTIMATE.start_main_~#t222~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t222~0.base_11| 0)) (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t222~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, ULTIMATE.start_main_~#t222~0.offset=|v_ULTIMATE.start_main_~#t222~0.offset_10|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t222~0.base=|v_ULTIMATE.start_main_~#t222~0.base_11|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t222~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t222~0.base, #length] because there is no mapped edge [2019-12-07 17:34:25,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] L856-1-->L858: Formula: (and (= |v_#valid_52| (store |v_#valid_53| |v_ULTIMATE.start_main_~#t223~0.base_13| 1)) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t223~0.base_13| 4) |v_#length_23|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t223~0.base_13|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t223~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t223~0.base_13|) |v_ULTIMATE.start_main_~#t223~0.offset_11| 2)) |v_#memory_int_17|) (= |v_ULTIMATE.start_main_~#t223~0.offset_11| 0) (= 0 (select |v_#valid_53| |v_ULTIMATE.start_main_~#t223~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t223~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t223~0.offset=|v_ULTIMATE.start_main_~#t223~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t223~0.base=|v_ULTIMATE.start_main_~#t223~0.base_13|, #valid=|v_#valid_52|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_17|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t223~0.offset, ULTIMATE.start_main_~#t223~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length] because there is no mapped edge [2019-12-07 17:34:25,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L858-1-->L860: Formula: (and (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t224~0.base_10| 1)) (= |v_ULTIMATE.start_main_~#t224~0.offset_9| 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t224~0.base_10|) (not (= 0 |v_ULTIMATE.start_main_~#t224~0.base_10|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t224~0.base_10| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t224~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t224~0.base_10|) |v_ULTIMATE.start_main_~#t224~0.offset_9| 3)) |v_#memory_int_11|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t224~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, ULTIMATE.start_main_~#t224~0.offset=|v_ULTIMATE.start_main_~#t224~0.offset_9|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t224~0.base=|v_ULTIMATE.start_main_~#t224~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t224~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t224~0.base] because there is no mapped edge [2019-12-07 17:34:25,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] P3ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0~0_33 v_~z$w_buff1~0_25) (= (ite (not (and (not (= (mod v_~z$w_buff0_used~0_103 256) 0)) (not (= (mod v_~z$w_buff1_used~0_58 256) 0)))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_8|) (= |v_P3Thread1of1ForFork2_#in~arg.offset_10| v_P3Thread1of1ForFork2_~arg.offset_8) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_10 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_8|) (= v_~z$w_buff0_used~0_104 v_~z$w_buff1_used~0_58) (= v_~z$w_buff0_used~0_103 1) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_10 0)) (= v_P3Thread1of1ForFork2_~arg.base_8 |v_P3Thread1of1ForFork2_#in~arg.base_10|) (= 1 v_~z$w_buff0~0_32)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~z$w_buff0~0=v_~z$w_buff0~0_33, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_10|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_10|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_10, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_8, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_103, ~z$w_buff0~0=v_~z$w_buff0~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_58, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_10|, ~z$w_buff1~0=v_~z$w_buff1~0_25, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_8|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_8, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_10|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 17:34:25,383 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L816-2-->L816-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1458060784 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1458060784 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite28_Out1458060784| ~z$w_buff1~0_In1458060784)) (and (not .cse1) (not .cse0) (= |P3Thread1of1ForFork2_#t~ite28_Out1458060784| ~z$w_buff0~0_In1458060784)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1458060784, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1458060784, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1458060784, ~z$w_buff1~0=~z$w_buff1~0_In1458060784} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out1458060784|, ~z$w_buff0~0=~z$w_buff0~0_In1458060784, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1458060784, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1458060784, ~z$w_buff1~0=~z$w_buff1~0_In1458060784} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 17:34:25,383 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [909] [909] L816-4-->L817: Formula: (= v_~z~0_22 |v_P3Thread1of1ForFork2_#t~ite28_10|) InVars {P3Thread1of1ForFork2_#t~ite28=|v_P3Thread1of1ForFork2_#t~ite28_10|} OutVars{P3Thread1of1ForFork2_#t~ite29=|v_P3Thread1of1ForFork2_#t~ite29_5|, P3Thread1of1ForFork2_#t~ite28=|v_P3Thread1of1ForFork2_#t~ite28_9|, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28, ~z~0] because there is no mapped edge [2019-12-07 17:34:25,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L821-->L822: Formula: (and (= v_~z$r_buff0_thd4~0_68 v_~z$r_buff0_thd4~0_67) (not (= (mod v_~weak$$choice2~0_34 256) 0))) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_34} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_6|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_7|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_34} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 17:34:25,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-1858744388 256) 0))) (or (and (= ~z~0_In-1858744388 |P3Thread1of1ForFork2_#t~ite48_Out-1858744388|) .cse0) (and (= |P3Thread1of1ForFork2_#t~ite48_Out-1858744388| ~z$mem_tmp~0_In-1858744388) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1858744388, ~z$flush_delayed~0=~z$flush_delayed~0_In-1858744388, ~z~0=~z~0_In-1858744388} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1858744388, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out-1858744388|, ~z$flush_delayed~0=~z$flush_delayed~0_In-1858744388, ~z~0=~z~0_In-1858744388} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 17:34:25,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= v_P0Thread1of1ForFork3_~arg.base_6 |v_P0Thread1of1ForFork3_#in~arg.base_8|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_8| v_P0Thread1of1ForFork3_~arg.offset_6) (= v_~a~0_12 1) (= (+ v_~__unbuffered_cnt~0_86 1) v_~__unbuffered_cnt~0_85) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_~x~0_28 1)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_8|} OutVars{~a~0=v_~a~0_12, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_8|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_6, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_6, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_8|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-07 17:34:25,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] P1ENTRY-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= v_~x~0_25 2) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_P1Thread1of1ForFork0_~arg.offset_7 |v_P1Thread1of1ForFork0_#in~arg.offset_9|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~y~0_51 1) (= v_P1Thread1of1ForFork0_~arg.base_7 |v_P1Thread1of1ForFork0_#in~arg.base_9|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_9|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_7, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_7, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_9|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_51, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 17:34:25,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In781495581 256)))) (or (and (= ~z$mem_tmp~0_In781495581 |P2Thread1of1ForFork1_#t~ite25_Out781495581|) (not .cse0)) (and .cse0 (= |P2Thread1of1ForFork1_#t~ite25_Out781495581| ~z~0_In781495581)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In781495581, ~z$flush_delayed~0=~z$flush_delayed~0_In781495581, ~z~0=~z~0_In781495581} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In781495581, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out781495581|, ~z$flush_delayed~0=~z$flush_delayed~0_In781495581, ~z~0=~z~0_In781495581} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 17:34:25,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1029] [1029] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83) (= v_~z~0_173 |v_P2Thread1of1ForFork1_#t~ite25_50|) (= 0 v_~z$flush_delayed~0_183)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_50|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_49|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, ~z$flush_delayed~0=v_~z$flush_delayed~0_183, ~z~0=v_~z~0_173, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 17:34:25,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L832-->L832-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1934008275 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In1934008275 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite51_Out1934008275| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In1934008275 |P3Thread1of1ForFork2_#t~ite51_Out1934008275|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1934008275, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1934008275} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out1934008275|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1934008275, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1934008275} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 17:34:25,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L833-->L833-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In1266637219 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1266637219 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In1266637219 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1266637219 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite52_Out1266637219| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P3Thread1of1ForFork2_#t~ite52_Out1266637219| ~z$w_buff1_used~0_In1266637219) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1266637219, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1266637219, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1266637219, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1266637219} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out1266637219|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1266637219, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1266637219, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1266637219, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1266637219} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 17:34:25,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L834-->L835: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1961879324 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In1961879324 256))) (.cse1 (= ~z$r_buff0_thd4~0_Out1961879324 ~z$r_buff0_thd4~0_In1961879324))) (or (and .cse0 .cse1) (and (= 0 ~z$r_buff0_thd4~0_Out1961879324) (not .cse0) (not .cse2)) (and .cse2 .cse1))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1961879324, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1961879324} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out1961879324|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1961879324, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1961879324} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 17:34:25,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L835-->L835-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In1695147365 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In1695147365 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In1695147365 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1695147365 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite54_Out1695147365| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P3Thread1of1ForFork2_#t~ite54_Out1695147365| ~z$r_buff1_thd4~0_In1695147365) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1695147365, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1695147365, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1695147365, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1695147365} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out1695147365|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1695147365, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1695147365, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1695147365, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1695147365} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 17:34:25,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1026] [1026] L835-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= |v_P3Thread1of1ForFork2_#t~ite54_28| v_~z$r_buff1_thd4~0_234) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_27|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_234, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 17:34:25,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L864-->L866-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_175 256)) (= (mod v_~z$r_buff0_thd0~0_16 256) 0)) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_175, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_175, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 17:34:25,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L866-2-->L866-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-242201651 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-242201651 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite59_Out-242201651| ~z~0_In-242201651) (or .cse0 .cse1)) (and (not .cse1) (= ~z$w_buff1~0_In-242201651 |ULTIMATE.start_main_#t~ite59_Out-242201651|) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-242201651, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-242201651, ~z$w_buff1~0=~z$w_buff1~0_In-242201651, ~z~0=~z~0_In-242201651} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-242201651, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-242201651, ~z$w_buff1~0=~z$w_buff1~0_In-242201651, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-242201651|, ~z~0=~z~0_In-242201651} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 17:34:25,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L866-4-->L867: Formula: (= v_~z~0_76 |v_ULTIMATE.start_main_#t~ite59_14|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_14|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_10|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_13|, ~z~0=v_~z~0_76} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 17:34:25,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L867-->L867-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-85149177 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-85149177 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite61_Out-85149177|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite61_Out-85149177| ~z$w_buff0_used~0_In-85149177) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-85149177, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-85149177} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-85149177, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-85149177|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-85149177} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 17:34:25,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [998] [998] L868-->L868-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1110930312 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1110930312 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In1110930312 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1110930312 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite62_Out1110930312|)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite62_Out1110930312| ~z$w_buff1_used~0_In1110930312) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1110930312, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1110930312, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1110930312, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1110930312} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1110930312|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1110930312, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1110930312, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1110930312, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1110930312} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 17:34:25,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L869-->L869-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In791165630 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In791165630 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite63_Out791165630|)) (and (= ~z$r_buff0_thd0~0_In791165630 |ULTIMATE.start_main_#t~ite63_Out791165630|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In791165630, ~z$w_buff0_used~0=~z$w_buff0_used~0_In791165630} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out791165630|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In791165630, ~z$w_buff0_used~0=~z$w_buff0_used~0_In791165630} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 17:34:25,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L870-->L870-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1049486796 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In1049486796 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1049486796 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In1049486796 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite64_Out1049486796|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite64_Out1049486796| ~z$r_buff1_thd0~0_In1049486796) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1049486796, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1049486796, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1049486796, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1049486796} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1049486796, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1049486796, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1049486796, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1049486796, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out1049486796|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 17:34:25,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1048] [1048] L870-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= v_~x~0_57 2) (= v_~__unbuffered_p2_EBX~0_70 0) (= 2 v_~__unbuffered_p2_EAX~0_76) (= 0 v_~__unbuffered_p3_EBX~0_50) (= v_~y~0_81 2) (= 1 v_~__unbuffered_p3_EAX~0_55))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_46) (= v_ULTIMATE.start___VERIFIER_assert_~expression_27 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_19|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_19| (mod v_~main$tmp_guard1~0_46 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_27 0) (= v_~z$r_buff1_thd0~0_198 |v_ULTIMATE.start_main_#t~ite64_91|)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_70, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_55, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_76, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_50, ~y~0=v_~y~0_81, ~x~0=v_~x~0_57, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_91|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_27, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_70, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_198, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_55, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_46, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_76, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_50, ~y~0=v_~y~0_81, ~x~0=v_~x~0_57, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_90|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_19|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:34:25,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:34:25 BasicIcfg [2019-12-07 17:34:25,464 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:34:25,464 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:34:25,464 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:34:25,464 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:34:25,465 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:31:43" (3/4) ... [2019-12-07 17:34:25,466 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:34:25,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1057] [1057] ULTIMATE.startENTRY-->L854: Formula: (let ((.cse0 (store |v_#valid_122| 0 0))) (and (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t221~0.base_70|)) (= |v_ULTIMATE.start_main_~#t221~0.offset_44| 0) (= v_~z$r_buff1_thd2~0_128 0) (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t221~0.base_70| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t221~0.base_70|) |v_ULTIMATE.start_main_~#t221~0.offset_44| 0))) (= 0 v_~z$flush_delayed~0_241) (= v_~z$r_buff0_thd1~0_60 0) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_6| 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t221~0.base_70| 4)) (= v_~z$w_buff1_used~0_546 0) (= 0 v_~__unbuffered_p3_EAX~0_92) (= v_~__unbuffered_cnt~0_193 0) (= v_~z$read_delayed~0_6 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t221~0.base_70|) (= v_~z$r_buff1_thd0~0_247 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$w_buff0~0_267 0) (= 0 v_~__unbuffered_p2_EAX~0_115) (= v_~main$tmp_guard0~0_28 0) (= 0 v_~z$r_buff1_thd4~0_282) (= 0 |v_#NULL.base_6|) (= v_~z$r_buff0_thd2~0_59 0) (= 0 v_~__unbuffered_p3_EBX~0_87) (= v_~y~0_120 0) (= v_~z$r_buff1_thd1~0_131 0) (= v_~z$w_buff0_used~0_794 0) (< 0 |v_#StackHeapBarrier_20|) (= v_~a~0_35 0) (= v_~z$r_buff0_thd0~0_129 0) (= v_~z~0_291 0) (= v_~x~0_99 0) (= 0 v_~z$r_buff0_thd3~0_336) (= 0 v_~z$r_buff1_thd3~0_316) (= 0 v_~z$r_buff0_thd4~0_443) (= v_~weak$$choice2~0_248 0) (= 0 v_~z$mem_tmp~0_180) (= 0 v_~weak$$choice0~0_170) (= v_~main$tmp_guard1~0_88 0) (= v_~z$w_buff1~0_199 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t221~0.base_70| 1) |v_#valid_120|) (= v_~__unbuffered_p2_EBX~0_117 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_122|, #memory_int=|v_#memory_int_24|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_9|, ULTIMATE.start_main_~#t221~0.base=|v_ULTIMATE.start_main_~#t221~0.base_70|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_128, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_171|, ~a~0=v_~a~0_35, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_129, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_443, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_92, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_115, ULTIMATE.start_main_~#t224~0.base=|v_ULTIMATE.start_main_~#t224~0.base_24|, ~z$mem_tmp~0=v_~z$mem_tmp~0_180, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_117, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_546, ~z$flush_delayed~0=v_~z$flush_delayed~0_241, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_28|, ~weak$$choice0~0=v_~weak$$choice0~0_170, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_150|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_131, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_336, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_193, ~x~0=v_~x~0_99, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_282, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_15|, ULTIMATE.start_main_~#t221~0.offset=|v_ULTIMATE.start_main_~#t221~0.offset_44|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_199, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_88, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t224~0.offset=|v_ULTIMATE.start_main_~#t224~0.offset_18|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_247, ~y~0=v_~y~0_120, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_59, ULTIMATE.start_main_~#t223~0.offset=|v_ULTIMATE.start_main_~#t223~0.offset_18|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_794, ~z$w_buff0~0=v_~z$w_buff0~0_267, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_316, ULTIMATE.start_main_~#t222~0.base=|v_ULTIMATE.start_main_~#t222~0.base_62|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_48|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_87, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_174|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_45|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_45|, #valid=|v_#valid_120|, ULTIMATE.start_main_~#t222~0.offset=|v_ULTIMATE.start_main_~#t222~0.offset_37|, ULTIMATE.start_main_~#t223~0.base=|v_ULTIMATE.start_main_~#t223~0.base_24|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_291, ~weak$$choice2~0=v_~weak$$choice2~0_248, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_60} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t221~0.base, ULTIMATE.start_main_#t~nondet55, ~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_~#t224~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_~#t221~0.offset, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t224~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t223~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t222~0.base, 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_#res, #valid, ULTIMATE.start_main_~#t222~0.offset, ULTIMATE.start_main_~#t223~0.base, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:34:25,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] L854-1-->L856: Formula: (and (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t222~0.base_11| 4) |v_#length_21|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t222~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t222~0.base_11|) |v_ULTIMATE.start_main_~#t222~0.offset_10| 1)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t222~0.offset_10| 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t222~0.base_11|) (= 0 (select |v_#valid_51| |v_ULTIMATE.start_main_~#t222~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t222~0.base_11| 0)) (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t222~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, ULTIMATE.start_main_~#t222~0.offset=|v_ULTIMATE.start_main_~#t222~0.offset_10|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t222~0.base=|v_ULTIMATE.start_main_~#t222~0.base_11|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t222~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t222~0.base, #length] because there is no mapped edge [2019-12-07 17:34:25,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] L856-1-->L858: Formula: (and (= |v_#valid_52| (store |v_#valid_53| |v_ULTIMATE.start_main_~#t223~0.base_13| 1)) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t223~0.base_13| 4) |v_#length_23|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t223~0.base_13|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t223~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t223~0.base_13|) |v_ULTIMATE.start_main_~#t223~0.offset_11| 2)) |v_#memory_int_17|) (= |v_ULTIMATE.start_main_~#t223~0.offset_11| 0) (= 0 (select |v_#valid_53| |v_ULTIMATE.start_main_~#t223~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t223~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t223~0.offset=|v_ULTIMATE.start_main_~#t223~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t223~0.base=|v_ULTIMATE.start_main_~#t223~0.base_13|, #valid=|v_#valid_52|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_17|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t223~0.offset, ULTIMATE.start_main_~#t223~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length] because there is no mapped edge [2019-12-07 17:34:25,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L858-1-->L860: Formula: (and (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t224~0.base_10| 1)) (= |v_ULTIMATE.start_main_~#t224~0.offset_9| 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t224~0.base_10|) (not (= 0 |v_ULTIMATE.start_main_~#t224~0.base_10|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t224~0.base_10| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t224~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t224~0.base_10|) |v_ULTIMATE.start_main_~#t224~0.offset_9| 3)) |v_#memory_int_11|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t224~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, ULTIMATE.start_main_~#t224~0.offset=|v_ULTIMATE.start_main_~#t224~0.offset_9|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t224~0.base=|v_ULTIMATE.start_main_~#t224~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t224~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t224~0.base] because there is no mapped edge [2019-12-07 17:34:25,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] P3ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0~0_33 v_~z$w_buff1~0_25) (= (ite (not (and (not (= (mod v_~z$w_buff0_used~0_103 256) 0)) (not (= (mod v_~z$w_buff1_used~0_58 256) 0)))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_8|) (= |v_P3Thread1of1ForFork2_#in~arg.offset_10| v_P3Thread1of1ForFork2_~arg.offset_8) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_10 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_8|) (= v_~z$w_buff0_used~0_104 v_~z$w_buff1_used~0_58) (= v_~z$w_buff0_used~0_103 1) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_10 0)) (= v_P3Thread1of1ForFork2_~arg.base_8 |v_P3Thread1of1ForFork2_#in~arg.base_10|) (= 1 v_~z$w_buff0~0_32)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~z$w_buff0~0=v_~z$w_buff0~0_33, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_10|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_10|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_10, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_8, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_103, ~z$w_buff0~0=v_~z$w_buff0~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_58, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_10|, ~z$w_buff1~0=v_~z$w_buff1~0_25, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_8|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_8, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_10|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 17:34:25,469 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L816-2-->L816-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1458060784 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1458060784 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite28_Out1458060784| ~z$w_buff1~0_In1458060784)) (and (not .cse1) (not .cse0) (= |P3Thread1of1ForFork2_#t~ite28_Out1458060784| ~z$w_buff0~0_In1458060784)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1458060784, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1458060784, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1458060784, ~z$w_buff1~0=~z$w_buff1~0_In1458060784} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out1458060784|, ~z$w_buff0~0=~z$w_buff0~0_In1458060784, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1458060784, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1458060784, ~z$w_buff1~0=~z$w_buff1~0_In1458060784} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 17:34:25,469 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [909] [909] L816-4-->L817: Formula: (= v_~z~0_22 |v_P3Thread1of1ForFork2_#t~ite28_10|) InVars {P3Thread1of1ForFork2_#t~ite28=|v_P3Thread1of1ForFork2_#t~ite28_10|} OutVars{P3Thread1of1ForFork2_#t~ite29=|v_P3Thread1of1ForFork2_#t~ite29_5|, P3Thread1of1ForFork2_#t~ite28=|v_P3Thread1of1ForFork2_#t~ite28_9|, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28, ~z~0] because there is no mapped edge [2019-12-07 17:34:25,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L821-->L822: Formula: (and (= v_~z$r_buff0_thd4~0_68 v_~z$r_buff0_thd4~0_67) (not (= (mod v_~weak$$choice2~0_34 256) 0))) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_34} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_6|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_7|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_34} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 17:34:25,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-1858744388 256) 0))) (or (and (= ~z~0_In-1858744388 |P3Thread1of1ForFork2_#t~ite48_Out-1858744388|) .cse0) (and (= |P3Thread1of1ForFork2_#t~ite48_Out-1858744388| ~z$mem_tmp~0_In-1858744388) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1858744388, ~z$flush_delayed~0=~z$flush_delayed~0_In-1858744388, ~z~0=~z~0_In-1858744388} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1858744388, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out-1858744388|, ~z$flush_delayed~0=~z$flush_delayed~0_In-1858744388, ~z~0=~z~0_In-1858744388} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 17:34:25,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= v_P0Thread1of1ForFork3_~arg.base_6 |v_P0Thread1of1ForFork3_#in~arg.base_8|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_8| v_P0Thread1of1ForFork3_~arg.offset_6) (= v_~a~0_12 1) (= (+ v_~__unbuffered_cnt~0_86 1) v_~__unbuffered_cnt~0_85) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_~x~0_28 1)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_8|} OutVars{~a~0=v_~a~0_12, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_8|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_6, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_6, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_8|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-07 17:34:25,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] P1ENTRY-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= v_~x~0_25 2) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_P1Thread1of1ForFork0_~arg.offset_7 |v_P1Thread1of1ForFork0_#in~arg.offset_9|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~y~0_51 1) (= v_P1Thread1of1ForFork0_~arg.base_7 |v_P1Thread1of1ForFork0_#in~arg.base_9|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_9|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_7, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_7, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_9|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_51, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 17:34:25,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In781495581 256)))) (or (and (= ~z$mem_tmp~0_In781495581 |P2Thread1of1ForFork1_#t~ite25_Out781495581|) (not .cse0)) (and .cse0 (= |P2Thread1of1ForFork1_#t~ite25_Out781495581| ~z~0_In781495581)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In781495581, ~z$flush_delayed~0=~z$flush_delayed~0_In781495581, ~z~0=~z~0_In781495581} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In781495581, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out781495581|, ~z$flush_delayed~0=~z$flush_delayed~0_In781495581, ~z~0=~z~0_In781495581} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 17:34:25,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1029] [1029] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83) (= v_~z~0_173 |v_P2Thread1of1ForFork1_#t~ite25_50|) (= 0 v_~z$flush_delayed~0_183)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_50|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_49|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, ~z$flush_delayed~0=v_~z$flush_delayed~0_183, ~z~0=v_~z~0_173, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 17:34:25,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L832-->L832-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1934008275 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In1934008275 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite51_Out1934008275| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In1934008275 |P3Thread1of1ForFork2_#t~ite51_Out1934008275|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1934008275, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1934008275} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out1934008275|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1934008275, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1934008275} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 17:34:25,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L833-->L833-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In1266637219 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1266637219 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In1266637219 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1266637219 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite52_Out1266637219| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P3Thread1of1ForFork2_#t~ite52_Out1266637219| ~z$w_buff1_used~0_In1266637219) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1266637219, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1266637219, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1266637219, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1266637219} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out1266637219|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1266637219, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1266637219, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1266637219, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1266637219} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 17:34:25,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L834-->L835: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1961879324 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In1961879324 256))) (.cse1 (= ~z$r_buff0_thd4~0_Out1961879324 ~z$r_buff0_thd4~0_In1961879324))) (or (and .cse0 .cse1) (and (= 0 ~z$r_buff0_thd4~0_Out1961879324) (not .cse0) (not .cse2)) (and .cse2 .cse1))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1961879324, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1961879324} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out1961879324|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1961879324, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1961879324} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 17:34:25,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L835-->L835-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In1695147365 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In1695147365 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In1695147365 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1695147365 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite54_Out1695147365| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P3Thread1of1ForFork2_#t~ite54_Out1695147365| ~z$r_buff1_thd4~0_In1695147365) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1695147365, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1695147365, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1695147365, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1695147365} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out1695147365|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1695147365, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1695147365, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1695147365, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1695147365} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 17:34:25,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1026] [1026] L835-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= |v_P3Thread1of1ForFork2_#t~ite54_28| v_~z$r_buff1_thd4~0_234) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_27|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_234, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 17:34:25,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L864-->L866-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_175 256)) (= (mod v_~z$r_buff0_thd0~0_16 256) 0)) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_175, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_175, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 17:34:25,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L866-2-->L866-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-242201651 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-242201651 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite59_Out-242201651| ~z~0_In-242201651) (or .cse0 .cse1)) (and (not .cse1) (= ~z$w_buff1~0_In-242201651 |ULTIMATE.start_main_#t~ite59_Out-242201651|) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-242201651, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-242201651, ~z$w_buff1~0=~z$w_buff1~0_In-242201651, ~z~0=~z~0_In-242201651} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-242201651, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-242201651, ~z$w_buff1~0=~z$w_buff1~0_In-242201651, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-242201651|, ~z~0=~z~0_In-242201651} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 17:34:25,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L866-4-->L867: Formula: (= v_~z~0_76 |v_ULTIMATE.start_main_#t~ite59_14|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_14|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_10|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_13|, ~z~0=v_~z~0_76} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 17:34:25,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L867-->L867-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-85149177 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-85149177 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite61_Out-85149177|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite61_Out-85149177| ~z$w_buff0_used~0_In-85149177) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-85149177, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-85149177} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-85149177, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-85149177|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-85149177} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 17:34:25,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [998] [998] L868-->L868-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1110930312 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1110930312 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In1110930312 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1110930312 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite62_Out1110930312|)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite62_Out1110930312| ~z$w_buff1_used~0_In1110930312) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1110930312, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1110930312, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1110930312, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1110930312} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1110930312|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1110930312, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1110930312, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1110930312, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1110930312} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 17:34:25,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L869-->L869-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In791165630 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In791165630 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite63_Out791165630|)) (and (= ~z$r_buff0_thd0~0_In791165630 |ULTIMATE.start_main_#t~ite63_Out791165630|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In791165630, ~z$w_buff0_used~0=~z$w_buff0_used~0_In791165630} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out791165630|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In791165630, ~z$w_buff0_used~0=~z$w_buff0_used~0_In791165630} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 17:34:25,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L870-->L870-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1049486796 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In1049486796 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1049486796 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In1049486796 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite64_Out1049486796|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite64_Out1049486796| ~z$r_buff1_thd0~0_In1049486796) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1049486796, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1049486796, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1049486796, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1049486796} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1049486796, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1049486796, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1049486796, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1049486796, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out1049486796|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 17:34:25,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1048] [1048] L870-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= v_~x~0_57 2) (= v_~__unbuffered_p2_EBX~0_70 0) (= 2 v_~__unbuffered_p2_EAX~0_76) (= 0 v_~__unbuffered_p3_EBX~0_50) (= v_~y~0_81 2) (= 1 v_~__unbuffered_p3_EAX~0_55))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_46) (= v_ULTIMATE.start___VERIFIER_assert_~expression_27 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_19|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_19| (mod v_~main$tmp_guard1~0_46 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_27 0) (= v_~z$r_buff1_thd0~0_198 |v_ULTIMATE.start_main_#t~ite64_91|)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_70, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_55, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_76, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_50, ~y~0=v_~y~0_81, ~x~0=v_~x~0_57, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_91|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_27, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_70, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_198, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_55, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_46, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_76, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_50, ~y~0=v_~y~0_81, ~x~0=v_~x~0_57, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_90|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_19|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:34:25,546 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_573310ed-20e9-4a30-bf95-244ac88cd2d1/bin/uautomizer/witness.graphml [2019-12-07 17:34:25,546 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:34:25,547 INFO L168 Benchmark]: Toolchain (without parser) took 162522.27 ms. Allocated memory was 1.0 GB in the beginning and 9.0 GB in the end (delta: 8.0 GB). Free memory was 938.0 MB in the beginning and 3.6 GB in the end (delta: -2.7 GB). Peak memory consumption was 5.3 GB. Max. memory is 11.5 GB. [2019-12-07 17:34:25,548 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:34:25,548 INFO L168 Benchmark]: CACSL2BoogieTranslator took 392.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -117.6 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:34:25,548 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.97 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 17:34:25,548 INFO L168 Benchmark]: Boogie Preprocessor took 28.16 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 17:34:25,549 INFO L168 Benchmark]: RCFGBuilder took 472.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 988.9 MB in the end (delta: 61.3 MB). Peak memory consumption was 61.3 MB. Max. memory is 11.5 GB. [2019-12-07 17:34:25,549 INFO L168 Benchmark]: TraceAbstraction took 161502.09 ms. Allocated memory was 1.1 GB in the beginning and 9.0 GB in the end (delta: 7.9 GB). Free memory was 988.9 MB in the beginning and 3.7 GB in the end (delta: -2.7 GB). Peak memory consumption was 5.2 GB. Max. memory is 11.5 GB. [2019-12-07 17:34:25,549 INFO L168 Benchmark]: Witness Printer took 82.28 ms. Allocated memory is still 9.0 GB. Free memory was 3.7 GB in the beginning and 3.6 GB in the end (delta: 66.5 MB). Peak memory consumption was 66.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:34:25,550 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 392.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -117.6 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.97 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 28.16 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 472.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 988.9 MB in the end (delta: 61.3 MB). Peak memory consumption was 61.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 161502.09 ms. Allocated memory was 1.1 GB in the beginning and 9.0 GB in the end (delta: 7.9 GB). Free memory was 988.9 MB in the beginning and 3.7 GB in the end (delta: -2.7 GB). Peak memory consumption was 5.2 GB. Max. memory is 11.5 GB. * Witness Printer took 82.28 ms. Allocated memory is still 9.0 GB. Free memory was 3.7 GB in the beginning and 3.6 GB in the end (delta: 66.5 MB). Peak memory consumption was 66.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 211 ProgramPointsBefore, 113 ProgramPointsAfterwards, 254 TransitionsBefore, 134 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 51 ConcurrentYvCompositions, 27 ChoiceCompositions, 10992 VarBasedMoverChecksPositive, 301 VarBasedMoverChecksNegative, 70 SemBasedMoverChecksPositive, 323 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 147708 CheckedPairsTotal, 132 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L854] FCALL, FORK 0 pthread_create(&t221, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] FCALL, FORK 0 pthread_create(&t222, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] FCALL, FORK 0 pthread_create(&t223, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] FCALL, FORK 0 pthread_create(&t224, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L804] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L805] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L806] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L807] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L808] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L809] 4 z$r_buff0_thd4 = (_Bool)1 [L812] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 4 z$flush_delayed = weak$$choice2 [L815] 4 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L818] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L819] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L820] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L822] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L823] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] 4 z = z$flush_delayed ? z$mem_tmp : z [L825] 4 z$flush_delayed = (_Bool)0 [L828] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L831] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 y = 2 [L771] 3 __unbuffered_p2_EAX = y [L774] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 3 z$flush_delayed = weak$$choice2 [L777] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L779] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L780] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L781] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L782] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L783] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L784] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L785] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L831] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L832] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L833] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L867] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L868] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L869] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 199 locations, 2 error locations. Result: UNSAFE, OverallTime: 161.3s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 44.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5137 SDtfs, 6711 SDslu, 9333 SDs, 0 SdLazy, 3740 SolverSat, 301 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 28 SyntacticMatches, 6 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=384846occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 102.8s AutomataMinimizationTime, 22 MinimizatonAttempts, 600974 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 908 NumberOfCodeBlocks, 908 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 820 ConstructedInterpolants, 0 QuantifiedInterpolants, 279859 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...