./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix015_pso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_54fb6b6c-75d4-4953-b314-a57531328c01/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_54fb6b6c-75d4-4953-b314-a57531328c01/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_54fb6b6c-75d4-4953-b314-a57531328c01/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_54fb6b6c-75d4-4953-b314-a57531328c01/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix015_pso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_54fb6b6c-75d4-4953-b314-a57531328c01/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_54fb6b6c-75d4-4953-b314-a57531328c01/bin-2019/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 f307346aec6f29e68c8dfd90bd8a8b0631cc8549 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.23-635dfa2 [2018-12-09 01:40:24,220 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 01:40:24,221 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 01:40:24,227 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 01:40:24,227 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 01:40:24,228 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 01:40:24,228 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 01:40:24,229 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 01:40:24,230 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 01:40:24,230 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 01:40:24,231 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 01:40:24,231 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 01:40:24,231 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 01:40:24,232 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 01:40:24,232 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 01:40:24,233 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 01:40:24,233 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 01:40:24,234 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 01:40:24,235 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 01:40:24,236 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 01:40:24,237 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 01:40:24,237 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 01:40:24,238 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 01:40:24,238 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 01:40:24,239 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 01:40:24,239 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 01:40:24,240 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 01:40:24,240 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 01:40:24,240 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 01:40:24,241 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 01:40:24,241 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 01:40:24,241 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 01:40:24,241 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 01:40:24,242 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 01:40:24,242 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 01:40:24,242 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 01:40:24,243 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_54fb6b6c-75d4-4953-b314-a57531328c01/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-09 01:40:24,250 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 01:40:24,250 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 01:40:24,251 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 01:40:24,251 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 01:40:24,251 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 01:40:24,251 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 01:40:24,251 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 01:40:24,251 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 01:40:24,251 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 01:40:24,251 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 01:40:24,252 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 01:40:24,252 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 01:40:24,252 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 01:40:24,252 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 01:40:24,252 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 01:40:24,252 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 01:40:24,252 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 01:40:24,252 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 01:40:24,252 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 01:40:24,252 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 01:40:24,253 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 01:40:24,253 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 01:40:24,253 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 01:40:24,253 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 01:40:24,253 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 01:40:24,253 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 01:40:24,253 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 01:40:24,253 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 01:40:24,253 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 01:40:24,253 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 01:40:24,253 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_54fb6b6c-75d4-4953-b314-a57531328c01/bin-2019/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 -> f307346aec6f29e68c8dfd90bd8a8b0631cc8549 [2018-12-09 01:40:24,276 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 01:40:24,285 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 01:40:24,287 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 01:40:24,288 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 01:40:24,288 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 01:40:24,289 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_54fb6b6c-75d4-4953-b314-a57531328c01/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix015_pso.opt_false-unreach-call.i [2018-12-09 01:40:24,331 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_54fb6b6c-75d4-4953-b314-a57531328c01/bin-2019/uautomizer/data/b257dceb8/c56608dd6b5c41bfbe29130d9099f578/FLAGb6f1b4c5a [2018-12-09 01:40:24,810 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 01:40:24,810 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_54fb6b6c-75d4-4953-b314-a57531328c01/sv-benchmarks/c/pthread-wmm/mix015_pso.opt_false-unreach-call.i [2018-12-09 01:40:24,818 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_54fb6b6c-75d4-4953-b314-a57531328c01/bin-2019/uautomizer/data/b257dceb8/c56608dd6b5c41bfbe29130d9099f578/FLAGb6f1b4c5a [2018-12-09 01:40:25,308 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_54fb6b6c-75d4-4953-b314-a57531328c01/bin-2019/uautomizer/data/b257dceb8/c56608dd6b5c41bfbe29130d9099f578 [2018-12-09 01:40:25,310 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 01:40:25,311 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 01:40:25,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 01:40:25,312 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 01:40:25,314 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 01:40:25,315 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:40:25" (1/1) ... [2018-12-09 01:40:25,317 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7014c445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:40:25, skipping insertion in model container [2018-12-09 01:40:25,317 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:40:25" (1/1) ... [2018-12-09 01:40:25,322 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 01:40:25,351 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 01:40:25,569 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:40:25,579 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 01:40:25,663 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:40:25,693 INFO L195 MainTranslator]: Completed translation [2018-12-09 01:40:25,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:40:25 WrapperNode [2018-12-09 01:40:25,693 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 01:40:25,694 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 01:40:25,694 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 01:40:25,694 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 01:40:25,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:40:25" (1/1) ... [2018-12-09 01:40:25,710 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:40:25" (1/1) ... [2018-12-09 01:40:25,727 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 01:40:25,728 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 01:40:25,728 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 01:40:25,728 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 01:40:25,734 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:40:25" (1/1) ... [2018-12-09 01:40:25,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:40:25" (1/1) ... [2018-12-09 01:40:25,737 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:40:25" (1/1) ... [2018-12-09 01:40:25,737 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:40:25" (1/1) ... [2018-12-09 01:40:25,743 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:40:25" (1/1) ... [2018-12-09 01:40:25,745 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:40:25" (1/1) ... [2018-12-09 01:40:25,747 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:40:25" (1/1) ... [2018-12-09 01:40:25,749 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 01:40:25,749 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 01:40:25,749 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 01:40:25,749 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 01:40:25,750 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:40:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54fb6b6c-75d4-4953-b314-a57531328c01/bin-2019/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 [2018-12-09 01:40:25,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 01:40:25,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 01:40:25,781 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 01:40:25,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 01:40:25,781 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 01:40:25,782 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 01:40:25,782 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 01:40:25,782 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 01:40:25,782 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-09 01:40:25,782 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-09 01:40:25,782 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 01:40:25,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 01:40:25,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 01:40:25,783 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 01:40:26,126 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 01:40:26,126 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 01:40:26,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:40:26 BoogieIcfgContainer [2018-12-09 01:40:26,127 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 01:40:26,127 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 01:40:26,127 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 01:40:26,129 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 01:40:26,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 01:40:25" (1/3) ... [2018-12-09 01:40:26,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47400ce4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:40:26, skipping insertion in model container [2018-12-09 01:40:26,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:40:25" (2/3) ... [2018-12-09 01:40:26,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47400ce4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:40:26, skipping insertion in model container [2018-12-09 01:40:26,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:40:26" (3/3) ... [2018-12-09 01:40:26,131 INFO L112 eAbstractionObserver]: Analyzing ICFG mix015_pso.opt_false-unreach-call.i [2018-12-09 01:40:26,158 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,158 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,158 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,158 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,158 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,159 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,159 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,159 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,159 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,159 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,159 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,159 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,159 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,160 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,160 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,160 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,160 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,160 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,160 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,160 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,160 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,160 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,160 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,160 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,161 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,161 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,161 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,161 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,161 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,161 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,161 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,161 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,161 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,161 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,161 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,162 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,162 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,162 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,162 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,162 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,162 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,162 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,162 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,162 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,162 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,163 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,163 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,163 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,163 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,163 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,163 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,163 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,163 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,164 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,164 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,164 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,164 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,164 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,164 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,164 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,164 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,164 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,165 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,165 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,165 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,165 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,165 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,165 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,165 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,165 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,165 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,166 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,166 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,166 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,166 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,166 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,166 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,166 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,166 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,166 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,167 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,167 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,167 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,167 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,167 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,167 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,167 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,167 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,167 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,168 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,168 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,168 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,168 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,168 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,168 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,168 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,168 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,169 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,169 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,169 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,169 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,169 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,169 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,169 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,169 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,169 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,170 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,170 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,170 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,170 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,170 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,170 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,171 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,171 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,171 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,171 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,171 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,177 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,177 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,177 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,177 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,177 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,177 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,177 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,177 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,177 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,177 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,177 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,177 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,177 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,178 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,178 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,178 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,178 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,178 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,178 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,178 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,178 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,178 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,178 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,178 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,178 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,178 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,179 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,179 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,179 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,179 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,179 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,179 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,179 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,179 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,179 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,179 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,179 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,179 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,179 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,181 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,181 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet57.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,181 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet57.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,181 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,181 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,181 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet57.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,181 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet57.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:40:26,190 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 01:40:26,190 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 01:40:26,195 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 01:40:26,204 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 01:40:26,218 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 01:40:26,219 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 01:40:26,219 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 01:40:26,219 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 01:40:26,219 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 01:40:26,219 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 01:40:26,219 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 01:40:26,219 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 01:40:26,219 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 01:40:26,226 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 190places, 242 transitions [2018-12-09 01:42:55,612 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 445147 states. [2018-12-09 01:42:55,613 INFO L276 IsEmpty]: Start isEmpty. Operand 445147 states. [2018-12-09 01:42:55,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 01:42:55,620 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:42:55,621 INFO L402 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] [2018-12-09 01:42:55,622 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:42:55,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:42:55,626 INFO L82 PathProgramCache]: Analyzing trace with hash -339585471, now seen corresponding path program 1 times [2018-12-09 01:42:55,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:42:55,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:42:55,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:42:55,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:42:55,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:42:55,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:42:55,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:42:55,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:42:55,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:42:55,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:42:55,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:42:55,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:42:55,789 INFO L87 Difference]: Start difference. First operand 445147 states. Second operand 4 states. [2018-12-09 01:43:04,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:43:04,289 INFO L93 Difference]: Finished difference Result 810627 states and 3886644 transitions. [2018-12-09 01:43:04,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:43:04,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-12-09 01:43:04,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:43:05,920 INFO L225 Difference]: With dead ends: 810627 [2018-12-09 01:43:05,920 INFO L226 Difference]: Without dead ends: 530977 [2018-12-09 01:43:05,922 INFO L631 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 [2018-12-09 01:43:13,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530977 states. [2018-12-09 01:43:19,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530977 to 307957. [2018-12-09 01:43:19,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307957 states. [2018-12-09 01:43:29,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307957 states to 307957 states and 1493658 transitions. [2018-12-09 01:43:29,826 INFO L78 Accepts]: Start accepts. Automaton has 307957 states and 1493658 transitions. Word has length 48 [2018-12-09 01:43:29,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:43:29,828 INFO L480 AbstractCegarLoop]: Abstraction has 307957 states and 1493658 transitions. [2018-12-09 01:43:29,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:43:29,828 INFO L276 IsEmpty]: Start isEmpty. Operand 307957 states and 1493658 transitions. [2018-12-09 01:43:29,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 01:43:29,840 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:43:29,840 INFO L402 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] [2018-12-09 01:43:29,840 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:43:29,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:43:29,841 INFO L82 PathProgramCache]: Analyzing trace with hash -48370061, now seen corresponding path program 1 times [2018-12-09 01:43:29,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:43:29,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:43:29,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:43:29,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:43:29,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:43:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:43:29,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:43:29,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:43:29,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:43:29,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:43:29,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:43:29,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:43:29,892 INFO L87 Difference]: Start difference. First operand 307957 states and 1493658 transitions. Second operand 3 states. [2018-12-09 01:43:32,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:43:32,272 INFO L93 Difference]: Finished difference Result 307957 states and 1492633 transitions. [2018-12-09 01:43:32,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:43:32,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-12-09 01:43:32,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:43:33,123 INFO L225 Difference]: With dead ends: 307957 [2018-12-09 01:43:33,123 INFO L226 Difference]: Without dead ends: 307957 [2018-12-09 01:43:33,124 INFO L631 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 [2018-12-09 01:43:42,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307957 states. [2018-12-09 01:43:45,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307957 to 307957. [2018-12-09 01:43:45,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307957 states. [2018-12-09 01:43:46,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307957 states to 307957 states and 1492633 transitions. [2018-12-09 01:43:46,846 INFO L78 Accepts]: Start accepts. Automaton has 307957 states and 1492633 transitions. Word has length 56 [2018-12-09 01:43:46,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:43:46,847 INFO L480 AbstractCegarLoop]: Abstraction has 307957 states and 1492633 transitions. [2018-12-09 01:43:46,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:43:46,847 INFO L276 IsEmpty]: Start isEmpty. Operand 307957 states and 1492633 transitions. [2018-12-09 01:43:46,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 01:43:46,853 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:43:46,853 INFO L402 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] [2018-12-09 01:43:46,853 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:43:46,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:43:46,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1694440274, now seen corresponding path program 1 times [2018-12-09 01:43:46,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:43:46,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:43:46,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:43:46,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:43:46,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:43:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:43:46,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:43:46,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:43:46,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:43:46,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:43:46,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:43:46,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:43:46,906 INFO L87 Difference]: Start difference. First operand 307957 states and 1492633 transitions. Second operand 4 states. [2018-12-09 01:43:51,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:43:51,553 INFO L93 Difference]: Finished difference Result 272411 states and 1286588 transitions. [2018-12-09 01:43:51,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:43:51,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-12-09 01:43:51,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:43:52,235 INFO L225 Difference]: With dead ends: 272411 [2018-12-09 01:43:52,235 INFO L226 Difference]: Without dead ends: 258311 [2018-12-09 01:43:52,235 INFO L631 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 [2018-12-09 01:43:56,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258311 states. [2018-12-09 01:43:59,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258311 to 258311. [2018-12-09 01:43:59,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258311 states. [2018-12-09 01:44:00,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258311 states to 258311 states and 1232395 transitions. [2018-12-09 01:44:00,594 INFO L78 Accepts]: Start accepts. Automaton has 258311 states and 1232395 transitions. Word has length 56 [2018-12-09 01:44:00,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:44:00,594 INFO L480 AbstractCegarLoop]: Abstraction has 258311 states and 1232395 transitions. [2018-12-09 01:44:00,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:44:00,594 INFO L276 IsEmpty]: Start isEmpty. Operand 258311 states and 1232395 transitions. [2018-12-09 01:44:00,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 01:44:00,599 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:44:00,599 INFO L402 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] [2018-12-09 01:44:00,599 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:44:00,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:44:00,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1611734580, now seen corresponding path program 1 times [2018-12-09 01:44:00,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:44:00,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:44:00,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:00,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:44:00,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:00,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:44:00,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:44:00,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:44:00,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:44:00,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:44:00,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:44:00,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:44:00,639 INFO L87 Difference]: Start difference. First operand 258311 states and 1232395 transitions. Second operand 5 states. [2018-12-09 01:44:00,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:44:00,891 INFO L93 Difference]: Finished difference Result 61671 states and 252911 transitions. [2018-12-09 01:44:00,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 01:44:00,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-12-09 01:44:00,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:44:01,396 INFO L225 Difference]: With dead ends: 61671 [2018-12-09 01:44:01,396 INFO L226 Difference]: Without dead ends: 49979 [2018-12-09 01:44:01,396 INFO L631 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 [2018-12-09 01:44:01,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49979 states. [2018-12-09 01:44:01,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49979 to 49519. [2018-12-09 01:44:01,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49519 states. [2018-12-09 01:44:02,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49519 states to 49519 states and 199433 transitions. [2018-12-09 01:44:02,063 INFO L78 Accepts]: Start accepts. Automaton has 49519 states and 199433 transitions. Word has length 57 [2018-12-09 01:44:02,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:44:02,064 INFO L480 AbstractCegarLoop]: Abstraction has 49519 states and 199433 transitions. [2018-12-09 01:44:02,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:44:02,064 INFO L276 IsEmpty]: Start isEmpty. Operand 49519 states and 199433 transitions. [2018-12-09 01:44:02,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 01:44:02,066 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:44:02,066 INFO L402 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] [2018-12-09 01:44:02,066 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:44:02,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:44:02,066 INFO L82 PathProgramCache]: Analyzing trace with hash 828222952, now seen corresponding path program 1 times [2018-12-09 01:44:02,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:44:02,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:44:02,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:02,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:44:02,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:44:02,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:44:02,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:44:02,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:44:02,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:44:02,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:44:02,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:44:02,116 INFO L87 Difference]: Start difference. First operand 49519 states and 199433 transitions. Second operand 5 states. [2018-12-09 01:44:02,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:44:02,696 INFO L93 Difference]: Finished difference Result 100165 states and 398362 transitions. [2018-12-09 01:44:02,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 01:44:02,696 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-12-09 01:44:02,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:44:02,902 INFO L225 Difference]: With dead ends: 100165 [2018-12-09 01:44:02,902 INFO L226 Difference]: Without dead ends: 99790 [2018-12-09 01:44:02,903 INFO L631 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 [2018-12-09 01:44:03,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99790 states. [2018-12-09 01:44:05,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99790 to 66558. [2018-12-09 01:44:05,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66558 states. [2018-12-09 01:44:05,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66558 states to 66558 states and 261441 transitions. [2018-12-09 01:44:05,712 INFO L78 Accepts]: Start accepts. Automaton has 66558 states and 261441 transitions. Word has length 57 [2018-12-09 01:44:05,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:44:05,712 INFO L480 AbstractCegarLoop]: Abstraction has 66558 states and 261441 transitions. [2018-12-09 01:44:05,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:44:05,712 INFO L276 IsEmpty]: Start isEmpty. Operand 66558 states and 261441 transitions. [2018-12-09 01:44:05,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 01:44:05,715 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:44:05,716 INFO L402 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] [2018-12-09 01:44:05,716 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:44:05,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:44:05,716 INFO L82 PathProgramCache]: Analyzing trace with hash -2059079538, now seen corresponding path program 1 times [2018-12-09 01:44:05,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:44:05,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:44:05,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:05,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:44:05,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:05,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:44:05,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:44:05,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:44:05,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:44:05,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:44:05,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:44:05,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:44:05,745 INFO L87 Difference]: Start difference. First operand 66558 states and 261441 transitions. Second operand 3 states. [2018-12-09 01:44:06,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:44:06,228 INFO L93 Difference]: Finished difference Result 122934 states and 477436 transitions. [2018-12-09 01:44:06,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:44:06,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-12-09 01:44:06,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:44:06,477 INFO L225 Difference]: With dead ends: 122934 [2018-12-09 01:44:06,477 INFO L226 Difference]: Without dead ends: 122914 [2018-12-09 01:44:06,478 INFO L631 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 [2018-12-09 01:44:06,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122914 states. [2018-12-09 01:44:07,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122914 to 103769. [2018-12-09 01:44:07,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103769 states. [2018-12-09 01:44:08,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103769 states to 103769 states and 403303 transitions. [2018-12-09 01:44:08,235 INFO L78 Accepts]: Start accepts. Automaton has 103769 states and 403303 transitions. Word has length 59 [2018-12-09 01:44:08,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:44:08,235 INFO L480 AbstractCegarLoop]: Abstraction has 103769 states and 403303 transitions. [2018-12-09 01:44:08,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:44:08,235 INFO L276 IsEmpty]: Start isEmpty. Operand 103769 states and 403303 transitions. [2018-12-09 01:44:08,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 01:44:08,242 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:44:08,243 INFO L402 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] [2018-12-09 01:44:08,243 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:44:08,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:44:08,243 INFO L82 PathProgramCache]: Analyzing trace with hash 422957529, now seen corresponding path program 1 times [2018-12-09 01:44:08,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:44:08,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:44:08,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:08,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:44:08,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:44:08,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:44:08,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:44:08,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 01:44:08,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 01:44:08,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 01:44:08,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-09 01:44:08,321 INFO L87 Difference]: Start difference. First operand 103769 states and 403303 transitions. Second operand 8 states. [2018-12-09 01:44:09,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:44:09,537 INFO L93 Difference]: Finished difference Result 140479 states and 532646 transitions. [2018-12-09 01:44:09,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 01:44:09,538 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2018-12-09 01:44:09,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:44:09,817 INFO L225 Difference]: With dead ends: 140479 [2018-12-09 01:44:09,817 INFO L226 Difference]: Without dead ends: 140014 [2018-12-09 01:44:09,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2018-12-09 01:44:10,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140014 states. [2018-12-09 01:44:11,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140014 to 105818. [2018-12-09 01:44:11,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105818 states. [2018-12-09 01:44:11,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105818 states to 105818 states and 410088 transitions. [2018-12-09 01:44:11,756 INFO L78 Accepts]: Start accepts. Automaton has 105818 states and 410088 transitions. Word has length 63 [2018-12-09 01:44:11,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:44:11,756 INFO L480 AbstractCegarLoop]: Abstraction has 105818 states and 410088 transitions. [2018-12-09 01:44:11,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 01:44:11,756 INFO L276 IsEmpty]: Start isEmpty. Operand 105818 states and 410088 transitions. [2018-12-09 01:44:11,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-09 01:44:11,783 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:44:11,783 INFO L402 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] [2018-12-09 01:44:11,783 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:44:11,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:44:11,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1246120427, now seen corresponding path program 1 times [2018-12-09 01:44:11,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:44:11,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:44:11,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:11,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:44:11,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:44:11,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:44:11,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:44:11,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 01:44:11,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:44:11,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:44:11,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:44:11,852 INFO L87 Difference]: Start difference. First operand 105818 states and 410088 transitions. Second operand 6 states. [2018-12-09 01:44:13,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:44:13,456 INFO L93 Difference]: Finished difference Result 249350 states and 954618 transitions. [2018-12-09 01:44:13,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 01:44:13,457 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2018-12-09 01:44:13,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:44:13,983 INFO L225 Difference]: With dead ends: 249350 [2018-12-09 01:44:13,983 INFO L226 Difference]: Without dead ends: 249030 [2018-12-09 01:44:13,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-09 01:44:14,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249030 states. [2018-12-09 01:44:18,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249030 to 156108. [2018-12-09 01:44:18,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156108 states. [2018-12-09 01:44:18,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156108 states to 156108 states and 592792 transitions. [2018-12-09 01:44:18,966 INFO L78 Accepts]: Start accepts. Automaton has 156108 states and 592792 transitions. Word has length 74 [2018-12-09 01:44:18,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:44:18,966 INFO L480 AbstractCegarLoop]: Abstraction has 156108 states and 592792 transitions. [2018-12-09 01:44:18,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:44:18,966 INFO L276 IsEmpty]: Start isEmpty. Operand 156108 states and 592792 transitions. [2018-12-09 01:44:19,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 01:44:19,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:44:19,028 INFO L402 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] [2018-12-09 01:44:19,028 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:44:19,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:44:19,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1848798614, now seen corresponding path program 1 times [2018-12-09 01:44:19,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:44:19,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:44:19,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:19,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:44:19,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:44:19,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:44:19,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:44:19,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 01:44:19,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 01:44:19,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 01:44:19,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 01:44:19,097 INFO L87 Difference]: Start difference. First operand 156108 states and 592792 transitions. Second operand 7 states. [2018-12-09 01:44:20,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:44:20,927 INFO L93 Difference]: Finished difference Result 242605 states and 920052 transitions. [2018-12-09 01:44:20,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 01:44:20,928 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2018-12-09 01:44:20,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:44:21,465 INFO L225 Difference]: With dead ends: 242605 [2018-12-09 01:44:21,465 INFO L226 Difference]: Without dead ends: 241357 [2018-12-09 01:44:21,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-09 01:44:21,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241357 states. [2018-12-09 01:44:24,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241357 to 221191. [2018-12-09 01:44:24,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221191 states. [2018-12-09 01:44:25,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221191 states to 221191 states and 838930 transitions. [2018-12-09 01:44:25,373 INFO L78 Accepts]: Start accepts. Automaton has 221191 states and 838930 transitions. Word has length 81 [2018-12-09 01:44:25,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:44:25,373 INFO L480 AbstractCegarLoop]: Abstraction has 221191 states and 838930 transitions. [2018-12-09 01:44:25,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 01:44:25,374 INFO L276 IsEmpty]: Start isEmpty. Operand 221191 states and 838930 transitions. [2018-12-09 01:44:25,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 01:44:25,466 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:44:25,467 INFO L402 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] [2018-12-09 01:44:25,467 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:44:25,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:44:25,467 INFO L82 PathProgramCache]: Analyzing trace with hash 51847255, now seen corresponding path program 1 times [2018-12-09 01:44:25,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:44:25,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:44:25,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:25,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:44:25,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:25,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:44:25,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:44:25,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:44:25,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 01:44:25,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 01:44:25,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 01:44:25,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 01:44:25,542 INFO L87 Difference]: Start difference. First operand 221191 states and 838930 transitions. Second operand 8 states. [2018-12-09 01:44:27,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:44:27,569 INFO L93 Difference]: Finished difference Result 264605 states and 995964 transitions. [2018-12-09 01:44:27,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 01:44:27,569 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 81 [2018-12-09 01:44:27,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:44:28,149 INFO L225 Difference]: With dead ends: 264605 [2018-12-09 01:44:28,149 INFO L226 Difference]: Without dead ends: 264605 [2018-12-09 01:44:28,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-12-09 01:44:28,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264605 states. [2018-12-09 01:44:34,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264605 to 234279. [2018-12-09 01:44:34,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234279 states. [2018-12-09 01:44:34,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234279 states to 234279 states and 886386 transitions. [2018-12-09 01:44:34,783 INFO L78 Accepts]: Start accepts. Automaton has 234279 states and 886386 transitions. Word has length 81 [2018-12-09 01:44:34,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:44:34,783 INFO L480 AbstractCegarLoop]: Abstraction has 234279 states and 886386 transitions. [2018-12-09 01:44:34,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 01:44:34,783 INFO L276 IsEmpty]: Start isEmpty. Operand 234279 states and 886386 transitions. [2018-12-09 01:44:34,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 01:44:34,876 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:44:34,876 INFO L402 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] [2018-12-09 01:44:34,876 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:44:34,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:44:34,877 INFO L82 PathProgramCache]: Analyzing trace with hash 939350936, now seen corresponding path program 1 times [2018-12-09 01:44:34,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:44:34,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:44:34,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:34,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:44:34,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:34,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:44:34,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:44:34,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:44:34,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:44:34,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:44:34,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:44:34,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:44:34,911 INFO L87 Difference]: Start difference. First operand 234279 states and 886386 transitions. Second operand 3 states. [2018-12-09 01:44:35,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:44:35,969 INFO L93 Difference]: Finished difference Result 196919 states and 731802 transitions. [2018-12-09 01:44:35,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:44:35,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-12-09 01:44:35,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:44:36,384 INFO L225 Difference]: With dead ends: 196919 [2018-12-09 01:44:36,384 INFO L226 Difference]: Without dead ends: 196023 [2018-12-09 01:44:36,385 INFO L631 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 [2018-12-09 01:44:36,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196023 states. [2018-12-09 01:44:38,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196023 to 183304. [2018-12-09 01:44:38,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183304 states. [2018-12-09 01:44:39,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183304 states to 183304 states and 682992 transitions. [2018-12-09 01:44:39,674 INFO L78 Accepts]: Start accepts. Automaton has 183304 states and 682992 transitions. Word has length 81 [2018-12-09 01:44:39,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:44:39,674 INFO L480 AbstractCegarLoop]: Abstraction has 183304 states and 682992 transitions. [2018-12-09 01:44:39,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:44:39,674 INFO L276 IsEmpty]: Start isEmpty. Operand 183304 states and 682992 transitions. [2018-12-09 01:44:39,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 01:44:39,760 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:44:39,760 INFO L402 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] [2018-12-09 01:44:39,761 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:44:39,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:44:39,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1103979428, now seen corresponding path program 1 times [2018-12-09 01:44:39,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:44:39,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:44:39,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:39,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:44:39,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:39,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:44:39,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:44:39,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:44:39,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 01:44:39,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 01:44:39,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 01:44:39,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 01:44:39,839 INFO L87 Difference]: Start difference. First operand 183304 states and 682992 transitions. Second operand 7 states. [2018-12-09 01:44:41,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:44:41,308 INFO L93 Difference]: Finished difference Result 271087 states and 1012125 transitions. [2018-12-09 01:44:41,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 01:44:41,308 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-12-09 01:44:41,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:44:41,898 INFO L225 Difference]: With dead ends: 271087 [2018-12-09 01:44:41,898 INFO L226 Difference]: Without dead ends: 271087 [2018-12-09 01:44:41,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-12-09 01:44:42,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271087 states. [2018-12-09 01:44:47,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271087 to 228911. [2018-12-09 01:44:47,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228911 states. [2018-12-09 01:44:48,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228911 states to 228911 states and 854941 transitions. [2018-12-09 01:44:48,551 INFO L78 Accepts]: Start accepts. Automaton has 228911 states and 854941 transitions. Word has length 82 [2018-12-09 01:44:48,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:44:48,551 INFO L480 AbstractCegarLoop]: Abstraction has 228911 states and 854941 transitions. [2018-12-09 01:44:48,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 01:44:48,552 INFO L276 IsEmpty]: Start isEmpty. Operand 228911 states and 854941 transitions. [2018-12-09 01:44:48,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 01:44:48,651 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:44:48,652 INFO L402 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] [2018-12-09 01:44:48,652 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:44:48,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:44:48,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1991483109, now seen corresponding path program 1 times [2018-12-09 01:44:48,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:44:48,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:44:48,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:48,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:44:48,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:48,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:44:48,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:44:48,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:44:48,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 01:44:48,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:44:48,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:44:48,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:44:48,702 INFO L87 Difference]: Start difference. First operand 228911 states and 854941 transitions. Second operand 6 states. [2018-12-09 01:44:48,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:44:48,978 INFO L93 Difference]: Finished difference Result 78479 states and 263197 transitions. [2018-12-09 01:44:48,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 01:44:48,978 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-12-09 01:44:48,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:44:49,080 INFO L225 Difference]: With dead ends: 78479 [2018-12-09 01:44:49,080 INFO L226 Difference]: Without dead ends: 67103 [2018-12-09 01:44:49,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-09 01:44:49,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67103 states. [2018-12-09 01:44:49,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67103 to 40413. [2018-12-09 01:44:49,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40413 states. [2018-12-09 01:44:49,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40413 states to 40413 states and 135753 transitions. [2018-12-09 01:44:49,708 INFO L78 Accepts]: Start accepts. Automaton has 40413 states and 135753 transitions. Word has length 82 [2018-12-09 01:44:49,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:44:49,708 INFO L480 AbstractCegarLoop]: Abstraction has 40413 states and 135753 transitions. [2018-12-09 01:44:49,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:44:49,709 INFO L276 IsEmpty]: Start isEmpty. Operand 40413 states and 135753 transitions. [2018-12-09 01:44:49,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 01:44:49,747 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:44:49,747 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:44:49,747 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:44:49,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:44:49,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1402014901, now seen corresponding path program 1 times [2018-12-09 01:44:49,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:44:49,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:44:49,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:49,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:44:49,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:44:49,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:44:49,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:44:49,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:44:49,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:44:49,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:44:49,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:44:49,784 INFO L87 Difference]: Start difference. First operand 40413 states and 135753 transitions. Second operand 4 states. [2018-12-09 01:44:50,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:44:50,169 INFO L93 Difference]: Finished difference Result 79407 states and 257347 transitions. [2018-12-09 01:44:50,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:44:50,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2018-12-09 01:44:50,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:44:50,281 INFO L225 Difference]: With dead ends: 79407 [2018-12-09 01:44:50,282 INFO L226 Difference]: Without dead ends: 79407 [2018-12-09 01:44:50,282 INFO L631 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 [2018-12-09 01:44:50,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79407 states. [2018-12-09 01:44:51,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79407 to 60113. [2018-12-09 01:44:51,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60113 states. [2018-12-09 01:44:51,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60113 states to 60113 states and 198448 transitions. [2018-12-09 01:44:51,395 INFO L78 Accepts]: Start accepts. Automaton has 60113 states and 198448 transitions. Word has length 111 [2018-12-09 01:44:51,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:44:51,396 INFO L480 AbstractCegarLoop]: Abstraction has 60113 states and 198448 transitions. [2018-12-09 01:44:51,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:44:51,396 INFO L276 IsEmpty]: Start isEmpty. Operand 60113 states and 198448 transitions. [2018-12-09 01:44:51,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 01:44:51,459 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:44:51,460 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:44:51,460 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:44:51,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:44:51,460 INFO L82 PathProgramCache]: Analyzing trace with hash -157250420, now seen corresponding path program 1 times [2018-12-09 01:44:51,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:44:51,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:44:51,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:51,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:44:51,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:51,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:44:51,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:44:51,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:44:51,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 01:44:51,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 01:44:51,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 01:44:51,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 01:44:51,537 INFO L87 Difference]: Start difference. First operand 60113 states and 198448 transitions. Second operand 7 states. [2018-12-09 01:44:52,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:44:52,188 INFO L93 Difference]: Finished difference Result 82473 states and 268791 transitions. [2018-12-09 01:44:52,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 01:44:52,188 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-12-09 01:44:52,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:44:52,296 INFO L225 Difference]: With dead ends: 82473 [2018-12-09 01:44:52,296 INFO L226 Difference]: Without dead ends: 82473 [2018-12-09 01:44:52,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-09 01:44:52,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82473 states. [2018-12-09 01:44:53,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82473 to 69163. [2018-12-09 01:44:53,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69163 states. [2018-12-09 01:44:53,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69163 states to 69163 states and 228228 transitions. [2018-12-09 01:44:53,300 INFO L78 Accepts]: Start accepts. Automaton has 69163 states and 228228 transitions. Word has length 111 [2018-12-09 01:44:53,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:44:53,301 INFO L480 AbstractCegarLoop]: Abstraction has 69163 states and 228228 transitions. [2018-12-09 01:44:53,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 01:44:53,301 INFO L276 IsEmpty]: Start isEmpty. Operand 69163 states and 228228 transitions. [2018-12-09 01:44:53,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 01:44:53,378 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:44:53,379 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:44:53,379 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:44:53,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:44:53,379 INFO L82 PathProgramCache]: Analyzing trace with hash 54100493, now seen corresponding path program 1 times [2018-12-09 01:44:53,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:44:53,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:44:53,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:53,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:44:53,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:44:53,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:44:53,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:44:53,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 01:44:53,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 01:44:53,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 01:44:53,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 01:44:53,448 INFO L87 Difference]: Start difference. First operand 69163 states and 228228 transitions. Second operand 7 states. [2018-12-09 01:44:54,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:44:54,182 INFO L93 Difference]: Finished difference Result 113223 states and 372472 transitions. [2018-12-09 01:44:54,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 01:44:54,182 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-12-09 01:44:54,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:44:54,358 INFO L225 Difference]: With dead ends: 113223 [2018-12-09 01:44:54,358 INFO L226 Difference]: Without dead ends: 113223 [2018-12-09 01:44:54,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-12-09 01:44:54,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113223 states. [2018-12-09 01:44:55,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113223 to 105795. [2018-12-09 01:44:55,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105795 states. [2018-12-09 01:44:55,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105795 states to 105795 states and 348418 transitions. [2018-12-09 01:44:55,849 INFO L78 Accepts]: Start accepts. Automaton has 105795 states and 348418 transitions. Word has length 111 [2018-12-09 01:44:55,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:44:55,849 INFO L480 AbstractCegarLoop]: Abstraction has 105795 states and 348418 transitions. [2018-12-09 01:44:55,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 01:44:55,849 INFO L276 IsEmpty]: Start isEmpty. Operand 105795 states and 348418 transitions. [2018-12-09 01:44:55,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 01:44:55,986 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:44:55,986 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:44:55,986 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:44:55,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:44:55,986 INFO L82 PathProgramCache]: Analyzing trace with hash -456433684, now seen corresponding path program 1 times [2018-12-09 01:44:55,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:44:55,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:44:55,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:55,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:44:55,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:44:56,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:44:56,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:44:56,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:44:56,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:44:56,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:44:56,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:44:56,036 INFO L87 Difference]: Start difference. First operand 105795 states and 348418 transitions. Second operand 4 states. [2018-12-09 01:44:56,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:44:56,486 INFO L93 Difference]: Finished difference Result 106371 states and 350290 transitions. [2018-12-09 01:44:56,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:44:56,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2018-12-09 01:44:56,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:44:56,651 INFO L225 Difference]: With dead ends: 106371 [2018-12-09 01:44:56,651 INFO L226 Difference]: Without dead ends: 106243 [2018-12-09 01:44:56,651 INFO L631 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 [2018-12-09 01:44:56,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106243 states. [2018-12-09 01:44:57,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106243 to 103908. [2018-12-09 01:44:57,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103908 states. [2018-12-09 01:44:58,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103908 states to 103908 states and 342389 transitions. [2018-12-09 01:44:58,111 INFO L78 Accepts]: Start accepts. Automaton has 103908 states and 342389 transitions. Word has length 111 [2018-12-09 01:44:58,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:44:58,111 INFO L480 AbstractCegarLoop]: Abstraction has 103908 states and 342389 transitions. [2018-12-09 01:44:58,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:44:58,111 INFO L276 IsEmpty]: Start isEmpty. Operand 103908 states and 342389 transitions. [2018-12-09 01:44:58,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 01:44:58,246 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:44:58,246 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:44:58,247 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:44:58,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:44:58,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1154078572, now seen corresponding path program 1 times [2018-12-09 01:44:58,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:44:58,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:44:58,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:58,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:44:58,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:58,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:44:58,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:44:58,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:44:58,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 01:44:58,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 01:44:58,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 01:44:58,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 01:44:58,335 INFO L87 Difference]: Start difference. First operand 103908 states and 342389 transitions. Second operand 7 states. [2018-12-09 01:44:58,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:44:58,889 INFO L93 Difference]: Finished difference Result 120185 states and 391151 transitions. [2018-12-09 01:44:58,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 01:44:58,890 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-12-09 01:44:58,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:44:59,250 INFO L225 Difference]: With dead ends: 120185 [2018-12-09 01:44:59,250 INFO L226 Difference]: Without dead ends: 120185 [2018-12-09 01:44:59,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-09 01:44:59,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120185 states. [2018-12-09 01:45:00,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120185 to 74986. [2018-12-09 01:45:00,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74986 states. [2018-12-09 01:45:00,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74986 states to 74986 states and 247920 transitions. [2018-12-09 01:45:00,352 INFO L78 Accepts]: Start accepts. Automaton has 74986 states and 247920 transitions. Word has length 111 [2018-12-09 01:45:00,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:45:00,352 INFO L480 AbstractCegarLoop]: Abstraction has 74986 states and 247920 transitions. [2018-12-09 01:45:00,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 01:45:00,352 INFO L276 IsEmpty]: Start isEmpty. Operand 74986 states and 247920 transitions. [2018-12-09 01:45:00,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 01:45:00,438 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:45:00,438 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:45:00,438 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:45:00,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:45:00,439 INFO L82 PathProgramCache]: Analyzing trace with hash 2041582253, now seen corresponding path program 1 times [2018-12-09 01:45:00,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:45:00,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:45:00,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:45:00,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:45:00,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:45:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:45:00,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:45:00,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:45:00,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:45:00,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:45:00,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:45:00,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:45:00,505 INFO L87 Difference]: Start difference. First operand 74986 states and 247920 transitions. Second operand 4 states. [2018-12-09 01:45:00,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:45:00,868 INFO L93 Difference]: Finished difference Result 76986 states and 253215 transitions. [2018-12-09 01:45:00,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:45:00,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2018-12-09 01:45:00,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:45:00,977 INFO L225 Difference]: With dead ends: 76986 [2018-12-09 01:45:00,977 INFO L226 Difference]: Without dead ends: 76986 [2018-12-09 01:45:00,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:45:01,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76986 states. [2018-12-09 01:45:01,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76986 to 75531. [2018-12-09 01:45:01,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75531 states. [2018-12-09 01:45:01,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75531 states to 75531 states and 248856 transitions. [2018-12-09 01:45:01,976 INFO L78 Accepts]: Start accepts. Automaton has 75531 states and 248856 transitions. Word has length 111 [2018-12-09 01:45:01,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:45:01,976 INFO L480 AbstractCegarLoop]: Abstraction has 75531 states and 248856 transitions. [2018-12-09 01:45:01,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:45:01,976 INFO L276 IsEmpty]: Start isEmpty. Operand 75531 states and 248856 transitions. [2018-12-09 01:45:02,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 01:45:02,063 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:45:02,063 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:45:02,063 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:45:02,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:45:02,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1547240839, now seen corresponding path program 2 times [2018-12-09 01:45:02,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:45:02,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:45:02,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:45:02,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:45:02,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:45:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:45:02,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:45:02,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:45:02,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 01:45:02,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:45:02,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:45:02,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:45:02,147 INFO L87 Difference]: Start difference. First operand 75531 states and 248856 transitions. Second operand 6 states. [2018-12-09 01:45:02,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:45:02,587 INFO L93 Difference]: Finished difference Result 78551 states and 257797 transitions. [2018-12-09 01:45:02,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 01:45:02,587 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 111 [2018-12-09 01:45:02,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:45:02,702 INFO L225 Difference]: With dead ends: 78551 [2018-12-09 01:45:02,702 INFO L226 Difference]: Without dead ends: 78551 [2018-12-09 01:45:02,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 01:45:02,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78551 states. [2018-12-09 01:45:03,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78551 to 75531. [2018-12-09 01:45:03,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75531 states. [2018-12-09 01:45:03,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75531 states to 75531 states and 248816 transitions. [2018-12-09 01:45:03,743 INFO L78 Accepts]: Start accepts. Automaton has 75531 states and 248816 transitions. Word has length 111 [2018-12-09 01:45:03,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:45:03,743 INFO L480 AbstractCegarLoop]: Abstraction has 75531 states and 248816 transitions. [2018-12-09 01:45:03,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:45:03,743 INFO L276 IsEmpty]: Start isEmpty. Operand 75531 states and 248816 transitions. [2018-12-09 01:45:03,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 01:45:03,830 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:45:03,830 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:45:03,830 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:45:03,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:45:03,831 INFO L82 PathProgramCache]: Analyzing trace with hash -863762927, now seen corresponding path program 3 times [2018-12-09 01:45:03,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:45:03,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:45:03,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:45:03,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:45:03,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:45:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:45:03,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:45:03,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:45:03,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 01:45:03,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:45:03,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:45:03,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:45:03,891 INFO L87 Difference]: Start difference. First operand 75531 states and 248816 transitions. Second operand 6 states. [2018-12-09 01:45:04,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:45:04,460 INFO L93 Difference]: Finished difference Result 92594 states and 304658 transitions. [2018-12-09 01:45:04,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 01:45:04,460 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 111 [2018-12-09 01:45:04,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:45:04,597 INFO L225 Difference]: With dead ends: 92594 [2018-12-09 01:45:04,597 INFO L226 Difference]: Without dead ends: 92594 [2018-12-09 01:45:04,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-09 01:45:04,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92594 states. [2018-12-09 01:45:05,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92594 to 77116. [2018-12-09 01:45:05,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77116 states. [2018-12-09 01:45:05,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77116 states to 77116 states and 253964 transitions. [2018-12-09 01:45:05,655 INFO L78 Accepts]: Start accepts. Automaton has 77116 states and 253964 transitions. Word has length 111 [2018-12-09 01:45:05,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:45:05,656 INFO L480 AbstractCegarLoop]: Abstraction has 77116 states and 253964 transitions. [2018-12-09 01:45:05,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:45:05,656 INFO L276 IsEmpty]: Start isEmpty. Operand 77116 states and 253964 transitions. [2018-12-09 01:45:05,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 01:45:05,746 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:45:05,746 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:45:05,746 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:45:05,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:45:05,747 INFO L82 PathProgramCache]: Analyzing trace with hash 796875473, now seen corresponding path program 4 times [2018-12-09 01:45:05,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:45:05,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:45:05,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:45:05,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:45:05,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:45:05,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:45:05,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:45:05,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:45:05,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:45:05,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:45:05,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:45:05,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:45:05,952 INFO L87 Difference]: Start difference. First operand 77116 states and 253964 transitions. Second operand 5 states. [2018-12-09 01:45:06,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:45:06,355 INFO L93 Difference]: Finished difference Result 91869 states and 298273 transitions. [2018-12-09 01:45:06,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 01:45:06,355 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2018-12-09 01:45:06,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:45:06,486 INFO L225 Difference]: With dead ends: 91869 [2018-12-09 01:45:06,487 INFO L226 Difference]: Without dead ends: 91869 [2018-12-09 01:45:06,487 INFO L631 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 [2018-12-09 01:45:06,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91869 states. [2018-12-09 01:45:07,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91869 to 80236. [2018-12-09 01:45:07,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80236 states. [2018-12-09 01:45:07,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80236 states to 80236 states and 263345 transitions. [2018-12-09 01:45:07,540 INFO L78 Accepts]: Start accepts. Automaton has 80236 states and 263345 transitions. Word has length 111 [2018-12-09 01:45:07,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:45:07,540 INFO L480 AbstractCegarLoop]: Abstraction has 80236 states and 263345 transitions. [2018-12-09 01:45:07,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:45:07,540 INFO L276 IsEmpty]: Start isEmpty. Operand 80236 states and 263345 transitions. [2018-12-09 01:45:07,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 01:45:07,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:45:07,634 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:45:07,635 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:45:07,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:45:07,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1439988210, now seen corresponding path program 1 times [2018-12-09 01:45:07,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:45:07,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:45:07,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:45:07,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:45:07,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:45:07,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:45:07,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:45:07,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:45:07,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 01:45:07,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 01:45:07,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 01:45:07,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-12-09 01:45:07,747 INFO L87 Difference]: Start difference. First operand 80236 states and 263345 transitions. Second operand 12 states. [2018-12-09 01:45:08,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:45:08,993 INFO L93 Difference]: Finished difference Result 147552 states and 479234 transitions. [2018-12-09 01:45:08,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-09 01:45:08,994 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 113 [2018-12-09 01:45:08,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:45:09,198 INFO L225 Difference]: With dead ends: 147552 [2018-12-09 01:45:09,198 INFO L226 Difference]: Without dead ends: 136120 [2018-12-09 01:45:09,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2018-12-09 01:45:09,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136120 states. [2018-12-09 01:45:10,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136120 to 100091. [2018-12-09 01:45:10,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100091 states. [2018-12-09 01:45:10,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100091 states to 100091 states and 329229 transitions. [2018-12-09 01:45:10,864 INFO L78 Accepts]: Start accepts. Automaton has 100091 states and 329229 transitions. Word has length 113 [2018-12-09 01:45:10,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:45:10,865 INFO L480 AbstractCegarLoop]: Abstraction has 100091 states and 329229 transitions. [2018-12-09 01:45:10,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 01:45:10,865 INFO L276 IsEmpty]: Start isEmpty. Operand 100091 states and 329229 transitions. [2018-12-09 01:45:10,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 01:45:10,999 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:45:10,999 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:45:10,999 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:45:10,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:45:11,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1682974836, now seen corresponding path program 2 times [2018-12-09 01:45:11,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:45:11,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:45:11,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:45:11,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:45:11,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:45:11,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:45:11,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:45:11,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:45:11,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:45:11,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:45:11,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:45:11,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:45:11,022 INFO L87 Difference]: Start difference. First operand 100091 states and 329229 transitions. Second operand 3 states. [2018-12-09 01:45:11,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:45:11,468 INFO L93 Difference]: Finished difference Result 104891 states and 343414 transitions. [2018-12-09 01:45:11,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:45:11,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2018-12-09 01:45:11,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:45:11,634 INFO L225 Difference]: With dead ends: 104891 [2018-12-09 01:45:11,634 INFO L226 Difference]: Without dead ends: 104891 [2018-12-09 01:45:11,634 INFO L631 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 [2018-12-09 01:45:11,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104891 states. [2018-12-09 01:45:12,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104891 to 104201. [2018-12-09 01:45:12,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104201 states. [2018-12-09 01:45:13,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104201 states to 104201 states and 341397 transitions. [2018-12-09 01:45:13,047 INFO L78 Accepts]: Start accepts. Automaton has 104201 states and 341397 transitions. Word has length 113 [2018-12-09 01:45:13,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:45:13,047 INFO L480 AbstractCegarLoop]: Abstraction has 104201 states and 341397 transitions. [2018-12-09 01:45:13,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:45:13,047 INFO L276 IsEmpty]: Start isEmpty. Operand 104201 states and 341397 transitions. [2018-12-09 01:45:13,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 01:45:13,184 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:45:13,184 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:45:13,184 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:45:13,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:45:13,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1836320102, now seen corresponding path program 3 times [2018-12-09 01:45:13,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:45:13,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:45:13,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:45:13,185 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:45:13,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:45:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:45:13,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:45:13,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:45:13,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 01:45:13,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 01:45:13,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 01:45:13,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-09 01:45:13,294 INFO L87 Difference]: Start difference. First operand 104201 states and 341397 transitions. Second operand 13 states. [2018-12-09 01:45:15,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:45:15,368 INFO L93 Difference]: Finished difference Result 197907 states and 648622 transitions. [2018-12-09 01:45:15,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-09 01:45:15,368 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 113 [2018-12-09 01:45:15,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:45:15,657 INFO L225 Difference]: With dead ends: 197907 [2018-12-09 01:45:15,657 INFO L226 Difference]: Without dead ends: 170521 [2018-12-09 01:45:15,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=778, Unknown=0, NotChecked=0, Total=930 [2018-12-09 01:45:15,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170521 states. [2018-12-09 01:45:17,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170521 to 139811. [2018-12-09 01:45:17,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139811 states. [2018-12-09 01:45:17,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139811 states to 139811 states and 460980 transitions. [2018-12-09 01:45:17,863 INFO L78 Accepts]: Start accepts. Automaton has 139811 states and 460980 transitions. Word has length 113 [2018-12-09 01:45:17,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:45:17,863 INFO L480 AbstractCegarLoop]: Abstraction has 139811 states and 460980 transitions. [2018-12-09 01:45:17,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 01:45:17,863 INFO L276 IsEmpty]: Start isEmpty. Operand 139811 states and 460980 transitions. [2018-12-09 01:45:18,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 01:45:18,052 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:45:18,052 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:45:18,052 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:45:18,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:45:18,052 INFO L82 PathProgramCache]: Analyzing trace with hash -89858118, now seen corresponding path program 4 times [2018-12-09 01:45:18,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:45:18,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:45:18,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:45:18,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:45:18,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:45:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:45:18,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:45:18,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:45:18,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:45:18,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:45:18,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:45:18,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:45:18,129 INFO L87 Difference]: Start difference. First operand 139811 states and 460980 transitions. Second operand 4 states. [2018-12-09 01:45:18,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:45:18,726 INFO L93 Difference]: Finished difference Result 163311 states and 535685 transitions. [2018-12-09 01:45:18,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:45:18,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2018-12-09 01:45:18,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:45:18,994 INFO L225 Difference]: With dead ends: 163311 [2018-12-09 01:45:18,994 INFO L226 Difference]: Without dead ends: 163311 [2018-12-09 01:45:18,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:45:19,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163311 states. [2018-12-09 01:45:20,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163311 to 158036. [2018-12-09 01:45:20,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158036 states. [2018-12-09 01:45:21,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158036 states to 158036 states and 519030 transitions. [2018-12-09 01:45:21,253 INFO L78 Accepts]: Start accepts. Automaton has 158036 states and 519030 transitions. Word has length 113 [2018-12-09 01:45:21,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:45:21,254 INFO L480 AbstractCegarLoop]: Abstraction has 158036 states and 519030 transitions. [2018-12-09 01:45:21,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:45:21,254 INFO L276 IsEmpty]: Start isEmpty. Operand 158036 states and 519030 transitions. [2018-12-09 01:45:21,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 01:45:21,469 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:45:21,470 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:45:21,470 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:45:21,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:45:21,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1115350117, now seen corresponding path program 1 times [2018-12-09 01:45:21,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:45:21,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:45:21,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:45:21,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:45:21,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:45:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:45:21,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:45:21,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:45:21,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:45:21,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:45:21,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:45:21,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:45:21,497 INFO L87 Difference]: Start difference. First operand 158036 states and 519030 transitions. Second operand 3 states. [2018-12-09 01:45:22,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:45:22,031 INFO L93 Difference]: Finished difference Result 160781 states and 527506 transitions. [2018-12-09 01:45:22,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:45:22,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2018-12-09 01:45:22,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:45:22,293 INFO L225 Difference]: With dead ends: 160781 [2018-12-09 01:45:22,293 INFO L226 Difference]: Without dead ends: 160781 [2018-12-09 01:45:22,293 INFO L631 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 [2018-12-09 01:45:22,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160781 states. [2018-12-09 01:45:24,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160781 to 160366. [2018-12-09 01:45:24,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160366 states. [2018-12-09 01:45:24,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160366 states to 160366 states and 526279 transitions. [2018-12-09 01:45:24,539 INFO L78 Accepts]: Start accepts. Automaton has 160366 states and 526279 transitions. Word has length 113 [2018-12-09 01:45:24,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:45:24,539 INFO L480 AbstractCegarLoop]: Abstraction has 160366 states and 526279 transitions. [2018-12-09 01:45:24,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:45:24,540 INFO L276 IsEmpty]: Start isEmpty. Operand 160366 states and 526279 transitions. [2018-12-09 01:45:24,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 01:45:24,759 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:45:24,760 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:45:24,760 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:45:24,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:45:24,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1104033990, now seen corresponding path program 1 times [2018-12-09 01:45:24,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:45:24,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:45:24,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:45:24,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:45:24,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:45:24,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:45:24,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:45:24,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:45:24,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 01:45:24,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 01:45:24,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 01:45:24,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-09 01:45:24,836 INFO L87 Difference]: Start difference. First operand 160366 states and 526279 transitions. Second operand 10 states. [2018-12-09 01:45:26,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:45:26,136 INFO L93 Difference]: Finished difference Result 217718 states and 712853 transitions. [2018-12-09 01:45:26,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 01:45:26,136 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 113 [2018-12-09 01:45:26,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:45:26,248 INFO L225 Difference]: With dead ends: 217718 [2018-12-09 01:45:26,248 INFO L226 Difference]: Without dead ends: 76490 [2018-12-09 01:45:26,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-12-09 01:45:26,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76490 states. [2018-12-09 01:45:26,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76490 to 76490. [2018-12-09 01:45:26,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76490 states. [2018-12-09 01:45:27,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76490 states to 76490 states and 236339 transitions. [2018-12-09 01:45:27,125 INFO L78 Accepts]: Start accepts. Automaton has 76490 states and 236339 transitions. Word has length 113 [2018-12-09 01:45:27,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:45:27,125 INFO L480 AbstractCegarLoop]: Abstraction has 76490 states and 236339 transitions. [2018-12-09 01:45:27,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 01:45:27,125 INFO L276 IsEmpty]: Start isEmpty. Operand 76490 states and 236339 transitions. [2018-12-09 01:45:27,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 01:45:27,207 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:45:27,207 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:45:27,207 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:45:27,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:45:27,207 INFO L82 PathProgramCache]: Analyzing trace with hash 652208486, now seen corresponding path program 2 times [2018-12-09 01:45:27,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:45:27,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:45:27,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:45:27,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:45:27,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:45:27,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:45:27,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:45:27,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:45:27,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 01:45:27,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 01:45:27,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 01:45:27,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 01:45:27,269 INFO L87 Difference]: Start difference. First operand 76490 states and 236339 transitions. Second operand 8 states. [2018-12-09 01:45:27,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:45:27,800 INFO L93 Difference]: Finished difference Result 95221 states and 296926 transitions. [2018-12-09 01:45:27,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 01:45:27,800 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 113 [2018-12-09 01:45:27,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:45:27,822 INFO L225 Difference]: With dead ends: 95221 [2018-12-09 01:45:27,822 INFO L226 Difference]: Without dead ends: 18409 [2018-12-09 01:45:27,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-12-09 01:45:27,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18409 states. [2018-12-09 01:45:27,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18409 to 18405. [2018-12-09 01:45:27,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18405 states. [2018-12-09 01:45:28,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18405 states to 18405 states and 60073 transitions. [2018-12-09 01:45:28,012 INFO L78 Accepts]: Start accepts. Automaton has 18405 states and 60073 transitions. Word has length 113 [2018-12-09 01:45:28,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:45:28,012 INFO L480 AbstractCegarLoop]: Abstraction has 18405 states and 60073 transitions. [2018-12-09 01:45:28,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 01:45:28,012 INFO L276 IsEmpty]: Start isEmpty. Operand 18405 states and 60073 transitions. [2018-12-09 01:45:28,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 01:45:28,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:45:28,027 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:45:28,027 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:45:28,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:45:28,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1990998278, now seen corresponding path program 1 times [2018-12-09 01:45:28,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:45:28,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:45:28,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:45:28,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:45:28,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:45:28,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:45:28,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:45:28,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:45:28,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 01:45:28,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 01:45:28,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 01:45:28,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 01:45:28,113 INFO L87 Difference]: Start difference. First operand 18405 states and 60073 transitions. Second operand 8 states. [2018-12-09 01:45:28,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:45:28,340 INFO L93 Difference]: Finished difference Result 21678 states and 69728 transitions. [2018-12-09 01:45:28,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 01:45:28,341 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 113 [2018-12-09 01:45:28,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:45:28,364 INFO L225 Difference]: With dead ends: 21678 [2018-12-09 01:45:28,364 INFO L226 Difference]: Without dead ends: 21678 [2018-12-09 01:45:28,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-12-09 01:45:28,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21678 states. [2018-12-09 01:45:28,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21678 to 19622. [2018-12-09 01:45:28,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19622 states. [2018-12-09 01:45:28,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19622 states to 19622 states and 63574 transitions. [2018-12-09 01:45:28,601 INFO L78 Accepts]: Start accepts. Automaton has 19622 states and 63574 transitions. Word has length 113 [2018-12-09 01:45:28,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:45:28,601 INFO L480 AbstractCegarLoop]: Abstraction has 19622 states and 63574 transitions. [2018-12-09 01:45:28,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 01:45:28,601 INFO L276 IsEmpty]: Start isEmpty. Operand 19622 states and 63574 transitions. [2018-12-09 01:45:28,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 01:45:28,618 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:45:28,618 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:45:28,618 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:45:28,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:45:28,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1103494597, now seen corresponding path program 2 times [2018-12-09 01:45:28,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:45:28,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:45:28,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:45:28,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:45:28,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:45:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:45:28,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:45:28,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:45:28,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 01:45:28,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 01:45:28,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 01:45:28,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-09 01:45:28,725 INFO L87 Difference]: Start difference. First operand 19622 states and 63574 transitions. Second operand 13 states. [2018-12-09 01:45:29,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:45:29,237 INFO L93 Difference]: Finished difference Result 32254 states and 102851 transitions. [2018-12-09 01:45:29,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 01:45:29,237 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 113 [2018-12-09 01:45:29,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:45:29,263 INFO L225 Difference]: With dead ends: 32254 [2018-12-09 01:45:29,263 INFO L226 Difference]: Without dead ends: 23687 [2018-12-09 01:45:29,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2018-12-09 01:45:29,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23687 states. [2018-12-09 01:45:29,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23687 to 20008. [2018-12-09 01:45:29,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20008 states. [2018-12-09 01:45:29,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20008 states to 20008 states and 64562 transitions. [2018-12-09 01:45:29,485 INFO L78 Accepts]: Start accepts. Automaton has 20008 states and 64562 transitions. Word has length 113 [2018-12-09 01:45:29,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:45:29,486 INFO L480 AbstractCegarLoop]: Abstraction has 20008 states and 64562 transitions. [2018-12-09 01:45:29,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 01:45:29,486 INFO L276 IsEmpty]: Start isEmpty. Operand 20008 states and 64562 transitions. [2018-12-09 01:45:29,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 01:45:29,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:45:29,502 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:45:29,502 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:45:29,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:45:29,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1575828745, now seen corresponding path program 3 times [2018-12-09 01:45:29,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:45:29,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:45:29,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:45:29,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:45:29,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:45:29,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:45:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:45:29,550 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 01:45:29,645 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 01:45:29,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 01:45:29 BasicIcfg [2018-12-09 01:45:29,647 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 01:45:29,647 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 01:45:29,647 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 01:45:29,647 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 01:45:29,647 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:40:26" (3/4) ... [2018-12-09 01:45:29,649 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 01:45:29,734 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_54fb6b6c-75d4-4953-b314-a57531328c01/bin-2019/uautomizer/witness.graphml [2018-12-09 01:45:29,734 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 01:45:29,734 INFO L168 Benchmark]: Toolchain (without parser) took 304423.91 ms. Allocated memory was 1.0 GB in the beginning and 9.3 GB in the end (delta: 8.2 GB). Free memory was 956.0 MB in the beginning and 5.1 GB in the end (delta: -4.2 GB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. [2018-12-09 01:45:29,735 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:45:29,735 INFO L168 Benchmark]: CACSL2BoogieTranslator took 381.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 67.1 MB). Free memory was 956.0 MB in the beginning and 1.0 GB in the end (delta: -83.1 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. [2018-12-09 01:45:29,735 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2018-12-09 01:45:29,736 INFO L168 Benchmark]: Boogie Preprocessor took 20.98 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:45:29,736 INFO L168 Benchmark]: RCFGBuilder took 377.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 970.7 MB in the end (delta: 61.3 MB). Peak memory consumption was 61.3 MB. Max. memory is 11.5 GB. [2018-12-09 01:45:29,736 INFO L168 Benchmark]: TraceAbstraction took 303519.54 ms. Allocated memory was 1.1 GB in the beginning and 9.3 GB in the end (delta: 8.2 GB). Free memory was 970.7 MB in the beginning and 5.2 GB in the end (delta: -4.2 GB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. [2018-12-09 01:45:29,736 INFO L168 Benchmark]: Witness Printer took 86.95 ms. Allocated memory is still 9.3 GB. Free memory was 5.2 GB in the beginning and 5.1 GB in the end (delta: 40.2 MB). Peak memory consumption was 40.2 MB. Max. memory is 11.5 GB. [2018-12-09 01:45:29,737 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 381.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 67.1 MB). Free memory was 956.0 MB in the beginning and 1.0 GB in the end (delta: -83.1 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.98 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 377.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 970.7 MB in the end (delta: 61.3 MB). Peak memory consumption was 61.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 303519.54 ms. Allocated memory was 1.1 GB in the beginning and 9.3 GB in the end (delta: 8.2 GB). Free memory was 970.7 MB in the beginning and 5.2 GB in the end (delta: -4.2 GB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. * Witness Printer took 86.95 ms. Allocated memory is still 9.3 GB. Free memory was 5.2 GB in the beginning and 5.1 GB in the end (delta: 40.2 MB). Peak memory consumption was 40.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L678] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L680] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L682] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L684] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L685] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L686] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L688] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L690] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L692] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L693] -1 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L694] -1 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L695] -1 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L696] -1 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L697] -1 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L698] -1 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L699] -1 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L700] -1 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L701] -1 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L702] -1 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L703] -1 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L704] -1 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L705] -1 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L706] -1 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L707] -1 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L708] -1 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L709] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L710] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L816] -1 pthread_t t396; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] FCALL, FORK -1 pthread_create(&t396, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] -1 pthread_t t397; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] FCALL, FORK -1 pthread_create(&t397, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L820] -1 pthread_t t398; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L821] FCALL, FORK -1 pthread_create(&t398, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L763] 0 z$w_buff1 = z$w_buff0 [L764] 0 z$w_buff0 = 1 [L765] 0 z$w_buff1_used = z$w_buff0_used [L766] 0 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 0 z$r_buff1_thd0 = z$r_buff0_thd0 [L769] 0 z$r_buff1_thd1 = z$r_buff0_thd1 [L770] 0 z$r_buff1_thd2 = z$r_buff0_thd2 [L771] 0 z$r_buff1_thd3 = z$r_buff0_thd3 [L772] 0 z$r_buff0_thd3 = (_Bool)1 [L775] 0 weak$$choice0 = __VERIFIER_nondet_pointer() [L776] 0 weak$$choice2 = __VERIFIER_nondet_pointer() [L777] 0 z$flush_delayed = weak$$choice2 [L778] 0 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 0 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L780] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L781] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L782] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L783] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L784] EXPR 0 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 0 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L785] EXPR 0 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 0 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L786] 0 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR 0 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 0 z = z$flush_delayed ? z$mem_tmp : z [L788] 0 z$flush_delayed = (_Bool)0 [L791] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L714] 1 a = 1 [L717] 1 x = 1 [L720] 1 __unbuffered_p0_EAX = x [L723] 1 __unbuffered_p0_EBX = y [L728] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L735] 2 y = 1 [L738] 2 weak$$choice0 = __VERIFIER_nondet_pointer() [L739] 2 weak$$choice2 = __VERIFIER_nondet_pointer() [L740] 2 z$flush_delayed = weak$$choice2 [L741] 2 z$mem_tmp = z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L743] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L743] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L744] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L745] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L745] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L746] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L747] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L747] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L748] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L749] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] EXPR 2 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L794] 0 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L795] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 2 z = z$flush_delayed ? z$mem_tmp : z [L751] 2 z$flush_delayed = (_Bool)0 [L756] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L795] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L797] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L797] 0 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 0 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L801] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] EXPR -1 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] -1 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L828] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] -1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] -1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L830] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] -1 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] -1 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L834] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 305 locations, 3 error locations. UNSAFE Result, 303.4s OverallTime, 32 OverallIterations, 1 TraceHistogramMax, 48.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12636 SDtfs, 16176 SDslu, 38658 SDs, 0 SdLazy, 12258 SolverSat, 518 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 376 GetRequests, 100 SyntacticMatches, 24 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=445147occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 100.8s AutomataMinimizationTime, 31 MinimizatonAttempts, 733062 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 3006 NumberOfCodeBlocks, 3006 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2862 ConstructedInterpolants, 0 QuantifiedInterpolants, 712062 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...