./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix033_rmo.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_124c5bea-32eb-4334-a1b5-3d3372ecebc0/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_124c5bea-32eb-4334-a1b5-3d3372ecebc0/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_124c5bea-32eb-4334-a1b5-3d3372ecebc0/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_124c5bea-32eb-4334-a1b5-3d3372ecebc0/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix033_rmo.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_124c5bea-32eb-4334-a1b5-3d3372ecebc0/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_124c5bea-32eb-4334-a1b5-3d3372ecebc0/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 016d4db321352277c69af3257fac86162fa30707 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-02 23:23:34,521 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 23:23:34,521 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 23:23:34,527 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 23:23:34,528 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 23:23:34,528 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 23:23:34,529 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 23:23:34,529 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 23:23:34,530 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 23:23:34,531 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 23:23:34,531 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 23:23:34,531 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 23:23:34,532 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 23:23:34,532 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 23:23:34,533 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 23:23:34,533 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 23:23:34,534 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 23:23:34,534 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 23:23:34,535 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 23:23:34,536 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 23:23:34,537 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 23:23:34,537 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 23:23:34,538 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 23:23:34,538 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 23:23:34,538 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 23:23:34,539 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 23:23:34,539 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 23:23:34,540 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 23:23:34,540 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 23:23:34,541 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 23:23:34,541 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 23:23:34,541 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 23:23:34,541 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 23:23:34,541 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 23:23:34,542 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 23:23:34,542 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 23:23:34,542 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_124c5bea-32eb-4334-a1b5-3d3372ecebc0/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 23:23:34,550 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 23:23:34,550 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 23:23:34,550 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 23:23:34,550 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 23:23:34,551 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 23:23:34,551 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 23:23:34,551 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 23:23:34,551 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 23:23:34,551 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 23:23:34,551 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 23:23:34,551 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 23:23:34,551 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 23:23:34,551 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 23:23:34,552 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 23:23:34,552 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 23:23:34,552 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 23:23:34,552 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 23:23:34,552 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 23:23:34,552 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 23:23:34,552 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 23:23:34,552 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 23:23:34,552 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 23:23:34,552 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 23:23:34,552 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 23:23:34,553 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 23:23:34,553 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 23:23:34,553 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 23:23:34,553 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 23:23:34,553 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 23:23:34,553 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 23:23:34,553 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_124c5bea-32eb-4334-a1b5-3d3372ecebc0/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 -> 016d4db321352277c69af3257fac86162fa30707 [2018-12-02 23:23:34,570 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 23:23:34,577 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 23:23:34,579 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 23:23:34,580 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 23:23:34,580 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 23:23:34,580 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_124c5bea-32eb-4334-a1b5-3d3372ecebc0/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix033_rmo.opt_false-unreach-call.i [2018-12-02 23:23:34,615 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_124c5bea-32eb-4334-a1b5-3d3372ecebc0/bin-2019/uautomizer/data/7631b93d6/a8a369dbfe99426aa4fa6f2640a0dea7/FLAGabf76f1e7 [2018-12-02 23:23:34,999 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 23:23:34,999 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_124c5bea-32eb-4334-a1b5-3d3372ecebc0/sv-benchmarks/c/pthread-wmm/mix033_rmo.opt_false-unreach-call.i [2018-12-02 23:23:35,006 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_124c5bea-32eb-4334-a1b5-3d3372ecebc0/bin-2019/uautomizer/data/7631b93d6/a8a369dbfe99426aa4fa6f2640a0dea7/FLAGabf76f1e7 [2018-12-02 23:23:35,014 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_124c5bea-32eb-4334-a1b5-3d3372ecebc0/bin-2019/uautomizer/data/7631b93d6/a8a369dbfe99426aa4fa6f2640a0dea7 [2018-12-02 23:23:35,016 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 23:23:35,016 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 23:23:35,017 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 23:23:35,017 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 23:23:35,019 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 23:23:35,020 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:23:35" (1/1) ... [2018-12-02 23:23:35,021 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4599fb93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:23:35, skipping insertion in model container [2018-12-02 23:23:35,021 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:23:35" (1/1) ... [2018-12-02 23:23:35,025 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 23:23:35,045 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 23:23:35,221 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 23:23:35,229 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 23:23:35,301 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 23:23:35,332 INFO L195 MainTranslator]: Completed translation [2018-12-02 23:23:35,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:23:35 WrapperNode [2018-12-02 23:23:35,333 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 23:23:35,333 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 23:23:35,333 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 23:23:35,333 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 23:23:35,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:23:35" (1/1) ... [2018-12-02 23:23:35,349 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:23:35" (1/1) ... [2018-12-02 23:23:35,365 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 23:23:35,365 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 23:23:35,365 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 23:23:35,365 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 23:23:35,372 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:23:35" (1/1) ... [2018-12-02 23:23:35,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:23:35" (1/1) ... [2018-12-02 23:23:35,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:23:35" (1/1) ... [2018-12-02 23:23:35,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:23:35" (1/1) ... [2018-12-02 23:23:35,380 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:23:35" (1/1) ... [2018-12-02 23:23:35,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:23:35" (1/1) ... [2018-12-02 23:23:35,384 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:23:35" (1/1) ... [2018-12-02 23:23:35,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 23:23:35,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 23:23:35,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 23:23:35,386 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 23:23:35,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:23:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_124c5bea-32eb-4334-a1b5-3d3372ecebc0/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-02 23:23:35,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 23:23:35,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 23:23:35,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 23:23:35,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 23:23:35,419 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 23:23:35,419 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 23:23:35,419 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 23:23:35,419 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 23:23:35,419 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-02 23:23:35,419 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-02 23:23:35,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 23:23:35,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 23:23:35,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 23:23:35,420 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 23:23:35,730 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 23:23:35,730 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 23:23:35,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:23:35 BoogieIcfgContainer [2018-12-02 23:23:35,731 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 23:23:35,731 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 23:23:35,731 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 23:23:35,734 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 23:23:35,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 11:23:35" (1/3) ... [2018-12-02 23:23:35,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e95255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:23:35, skipping insertion in model container [2018-12-02 23:23:35,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:23:35" (2/3) ... [2018-12-02 23:23:35,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e95255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:23:35, skipping insertion in model container [2018-12-02 23:23:35,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:23:35" (3/3) ... [2018-12-02 23:23:35,737 INFO L112 eAbstractionObserver]: Analyzing ICFG mix033_rmo.opt_false-unreach-call.i [2018-12-02 23:23:35,763 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,763 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,763 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,763 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,763 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,763 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,763 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,763 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,764 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,764 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,764 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,764 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,764 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,764 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,764 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,765 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,765 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,765 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,765 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,765 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,765 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,765 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,765 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,765 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,765 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,765 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,766 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,766 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,766 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,766 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,766 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,766 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,766 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,767 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,767 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,767 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,767 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,767 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,768 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,768 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,768 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,768 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,768 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,768 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,768 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,769 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,769 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,769 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,769 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,769 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,769 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,770 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,770 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,770 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,770 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,770 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,770 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,770 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,771 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,771 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,771 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,771 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,771 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,771 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,772 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,772 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,772 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,772 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,772 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,772 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,772 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,773 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,773 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,773 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,773 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,773 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,773 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,773 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,774 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,774 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,774 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,774 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,774 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,774 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,774 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,774 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,775 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,775 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,775 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,775 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,775 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,775 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,775 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,775 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,776 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,776 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,776 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,776 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,776 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,776 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,776 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,777 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,777 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,777 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,777 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,777 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,777 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,777 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,777 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,777 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,778 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,778 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,778 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,778 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,778 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,779 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,779 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,779 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,779 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,779 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,779 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,779 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,780 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,780 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,780 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,780 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,780 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,780 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,780 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,781 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,781 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,781 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,781 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,781 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,781 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,781 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,782 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,782 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,782 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,782 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,782 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,782 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,783 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,783 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,783 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,783 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,783 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,783 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,783 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,783 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:23:35,788 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 23:23:35,788 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 23:23:35,794 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 23:23:35,804 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 23:23:35,819 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 23:23:35,820 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 23:23:35,820 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 23:23:35,820 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 23:23:35,820 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 23:23:35,820 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 23:23:35,821 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 23:23:35,821 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 23:23:35,821 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 23:23:35,828 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 148places, 179 transitions [2018-12-02 23:23:54,679 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 149047 states. [2018-12-02 23:23:54,681 INFO L276 IsEmpty]: Start isEmpty. Operand 149047 states. [2018-12-02 23:23:54,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 23:23:54,688 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:23:54,688 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-02 23:23:54,689 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:23:54,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:23:54,693 INFO L82 PathProgramCache]: Analyzing trace with hash -552567723, now seen corresponding path program 1 times [2018-12-02 23:23:54,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:23:54,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:23:54,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:23:54,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:23:54,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:23:54,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:23:54,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-02 23:23:54,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:23:54,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 23:23:54,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 23:23:54,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 23:23:54,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 23:23:54,849 INFO L87 Difference]: Start difference. First operand 149047 states. Second operand 4 states. [2018-12-02 23:23:56,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:23:56,225 INFO L93 Difference]: Finished difference Result 257067 states and 1188606 transitions. [2018-12-02 23:23:56,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 23:23:56,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-12-02 23:23:56,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:23:56,820 INFO L225 Difference]: With dead ends: 257067 [2018-12-02 23:23:56,820 INFO L226 Difference]: Without dead ends: 174817 [2018-12-02 23:23:56,821 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-02 23:23:57,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174817 states. [2018-12-02 23:24:01,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174817 to 110557. [2018-12-02 23:24:01,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110557 states. [2018-12-02 23:24:01,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110557 states to 110557 states and 511488 transitions. [2018-12-02 23:24:01,765 INFO L78 Accepts]: Start accepts. Automaton has 110557 states and 511488 transitions. Word has length 48 [2018-12-02 23:24:01,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:24:01,766 INFO L480 AbstractCegarLoop]: Abstraction has 110557 states and 511488 transitions. [2018-12-02 23:24:01,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 23:24:01,766 INFO L276 IsEmpty]: Start isEmpty. Operand 110557 states and 511488 transitions. [2018-12-02 23:24:01,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 23:24:01,778 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:24:01,778 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-02 23:24:01,778 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:24:01,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:24:01,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1274372901, now seen corresponding path program 1 times [2018-12-02 23:24:01,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:24:01,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:24:01,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:01,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:24:01,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:24:01,825 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-02 23:24:01,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:24:01,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:24:01,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:24:01,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:24:01,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:24:01,827 INFO L87 Difference]: Start difference. First operand 110557 states and 511488 transitions. Second operand 3 states. [2018-12-02 23:24:02,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:24:02,720 INFO L93 Difference]: Finished difference Result 110557 states and 511383 transitions. [2018-12-02 23:24:02,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:24:02,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-12-02 23:24:02,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:24:02,998 INFO L225 Difference]: With dead ends: 110557 [2018-12-02 23:24:02,998 INFO L226 Difference]: Without dead ends: 110557 [2018-12-02 23:24:02,999 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-02 23:24:03,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110557 states. [2018-12-02 23:24:04,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110557 to 110557. [2018-12-02 23:24:04,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110557 states. [2018-12-02 23:24:07,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110557 states to 110557 states and 511383 transitions. [2018-12-02 23:24:07,690 INFO L78 Accepts]: Start accepts. Automaton has 110557 states and 511383 transitions. Word has length 56 [2018-12-02 23:24:07,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:24:07,690 INFO L480 AbstractCegarLoop]: Abstraction has 110557 states and 511383 transitions. [2018-12-02 23:24:07,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:24:07,691 INFO L276 IsEmpty]: Start isEmpty. Operand 110557 states and 511383 transitions. [2018-12-02 23:24:07,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 23:24:07,697 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:24:07,698 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-02 23:24:07,698 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:24:07,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:24:07,698 INFO L82 PathProgramCache]: Analyzing trace with hash 468437434, now seen corresponding path program 1 times [2018-12-02 23:24:07,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:24:07,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:24:07,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:07,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:24:07,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:07,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:24:07,758 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-02 23:24:07,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:24:07,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:24:07,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:24:07,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:24:07,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:24:07,760 INFO L87 Difference]: Start difference. First operand 110557 states and 511383 transitions. Second operand 5 states. [2018-12-02 23:24:09,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:24:09,003 INFO L93 Difference]: Finished difference Result 240607 states and 1068638 transitions. [2018-12-02 23:24:09,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 23:24:09,004 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-12-02 23:24:09,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:24:09,639 INFO L225 Difference]: With dead ends: 240607 [2018-12-02 23:24:09,639 INFO L226 Difference]: Without dead ends: 237057 [2018-12-02 23:24:09,639 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-02 23:24:10,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237057 states. [2018-12-02 23:24:12,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237057 to 160437. [2018-12-02 23:24:12,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160437 states. [2018-12-02 23:24:13,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160437 states to 160437 states and 716827 transitions. [2018-12-02 23:24:13,866 INFO L78 Accepts]: Start accepts. Automaton has 160437 states and 716827 transitions. Word has length 56 [2018-12-02 23:24:13,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:24:13,866 INFO L480 AbstractCegarLoop]: Abstraction has 160437 states and 716827 transitions. [2018-12-02 23:24:13,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:24:13,866 INFO L276 IsEmpty]: Start isEmpty. Operand 160437 states and 716827 transitions. [2018-12-02 23:24:13,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-02 23:24:13,873 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:24:13,873 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-02 23:24:13,874 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:24:13,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:24:13,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1683293826, now seen corresponding path program 1 times [2018-12-02 23:24:13,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:24:13,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:24:13,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:13,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:24:13,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:13,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:24:13,927 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-02 23:24:13,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:24:13,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:24:13,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:24:13,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:24:13,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:24:13,928 INFO L87 Difference]: Start difference. First operand 160437 states and 716827 transitions. Second operand 5 states. [2018-12-02 23:24:15,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:24:15,517 INFO L93 Difference]: Finished difference Result 317177 states and 1405159 transitions. [2018-12-02 23:24:15,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 23:24:15,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-12-02 23:24:15,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:24:16,348 INFO L225 Difference]: With dead ends: 317177 [2018-12-02 23:24:16,348 INFO L226 Difference]: Without dead ends: 314277 [2018-12-02 23:24:16,348 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-02 23:24:18,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314277 states. [2018-12-02 23:24:23,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314277 to 178277. [2018-12-02 23:24:23,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178277 states. [2018-12-02 23:24:24,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178277 states to 178277 states and 791364 transitions. [2018-12-02 23:24:24,200 INFO L78 Accepts]: Start accepts. Automaton has 178277 states and 791364 transitions. Word has length 57 [2018-12-02 23:24:24,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:24:24,200 INFO L480 AbstractCegarLoop]: Abstraction has 178277 states and 791364 transitions. [2018-12-02 23:24:24,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:24:24,201 INFO L276 IsEmpty]: Start isEmpty. Operand 178277 states and 791364 transitions. [2018-12-02 23:24:24,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 23:24:24,213 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:24:24,213 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-02 23:24:24,213 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:24:24,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:24:24,213 INFO L82 PathProgramCache]: Analyzing trace with hash -674729880, now seen corresponding path program 1 times [2018-12-02 23:24:24,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:24:24,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:24:24,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:24,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:24:24,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:24,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:24:24,243 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-02 23:24:24,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:24:24,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:24:24,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:24:24,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:24:24,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:24:24,244 INFO L87 Difference]: Start difference. First operand 178277 states and 791364 transitions. Second operand 3 states. [2018-12-02 23:24:25,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:24:25,327 INFO L93 Difference]: Finished difference Result 231657 states and 1011133 transitions. [2018-12-02 23:24:25,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:24:25,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-12-02 23:24:25,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:24:25,932 INFO L225 Difference]: With dead ends: 231657 [2018-12-02 23:24:25,932 INFO L226 Difference]: Without dead ends: 231657 [2018-12-02 23:24:25,932 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-02 23:24:27,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231657 states. [2018-12-02 23:24:32,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231657 to 202942. [2018-12-02 23:24:32,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202942 states. [2018-12-02 23:24:32,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202942 states to 202942 states and 893421 transitions. [2018-12-02 23:24:32,928 INFO L78 Accepts]: Start accepts. Automaton has 202942 states and 893421 transitions. Word has length 59 [2018-12-02 23:24:32,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:24:32,929 INFO L480 AbstractCegarLoop]: Abstraction has 202942 states and 893421 transitions. [2018-12-02 23:24:32,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:24:32,929 INFO L276 IsEmpty]: Start isEmpty. Operand 202942 states and 893421 transitions. [2018-12-02 23:24:32,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 23:24:32,962 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:24:32,962 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-02 23:24:32,962 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:24:32,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:24:32,963 INFO L82 PathProgramCache]: Analyzing trace with hash 978550790, now seen corresponding path program 1 times [2018-12-02 23:24:32,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:24:32,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:24:32,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:32,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:24:32,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:32,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:24:33,030 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-02 23:24:33,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:24:33,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 23:24:33,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 23:24:33,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 23:24:33,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:24:33,031 INFO L87 Difference]: Start difference. First operand 202942 states and 893421 transitions. Second operand 6 states. [2018-12-02 23:24:34,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:24:34,544 INFO L93 Difference]: Finished difference Result 278037 states and 1213527 transitions. [2018-12-02 23:24:34,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 23:24:34,544 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-12-02 23:24:34,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:24:35,683 INFO L225 Difference]: With dead ends: 278037 [2018-12-02 23:24:35,684 INFO L226 Difference]: Without dead ends: 273332 [2018-12-02 23:24:35,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 23:24:36,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273332 states. [2018-12-02 23:24:42,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273332 to 256762. [2018-12-02 23:24:42,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256762 states. [2018-12-02 23:24:43,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256762 states to 256762 states and 1124197 transitions. [2018-12-02 23:24:43,413 INFO L78 Accepts]: Start accepts. Automaton has 256762 states and 1124197 transitions. Word has length 63 [2018-12-02 23:24:43,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:24:43,413 INFO L480 AbstractCegarLoop]: Abstraction has 256762 states and 1124197 transitions. [2018-12-02 23:24:43,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 23:24:43,413 INFO L276 IsEmpty]: Start isEmpty. Operand 256762 states and 1124197 transitions. [2018-12-02 23:24:43,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 23:24:43,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:24:43,453 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-02 23:24:43,453 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:24:43,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:24:43,453 INFO L82 PathProgramCache]: Analyzing trace with hash -818400569, now seen corresponding path program 1 times [2018-12-02 23:24:43,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:24:43,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:24:43,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:43,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:24:43,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:24:43,500 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-02 23:24:43,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:24:43,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 23:24:43,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 23:24:43,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 23:24:43,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 23:24:43,501 INFO L87 Difference]: Start difference. First operand 256762 states and 1124197 transitions. Second operand 7 states. [2018-12-02 23:24:45,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:24:45,880 INFO L93 Difference]: Finished difference Result 367257 states and 1557913 transitions. [2018-12-02 23:24:45,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 23:24:45,880 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2018-12-02 23:24:45,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:24:47,264 INFO L225 Difference]: With dead ends: 367257 [2018-12-02 23:24:47,265 INFO L226 Difference]: Without dead ends: 367257 [2018-12-02 23:24:47,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-02 23:24:48,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367257 states. [2018-12-02 23:24:55,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367257 to 302982. [2018-12-02 23:24:55,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302982 states. [2018-12-02 23:24:56,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302982 states to 302982 states and 1302893 transitions. [2018-12-02 23:24:56,982 INFO L78 Accepts]: Start accepts. Automaton has 302982 states and 1302893 transitions. Word has length 63 [2018-12-02 23:24:56,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:24:56,982 INFO L480 AbstractCegarLoop]: Abstraction has 302982 states and 1302893 transitions. [2018-12-02 23:24:56,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 23:24:56,982 INFO L276 IsEmpty]: Start isEmpty. Operand 302982 states and 1302893 transitions. [2018-12-02 23:24:57,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 23:24:57,024 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:24:57,024 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-02 23:24:57,024 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:24:57,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:24:57,024 INFO L82 PathProgramCache]: Analyzing trace with hash 69103112, now seen corresponding path program 1 times [2018-12-02 23:24:57,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:24:57,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:24:57,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:57,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:24:57,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:24:57,049 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-02 23:24:57,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:24:57,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 23:24:57,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 23:24:57,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 23:24:57,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 23:24:57,050 INFO L87 Difference]: Start difference. First operand 302982 states and 1302893 transitions. Second operand 4 states. [2018-12-02 23:24:58,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:24:58,713 INFO L93 Difference]: Finished difference Result 261613 states and 1104583 transitions. [2018-12-02 23:24:58,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 23:24:58,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-02 23:24:58,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:24:59,341 INFO L225 Difference]: With dead ends: 261613 [2018-12-02 23:24:59,342 INFO L226 Difference]: Without dead ends: 254858 [2018-12-02 23:24:59,342 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-02 23:25:00,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254858 states. [2018-12-02 23:25:03,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254858 to 254858. [2018-12-02 23:25:03,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254858 states. [2018-12-02 23:25:04,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254858 states to 254858 states and 1081014 transitions. [2018-12-02 23:25:04,543 INFO L78 Accepts]: Start accepts. Automaton has 254858 states and 1081014 transitions. Word has length 63 [2018-12-02 23:25:04,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:25:04,543 INFO L480 AbstractCegarLoop]: Abstraction has 254858 states and 1081014 transitions. [2018-12-02 23:25:04,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 23:25:04,543 INFO L276 IsEmpty]: Start isEmpty. Operand 254858 states and 1081014 transitions. [2018-12-02 23:25:04,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 23:25:04,569 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:25:04,569 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-02 23:25:04,569 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:25:04,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:25:04,569 INFO L82 PathProgramCache]: Analyzing trace with hash 2071932979, now seen corresponding path program 1 times [2018-12-02 23:25:04,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:25:04,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:25:04,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:04,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:25:04,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:04,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:25:04,618 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-02 23:25:04,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:25:04,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 23:25:04,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 23:25:04,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 23:25:04,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:25:04,618 INFO L87 Difference]: Start difference. First operand 254858 states and 1081014 transitions. Second operand 6 states. [2018-12-02 23:25:07,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:25:07,175 INFO L93 Difference]: Finished difference Result 407574 states and 1714377 transitions. [2018-12-02 23:25:07,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 23:25:07,175 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-12-02 23:25:07,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:25:11,389 INFO L225 Difference]: With dead ends: 407574 [2018-12-02 23:25:11,389 INFO L226 Difference]: Without dead ends: 400393 [2018-12-02 23:25:11,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-02 23:25:12,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400393 states. [2018-12-02 23:25:16,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400393 to 259070. [2018-12-02 23:25:16,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259070 states. [2018-12-02 23:25:17,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259070 states to 259070 states and 1099301 transitions. [2018-12-02 23:25:17,731 INFO L78 Accepts]: Start accepts. Automaton has 259070 states and 1099301 transitions. Word has length 63 [2018-12-02 23:25:17,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:25:17,731 INFO L480 AbstractCegarLoop]: Abstraction has 259070 states and 1099301 transitions. [2018-12-02 23:25:17,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 23:25:17,731 INFO L276 IsEmpty]: Start isEmpty. Operand 259070 states and 1099301 transitions. [2018-12-02 23:25:17,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 23:25:17,769 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:25:17,769 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] [2018-12-02 23:25:17,770 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:25:17,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:25:17,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1391724770, now seen corresponding path program 1 times [2018-12-02 23:25:17,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:25:17,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:25:17,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:17,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:25:17,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:17,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:25:17,815 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-02 23:25:17,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:25:17,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:25:17,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:25:17,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:25:17,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:25:17,815 INFO L87 Difference]: Start difference. First operand 259070 states and 1099301 transitions. Second operand 5 states. [2018-12-02 23:25:18,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:25:18,037 INFO L93 Difference]: Finished difference Result 57902 states and 224525 transitions. [2018-12-02 23:25:18,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 23:25:18,038 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2018-12-02 23:25:18,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:25:18,136 INFO L225 Difference]: With dead ends: 57902 [2018-12-02 23:25:18,137 INFO L226 Difference]: Without dead ends: 50986 [2018-12-02 23:25:18,137 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-02 23:25:18,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50986 states. [2018-12-02 23:25:18,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50986 to 50746. [2018-12-02 23:25:18,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50746 states. [2018-12-02 23:25:18,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50746 states to 50746 states and 196312 transitions. [2018-12-02 23:25:18,848 INFO L78 Accepts]: Start accepts. Automaton has 50746 states and 196312 transitions. Word has length 64 [2018-12-02 23:25:18,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:25:18,848 INFO L480 AbstractCegarLoop]: Abstraction has 50746 states and 196312 transitions. [2018-12-02 23:25:18,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:25:18,849 INFO L276 IsEmpty]: Start isEmpty. Operand 50746 states and 196312 transitions. [2018-12-02 23:25:18,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-02 23:25:18,864 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:25:18,864 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-02 23:25:18,864 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:25:18,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:25:18,865 INFO L82 PathProgramCache]: Analyzing trace with hash -276513334, now seen corresponding path program 1 times [2018-12-02 23:25:18,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:25:18,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:25:18,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:18,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:25:18,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:18,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:25:18,903 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-02 23:25:18,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:25:18,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 23:25:18,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 23:25:18,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 23:25:18,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 23:25:18,904 INFO L87 Difference]: Start difference. First operand 50746 states and 196312 transitions. Second operand 4 states. [2018-12-02 23:25:19,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:25:19,564 INFO L93 Difference]: Finished difference Result 59865 states and 230931 transitions. [2018-12-02 23:25:19,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 23:25:19,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2018-12-02 23:25:19,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:25:19,678 INFO L225 Difference]: With dead ends: 59865 [2018-12-02 23:25:19,678 INFO L226 Difference]: Without dead ends: 59865 [2018-12-02 23:25:19,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:25:19,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59865 states. [2018-12-02 23:25:20,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59865 to 53961. [2018-12-02 23:25:20,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53961 states. [2018-12-02 23:25:20,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53961 states to 53961 states and 208379 transitions. [2018-12-02 23:25:20,458 INFO L78 Accepts]: Start accepts. Automaton has 53961 states and 208379 transitions. Word has length 74 [2018-12-02 23:25:20,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:25:20,459 INFO L480 AbstractCegarLoop]: Abstraction has 53961 states and 208379 transitions. [2018-12-02 23:25:20,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 23:25:20,459 INFO L276 IsEmpty]: Start isEmpty. Operand 53961 states and 208379 transitions. [2018-12-02 23:25:20,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-02 23:25:20,476 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:25:20,476 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-02 23:25:20,476 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:25:20,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:25:20,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1466297001, now seen corresponding path program 1 times [2018-12-02 23:25:20,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:25:20,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:25:20,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:20,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:25:20,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:20,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:25:20,527 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-02 23:25:20,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:25:20,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 23:25:20,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 23:25:20,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 23:25:20,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:25:20,527 INFO L87 Difference]: Start difference. First operand 53961 states and 208379 transitions. Second operand 6 states. [2018-12-02 23:25:21,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:25:21,090 INFO L93 Difference]: Finished difference Result 98120 states and 377173 transitions. [2018-12-02 23:25:21,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 23:25:21,091 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2018-12-02 23:25:21,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:25:21,276 INFO L225 Difference]: With dead ends: 98120 [2018-12-02 23:25:21,276 INFO L226 Difference]: Without dead ends: 97800 [2018-12-02 23:25:21,277 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-02 23:25:21,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97800 states. [2018-12-02 23:25:22,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97800 to 58186. [2018-12-02 23:25:22,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58186 states. [2018-12-02 23:25:22,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58186 states to 58186 states and 223570 transitions. [2018-12-02 23:25:22,446 INFO L78 Accepts]: Start accepts. Automaton has 58186 states and 223570 transitions. Word has length 74 [2018-12-02 23:25:22,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:25:22,447 INFO L480 AbstractCegarLoop]: Abstraction has 58186 states and 223570 transitions. [2018-12-02 23:25:22,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 23:25:22,447 INFO L276 IsEmpty]: Start isEmpty. Operand 58186 states and 223570 transitions. [2018-12-02 23:25:22,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-02 23:25:22,469 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:25:22,469 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] [2018-12-02 23:25:22,470 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:25:22,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:25:22,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1987377366, now seen corresponding path program 1 times [2018-12-02 23:25:22,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:25:22,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:25:22,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:22,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:25:22,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:25:22,525 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-02 23:25:22,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:25:22,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 23:25:22,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 23:25:22,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 23:25:22,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 23:25:22,526 INFO L87 Difference]: Start difference. First operand 58186 states and 223570 transitions. Second operand 4 states. [2018-12-02 23:25:22,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:25:22,891 INFO L93 Difference]: Finished difference Result 73349 states and 278574 transitions. [2018-12-02 23:25:22,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 23:25:22,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2018-12-02 23:25:22,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:25:23,016 INFO L225 Difference]: With dead ends: 73349 [2018-12-02 23:25:23,017 INFO L226 Difference]: Without dead ends: 73349 [2018-12-02 23:25:23,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 23:25:23,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73349 states. [2018-12-02 23:25:23,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73349 to 66713. [2018-12-02 23:25:23,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66713 states. [2018-12-02 23:25:24,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66713 states to 66713 states and 254002 transitions. [2018-12-02 23:25:24,120 INFO L78 Accepts]: Start accepts. Automaton has 66713 states and 254002 transitions. Word has length 76 [2018-12-02 23:25:24,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:25:24,121 INFO L480 AbstractCegarLoop]: Abstraction has 66713 states and 254002 transitions. [2018-12-02 23:25:24,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 23:25:24,121 INFO L276 IsEmpty]: Start isEmpty. Operand 66713 states and 254002 transitions. [2018-12-02 23:25:24,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-02 23:25:24,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:25:24,152 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] [2018-12-02 23:25:24,152 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:25:24,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:25:24,153 INFO L82 PathProgramCache]: Analyzing trace with hash -89831977, now seen corresponding path program 1 times [2018-12-02 23:25:24,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:25:24,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:25:24,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:24,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:25:24,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:25:24,184 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-02 23:25:24,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:25:24,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:25:24,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:25:24,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:25:24,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:25:24,185 INFO L87 Difference]: Start difference. First operand 66713 states and 254002 transitions. Second operand 3 states. [2018-12-02 23:25:24,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:25:24,494 INFO L93 Difference]: Finished difference Result 69475 states and 263647 transitions. [2018-12-02 23:25:24,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:25:24,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2018-12-02 23:25:24,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:25:24,621 INFO L225 Difference]: With dead ends: 69475 [2018-12-02 23:25:24,622 INFO L226 Difference]: Without dead ends: 69475 [2018-12-02 23:25:24,622 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-02 23:25:24,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69475 states. [2018-12-02 23:25:25,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69475 to 68223. [2018-12-02 23:25:25,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68223 states. [2018-12-02 23:25:25,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68223 states to 68223 states and 259246 transitions. [2018-12-02 23:25:25,769 INFO L78 Accepts]: Start accepts. Automaton has 68223 states and 259246 transitions. Word has length 76 [2018-12-02 23:25:25,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:25:25,770 INFO L480 AbstractCegarLoop]: Abstraction has 68223 states and 259246 transitions. [2018-12-02 23:25:25,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:25:25,770 INFO L276 IsEmpty]: Start isEmpty. Operand 68223 states and 259246 transitions. [2018-12-02 23:25:25,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 23:25:25,806 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:25:25,806 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] [2018-12-02 23:25:25,807 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:25:25,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:25:25,807 INFO L82 PathProgramCache]: Analyzing trace with hash 2086484495, now seen corresponding path program 1 times [2018-12-02 23:25:25,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:25:25,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:25:25,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:25,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:25:25,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:25,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:25:25,847 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-02 23:25:25,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:25:25,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 23:25:25,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 23:25:25,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 23:25:25,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:25:25,848 INFO L87 Difference]: Start difference. First operand 68223 states and 259246 transitions. Second operand 6 states. [2018-12-02 23:25:26,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:25:26,480 INFO L93 Difference]: Finished difference Result 82930 states and 311777 transitions. [2018-12-02 23:25:26,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 23:25:26,480 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-02 23:25:26,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:25:26,635 INFO L225 Difference]: With dead ends: 82930 [2018-12-02 23:25:26,635 INFO L226 Difference]: Without dead ends: 82930 [2018-12-02 23:25:26,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-02 23:25:26,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82930 states. [2018-12-02 23:25:27,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82930 to 78446. [2018-12-02 23:25:27,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78446 states. [2018-12-02 23:25:28,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78446 states to 78446 states and 296295 transitions. [2018-12-02 23:25:28,024 INFO L78 Accepts]: Start accepts. Automaton has 78446 states and 296295 transitions. Word has length 78 [2018-12-02 23:25:28,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:25:28,025 INFO L480 AbstractCegarLoop]: Abstraction has 78446 states and 296295 transitions. [2018-12-02 23:25:28,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 23:25:28,025 INFO L276 IsEmpty]: Start isEmpty. Operand 78446 states and 296295 transitions. [2018-12-02 23:25:28,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 23:25:28,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:25:28,067 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] [2018-12-02 23:25:28,067 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:25:28,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:25:28,067 INFO L82 PathProgramCache]: Analyzing trace with hash 9275152, now seen corresponding path program 1 times [2018-12-02 23:25:28,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:25:28,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:25:28,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:28,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:25:28,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:28,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:25:28,121 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-02 23:25:28,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:25:28,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 23:25:28,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 23:25:28,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 23:25:28,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:25:28,122 INFO L87 Difference]: Start difference. First operand 78446 states and 296295 transitions. Second operand 6 states. [2018-12-02 23:25:28,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:25:28,599 INFO L93 Difference]: Finished difference Result 91980 states and 338638 transitions. [2018-12-02 23:25:28,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 23:25:28,599 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-02 23:25:28,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:25:28,766 INFO L225 Difference]: With dead ends: 91980 [2018-12-02 23:25:28,766 INFO L226 Difference]: Without dead ends: 91980 [2018-12-02 23:25:28,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-02 23:25:28,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91980 states. [2018-12-02 23:25:29,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91980 to 80035. [2018-12-02 23:25:29,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80035 states. [2018-12-02 23:25:30,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80035 states to 80035 states and 297460 transitions. [2018-12-02 23:25:30,211 INFO L78 Accepts]: Start accepts. Automaton has 80035 states and 297460 transitions. Word has length 78 [2018-12-02 23:25:30,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:25:30,212 INFO L480 AbstractCegarLoop]: Abstraction has 80035 states and 297460 transitions. [2018-12-02 23:25:30,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 23:25:30,212 INFO L276 IsEmpty]: Start isEmpty. Operand 80035 states and 297460 transitions. [2018-12-02 23:25:30,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 23:25:30,256 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:25:30,256 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] [2018-12-02 23:25:30,256 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:25:30,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:25:30,256 INFO L82 PathProgramCache]: Analyzing trace with hash 220626065, now seen corresponding path program 1 times [2018-12-02 23:25:30,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:25:30,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:25:30,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:30,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:25:30,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:30,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:25:30,304 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-02 23:25:30,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:25:30,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:25:30,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:25:30,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:25:30,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:25:30,305 INFO L87 Difference]: Start difference. First operand 80035 states and 297460 transitions. Second operand 5 states. [2018-12-02 23:25:30,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:25:30,782 INFO L93 Difference]: Finished difference Result 101344 states and 374908 transitions. [2018-12-02 23:25:30,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 23:25:30,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-12-02 23:25:30,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:25:30,980 INFO L225 Difference]: With dead ends: 101344 [2018-12-02 23:25:30,981 INFO L226 Difference]: Without dead ends: 101344 [2018-12-02 23:25:30,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 23:25:31,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101344 states. [2018-12-02 23:25:32,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101344 to 85990. [2018-12-02 23:25:32,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85990 states. [2018-12-02 23:25:32,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85990 states to 85990 states and 317478 transitions. [2018-12-02 23:25:32,548 INFO L78 Accepts]: Start accepts. Automaton has 85990 states and 317478 transitions. Word has length 78 [2018-12-02 23:25:32,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:25:32,548 INFO L480 AbstractCegarLoop]: Abstraction has 85990 states and 317478 transitions. [2018-12-02 23:25:32,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:25:32,548 INFO L276 IsEmpty]: Start isEmpty. Operand 85990 states and 317478 transitions. [2018-12-02 23:25:32,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 23:25:32,594 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:25:32,594 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] [2018-12-02 23:25:32,595 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:25:32,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:25:32,595 INFO L82 PathProgramCache]: Analyzing trace with hash -289908112, now seen corresponding path program 1 times [2018-12-02 23:25:32,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:25:32,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:25:32,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:32,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:25:32,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:32,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:25:32,629 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-02 23:25:32,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:25:32,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:25:32,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:25:32,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:25:32,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:25:32,630 INFO L87 Difference]: Start difference. First operand 85990 states and 317478 transitions. Second operand 5 states. [2018-12-02 23:25:33,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:25:33,247 INFO L93 Difference]: Finished difference Result 115113 states and 423726 transitions. [2018-12-02 23:25:33,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 23:25:33,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-12-02 23:25:33,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:25:33,470 INFO L225 Difference]: With dead ends: 115113 [2018-12-02 23:25:33,470 INFO L226 Difference]: Without dead ends: 115113 [2018-12-02 23:25:33,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 23:25:33,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115113 states. [2018-12-02 23:25:34,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115113 to 90923. [2018-12-02 23:25:34,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90923 states. [2018-12-02 23:25:35,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90923 states to 90923 states and 335672 transitions. [2018-12-02 23:25:35,060 INFO L78 Accepts]: Start accepts. Automaton has 90923 states and 335672 transitions. Word has length 78 [2018-12-02 23:25:35,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:25:35,060 INFO L480 AbstractCegarLoop]: Abstraction has 90923 states and 335672 transitions. [2018-12-02 23:25:35,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:25:35,060 INFO L276 IsEmpty]: Start isEmpty. Operand 90923 states and 335672 transitions. [2018-12-02 23:25:35,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 23:25:35,110 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:25:35,110 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] [2018-12-02 23:25:35,110 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:25:35,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:25:35,111 INFO L82 PathProgramCache]: Analyzing trace with hash -2097362575, now seen corresponding path program 1 times [2018-12-02 23:25:35,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:25:35,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:25:35,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:35,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:25:35,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:25:35,146 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-02 23:25:35,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:25:35,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 23:25:35,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 23:25:35,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 23:25:35,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 23:25:35,147 INFO L87 Difference]: Start difference. First operand 90923 states and 335672 transitions. Second operand 4 states. [2018-12-02 23:25:35,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:25:35,838 INFO L93 Difference]: Finished difference Result 119675 states and 442976 transitions. [2018-12-02 23:25:35,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 23:25:35,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-02 23:25:35,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:25:36,070 INFO L225 Difference]: With dead ends: 119675 [2018-12-02 23:25:36,071 INFO L226 Difference]: Without dead ends: 117963 [2018-12-02 23:25:36,071 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-02 23:25:36,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117963 states. [2018-12-02 23:25:37,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117963 to 109079. [2018-12-02 23:25:37,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109079 states. [2018-12-02 23:25:37,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109079 states to 109079 states and 404024 transitions. [2018-12-02 23:25:37,843 INFO L78 Accepts]: Start accepts. Automaton has 109079 states and 404024 transitions. Word has length 78 [2018-12-02 23:25:37,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:25:37,844 INFO L480 AbstractCegarLoop]: Abstraction has 109079 states and 404024 transitions. [2018-12-02 23:25:37,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 23:25:37,844 INFO L276 IsEmpty]: Start isEmpty. Operand 109079 states and 404024 transitions. [2018-12-02 23:25:37,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 23:25:37,907 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:25:37,907 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] [2018-12-02 23:25:37,908 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:25:37,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:25:37,908 INFO L82 PathProgramCache]: Analyzing trace with hash 400653362, now seen corresponding path program 1 times [2018-12-02 23:25:37,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:25:37,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:25:37,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:37,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:25:37,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:37,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:25:37,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-02 23:25:37,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:25:37,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 23:25:37,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 23:25:37,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 23:25:37,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:25:37,952 INFO L87 Difference]: Start difference. First operand 109079 states and 404024 transitions. Second operand 6 states. [2018-12-02 23:25:38,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:25:38,062 INFO L93 Difference]: Finished difference Result 32935 states and 104464 transitions. [2018-12-02 23:25:38,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 23:25:38,062 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-02 23:25:38,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:25:38,095 INFO L225 Difference]: With dead ends: 32935 [2018-12-02 23:25:38,095 INFO L226 Difference]: Without dead ends: 26736 [2018-12-02 23:25:38,095 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-02 23:25:38,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26736 states. [2018-12-02 23:25:38,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26736 to 23366. [2018-12-02 23:25:38,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23366 states. [2018-12-02 23:25:38,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23366 states to 23366 states and 73363 transitions. [2018-12-02 23:25:38,348 INFO L78 Accepts]: Start accepts. Automaton has 23366 states and 73363 transitions. Word has length 78 [2018-12-02 23:25:38,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:25:38,348 INFO L480 AbstractCegarLoop]: Abstraction has 23366 states and 73363 transitions. [2018-12-02 23:25:38,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 23:25:38,348 INFO L276 IsEmpty]: Start isEmpty. Operand 23366 states and 73363 transitions. [2018-12-02 23:25:38,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 23:25:38,367 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:25:38,367 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] [2018-12-02 23:25:38,367 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:25:38,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:25:38,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1243988963, now seen corresponding path program 1 times [2018-12-02 23:25:38,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:25:38,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:25:38,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:38,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:25:38,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:25:38,421 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-02 23:25:38,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:25:38,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 23:25:38,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 23:25:38,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 23:25:38,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 23:25:38,422 INFO L87 Difference]: Start difference. First operand 23366 states and 73363 transitions. Second operand 7 states. [2018-12-02 23:25:38,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:25:38,811 INFO L93 Difference]: Finished difference Result 29400 states and 91988 transitions. [2018-12-02 23:25:38,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 23:25:38,811 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-02 23:25:38,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:25:38,841 INFO L225 Difference]: With dead ends: 29400 [2018-12-02 23:25:38,841 INFO L226 Difference]: Without dead ends: 29400 [2018-12-02 23:25:38,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 23:25:38,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29400 states. [2018-12-02 23:25:39,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29400 to 24116. [2018-12-02 23:25:39,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24116 states. [2018-12-02 23:25:39,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24116 states to 24116 states and 75913 transitions. [2018-12-02 23:25:39,101 INFO L78 Accepts]: Start accepts. Automaton has 24116 states and 75913 transitions. Word has length 93 [2018-12-02 23:25:39,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:25:39,101 INFO L480 AbstractCegarLoop]: Abstraction has 24116 states and 75913 transitions. [2018-12-02 23:25:39,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 23:25:39,101 INFO L276 IsEmpty]: Start isEmpty. Operand 24116 states and 75913 transitions. [2018-12-02 23:25:39,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 23:25:39,120 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:25:39,120 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] [2018-12-02 23:25:39,121 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:25:39,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:25:39,121 INFO L82 PathProgramCache]: Analyzing trace with hash 464240939, now seen corresponding path program 2 times [2018-12-02 23:25:39,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:25:39,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:25:39,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:39,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:25:39,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:39,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:25:39,171 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-02 23:25:39,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:25:39,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:25:39,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:25:39,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:25:39,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:25:39,172 INFO L87 Difference]: Start difference. First operand 24116 states and 75913 transitions. Second operand 5 states. [2018-12-02 23:25:39,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:25:39,362 INFO L93 Difference]: Finished difference Result 28070 states and 87487 transitions. [2018-12-02 23:25:39,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 23:25:39,363 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-02 23:25:39,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:25:39,393 INFO L225 Difference]: With dead ends: 28070 [2018-12-02 23:25:39,393 INFO L226 Difference]: Without dead ends: 27900 [2018-12-02 23:25:39,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 23:25:39,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27900 states. [2018-12-02 23:25:39,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27900 to 24896. [2018-12-02 23:25:39,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24896 states. [2018-12-02 23:25:39,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24896 states to 24896 states and 78077 transitions. [2018-12-02 23:25:39,675 INFO L78 Accepts]: Start accepts. Automaton has 24896 states and 78077 transitions. Word has length 93 [2018-12-02 23:25:39,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:25:39,675 INFO L480 AbstractCegarLoop]: Abstraction has 24896 states and 78077 transitions. [2018-12-02 23:25:39,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:25:39,675 INFO L276 IsEmpty]: Start isEmpty. Operand 24896 states and 78077 transitions. [2018-12-02 23:25:39,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 23:25:39,698 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:25:39,698 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] [2018-12-02 23:25:39,699 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:25:39,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:25:39,699 INFO L82 PathProgramCache]: Analyzing trace with hash 240665687, now seen corresponding path program 3 times [2018-12-02 23:25:39,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:25:39,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:25:39,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:39,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:25:39,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:25:39,798 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-02 23:25:39,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:25:39,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 23:25:39,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 23:25:39,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 23:25:39,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:25:39,799 INFO L87 Difference]: Start difference. First operand 24896 states and 78077 transitions. Second operand 6 states. [2018-12-02 23:25:39,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:25:39,920 INFO L93 Difference]: Finished difference Result 23872 states and 74045 transitions. [2018-12-02 23:25:39,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 23:25:39,921 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-02 23:25:39,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:25:39,955 INFO L225 Difference]: With dead ends: 23872 [2018-12-02 23:25:39,955 INFO L226 Difference]: Without dead ends: 23872 [2018-12-02 23:25:39,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-02 23:25:39,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23872 states. [2018-12-02 23:25:40,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23872 to 16028. [2018-12-02 23:25:40,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16028 states. [2018-12-02 23:25:40,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16028 states to 16028 states and 50193 transitions. [2018-12-02 23:25:40,163 INFO L78 Accepts]: Start accepts. Automaton has 16028 states and 50193 transitions. Word has length 93 [2018-12-02 23:25:40,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:25:40,164 INFO L480 AbstractCegarLoop]: Abstraction has 16028 states and 50193 transitions. [2018-12-02 23:25:40,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 23:25:40,164 INFO L276 IsEmpty]: Start isEmpty. Operand 16028 states and 50193 transitions. [2018-12-02 23:25:40,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 23:25:40,176 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:25:40,176 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] [2018-12-02 23:25:40,177 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:25:40,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:25:40,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1692142406, now seen corresponding path program 1 times [2018-12-02 23:25:40,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:25:40,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:25:40,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:40,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:25:40,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:40,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:25:40,239 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-02 23:25:40,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:25:40,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 23:25:40,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 23:25:40,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 23:25:40,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 23:25:40,240 INFO L87 Difference]: Start difference. First operand 16028 states and 50193 transitions. Second operand 7 states. [2018-12-02 23:25:40,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:25:40,620 INFO L93 Difference]: Finished difference Result 22140 states and 68568 transitions. [2018-12-02 23:25:40,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 23:25:40,620 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-12-02 23:25:40,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:25:40,642 INFO L225 Difference]: With dead ends: 22140 [2018-12-02 23:25:40,643 INFO L226 Difference]: Without dead ends: 21780 [2018-12-02 23:25:40,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-02 23:25:40,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21780 states. [2018-12-02 23:25:40,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21780 to 16498. [2018-12-02 23:25:40,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16498 states. [2018-12-02 23:25:40,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16498 states to 16498 states and 51199 transitions. [2018-12-02 23:25:40,824 INFO L78 Accepts]: Start accepts. Automaton has 16498 states and 51199 transitions. Word has length 95 [2018-12-02 23:25:40,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:25:40,824 INFO L480 AbstractCegarLoop]: Abstraction has 16498 states and 51199 transitions. [2018-12-02 23:25:40,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 23:25:40,825 INFO L276 IsEmpty]: Start isEmpty. Operand 16498 states and 51199 transitions. [2018-12-02 23:25:40,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 23:25:40,837 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:25:40,837 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] [2018-12-02 23:25:40,837 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:25:40,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:25:40,837 INFO L82 PathProgramCache]: Analyzing trace with hash 525615547, now seen corresponding path program 1 times [2018-12-02 23:25:40,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:25:40,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:25:40,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:40,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:25:40,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:25:40,936 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-02 23:25:40,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:25:40,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 23:25:40,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 23:25:40,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 23:25:40,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 23:25:40,937 INFO L87 Difference]: Start difference. First operand 16498 states and 51199 transitions. Second operand 8 states. [2018-12-02 23:25:41,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:25:41,218 INFO L93 Difference]: Finished difference Result 19635 states and 60536 transitions. [2018-12-02 23:25:41,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 23:25:41,218 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2018-12-02 23:25:41,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:25:41,236 INFO L225 Difference]: With dead ends: 19635 [2018-12-02 23:25:41,237 INFO L226 Difference]: Without dead ends: 19635 [2018-12-02 23:25:41,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2018-12-02 23:25:41,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19635 states. [2018-12-02 23:25:41,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19635 to 18806. [2018-12-02 23:25:41,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18806 states. [2018-12-02 23:25:41,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18806 states to 18806 states and 58221 transitions. [2018-12-02 23:25:41,432 INFO L78 Accepts]: Start accepts. Automaton has 18806 states and 58221 transitions. Word has length 95 [2018-12-02 23:25:41,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:25:41,432 INFO L480 AbstractCegarLoop]: Abstraction has 18806 states and 58221 transitions. [2018-12-02 23:25:41,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 23:25:41,432 INFO L276 IsEmpty]: Start isEmpty. Operand 18806 states and 58221 transitions. [2018-12-02 23:25:41,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 23:25:41,448 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:25:41,448 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] [2018-12-02 23:25:41,448 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:25:41,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:25:41,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1413119228, now seen corresponding path program 1 times [2018-12-02 23:25:41,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:25:41,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:25:41,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:41,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:25:41,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:41,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:25:41,549 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-02 23:25:41,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:25:41,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 23:25:41,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 23:25:41,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 23:25:41,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-02 23:25:41,550 INFO L87 Difference]: Start difference. First operand 18806 states and 58221 transitions. Second operand 10 states. [2018-12-02 23:25:42,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:25:42,052 INFO L93 Difference]: Finished difference Result 35478 states and 109561 transitions. [2018-12-02 23:25:42,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 23:25:42,052 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2018-12-02 23:25:42,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:25:42,071 INFO L225 Difference]: With dead ends: 35478 [2018-12-02 23:25:42,071 INFO L226 Difference]: Without dead ends: 16946 [2018-12-02 23:25:42,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-12-02 23:25:42,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16946 states. [2018-12-02 23:25:42,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16946 to 16946. [2018-12-02 23:25:42,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16946 states. [2018-12-02 23:25:42,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16946 states to 16946 states and 52281 transitions. [2018-12-02 23:25:42,235 INFO L78 Accepts]: Start accepts. Automaton has 16946 states and 52281 transitions. Word has length 95 [2018-12-02 23:25:42,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:25:42,235 INFO L480 AbstractCegarLoop]: Abstraction has 16946 states and 52281 transitions. [2018-12-02 23:25:42,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 23:25:42,235 INFO L276 IsEmpty]: Start isEmpty. Operand 16946 states and 52281 transitions. [2018-12-02 23:25:42,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 23:25:42,249 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:25:42,249 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] [2018-12-02 23:25:42,249 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:25:42,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:25:42,249 INFO L82 PathProgramCache]: Analyzing trace with hash -996346436, now seen corresponding path program 2 times [2018-12-02 23:25:42,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:25:42,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:25:42,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:42,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:25:42,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:25:42,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-02 23:25:42,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:25:42,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 23:25:42,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 23:25:42,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 23:25:42,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 23:25:42,320 INFO L87 Difference]: Start difference. First operand 16946 states and 52281 transitions. Second operand 7 states. [2018-12-02 23:25:42,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:25:42,619 INFO L93 Difference]: Finished difference Result 28985 states and 89401 transitions. [2018-12-02 23:25:42,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 23:25:42,619 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-12-02 23:25:42,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:25:42,631 INFO L225 Difference]: With dead ends: 28985 [2018-12-02 23:25:42,631 INFO L226 Difference]: Without dead ends: 11158 [2018-12-02 23:25:42,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-02 23:25:42,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11158 states. [2018-12-02 23:25:42,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11158 to 11158. [2018-12-02 23:25:42,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11158 states. [2018-12-02 23:25:42,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11158 states to 11158 states and 34312 transitions. [2018-12-02 23:25:42,740 INFO L78 Accepts]: Start accepts. Automaton has 11158 states and 34312 transitions. Word has length 95 [2018-12-02 23:25:42,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:25:42,740 INFO L480 AbstractCegarLoop]: Abstraction has 11158 states and 34312 transitions. [2018-12-02 23:25:42,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 23:25:42,740 INFO L276 IsEmpty]: Start isEmpty. Operand 11158 states and 34312 transitions. [2018-12-02 23:25:42,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 23:25:42,750 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:25:42,750 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] [2018-12-02 23:25:42,750 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:25:42,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:25:42,750 INFO L82 PathProgramCache]: Analyzing trace with hash 701775706, now seen corresponding path program 3 times [2018-12-02 23:25:42,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:25:42,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:25:42,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:42,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:25:42,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:25:42,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-02 23:25:42,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:25:42,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 23:25:42,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 23:25:42,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 23:25:42,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 23:25:42,835 INFO L87 Difference]: Start difference. First operand 11158 states and 34312 transitions. Second operand 11 states. [2018-12-02 23:25:43,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:25:43,443 INFO L93 Difference]: Finished difference Result 19834 states and 61127 transitions. [2018-12-02 23:25:43,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 23:25:43,443 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2018-12-02 23:25:43,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:25:43,457 INFO L225 Difference]: With dead ends: 19834 [2018-12-02 23:25:43,457 INFO L226 Difference]: Without dead ends: 12852 [2018-12-02 23:25:43,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-12-02 23:25:43,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12852 states. [2018-12-02 23:25:43,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12852 to 11300. [2018-12-02 23:25:43,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11300 states. [2018-12-02 23:25:43,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11300 states to 11300 states and 34526 transitions. [2018-12-02 23:25:43,573 INFO L78 Accepts]: Start accepts. Automaton has 11300 states and 34526 transitions. Word has length 95 [2018-12-02 23:25:43,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:25:43,573 INFO L480 AbstractCegarLoop]: Abstraction has 11300 states and 34526 transitions. [2018-12-02 23:25:43,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 23:25:43,573 INFO L276 IsEmpty]: Start isEmpty. Operand 11300 states and 34526 transitions. [2018-12-02 23:25:43,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 23:25:43,583 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:25:43,583 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] [2018-12-02 23:25:43,583 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:25:43,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:25:43,583 INFO L82 PathProgramCache]: Analyzing trace with hash 452153496, now seen corresponding path program 4 times [2018-12-02 23:25:43,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:25:43,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:25:43,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:43,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:25:43,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:25:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:25:43,620 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 23:25:43,687 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 23:25:43,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 11:25:43 BasicIcfg [2018-12-02 23:25:43,688 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 23:25:43,688 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 23:25:43,689 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 23:25:43,689 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 23:25:43,689 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:23:35" (3/4) ... [2018-12-02 23:25:43,691 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 23:25:43,762 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_124c5bea-32eb-4334-a1b5-3d3372ecebc0/bin-2019/uautomizer/witness.graphml [2018-12-02 23:25:43,762 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 23:25:43,762 INFO L168 Benchmark]: Toolchain (without parser) took 128746.43 ms. Allocated memory was 1.0 GB in the beginning and 9.2 GB in the end (delta: 8.2 GB). Free memory was 956.0 MB in the beginning and 4.2 GB in the end (delta: -3.3 GB). Peak memory consumption was 4.9 GB. Max. memory is 11.5 GB. [2018-12-02 23:25:43,763 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-02 23:25:43,763 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.83 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 78.1 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -95.7 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2018-12-02 23:25:43,763 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.02 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 23:25:43,764 INFO L168 Benchmark]: Boogie Preprocessor took 20.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 11.5 GB. [2018-12-02 23:25:43,764 INFO L168 Benchmark]: RCFGBuilder took 344.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 997.4 MB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. [2018-12-02 23:25:43,764 INFO L168 Benchmark]: TraceAbstraction took 127956.92 ms. Allocated memory was 1.1 GB in the beginning and 9.2 GB in the end (delta: 8.1 GB). Free memory was 997.4 MB in the beginning and 4.3 GB in the end (delta: -3.3 GB). Peak memory consumption was 4.9 GB. Max. memory is 11.5 GB. [2018-12-02 23:25:43,764 INFO L168 Benchmark]: Witness Printer took 73.35 ms. Allocated memory is still 9.2 GB. Free memory was 4.3 GB in the beginning and 4.2 GB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. [2018-12-02 23:25:43,765 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 315.83 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 78.1 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -95.7 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.02 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 344.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 997.4 MB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 127956.92 ms. Allocated memory was 1.1 GB in the beginning and 9.2 GB in the end (delta: 8.1 GB). Free memory was 997.4 MB in the beginning and 4.3 GB in the end (delta: -3.3 GB). Peak memory consumption was 4.9 GB. Max. memory is 11.5 GB. * Witness Printer took 73.35 ms. Allocated memory is still 9.2 GB. Free memory was 4.3 GB in the beginning and 4.2 GB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 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_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L676] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L678] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L680] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L682] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L684] -1 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0] [L685] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0] [L686] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L688] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L690] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L692] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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] [L806] -1 pthread_t t890; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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] [L807] FCALL, FORK -1 pthread_create(&t890, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=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] [L808] -1 pthread_t t891; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=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] [L809] FCALL, FORK -1 pthread_create(&t891, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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] [L810] -1 pthread_t t892; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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] [L811] FCALL, FORK -1 pthread_create(&t892, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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 a = 1 [L778] 0 __unbuffered_p2_EAX = a [L781] 0 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=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=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] 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_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=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=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 b = 1 [L717] 1 x = 1 [L722] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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] [L729] 2 x = 2 [L732] 2 y = 1 [L735] 2 __unbuffered_p1_EAX = y [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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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] [L784] 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) [L785] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used 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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, 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$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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=2, 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=0, 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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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=2, 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=0, 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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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))=0, x=2, 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=0, 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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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=2, 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=0, 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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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=2, 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=0, 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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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=2, 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=0, 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_EBX = z VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L750] EXPR 2 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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=0, 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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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] [L786] 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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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] [L786] 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 [L787] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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] [L787] 0 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] 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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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] [L788] 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 [L791] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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] [L813] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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] [L817] 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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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] [L817] EXPR -1 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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] [L817] 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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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] [L817] -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) [L818] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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] [L818] -1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L819] 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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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] [L819] -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 [L820] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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] [L820] -1 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L821] 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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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] [L821] -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 [L824] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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, 221 locations, 3 error locations. UNSAFE Result, 127.8s OverallTime, 29 OverallIterations, 1 TraceHistogramMax, 34.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8184 SDtfs, 10455 SDslu, 19190 SDs, 0 SdLazy, 7404 SolverSat, 436 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 276 GetRequests, 74 SyntacticMatches, 18 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=302982occurred in iteration=7, 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: 72.1s AutomataMinimizationTime, 28 MinimizatonAttempts, 673431 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2209 NumberOfCodeBlocks, 2209 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2086 ConstructedInterpolants, 0 QuantifiedInterpolants, 396153 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...