./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix034_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_00fad3d8-4a93-4ce0-9275-5de7d8d66d84/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_00fad3d8-4a93-4ce0-9275-5de7d8d66d84/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_00fad3d8-4a93-4ce0-9275-5de7d8d66d84/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_00fad3d8-4a93-4ce0-9275-5de7d8d66d84/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix034_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_00fad3d8-4a93-4ce0-9275-5de7d8d66d84/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_00fad3d8-4a93-4ce0-9275-5de7d8d66d84/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 ff5c85ebee88b83fb277698b63b87ea24f313b6a ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.24-6b5699a [2019-11-25 08:55:03,312 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:55:03,313 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:55:03,328 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:55:03,329 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:55:03,330 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:55:03,332 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:55:03,340 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:55:03,344 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:55:03,349 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:55:03,350 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:55:03,351 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:55:03,351 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:55:03,353 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:55:03,354 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:55:03,355 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:55:03,356 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:55:03,357 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:55:03,359 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:55:03,365 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:55:03,366 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:55:03,367 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:55:03,368 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:55:03,368 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:55:03,371 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:55:03,371 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:55:03,371 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:55:03,372 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:55:03,372 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:55:03,373 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:55:03,373 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:55:03,373 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:55:03,374 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:55:03,374 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:55:03,375 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:55:03,375 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:55:03,376 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:55:03,376 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:55:03,376 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:55:03,377 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:55:03,377 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:55:03,378 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_00fad3d8-4a93-4ce0-9275-5de7d8d66d84/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:55:03,390 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:55:03,390 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:55:03,391 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:55:03,391 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:55:03,391 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:55:03,391 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:55:03,392 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:55:03,392 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:55:03,392 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:55:03,392 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:55:03,392 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:55:03,393 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:55:03,393 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:55:03,393 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:55:03,393 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:55:03,393 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:55:03,393 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:55:03,394 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:55:03,394 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:55:03,394 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:55:03,394 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:55:03,394 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:55:03,395 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:55:03,395 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:55:03,395 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:55:03,395 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:55:03,395 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:55:03,396 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:55:03,396 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_00fad3d8-4a93-4ce0-9275-5de7d8d66d84/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 -> ff5c85ebee88b83fb277698b63b87ea24f313b6a [2019-11-25 08:55:03,530 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:55:03,540 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:55:03,543 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:55:03,544 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:55:03,544 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:55:03,545 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_00fad3d8-4a93-4ce0-9275-5de7d8d66d84/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix034_pso.opt.i [2019-11-25 08:55:03,611 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_00fad3d8-4a93-4ce0-9275-5de7d8d66d84/bin/uautomizer/data/7d66e8747/d73b92d8a6de4560a2df677049f73e72/FLAGfe12b5ec9 [2019-11-25 08:55:04,029 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:55:04,030 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_00fad3d8-4a93-4ce0-9275-5de7d8d66d84/sv-benchmarks/c/pthread-wmm/mix034_pso.opt.i [2019-11-25 08:55:04,047 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_00fad3d8-4a93-4ce0-9275-5de7d8d66d84/bin/uautomizer/data/7d66e8747/d73b92d8a6de4560a2df677049f73e72/FLAGfe12b5ec9 [2019-11-25 08:55:04,339 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_00fad3d8-4a93-4ce0-9275-5de7d8d66d84/bin/uautomizer/data/7d66e8747/d73b92d8a6de4560a2df677049f73e72 [2019-11-25 08:55:04,341 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:55:04,342 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:55:04,343 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:55:04,343 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:55:04,346 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:55:04,346 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:55:04" (1/1) ... [2019-11-25 08:55:04,350 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64e67cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:04, skipping insertion in model container [2019-11-25 08:55:04,350 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:55:04" (1/1) ... [2019-11-25 08:55:04,356 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:55:04,403 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:55:04,796 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:55:04,810 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:55:04,891 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:55:04,962 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:55:04,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:04 WrapperNode [2019-11-25 08:55:04,963 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:55:04,963 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:55:04,964 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:55:04,964 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:55:04,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:04" (1/1) ... [2019-11-25 08:55:04,988 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:04" (1/1) ... [2019-11-25 08:55:05,015 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:55:05,016 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:55:05,016 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:55:05,016 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:55:05,025 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:04" (1/1) ... [2019-11-25 08:55:05,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:04" (1/1) ... [2019-11-25 08:55:05,030 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:04" (1/1) ... [2019-11-25 08:55:05,030 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:04" (1/1) ... [2019-11-25 08:55:05,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:04" (1/1) ... [2019-11-25 08:55:05,048 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:04" (1/1) ... [2019-11-25 08:55:05,051 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:04" (1/1) ... [2019-11-25 08:55:05,055 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:55:05,056 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:55:05,056 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:55:05,056 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:55:05,057 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00fad3d8-4a93-4ce0-9275-5de7d8d66d84/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-11-25 08:55:05,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 08:55:05,128 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-25 08:55:05,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:55:05,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 08:55:05,128 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-25 08:55:05,129 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-25 08:55:05,129 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-25 08:55:05,129 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-25 08:55:05,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-25 08:55:05,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:55:05,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:55:05,131 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-25 08:55:05,682 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:55:05,684 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-25 08:55:05,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:55:05 BoogieIcfgContainer [2019-11-25 08:55:05,685 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:55:05,686 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:55:05,686 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:55:05,688 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:55:05,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:55:04" (1/3) ... [2019-11-25 08:55:05,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1190bbfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:55:05, skipping insertion in model container [2019-11-25 08:55:05,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:04" (2/3) ... [2019-11-25 08:55:05,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1190bbfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:55:05, skipping insertion in model container [2019-11-25 08:55:05,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:55:05" (3/3) ... [2019-11-25 08:55:05,690 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_pso.opt.i [2019-11-25 08:55:05,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,759 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,760 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,784 WARN L315 ript$VariableManager]: TermVariabe P0Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,787 WARN L315 ript$VariableManager]: TermVariabe P0Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,818 WARN L315 ript$VariableManager]: TermVariabe P0Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,818 WARN L315 ript$VariableManager]: TermVariabe P0Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,845 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,845 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,846 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,846 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,846 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,852 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,852 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,852 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,852 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,853 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,860 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,860 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,860 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,860 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,861 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:05,889 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-25 08:55:05,889 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:55:05,897 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-25 08:55:05,906 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-25 08:55:05,927 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:55:05,927 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:55:05,927 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:55:05,927 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:55:05,927 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:55:05,927 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:55:05,927 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:55:05,928 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:55:05,955 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 275 places, 351 transitions [2019-11-25 08:55:07,777 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25977 states. [2019-11-25 08:55:07,779 INFO L276 IsEmpty]: Start isEmpty. Operand 25977 states. [2019-11-25 08:55:07,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-25 08:55:07,788 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:07,789 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:07,789 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:07,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:07,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1294562099, now seen corresponding path program 1 times [2019-11-25 08:55:07,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:07,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698507631] [2019-11-25 08:55:07,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:08,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:08,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698507631] [2019-11-25 08:55:08,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:08,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:55:08,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743797538] [2019-11-25 08:55:08,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:55:08,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:08,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:55:08,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:55:08,062 INFO L87 Difference]: Start difference. First operand 25977 states. Second operand 4 states. [2019-11-25 08:55:08,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:08,643 INFO L93 Difference]: Finished difference Result 26617 states and 102122 transitions. [2019-11-25 08:55:08,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:55:08,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-11-25 08:55:08,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:08,866 INFO L225 Difference]: With dead ends: 26617 [2019-11-25 08:55:08,866 INFO L226 Difference]: Without dead ends: 20361 [2019-11-25 08:55:08,871 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:55:09,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20361 states. [2019-11-25 08:55:09,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20361 to 20361. [2019-11-25 08:55:09,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20361 states. [2019-11-25 08:55:10,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20361 states to 20361 states and 78426 transitions. [2019-11-25 08:55:10,177 INFO L78 Accepts]: Start accepts. Automaton has 20361 states and 78426 transitions. Word has length 40 [2019-11-25 08:55:10,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:10,178 INFO L462 AbstractCegarLoop]: Abstraction has 20361 states and 78426 transitions. [2019-11-25 08:55:10,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:55:10,178 INFO L276 IsEmpty]: Start isEmpty. Operand 20361 states and 78426 transitions. [2019-11-25 08:55:10,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-25 08:55:10,190 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:10,190 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:10,191 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:10,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:10,191 INFO L82 PathProgramCache]: Analyzing trace with hash -715711146, now seen corresponding path program 1 times [2019-11-25 08:55:10,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:10,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555597136] [2019-11-25 08:55:10,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:10,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:10,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:10,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555597136] [2019-11-25 08:55:10,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:10,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:55:10,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583086310] [2019-11-25 08:55:10,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:55:10,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:10,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:55:10,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:55:10,368 INFO L87 Difference]: Start difference. First operand 20361 states and 78426 transitions. Second operand 5 states. [2019-11-25 08:55:11,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:11,665 INFO L93 Difference]: Finished difference Result 31839 states and 116043 transitions. [2019-11-25 08:55:11,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:55:11,665 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-11-25 08:55:11,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:11,789 INFO L225 Difference]: With dead ends: 31839 [2019-11-25 08:55:11,789 INFO L226 Difference]: Without dead ends: 31287 [2019-11-25 08:55:11,790 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:55:12,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31287 states. [2019-11-25 08:55:12,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31287 to 29706. [2019-11-25 08:55:12,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29706 states. [2019-11-25 08:55:12,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29706 states to 29706 states and 109520 transitions. [2019-11-25 08:55:12,872 INFO L78 Accepts]: Start accepts. Automaton has 29706 states and 109520 transitions. Word has length 48 [2019-11-25 08:55:12,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:12,874 INFO L462 AbstractCegarLoop]: Abstraction has 29706 states and 109520 transitions. [2019-11-25 08:55:12,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:55:12,874 INFO L276 IsEmpty]: Start isEmpty. Operand 29706 states and 109520 transitions. [2019-11-25 08:55:13,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-25 08:55:13,217 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:13,217 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-11-25 08:55:13,217 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:13,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:13,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1400380026, now seen corresponding path program 1 times [2019-11-25 08:55:13,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:13,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129353448] [2019-11-25 08:55:13,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:13,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:13,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:13,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129353448] [2019-11-25 08:55:13,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:13,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:55:13,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153677978] [2019-11-25 08:55:13,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:55:13,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:13,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:55:13,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:55:13,306 INFO L87 Difference]: Start difference. First operand 29706 states and 109520 transitions. Second operand 5 states. [2019-11-25 08:55:13,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:13,769 INFO L93 Difference]: Finished difference Result 38697 states and 139692 transitions. [2019-11-25 08:55:13,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:55:13,770 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-11-25 08:55:13,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:13,927 INFO L225 Difference]: With dead ends: 38697 [2019-11-25 08:55:13,927 INFO L226 Difference]: Without dead ends: 38249 [2019-11-25 08:55:13,928 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:55:14,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38249 states. [2019-11-25 08:55:15,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38249 to 32952. [2019-11-25 08:55:15,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32952 states. [2019-11-25 08:55:15,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32952 states to 32952 states and 120529 transitions. [2019-11-25 08:55:15,295 INFO L78 Accepts]: Start accepts. Automaton has 32952 states and 120529 transitions. Word has length 49 [2019-11-25 08:55:15,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:15,297 INFO L462 AbstractCegarLoop]: Abstraction has 32952 states and 120529 transitions. [2019-11-25 08:55:15,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:55:15,297 INFO L276 IsEmpty]: Start isEmpty. Operand 32952 states and 120529 transitions. [2019-11-25 08:55:15,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-25 08:55:15,307 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:15,307 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] [2019-11-25 08:55:15,307 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:15,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:15,307 INFO L82 PathProgramCache]: Analyzing trace with hash 814114028, now seen corresponding path program 1 times [2019-11-25 08:55:15,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:15,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766807787] [2019-11-25 08:55:15,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:15,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:15,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:15,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766807787] [2019-11-25 08:55:15,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:15,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:55:15,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041883211] [2019-11-25 08:55:15,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:55:15,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:15,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:55:15,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:15,386 INFO L87 Difference]: Start difference. First operand 32952 states and 120529 transitions. Second operand 3 states. [2019-11-25 08:55:15,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:15,619 INFO L93 Difference]: Finished difference Result 42413 states and 152020 transitions. [2019-11-25 08:55:15,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:55:15,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-25 08:55:15,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:15,767 INFO L225 Difference]: With dead ends: 42413 [2019-11-25 08:55:15,767 INFO L226 Difference]: Without dead ends: 42413 [2019-11-25 08:55:15,768 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-11-25 08:55:15,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42413 states. [2019-11-25 08:55:16,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42413 to 37666. [2019-11-25 08:55:16,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37666 states. [2019-11-25 08:55:16,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37666 states to 37666 states and 136333 transitions. [2019-11-25 08:55:16,689 INFO L78 Accepts]: Start accepts. Automaton has 37666 states and 136333 transitions. Word has length 51 [2019-11-25 08:55:16,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:16,689 INFO L462 AbstractCegarLoop]: Abstraction has 37666 states and 136333 transitions. [2019-11-25 08:55:16,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:55:16,690 INFO L276 IsEmpty]: Start isEmpty. Operand 37666 states and 136333 transitions. [2019-11-25 08:55:16,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-25 08:55:16,709 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:16,709 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] [2019-11-25 08:55:16,710 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:16,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:16,710 INFO L82 PathProgramCache]: Analyzing trace with hash 142129207, now seen corresponding path program 1 times [2019-11-25 08:55:16,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:16,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315777182] [2019-11-25 08:55:16,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:16,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:16,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:16,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315777182] [2019-11-25 08:55:16,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:16,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:55:16,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564849323] [2019-11-25 08:55:16,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:55:16,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:16,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:55:16,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:55:16,805 INFO L87 Difference]: Start difference. First operand 37666 states and 136333 transitions. Second operand 6 states. [2019-11-25 08:55:17,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:17,765 INFO L93 Difference]: Finished difference Result 48757 states and 172982 transitions. [2019-11-25 08:55:17,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-25 08:55:17,766 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-11-25 08:55:17,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:17,869 INFO L225 Difference]: With dead ends: 48757 [2019-11-25 08:55:17,870 INFO L226 Difference]: Without dead ends: 48237 [2019-11-25 08:55:17,870 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-11-25 08:55:18,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48237 states. [2019-11-25 08:55:18,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48237 to 38230. [2019-11-25 08:55:18,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38230 states. [2019-11-25 08:55:18,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38230 states to 38230 states and 138496 transitions. [2019-11-25 08:55:18,697 INFO L78 Accepts]: Start accepts. Automaton has 38230 states and 138496 transitions. Word has length 55 [2019-11-25 08:55:18,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:18,697 INFO L462 AbstractCegarLoop]: Abstraction has 38230 states and 138496 transitions. [2019-11-25 08:55:18,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:55:18,697 INFO L276 IsEmpty]: Start isEmpty. Operand 38230 states and 138496 transitions. [2019-11-25 08:55:18,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-25 08:55:18,712 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:18,713 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] [2019-11-25 08:55:18,713 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:18,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:18,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1176357839, now seen corresponding path program 1 times [2019-11-25 08:55:18,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:18,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843089760] [2019-11-25 08:55:18,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:18,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:18,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843089760] [2019-11-25 08:55:18,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:18,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:55:18,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116268728] [2019-11-25 08:55:18,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:55:18,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:18,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:55:18,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:55:18,838 INFO L87 Difference]: Start difference. First operand 38230 states and 138496 transitions. Second operand 6 states. [2019-11-25 08:55:19,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:19,912 INFO L93 Difference]: Finished difference Result 53006 states and 189572 transitions. [2019-11-25 08:55:19,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:55:19,912 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-11-25 08:55:19,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:20,071 INFO L225 Difference]: With dead ends: 53006 [2019-11-25 08:55:20,071 INFO L226 Difference]: Without dead ends: 52030 [2019-11-25 08:55:20,072 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:55:20,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52030 states. [2019-11-25 08:55:20,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52030 to 48783. [2019-11-25 08:55:20,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48783 states. [2019-11-25 08:55:20,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48783 states to 48783 states and 175227 transitions. [2019-11-25 08:55:20,936 INFO L78 Accepts]: Start accepts. Automaton has 48783 states and 175227 transitions. Word has length 55 [2019-11-25 08:55:20,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:20,937 INFO L462 AbstractCegarLoop]: Abstraction has 48783 states and 175227 transitions. [2019-11-25 08:55:20,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:55:20,937 INFO L276 IsEmpty]: Start isEmpty. Operand 48783 states and 175227 transitions. [2019-11-25 08:55:20,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-25 08:55:20,952 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:20,952 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] [2019-11-25 08:55:20,952 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:20,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:20,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1321658098, now seen corresponding path program 1 times [2019-11-25 08:55:20,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:20,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252206838] [2019-11-25 08:55:20,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:20,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:21,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:21,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252206838] [2019-11-25 08:55:21,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:21,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 08:55:21,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169530770] [2019-11-25 08:55:21,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:55:21,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:21,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:55:21,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:55:21,067 INFO L87 Difference]: Start difference. First operand 48783 states and 175227 transitions. Second operand 7 states. [2019-11-25 08:55:22,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:22,195 INFO L93 Difference]: Finished difference Result 70898 states and 244524 transitions. [2019-11-25 08:55:22,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 08:55:22,195 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-11-25 08:55:22,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:22,356 INFO L225 Difference]: With dead ends: 70898 [2019-11-25 08:55:22,356 INFO L226 Difference]: Without dead ends: 70898 [2019-11-25 08:55:22,356 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:55:22,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70898 states. [2019-11-25 08:55:23,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70898 to 57891. [2019-11-25 08:55:23,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57891 states. [2019-11-25 08:55:23,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57891 states to 57891 states and 203151 transitions. [2019-11-25 08:55:23,799 INFO L78 Accepts]: Start accepts. Automaton has 57891 states and 203151 transitions. Word has length 55 [2019-11-25 08:55:23,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:23,799 INFO L462 AbstractCegarLoop]: Abstraction has 57891 states and 203151 transitions. [2019-11-25 08:55:23,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:55:23,799 INFO L276 IsEmpty]: Start isEmpty. Operand 57891 states and 203151 transitions. [2019-11-25 08:55:23,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-25 08:55:23,811 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:23,811 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] [2019-11-25 08:55:23,812 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:23,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:23,812 INFO L82 PathProgramCache]: Analyzing trace with hash -2085805517, now seen corresponding path program 1 times [2019-11-25 08:55:23,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:23,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644512164] [2019-11-25 08:55:23,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:23,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:23,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644512164] [2019-11-25 08:55:23,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:23,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:55:23,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440813351] [2019-11-25 08:55:23,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:55:23,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:23,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:55:23,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:23,872 INFO L87 Difference]: Start difference. First operand 57891 states and 203151 transitions. Second operand 3 states. [2019-11-25 08:55:24,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:24,037 INFO L93 Difference]: Finished difference Result 43857 states and 152834 transitions. [2019-11-25 08:55:24,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:55:24,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-25 08:55:24,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:24,114 INFO L225 Difference]: With dead ends: 43857 [2019-11-25 08:55:24,114 INFO L226 Difference]: Without dead ends: 43353 [2019-11-25 08:55:24,115 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-11-25 08:55:24,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43353 states. [2019-11-25 08:55:24,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43353 to 41887. [2019-11-25 08:55:24,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41887 states. [2019-11-25 08:55:24,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41887 states to 41887 states and 146705 transitions. [2019-11-25 08:55:24,788 INFO L78 Accepts]: Start accepts. Automaton has 41887 states and 146705 transitions. Word has length 55 [2019-11-25 08:55:24,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:24,788 INFO L462 AbstractCegarLoop]: Abstraction has 41887 states and 146705 transitions. [2019-11-25 08:55:24,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:55:24,789 INFO L276 IsEmpty]: Start isEmpty. Operand 41887 states and 146705 transitions. [2019-11-25 08:55:24,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-25 08:55:24,798 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:24,799 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] [2019-11-25 08:55:24,799 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:24,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:24,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1115337929, now seen corresponding path program 1 times [2019-11-25 08:55:24,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:24,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539515944] [2019-11-25 08:55:24,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:24,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:24,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539515944] [2019-11-25 08:55:24,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:24,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:55:24,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59390950] [2019-11-25 08:55:24,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:55:24,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:24,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:55:24,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:55:24,908 INFO L87 Difference]: Start difference. First operand 41887 states and 146705 transitions. Second operand 6 states. [2019-11-25 08:55:25,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:25,741 INFO L93 Difference]: Finished difference Result 54550 states and 184835 transitions. [2019-11-25 08:55:25,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:55:25,741 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-11-25 08:55:25,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:25,834 INFO L225 Difference]: With dead ends: 54550 [2019-11-25 08:55:25,834 INFO L226 Difference]: Without dead ends: 54550 [2019-11-25 08:55:25,834 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:55:26,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54550 states. [2019-11-25 08:55:26,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54550 to 45862. [2019-11-25 08:55:26,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45862 states. [2019-11-25 08:55:26,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45862 states to 45862 states and 158168 transitions. [2019-11-25 08:55:26,591 INFO L78 Accepts]: Start accepts. Automaton has 45862 states and 158168 transitions. Word has length 56 [2019-11-25 08:55:26,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:26,592 INFO L462 AbstractCegarLoop]: Abstraction has 45862 states and 158168 transitions. [2019-11-25 08:55:26,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:55:26,592 INFO L276 IsEmpty]: Start isEmpty. Operand 45862 states and 158168 transitions. [2019-11-25 08:55:26,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-25 08:55:26,600 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:26,600 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] [2019-11-25 08:55:26,600 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:26,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:26,601 INFO L82 PathProgramCache]: Analyzing trace with hash -227834248, now seen corresponding path program 1 times [2019-11-25 08:55:26,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:26,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073380710] [2019-11-25 08:55:26,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:26,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:26,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:26,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073380710] [2019-11-25 08:55:26,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:26,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:55:26,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144915938] [2019-11-25 08:55:26,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:55:26,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:26,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:55:26,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:55:26,676 INFO L87 Difference]: Start difference. First operand 45862 states and 158168 transitions. Second operand 4 states. [2019-11-25 08:55:26,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:26,731 INFO L93 Difference]: Finished difference Result 8164 states and 24872 transitions. [2019-11-25 08:55:26,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:55:26,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-25 08:55:26,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:26,742 INFO L225 Difference]: With dead ends: 8164 [2019-11-25 08:55:26,742 INFO L226 Difference]: Without dead ends: 6755 [2019-11-25 08:55:26,743 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-11-25 08:55:26,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6755 states. [2019-11-25 08:55:26,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6755 to 6707. [2019-11-25 08:55:26,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6707 states. [2019-11-25 08:55:26,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6707 states to 6707 states and 20041 transitions. [2019-11-25 08:55:26,849 INFO L78 Accepts]: Start accepts. Automaton has 6707 states and 20041 transitions. Word has length 56 [2019-11-25 08:55:26,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:26,849 INFO L462 AbstractCegarLoop]: Abstraction has 6707 states and 20041 transitions. [2019-11-25 08:55:26,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:55:26,850 INFO L276 IsEmpty]: Start isEmpty. Operand 6707 states and 20041 transitions. [2019-11-25 08:55:26,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-25 08:55:26,854 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:26,854 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-11-25 08:55:26,854 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:26,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:26,855 INFO L82 PathProgramCache]: Analyzing trace with hash 599593365, now seen corresponding path program 1 times [2019-11-25 08:55:26,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:26,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255496616] [2019-11-25 08:55:26,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:26,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:26,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:26,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255496616] [2019-11-25 08:55:26,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:26,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:55:26,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199702292] [2019-11-25 08:55:26,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:55:26,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:26,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:55:26,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:55:26,933 INFO L87 Difference]: Start difference. First operand 6707 states and 20041 transitions. Second operand 4 states. [2019-11-25 08:55:27,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:27,071 INFO L93 Difference]: Finished difference Result 7892 states and 23390 transitions. [2019-11-25 08:55:27,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:55:27,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-25 08:55:27,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:27,084 INFO L225 Difference]: With dead ends: 7892 [2019-11-25 08:55:27,084 INFO L226 Difference]: Without dead ends: 7892 [2019-11-25 08:55:27,084 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-11-25 08:55:27,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7892 states. [2019-11-25 08:55:27,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7892 to 7214. [2019-11-25 08:55:27,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7214 states. [2019-11-25 08:55:27,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7214 states to 7214 states and 21447 transitions. [2019-11-25 08:55:27,200 INFO L78 Accepts]: Start accepts. Automaton has 7214 states and 21447 transitions. Word has length 65 [2019-11-25 08:55:27,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:27,200 INFO L462 AbstractCegarLoop]: Abstraction has 7214 states and 21447 transitions. [2019-11-25 08:55:27,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:55:27,201 INFO L276 IsEmpty]: Start isEmpty. Operand 7214 states and 21447 transitions. [2019-11-25 08:55:27,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-25 08:55:27,210 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:27,210 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-11-25 08:55:27,210 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:27,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:27,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1952563596, now seen corresponding path program 1 times [2019-11-25 08:55:27,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:27,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591194963] [2019-11-25 08:55:27,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:27,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:27,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:27,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591194963] [2019-11-25 08:55:27,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:27,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:55:27,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755807141] [2019-11-25 08:55:27,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:55:27,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:27,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:55:27,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:55:27,313 INFO L87 Difference]: Start difference. First operand 7214 states and 21447 transitions. Second operand 6 states. [2019-11-25 08:55:27,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:27,622 INFO L93 Difference]: Finished difference Result 9269 states and 27196 transitions. [2019-11-25 08:55:27,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 08:55:27,622 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-11-25 08:55:27,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:27,631 INFO L225 Difference]: With dead ends: 9269 [2019-11-25 08:55:27,632 INFO L226 Difference]: Without dead ends: 9221 [2019-11-25 08:55:27,632 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-25 08:55:27,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9221 states. [2019-11-25 08:55:27,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9221 to 8053. [2019-11-25 08:55:27,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8053 states. [2019-11-25 08:55:27,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8053 states to 8053 states and 23827 transitions. [2019-11-25 08:55:27,734 INFO L78 Accepts]: Start accepts. Automaton has 8053 states and 23827 transitions. Word has length 65 [2019-11-25 08:55:27,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:27,734 INFO L462 AbstractCegarLoop]: Abstraction has 8053 states and 23827 transitions. [2019-11-25 08:55:27,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:55:27,734 INFO L276 IsEmpty]: Start isEmpty. Operand 8053 states and 23827 transitions. [2019-11-25 08:55:27,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-25 08:55:27,739 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:27,739 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, 1, 1, 1] [2019-11-25 08:55:27,739 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:27,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:27,740 INFO L82 PathProgramCache]: Analyzing trace with hash -60173883, now seen corresponding path program 1 times [2019-11-25 08:55:27,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:27,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067682091] [2019-11-25 08:55:27,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:27,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:27,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:27,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067682091] [2019-11-25 08:55:27,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:27,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:55:27,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169224230] [2019-11-25 08:55:27,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:55:27,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:27,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:55:27,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:55:27,804 INFO L87 Difference]: Start difference. First operand 8053 states and 23827 transitions. Second operand 4 states. [2019-11-25 08:55:28,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:28,037 INFO L93 Difference]: Finished difference Result 10666 states and 31176 transitions. [2019-11-25 08:55:28,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:55:28,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-11-25 08:55:28,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:28,049 INFO L225 Difference]: With dead ends: 10666 [2019-11-25 08:55:28,049 INFO L226 Difference]: Without dead ends: 10666 [2019-11-25 08:55:28,049 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:55:28,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10666 states. [2019-11-25 08:55:28,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10666 to 9076. [2019-11-25 08:55:28,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9076 states. [2019-11-25 08:55:28,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9076 states to 9076 states and 26646 transitions. [2019-11-25 08:55:28,159 INFO L78 Accepts]: Start accepts. Automaton has 9076 states and 26646 transitions. Word has length 69 [2019-11-25 08:55:28,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:28,160 INFO L462 AbstractCegarLoop]: Abstraction has 9076 states and 26646 transitions. [2019-11-25 08:55:28,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:55:28,160 INFO L276 IsEmpty]: Start isEmpty. Operand 9076 states and 26646 transitions. [2019-11-25 08:55:28,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-25 08:55:28,169 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:28,169 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, 1, 1, 1] [2019-11-25 08:55:28,169 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:28,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:28,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1184590598, now seen corresponding path program 1 times [2019-11-25 08:55:28,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:28,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997573853] [2019-11-25 08:55:28,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:28,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:28,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997573853] [2019-11-25 08:55:28,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:28,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:55:28,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573007570] [2019-11-25 08:55:28,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:55:28,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:28,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:55:28,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:55:28,269 INFO L87 Difference]: Start difference. First operand 9076 states and 26646 transitions. Second operand 6 states. [2019-11-25 08:55:28,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:28,723 INFO L93 Difference]: Finished difference Result 10386 states and 29897 transitions. [2019-11-25 08:55:28,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:55:28,724 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-11-25 08:55:28,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:28,734 INFO L225 Difference]: With dead ends: 10386 [2019-11-25 08:55:28,734 INFO L226 Difference]: Without dead ends: 10386 [2019-11-25 08:55:28,735 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:55:28,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10386 states. [2019-11-25 08:55:28,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10386 to 10083. [2019-11-25 08:55:28,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10083 states. [2019-11-25 08:55:28,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10083 states to 10083 states and 29120 transitions. [2019-11-25 08:55:28,850 INFO L78 Accepts]: Start accepts. Automaton has 10083 states and 29120 transitions. Word has length 69 [2019-11-25 08:55:28,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:28,850 INFO L462 AbstractCegarLoop]: Abstraction has 10083 states and 29120 transitions. [2019-11-25 08:55:28,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:55:28,851 INFO L276 IsEmpty]: Start isEmpty. Operand 10083 states and 29120 transitions. [2019-11-25 08:55:28,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-25 08:55:28,858 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:28,858 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-25 08:55:28,858 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:28,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:28,859 INFO L82 PathProgramCache]: Analyzing trace with hash -892618745, now seen corresponding path program 1 times [2019-11-25 08:55:28,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:28,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494086731] [2019-11-25 08:55:28,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:28,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:28,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:28,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494086731] [2019-11-25 08:55:28,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:28,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:55:28,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252618288] [2019-11-25 08:55:28,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:55:28,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:28,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:55:28,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:55:28,953 INFO L87 Difference]: Start difference. First operand 10083 states and 29120 transitions. Second operand 6 states. [2019-11-25 08:55:29,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:29,336 INFO L93 Difference]: Finished difference Result 12000 states and 33627 transitions. [2019-11-25 08:55:29,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 08:55:29,336 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-11-25 08:55:29,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:29,348 INFO L225 Difference]: With dead ends: 12000 [2019-11-25 08:55:29,348 INFO L226 Difference]: Without dead ends: 12000 [2019-11-25 08:55:29,348 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-25 08:55:29,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12000 states. [2019-11-25 08:55:29,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12000 to 10302. [2019-11-25 08:55:29,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10302 states. [2019-11-25 08:55:29,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10302 states to 10302 states and 29172 transitions. [2019-11-25 08:55:29,494 INFO L78 Accepts]: Start accepts. Automaton has 10302 states and 29172 transitions. Word has length 69 [2019-11-25 08:55:29,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:29,495 INFO L462 AbstractCegarLoop]: Abstraction has 10302 states and 29172 transitions. [2019-11-25 08:55:29,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:55:29,495 INFO L276 IsEmpty]: Start isEmpty. Operand 10302 states and 29172 transitions. [2019-11-25 08:55:29,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-25 08:55:29,504 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:29,504 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, 1, 1, 1] [2019-11-25 08:55:29,504 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:29,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:29,505 INFO L82 PathProgramCache]: Analyzing trace with hash -681267832, now seen corresponding path program 1 times [2019-11-25 08:55:29,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:29,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288697244] [2019-11-25 08:55:29,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:29,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:29,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288697244] [2019-11-25 08:55:29,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:29,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:55:29,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256045616] [2019-11-25 08:55:29,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:55:29,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:29,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:55:29,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:55:29,583 INFO L87 Difference]: Start difference. First operand 10302 states and 29172 transitions. Second operand 5 states. [2019-11-25 08:55:29,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:29,954 INFO L93 Difference]: Finished difference Result 12577 states and 35465 transitions. [2019-11-25 08:55:29,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:55:29,954 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-11-25 08:55:29,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:29,975 INFO L225 Difference]: With dead ends: 12577 [2019-11-25 08:55:29,975 INFO L226 Difference]: Without dead ends: 12577 [2019-11-25 08:55:29,975 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:55:30,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12577 states. [2019-11-25 08:55:30,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12577 to 11077. [2019-11-25 08:55:30,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11077 states. [2019-11-25 08:55:30,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11077 states to 11077 states and 31106 transitions. [2019-11-25 08:55:30,190 INFO L78 Accepts]: Start accepts. Automaton has 11077 states and 31106 transitions. Word has length 69 [2019-11-25 08:55:30,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:30,190 INFO L462 AbstractCegarLoop]: Abstraction has 11077 states and 31106 transitions. [2019-11-25 08:55:30,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:55:30,191 INFO L276 IsEmpty]: Start isEmpty. Operand 11077 states and 31106 transitions. [2019-11-25 08:55:30,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-25 08:55:30,196 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:30,197 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, 1, 1, 1] [2019-11-25 08:55:30,197 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:30,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:30,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1191802009, now seen corresponding path program 1 times [2019-11-25 08:55:30,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:30,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638427117] [2019-11-25 08:55:30,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:30,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:30,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638427117] [2019-11-25 08:55:30,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:30,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:55:30,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956135501] [2019-11-25 08:55:30,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:55:30,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:30,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:55:30,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:55:30,252 INFO L87 Difference]: Start difference. First operand 11077 states and 31106 transitions. Second operand 4 states. [2019-11-25 08:55:30,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:30,594 INFO L93 Difference]: Finished difference Result 13633 states and 38381 transitions. [2019-11-25 08:55:30,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:55:30,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-11-25 08:55:30,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:30,609 INFO L225 Difference]: With dead ends: 13633 [2019-11-25 08:55:30,609 INFO L226 Difference]: Without dead ends: 13258 [2019-11-25 08:55:30,610 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-11-25 08:55:30,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13258 states. [2019-11-25 08:55:30,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13258 to 12715. [2019-11-25 08:55:30,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12715 states. [2019-11-25 08:55:30,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12715 states to 12715 states and 35690 transitions. [2019-11-25 08:55:30,753 INFO L78 Accepts]: Start accepts. Automaton has 12715 states and 35690 transitions. Word has length 69 [2019-11-25 08:55:30,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:30,753 INFO L462 AbstractCegarLoop]: Abstraction has 12715 states and 35690 transitions. [2019-11-25 08:55:30,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:55:30,754 INFO L276 IsEmpty]: Start isEmpty. Operand 12715 states and 35690 transitions. [2019-11-25 08:55:30,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-25 08:55:30,759 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:30,760 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, 1, 1, 1] [2019-11-25 08:55:30,760 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:30,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:30,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1306213928, now seen corresponding path program 1 times [2019-11-25 08:55:30,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:30,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740635433] [2019-11-25 08:55:30,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:30,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:30,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740635433] [2019-11-25 08:55:30,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:30,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 08:55:30,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856072383] [2019-11-25 08:55:30,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:55:30,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:30,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:55:30,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:55:30,885 INFO L87 Difference]: Start difference. First operand 12715 states and 35690 transitions. Second operand 7 states. [2019-11-25 08:55:31,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:31,377 INFO L93 Difference]: Finished difference Result 15477 states and 42655 transitions. [2019-11-25 08:55:31,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 08:55:31,377 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-11-25 08:55:31,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:31,393 INFO L225 Difference]: With dead ends: 15477 [2019-11-25 08:55:31,393 INFO L226 Difference]: Without dead ends: 15477 [2019-11-25 08:55:31,394 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-11-25 08:55:31,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15477 states. [2019-11-25 08:55:31,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15477 to 12111. [2019-11-25 08:55:31,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12111 states. [2019-11-25 08:55:31,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12111 states to 12111 states and 33426 transitions. [2019-11-25 08:55:31,536 INFO L78 Accepts]: Start accepts. Automaton has 12111 states and 33426 transitions. Word has length 69 [2019-11-25 08:55:31,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:31,536 INFO L462 AbstractCegarLoop]: Abstraction has 12111 states and 33426 transitions. [2019-11-25 08:55:31,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:55:31,537 INFO L276 IsEmpty]: Start isEmpty. Operand 12111 states and 33426 transitions. [2019-11-25 08:55:31,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-25 08:55:31,542 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:31,542 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, 1, 1, 1] [2019-11-25 08:55:31,542 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:31,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:31,543 INFO L82 PathProgramCache]: Analyzing trace with hash -2101249687, now seen corresponding path program 1 times [2019-11-25 08:55:31,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:31,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167449015] [2019-11-25 08:55:31,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:31,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:31,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:31,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167449015] [2019-11-25 08:55:31,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:31,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:55:31,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227891983] [2019-11-25 08:55:31,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:55:31,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:31,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:55:31,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:55:31,610 INFO L87 Difference]: Start difference. First operand 12111 states and 33426 transitions. Second operand 5 states. [2019-11-25 08:55:31,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:31,649 INFO L93 Difference]: Finished difference Result 4026 states and 9373 transitions. [2019-11-25 08:55:31,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:55:31,649 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-11-25 08:55:31,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:31,653 INFO L225 Difference]: With dead ends: 4026 [2019-11-25 08:55:31,653 INFO L226 Difference]: Without dead ends: 3353 [2019-11-25 08:55:31,653 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-11-25 08:55:31,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3353 states. [2019-11-25 08:55:31,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3353 to 3093. [2019-11-25 08:55:31,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3093 states. [2019-11-25 08:55:31,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3093 states to 3093 states and 7079 transitions. [2019-11-25 08:55:31,692 INFO L78 Accepts]: Start accepts. Automaton has 3093 states and 7079 transitions. Word has length 69 [2019-11-25 08:55:31,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:31,692 INFO L462 AbstractCegarLoop]: Abstraction has 3093 states and 7079 transitions. [2019-11-25 08:55:31,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:55:31,693 INFO L276 IsEmpty]: Start isEmpty. Operand 3093 states and 7079 transitions. [2019-11-25 08:55:31,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-25 08:55:31,696 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:31,696 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:31,696 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:31,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:31,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1919644855, now seen corresponding path program 1 times [2019-11-25 08:55:31,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:31,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147711151] [2019-11-25 08:55:31,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:31,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:31,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147711151] [2019-11-25 08:55:31,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:31,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 08:55:31,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451188495] [2019-11-25 08:55:31,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:55:31,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:31,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:55:31,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:55:31,809 INFO L87 Difference]: Start difference. First operand 3093 states and 7079 transitions. Second operand 7 states. [2019-11-25 08:55:32,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:32,327 INFO L93 Difference]: Finished difference Result 3732 states and 8440 transitions. [2019-11-25 08:55:32,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-25 08:55:32,328 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-11-25 08:55:32,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:32,332 INFO L225 Difference]: With dead ends: 3732 [2019-11-25 08:55:32,332 INFO L226 Difference]: Without dead ends: 3701 [2019-11-25 08:55:32,332 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-11-25 08:55:32,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3701 states. [2019-11-25 08:55:32,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3701 to 3247. [2019-11-25 08:55:32,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3247 states. [2019-11-25 08:55:32,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3247 states to 3247 states and 7402 transitions. [2019-11-25 08:55:32,367 INFO L78 Accepts]: Start accepts. Automaton has 3247 states and 7402 transitions. Word has length 86 [2019-11-25 08:55:32,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:32,367 INFO L462 AbstractCegarLoop]: Abstraction has 3247 states and 7402 transitions. [2019-11-25 08:55:32,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:55:32,367 INFO L276 IsEmpty]: Start isEmpty. Operand 3247 states and 7402 transitions. [2019-11-25 08:55:32,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-25 08:55:32,371 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:32,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-25 08:55:32,371 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:32,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:32,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1568844918, now seen corresponding path program 1 times [2019-11-25 08:55:32,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:32,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292643293] [2019-11-25 08:55:32,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:32,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:32,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:32,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292643293] [2019-11-25 08:55:32,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:32,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-25 08:55:32,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734767924] [2019-11-25 08:55:32,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 08:55:32,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:32,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:55:32,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:55:32,523 INFO L87 Difference]: Start difference. First operand 3247 states and 7402 transitions. Second operand 8 states. [2019-11-25 08:55:32,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:32,616 INFO L93 Difference]: Finished difference Result 5451 states and 12511 transitions. [2019-11-25 08:55:32,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:55:32,617 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 86 [2019-11-25 08:55:32,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:32,618 INFO L225 Difference]: With dead ends: 5451 [2019-11-25 08:55:32,618 INFO L226 Difference]: Without dead ends: 2296 [2019-11-25 08:55:32,619 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-11-25 08:55:32,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2296 states. [2019-11-25 08:55:32,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2296 to 2296. [2019-11-25 08:55:32,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2296 states. [2019-11-25 08:55:32,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2296 states to 2296 states and 5260 transitions. [2019-11-25 08:55:32,636 INFO L78 Accepts]: Start accepts. Automaton has 2296 states and 5260 transitions. Word has length 86 [2019-11-25 08:55:32,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:32,636 INFO L462 AbstractCegarLoop]: Abstraction has 2296 states and 5260 transitions. [2019-11-25 08:55:32,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 08:55:32,636 INFO L276 IsEmpty]: Start isEmpty. Operand 2296 states and 5260 transitions. [2019-11-25 08:55:32,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-25 08:55:32,637 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:32,640 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:32,640 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:32,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:32,641 INFO L82 PathProgramCache]: Analyzing trace with hash -396577060, now seen corresponding path program 1 times [2019-11-25 08:55:32,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:32,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856107380] [2019-11-25 08:55:32,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:32,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:32,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:32,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856107380] [2019-11-25 08:55:32,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:32,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:55:32,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292462724] [2019-11-25 08:55:32,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:55:32,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:32,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:55:32,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:55:32,693 INFO L87 Difference]: Start difference. First operand 2296 states and 5260 transitions. Second operand 5 states. [2019-11-25 08:55:32,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:32,875 INFO L93 Difference]: Finished difference Result 2595 states and 5879 transitions. [2019-11-25 08:55:32,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:55:32,876 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-11-25 08:55:32,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:32,878 INFO L225 Difference]: With dead ends: 2595 [2019-11-25 08:55:32,878 INFO L226 Difference]: Without dead ends: 2573 [2019-11-25 08:55:32,878 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:55:32,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2573 states. [2019-11-25 08:55:32,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2573 to 2320. [2019-11-25 08:55:32,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2320 states. [2019-11-25 08:55:32,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2320 states to 2320 states and 5317 transitions. [2019-11-25 08:55:32,901 INFO L78 Accepts]: Start accepts. Automaton has 2320 states and 5317 transitions. Word has length 86 [2019-11-25 08:55:32,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:32,901 INFO L462 AbstractCegarLoop]: Abstraction has 2320 states and 5317 transitions. [2019-11-25 08:55:32,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:55:32,901 INFO L276 IsEmpty]: Start isEmpty. Operand 2320 states and 5317 transitions. [2019-11-25 08:55:32,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-25 08:55:32,903 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:32,903 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:32,903 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:32,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:32,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1059538334, now seen corresponding path program 1 times [2019-11-25 08:55:32,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:32,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185553064] [2019-11-25 08:55:32,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:32,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:32,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:32,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185553064] [2019-11-25 08:55:32,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:32,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:55:32,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219873306] [2019-11-25 08:55:32,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:55:32,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:32,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:55:32,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:55:32,978 INFO L87 Difference]: Start difference. First operand 2320 states and 5317 transitions. Second operand 6 states. [2019-11-25 08:55:33,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:33,200 INFO L93 Difference]: Finished difference Result 2290 states and 5231 transitions. [2019-11-25 08:55:33,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:55:33,200 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-11-25 08:55:33,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:33,202 INFO L225 Difference]: With dead ends: 2290 [2019-11-25 08:55:33,202 INFO L226 Difference]: Without dead ends: 2290 [2019-11-25 08:55:33,202 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:55:33,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2290 states. [2019-11-25 08:55:33,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2290 to 2262. [2019-11-25 08:55:33,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2262 states. [2019-11-25 08:55:33,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 2262 states and 5175 transitions. [2019-11-25 08:55:33,220 INFO L78 Accepts]: Start accepts. Automaton has 2262 states and 5175 transitions. Word has length 86 [2019-11-25 08:55:33,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:33,220 INFO L462 AbstractCegarLoop]: Abstraction has 2262 states and 5175 transitions. [2019-11-25 08:55:33,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:55:33,220 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 5175 transitions. [2019-11-25 08:55:33,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-25 08:55:33,222 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:33,222 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:33,223 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:33,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:33,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1387790970, now seen corresponding path program 2 times [2019-11-25 08:55:33,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:33,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348072622] [2019-11-25 08:55:33,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:33,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:33,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348072622] [2019-11-25 08:55:33,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:33,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:55:33,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162098938] [2019-11-25 08:55:33,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:55:33,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:33,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:55:33,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:55:33,361 INFO L87 Difference]: Start difference. First operand 2262 states and 5175 transitions. Second operand 6 states. [2019-11-25 08:55:33,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:33,561 INFO L93 Difference]: Finished difference Result 2504 states and 5700 transitions. [2019-11-25 08:55:33,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:55:33,561 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-11-25 08:55:33,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:33,563 INFO L225 Difference]: With dead ends: 2504 [2019-11-25 08:55:33,563 INFO L226 Difference]: Without dead ends: 2486 [2019-11-25 08:55:33,564 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:55:33,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2486 states. [2019-11-25 08:55:33,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2213. [2019-11-25 08:55:33,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2213 states. [2019-11-25 08:55:33,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2213 states to 2213 states and 5039 transitions. [2019-11-25 08:55:33,582 INFO L78 Accepts]: Start accepts. Automaton has 2213 states and 5039 transitions. Word has length 86 [2019-11-25 08:55:33,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:33,583 INFO L462 AbstractCegarLoop]: Abstraction has 2213 states and 5039 transitions. [2019-11-25 08:55:33,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:55:33,583 INFO L276 IsEmpty]: Start isEmpty. Operand 2213 states and 5039 transitions. [2019-11-25 08:55:33,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-25 08:55:33,585 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:33,585 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:33,586 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:33,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:33,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1738590907, now seen corresponding path program 1 times [2019-11-25 08:55:33,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:33,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2229947] [2019-11-25 08:55:33,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:33,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:33,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:33,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2229947] [2019-11-25 08:55:33,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:33,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:55:33,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591979508] [2019-11-25 08:55:33,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:55:33,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:33,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:55:33,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:55:33,689 INFO L87 Difference]: Start difference. First operand 2213 states and 5039 transitions. Second operand 5 states. [2019-11-25 08:55:33,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:33,727 INFO L93 Difference]: Finished difference Result 2213 states and 5030 transitions. [2019-11-25 08:55:33,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:55:33,728 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-11-25 08:55:33,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:33,730 INFO L225 Difference]: With dead ends: 2213 [2019-11-25 08:55:33,730 INFO L226 Difference]: Without dead ends: 2213 [2019-11-25 08:55:33,731 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:55:33,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2213 states. [2019-11-25 08:55:33,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2213 to 1990. [2019-11-25 08:55:33,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1990 states. [2019-11-25 08:55:33,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1990 states and 4552 transitions. [2019-11-25 08:55:33,755 INFO L78 Accepts]: Start accepts. Automaton has 1990 states and 4552 transitions. Word has length 86 [2019-11-25 08:55:33,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:33,756 INFO L462 AbstractCegarLoop]: Abstraction has 1990 states and 4552 transitions. [2019-11-25 08:55:33,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:55:33,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1990 states and 4552 transitions. [2019-11-25 08:55:33,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-25 08:55:33,758 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:33,758 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:33,759 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:33,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:33,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1668872708, now seen corresponding path program 2 times [2019-11-25 08:55:33,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:33,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043533889] [2019-11-25 08:55:33,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:33,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:33,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:33,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043533889] [2019-11-25 08:55:33,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:33,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-25 08:55:33,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206558298] [2019-11-25 08:55:33,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 08:55:33,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:33,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 08:55:33,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:55:33,903 INFO L87 Difference]: Start difference. First operand 1990 states and 4552 transitions. Second operand 10 states. [2019-11-25 08:55:34,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:34,160 INFO L93 Difference]: Finished difference Result 3264 states and 7440 transitions. [2019-11-25 08:55:34,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 08:55:34,161 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 86 [2019-11-25 08:55:34,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:34,163 INFO L225 Difference]: With dead ends: 3264 [2019-11-25 08:55:34,163 INFO L226 Difference]: Without dead ends: 2168 [2019-11-25 08:55:34,163 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-11-25 08:55:34,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2168 states. [2019-11-25 08:55:34,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2168 to 2023. [2019-11-25 08:55:34,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2023 states. [2019-11-25 08:55:34,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2023 states to 2023 states and 4577 transitions. [2019-11-25 08:55:34,179 INFO L78 Accepts]: Start accepts. Automaton has 2023 states and 4577 transitions. Word has length 86 [2019-11-25 08:55:34,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:34,179 INFO L462 AbstractCegarLoop]: Abstraction has 2023 states and 4577 transitions. [2019-11-25 08:55:34,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 08:55:34,179 INFO L276 IsEmpty]: Start isEmpty. Operand 2023 states and 4577 transitions. [2019-11-25 08:55:34,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-25 08:55:34,180 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:34,181 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:34,181 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:34,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:34,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1150142586, now seen corresponding path program 3 times [2019-11-25 08:55:34,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:34,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252570602] [2019-11-25 08:55:34,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:34,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:34,247 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:55:34,247 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-25 08:55:34,421 INFO L304 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-25 08:55:34,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:55:34 BasicIcfg [2019-11-25 08:55:34,423 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:55:34,423 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:55:34,423 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:55:34,424 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:55:34,424 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:55:05" (3/4) ... [2019-11-25 08:55:34,426 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-25 08:55:34,603 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_00fad3d8-4a93-4ce0-9275-5de7d8d66d84/bin/uautomizer/witness.graphml [2019-11-25 08:55:34,604 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:55:34,606 INFO L168 Benchmark]: Toolchain (without parser) took 30263.33 ms. Allocated memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: 2.1 GB). Free memory was 939.4 MB in the beginning and 1.4 GB in the end (delta: -438.7 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-11-25 08:55:34,606 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:55:34,606 INFO L168 Benchmark]: CACSL2BoogieTranslator took 620.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -166.2 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-11-25 08:55:34,607 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.31 ms. Allocated memory is still 1.2 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-11-25 08:55:34,607 INFO L168 Benchmark]: Boogie Preprocessor took 39.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:55:34,607 INFO L168 Benchmark]: RCFGBuilder took 628.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:55:34,608 INFO L168 Benchmark]: TraceAbstraction took 28737.28 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 2.0 GB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -373.7 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-11-25 08:55:34,608 INFO L168 Benchmark]: Witness Printer took 180.65 ms. Allocated memory is still 3.1 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:55:34,610 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 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 620.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -166.2 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 628.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28737.28 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 2.0 GB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -373.7 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 180.65 ms. Allocated memory is still 3.1 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L701] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L702] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L703] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L705] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L706] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L707] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L708] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L709] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L710] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L711] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L712] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L713] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L714] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L715] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L716] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L717] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L718] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L719] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L721] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L723] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L724] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L725] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L799] 0 pthread_t t903; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L800] FCALL, FORK 0 pthread_create(&t903, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L801] 0 pthread_t t904; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L802] FCALL, FORK 0 pthread_create(&t904, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L757] 2 x$w_buff1 = x$w_buff0 [L758] 2 x$w_buff0 = 1 [L759] 2 x$w_buff1_used = x$w_buff0_used [L760] 2 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L762] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L763] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L764] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L765] 2 x$r_buff0_thd2 = (_Bool)1 [L768] 2 y = 1 [L771] 2 __unbuffered_p1_EAX = y [L774] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L729] 1 z = 1 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 x$flush_delayed = weak$$choice2 [L735] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L736] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L736] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L737] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L737] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L738] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L738] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L739] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L739] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L740] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L742] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L742] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L744] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L744] 1 x = x$flush_delayed ? x$mem_tmp : x [L745] 1 x$flush_delayed = (_Bool)0 [L750] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L780] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L781] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L784] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L804] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L809] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L810] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L811] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L812] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L812] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L815] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 329 locations, 5 error locations. Result: UNSAFE, OverallTime: 28.4s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 12.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6502 SDtfs, 7705 SDslu, 15110 SDs, 0 SdLazy, 5587 SolverSat, 382 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 238 GetRequests, 64 SyntacticMatches, 15 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57891occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.6s AutomataMinimizationTime, 26 MinimizatonAttempts, 60570 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1821 NumberOfCodeBlocks, 1821 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1709 ConstructedInterpolants, 0 QuantifiedInterpolants, 358808 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...