./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix009_tso.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/mix009_tso.oepc_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 7173ac970a23592e8fa4a1dea5ce9a310499eb31 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 18:24:57,724 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 18:24:57,726 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 18:24:57,739 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 18:24:57,740 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 18:24:57,741 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 18:24:57,742 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 18:24:57,744 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 18:24:57,746 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 18:24:57,747 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 18:24:57,748 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 18:24:57,748 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 18:24:57,749 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 18:24:57,750 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 18:24:57,751 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 18:24:57,752 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 18:24:57,753 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 18:24:57,755 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 18:24:57,757 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 18:24:57,759 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 18:24:57,760 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 18:24:57,761 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 18:24:57,764 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 18:24:57,764 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 18:24:57,764 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 18:24:57,765 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 18:24:57,766 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 18:24:57,767 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 18:24:57,768 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 18:24:57,769 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 18:24:57,770 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 18:24:57,770 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 18:24:57,771 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 18:24:57,771 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 18:24:57,772 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 18:24:57,773 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 18:24:57,773 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 18:24:57,795 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 18:24:57,797 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 18:24:57,800 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 18:24:57,800 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 18:24:57,800 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 18:24:57,800 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 18:24:57,800 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 18:24:57,801 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 18:24:57,801 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 18:24:57,801 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 18:24:57,801 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 18:24:57,801 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 18:24:57,801 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 18:24:57,803 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 18:24:57,804 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 18:24:57,804 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 18:24:57,804 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 18:24:57,804 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 18:24:57,804 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 18:24:57,805 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 18:24:57,807 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 18:24:57,807 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 18:24:57,807 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 18:24:57,807 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 18:24:57,808 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 18:24:57,808 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 18:24:57,809 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 18:24:57,809 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 18:24:57,809 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 7173ac970a23592e8fa4a1dea5ce9a310499eb31 [2018-12-31 18:24:57,876 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 18:24:57,896 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 18:24:57,903 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 18:24:57,905 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 18:24:57,906 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 18:24:57,908 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix009_tso.oepc_false-unreach-call.i [2018-12-31 18:24:57,977 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25082221d/18ef02a0744b451eb7a07b37bb2e9022/FLAGb756ed55b [2018-12-31 18:24:58,576 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 18:24:58,577 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix009_tso.oepc_false-unreach-call.i [2018-12-31 18:24:58,601 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25082221d/18ef02a0744b451eb7a07b37bb2e9022/FLAGb756ed55b [2018-12-31 18:24:58,821 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25082221d/18ef02a0744b451eb7a07b37bb2e9022 [2018-12-31 18:24:58,825 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 18:24:58,827 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 18:24:58,829 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 18:24:58,829 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 18:24:58,834 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 18:24:58,835 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 06:24:58" (1/1) ... [2018-12-31 18:24:58,839 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70a3e582 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:24:58, skipping insertion in model container [2018-12-31 18:24:58,839 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 06:24:58" (1/1) ... [2018-12-31 18:24:58,848 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 18:24:58,912 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 18:24:59,485 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 18:24:59,511 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 18:24:59,674 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 18:24:59,765 INFO L195 MainTranslator]: Completed translation [2018-12-31 18:24:59,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:24:59 WrapperNode [2018-12-31 18:24:59,766 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 18:24:59,767 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 18:24:59,767 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 18:24:59,767 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 18:24:59,776 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:24:59" (1/1) ... [2018-12-31 18:24:59,799 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:24:59" (1/1) ... [2018-12-31 18:24:59,837 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 18:24:59,837 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 18:24:59,837 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 18:24:59,837 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 18:24:59,851 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:24:59" (1/1) ... [2018-12-31 18:24:59,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:24:59" (1/1) ... [2018-12-31 18:24:59,858 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:24:59" (1/1) ... [2018-12-31 18:24:59,858 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:24:59" (1/1) ... [2018-12-31 18:24:59,871 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:24:59" (1/1) ... [2018-12-31 18:24:59,876 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:24:59" (1/1) ... [2018-12-31 18:24:59,880 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:24:59" (1/1) ... [2018-12-31 18:24:59,886 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 18:24:59,886 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 18:24:59,886 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 18:24:59,887 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 18:24:59,888 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:24:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-31 18:24:59,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 18:24:59,993 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-31 18:24:59,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 18:24:59,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 18:24:59,994 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-31 18:24:59,994 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-31 18:24:59,995 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-31 18:24:59,995 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-31 18:24:59,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-31 18:24:59,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 18:24:59,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 18:24:59,999 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-31 18:25:01,353 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 18:25:01,354 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-31 18:25:01,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 06:25:01 BoogieIcfgContainer [2018-12-31 18:25:01,355 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 18:25:01,359 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 18:25:01,359 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 18:25:01,363 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 18:25:01,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 06:24:58" (1/3) ... [2018-12-31 18:25:01,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bdca1e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 06:25:01, skipping insertion in model container [2018-12-31 18:25:01,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:24:59" (2/3) ... [2018-12-31 18:25:01,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bdca1e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 06:25:01, skipping insertion in model container [2018-12-31 18:25:01,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 06:25:01" (3/3) ... [2018-12-31 18:25:01,368 INFO L112 eAbstractionObserver]: Analyzing ICFG mix009_tso.oepc_false-unreach-call.i [2018-12-31 18:25:01,418 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,419 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,419 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,420 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,420 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,420 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,420 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,421 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,425 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,425 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,425 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,425 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,426 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,426 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,426 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,426 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,436 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,436 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,436 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,436 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,436 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,438 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,439 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,441 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,441 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,441 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,441 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,441 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,442 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,442 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,442 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,442 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,442 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,443 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,443 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,443 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,443 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,444 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,445 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,445 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,445 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,445 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,446 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,446 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,446 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,446 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,446 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,447 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,447 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,447 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,447 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,447 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,448 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,448 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,448 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,448 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,448 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,449 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,450 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,450 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,450 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,450 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,450 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,451 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,451 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,452 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,452 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,453 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,453 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,453 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,454 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,454 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,454 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,454 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,454 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,455 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,455 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,455 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,455 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,455 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,456 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,456 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,456 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,456 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,456 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,458 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,458 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,459 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,459 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,461 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,464 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,464 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,464 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,464 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,464 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,466 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,466 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,466 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,466 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,466 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,467 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,467 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,467 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,467 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,467 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,468 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,468 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,468 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,468 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,468 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,470 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,470 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,470 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,470 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,470 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,471 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,471 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:25:01,492 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-31 18:25:01,493 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 18:25:01,502 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 18:25:01,528 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 18:25:01,557 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 18:25:01,558 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 18:25:01,558 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 18:25:01,558 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 18:25:01,558 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 18:25:01,559 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 18:25:01,559 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 18:25:01,559 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 18:25:01,559 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 18:25:01,578 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 145places, 183 transitions [2018-12-31 18:25:04,074 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34809 states. [2018-12-31 18:25:04,076 INFO L276 IsEmpty]: Start isEmpty. Operand 34809 states. [2018-12-31 18:25:04,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-31 18:25:04,084 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:25:04,085 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] [2018-12-31 18:25:04,088 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:25:04,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:25:04,094 INFO L82 PathProgramCache]: Analyzing trace with hash 787354290, now seen corresponding path program 1 times [2018-12-31 18:25:04,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:25:04,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:25:04,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:04,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:25:04,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:04,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:25:04,587 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-31 18:25:04,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:25:04,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:25:04,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:25:04,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:25:04,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:25:04,616 INFO L87 Difference]: Start difference. First operand 34809 states. Second operand 4 states. [2018-12-31 18:25:06,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:25:06,396 INFO L93 Difference]: Finished difference Result 60793 states and 234496 transitions. [2018-12-31 18:25:06,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 18:25:06,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-12-31 18:25:06,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:25:06,805 INFO L225 Difference]: With dead ends: 60793 [2018-12-31 18:25:06,805 INFO L226 Difference]: Without dead ends: 44273 [2018-12-31 18:25:06,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:25:07,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44273 states. [2018-12-31 18:25:08,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44273 to 27341. [2018-12-31 18:25:08,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27341 states. [2018-12-31 18:25:08,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27341 states to 27341 states and 105502 transitions. [2018-12-31 18:25:08,865 INFO L78 Accepts]: Start accepts. Automaton has 27341 states and 105502 transitions. Word has length 36 [2018-12-31 18:25:08,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:25:08,866 INFO L480 AbstractCegarLoop]: Abstraction has 27341 states and 105502 transitions. [2018-12-31 18:25:08,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:25:08,866 INFO L276 IsEmpty]: Start isEmpty. Operand 27341 states and 105502 transitions. [2018-12-31 18:25:08,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-31 18:25:08,878 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:25:08,878 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-31 18:25:08,878 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:25:08,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:25:08,880 INFO L82 PathProgramCache]: Analyzing trace with hash 901056929, now seen corresponding path program 1 times [2018-12-31 18:25:08,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:25:08,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:25:08,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:08,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:25:08,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:25:09,113 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-31 18:25:09,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:25:09,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:25:09,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:25:09,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:25:09,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:25:09,121 INFO L87 Difference]: Start difference. First operand 27341 states and 105502 transitions. Second operand 5 states. [2018-12-31 18:25:12,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:25:12,217 INFO L93 Difference]: Finished difference Result 64007 states and 235337 transitions. [2018-12-31 18:25:12,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 18:25:12,218 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-12-31 18:25:12,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:25:13,120 INFO L225 Difference]: With dead ends: 64007 [2018-12-31 18:25:13,120 INFO L226 Difference]: Without dead ends: 63455 [2018-12-31 18:25:13,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:25:13,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63455 states. [2018-12-31 18:25:14,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63455 to 41423. [2018-12-31 18:25:14,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41423 states. [2018-12-31 18:25:14,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41423 states to 41423 states and 152332 transitions. [2018-12-31 18:25:14,626 INFO L78 Accepts]: Start accepts. Automaton has 41423 states and 152332 transitions. Word has length 48 [2018-12-31 18:25:14,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:25:14,628 INFO L480 AbstractCegarLoop]: Abstraction has 41423 states and 152332 transitions. [2018-12-31 18:25:14,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:25:14,628 INFO L276 IsEmpty]: Start isEmpty. Operand 41423 states and 152332 transitions. [2018-12-31 18:25:14,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-31 18:25:14,637 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:25:14,637 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] [2018-12-31 18:25:14,637 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:25:14,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:25:14,639 INFO L82 PathProgramCache]: Analyzing trace with hash 2027995578, now seen corresponding path program 1 times [2018-12-31 18:25:14,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:25:14,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:25:14,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:14,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:25:14,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:14,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:25:14,811 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-31 18:25:14,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:25:14,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:25:14,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:25:14,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:25:14,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:25:14,814 INFO L87 Difference]: Start difference. First operand 41423 states and 152332 transitions. Second operand 6 states. [2018-12-31 18:25:16,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:25:16,356 INFO L93 Difference]: Finished difference Result 52773 states and 191027 transitions. [2018-12-31 18:25:16,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 18:25:16,357 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2018-12-31 18:25:16,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:25:16,694 INFO L225 Difference]: With dead ends: 52773 [2018-12-31 18:25:16,695 INFO L226 Difference]: Without dead ends: 52261 [2018-12-31 18:25:16,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-31 18:25:16,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52261 states. [2018-12-31 18:25:17,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52261 to 45377. [2018-12-31 18:25:17,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45377 states. [2018-12-31 18:25:18,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45377 states to 45377 states and 166020 transitions. [2018-12-31 18:25:18,868 INFO L78 Accepts]: Start accepts. Automaton has 45377 states and 166020 transitions. Word has length 49 [2018-12-31 18:25:18,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:25:18,868 INFO L480 AbstractCegarLoop]: Abstraction has 45377 states and 166020 transitions. [2018-12-31 18:25:18,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:25:18,869 INFO L276 IsEmpty]: Start isEmpty. Operand 45377 states and 166020 transitions. [2018-12-31 18:25:18,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-31 18:25:18,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:25:18,878 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] [2018-12-31 18:25:18,878 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:25:18,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:25:18,878 INFO L82 PathProgramCache]: Analyzing trace with hash -39217920, now seen corresponding path program 1 times [2018-12-31 18:25:18,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:25:18,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:25:18,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:18,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:25:18,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:25:18,981 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-31 18:25:18,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:25:18,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 18:25:18,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 18:25:18,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 18:25:18,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:25:18,982 INFO L87 Difference]: Start difference. First operand 45377 states and 166020 transitions. Second operand 3 states. [2018-12-31 18:25:19,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:25:19,325 INFO L93 Difference]: Finished difference Result 65253 states and 235816 transitions. [2018-12-31 18:25:19,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 18:25:19,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-12-31 18:25:19,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:25:19,479 INFO L225 Difference]: With dead ends: 65253 [2018-12-31 18:25:19,480 INFO L226 Difference]: Without dead ends: 65253 [2018-12-31 18:25:19,480 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-31 18:25:19,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65253 states. [2018-12-31 18:25:20,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65253 to 50947. [2018-12-31 18:25:20,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50947 states. [2018-12-31 18:25:20,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50947 states to 50947 states and 184327 transitions. [2018-12-31 18:25:20,626 INFO L78 Accepts]: Start accepts. Automaton has 50947 states and 184327 transitions. Word has length 51 [2018-12-31 18:25:20,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:25:20,626 INFO L480 AbstractCegarLoop]: Abstraction has 50947 states and 184327 transitions. [2018-12-31 18:25:20,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 18:25:20,626 INFO L276 IsEmpty]: Start isEmpty. Operand 50947 states and 184327 transitions. [2018-12-31 18:25:20,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-31 18:25:20,646 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:25:20,646 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] [2018-12-31 18:25:20,646 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:25:20,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:25:20,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1723497845, now seen corresponding path program 1 times [2018-12-31 18:25:20,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:25:20,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:25:20,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:20,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:25:20,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:25:20,895 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-31 18:25:20,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:25:20,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:25:20,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:25:20,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:25:20,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:25:20,896 INFO L87 Difference]: Start difference. First operand 50947 states and 184327 transitions. Second operand 7 states. [2018-12-31 18:25:24,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:25:24,121 INFO L93 Difference]: Finished difference Result 83876 states and 290140 transitions. [2018-12-31 18:25:24,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 18:25:24,121 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2018-12-31 18:25:24,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:25:24,390 INFO L225 Difference]: With dead ends: 83876 [2018-12-31 18:25:24,390 INFO L226 Difference]: Without dead ends: 83876 [2018-12-31 18:25:24,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-31 18:25:24,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83876 states. [2018-12-31 18:25:25,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83876 to 66523. [2018-12-31 18:25:25,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66523 states. [2018-12-31 18:25:25,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66523 states to 66523 states and 234927 transitions. [2018-12-31 18:25:25,878 INFO L78 Accepts]: Start accepts. Automaton has 66523 states and 234927 transitions. Word has length 55 [2018-12-31 18:25:25,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:25:25,878 INFO L480 AbstractCegarLoop]: Abstraction has 66523 states and 234927 transitions. [2018-12-31 18:25:25,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:25:25,878 INFO L276 IsEmpty]: Start isEmpty. Operand 66523 states and 234927 transitions. [2018-12-31 18:25:25,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-31 18:25:25,900 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:25:25,900 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] [2018-12-31 18:25:25,900 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:25:25,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:25:25,901 INFO L82 PathProgramCache]: Analyzing trace with hash -835994164, now seen corresponding path program 1 times [2018-12-31 18:25:25,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:25:25,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:25:25,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:25,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:25:25,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:25:25,992 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-31 18:25:25,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:25:25,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:25:25,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:25:25,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:25:25,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:25:25,993 INFO L87 Difference]: Start difference. First operand 66523 states and 234927 transitions. Second operand 4 states. [2018-12-31 18:25:28,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:25:28,799 INFO L93 Difference]: Finished difference Result 14673 states and 46636 transitions. [2018-12-31 18:25:28,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 18:25:28,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-12-31 18:25:28,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:25:28,824 INFO L225 Difference]: With dead ends: 14673 [2018-12-31 18:25:28,824 INFO L226 Difference]: Without dead ends: 13087 [2018-12-31 18:25:28,824 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-31 18:25:28,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13087 states. [2018-12-31 18:25:29,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13087 to 13038. [2018-12-31 18:25:29,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13038 states. [2018-12-31 18:25:29,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13038 states to 13038 states and 41162 transitions. [2018-12-31 18:25:29,072 INFO L78 Accepts]: Start accepts. Automaton has 13038 states and 41162 transitions. Word has length 55 [2018-12-31 18:25:29,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:25:29,072 INFO L480 AbstractCegarLoop]: Abstraction has 13038 states and 41162 transitions. [2018-12-31 18:25:29,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:25:29,072 INFO L276 IsEmpty]: Start isEmpty. Operand 13038 states and 41162 transitions. [2018-12-31 18:25:29,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-31 18:25:29,074 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:25:29,074 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] [2018-12-31 18:25:29,076 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:25:29,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:25:29,076 INFO L82 PathProgramCache]: Analyzing trace with hash -557670517, now seen corresponding path program 1 times [2018-12-31 18:25:29,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:25:29,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:25:29,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:29,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:25:29,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:29,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:25:29,273 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-31 18:25:29,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:25:29,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:25:29,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:25:29,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:25:29,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:25:29,274 INFO L87 Difference]: Start difference. First operand 13038 states and 41162 transitions. Second operand 6 states. [2018-12-31 18:25:29,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:25:29,820 INFO L93 Difference]: Finished difference Result 19060 states and 59763 transitions. [2018-12-31 18:25:29,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 18:25:29,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-12-31 18:25:29,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:25:29,856 INFO L225 Difference]: With dead ends: 19060 [2018-12-31 18:25:29,856 INFO L226 Difference]: Without dead ends: 18988 [2018-12-31 18:25:29,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-31 18:25:29,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18988 states. [2018-12-31 18:25:30,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18988 to 13596. [2018-12-31 18:25:30,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13596 states. [2018-12-31 18:25:30,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13596 states to 13596 states and 42815 transitions. [2018-12-31 18:25:30,092 INFO L78 Accepts]: Start accepts. Automaton has 13596 states and 42815 transitions. Word has length 55 [2018-12-31 18:25:30,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:25:30,093 INFO L480 AbstractCegarLoop]: Abstraction has 13596 states and 42815 transitions. [2018-12-31 18:25:30,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:25:30,093 INFO L276 IsEmpty]: Start isEmpty. Operand 13596 states and 42815 transitions. [2018-12-31 18:25:30,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-31 18:25:30,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:25:30,097 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-31 18:25:30,098 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:25:30,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:25:30,098 INFO L82 PathProgramCache]: Analyzing trace with hash -3940633, now seen corresponding path program 1 times [2018-12-31 18:25:30,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:25:30,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:25:30,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:30,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:25:30,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:25:30,178 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-31 18:25:30,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:25:30,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:25:30,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:25:30,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:25:30,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:25:30,179 INFO L87 Difference]: Start difference. First operand 13596 states and 42815 transitions. Second operand 4 states. [2018-12-31 18:25:30,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:25:30,349 INFO L93 Difference]: Finished difference Result 15779 states and 49765 transitions. [2018-12-31 18:25:30,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 18:25:30,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-31 18:25:30,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:25:30,380 INFO L225 Difference]: With dead ends: 15779 [2018-12-31 18:25:30,380 INFO L226 Difference]: Without dead ends: 15779 [2018-12-31 18:25:30,381 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-31 18:25:30,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15779 states. [2018-12-31 18:25:30,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15779 to 14376. [2018-12-31 18:25:30,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14376 states. [2018-12-31 18:25:30,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14376 states to 14376 states and 45279 transitions. [2018-12-31 18:25:30,603 INFO L78 Accepts]: Start accepts. Automaton has 14376 states and 45279 transitions. Word has length 63 [2018-12-31 18:25:30,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:25:30,604 INFO L480 AbstractCegarLoop]: Abstraction has 14376 states and 45279 transitions. [2018-12-31 18:25:30,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:25:30,604 INFO L276 IsEmpty]: Start isEmpty. Operand 14376 states and 45279 transitions. [2018-12-31 18:25:30,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-31 18:25:30,609 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:25:30,609 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-31 18:25:30,609 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:25:30,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:25:30,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1738869702, now seen corresponding path program 1 times [2018-12-31 18:25:30,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:25:30,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:25:30,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:30,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:25:30,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:25:31,108 WARN L181 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 7 [2018-12-31 18:25:31,168 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-31 18:25:31,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:25:31,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 18:25:31,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 18:25:31,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 18:25:31,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:25:31,169 INFO L87 Difference]: Start difference. First operand 14376 states and 45279 transitions. Second operand 8 states. [2018-12-31 18:25:32,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:25:32,379 INFO L93 Difference]: Finished difference Result 19042 states and 58902 transitions. [2018-12-31 18:25:32,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 18:25:32,380 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2018-12-31 18:25:32,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:25:32,418 INFO L225 Difference]: With dead ends: 19042 [2018-12-31 18:25:32,418 INFO L226 Difference]: Without dead ends: 18971 [2018-12-31 18:25:32,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-12-31 18:25:32,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18971 states. [2018-12-31 18:25:32,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18971 to 16646. [2018-12-31 18:25:32,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16646 states. [2018-12-31 18:25:32,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16646 states to 16646 states and 51931 transitions. [2018-12-31 18:25:32,706 INFO L78 Accepts]: Start accepts. Automaton has 16646 states and 51931 transitions. Word has length 63 [2018-12-31 18:25:32,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:25:32,707 INFO L480 AbstractCegarLoop]: Abstraction has 16646 states and 51931 transitions. [2018-12-31 18:25:32,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 18:25:32,707 INFO L276 IsEmpty]: Start isEmpty. Operand 16646 states and 51931 transitions. [2018-12-31 18:25:32,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 18:25:32,715 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:25:32,715 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] [2018-12-31 18:25:32,716 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:25:32,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:25:32,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1725745967, now seen corresponding path program 1 times [2018-12-31 18:25:32,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:25:32,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:25:32,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:32,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:25:32,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:25:32,971 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-31 18:25:32,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:25:32,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:25:32,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:25:32,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:25:32,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:25:32,974 INFO L87 Difference]: Start difference. First operand 16646 states and 51931 transitions. Second operand 4 states. [2018-12-31 18:25:33,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:25:33,418 INFO L93 Difference]: Finished difference Result 20582 states and 63398 transitions. [2018-12-31 18:25:33,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 18:25:33,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-31 18:25:33,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:25:33,463 INFO L225 Difference]: With dead ends: 20582 [2018-12-31 18:25:33,464 INFO L226 Difference]: Without dead ends: 20582 [2018-12-31 18:25:33,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:25:33,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20582 states. [2018-12-31 18:25:33,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20582 to 18532. [2018-12-31 18:25:33,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18532 states. [2018-12-31 18:25:33,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18532 states to 18532 states and 57288 transitions. [2018-12-31 18:25:33,756 INFO L78 Accepts]: Start accepts. Automaton has 18532 states and 57288 transitions. Word has length 67 [2018-12-31 18:25:33,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:25:33,756 INFO L480 AbstractCegarLoop]: Abstraction has 18532 states and 57288 transitions. [2018-12-31 18:25:33,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:25:33,757 INFO L276 IsEmpty]: Start isEmpty. Operand 18532 states and 57288 transitions. [2018-12-31 18:25:33,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 18:25:33,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:25:33,766 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] [2018-12-31 18:25:33,766 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:25:33,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:25:33,766 INFO L82 PathProgramCache]: Analyzing trace with hash 492011986, now seen corresponding path program 1 times [2018-12-31 18:25:33,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:25:33,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:25:33,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:33,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:25:33,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:25:33,885 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-31 18:25:33,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:25:33,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 18:25:33,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 18:25:33,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 18:25:33,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:25:33,886 INFO L87 Difference]: Start difference. First operand 18532 states and 57288 transitions. Second operand 3 states. [2018-12-31 18:25:34,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:25:34,438 INFO L93 Difference]: Finished difference Result 19140 states and 58939 transitions. [2018-12-31 18:25:34,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 18:25:34,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-31 18:25:34,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:25:34,470 INFO L225 Difference]: With dead ends: 19140 [2018-12-31 18:25:34,470 INFO L226 Difference]: Without dead ends: 19140 [2018-12-31 18:25:34,470 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-31 18:25:34,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19140 states. [2018-12-31 18:25:34,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19140 to 18856. [2018-12-31 18:25:34,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18856 states. [2018-12-31 18:25:34,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18856 states to 18856 states and 58160 transitions. [2018-12-31 18:25:34,740 INFO L78 Accepts]: Start accepts. Automaton has 18856 states and 58160 transitions. Word has length 67 [2018-12-31 18:25:34,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:25:34,740 INFO L480 AbstractCegarLoop]: Abstraction has 18856 states and 58160 transitions. [2018-12-31 18:25:34,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 18:25:34,741 INFO L276 IsEmpty]: Start isEmpty. Operand 18856 states and 58160 transitions. [2018-12-31 18:25:34,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-31 18:25:34,752 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:25:34,752 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] [2018-12-31 18:25:34,752 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:25:34,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:25:34,753 INFO L82 PathProgramCache]: Analyzing trace with hash 2096525335, now seen corresponding path program 1 times [2018-12-31 18:25:34,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:25:34,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:25:34,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:34,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:25:34,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:25:34,891 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-31 18:25:34,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:25:34,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 18:25:34,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 18:25:34,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 18:25:34,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:25:34,893 INFO L87 Difference]: Start difference. First operand 18856 states and 58160 transitions. Second operand 3 states. [2018-12-31 18:25:35,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:25:35,624 INFO L93 Difference]: Finished difference Result 24076 states and 74215 transitions. [2018-12-31 18:25:35,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 18:25:35,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-12-31 18:25:35,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:25:35,670 INFO L225 Difference]: With dead ends: 24076 [2018-12-31 18:25:35,670 INFO L226 Difference]: Without dead ends: 24076 [2018-12-31 18:25:35,670 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-31 18:25:35,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24076 states. [2018-12-31 18:25:36,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24076 to 23284. [2018-12-31 18:25:36,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23284 states. [2018-12-31 18:25:36,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23284 states to 23284 states and 71849 transitions. [2018-12-31 18:25:36,199 INFO L78 Accepts]: Start accepts. Automaton has 23284 states and 71849 transitions. Word has length 69 [2018-12-31 18:25:36,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:25:36,199 INFO L480 AbstractCegarLoop]: Abstraction has 23284 states and 71849 transitions. [2018-12-31 18:25:36,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 18:25:36,200 INFO L276 IsEmpty]: Start isEmpty. Operand 23284 states and 71849 transitions. [2018-12-31 18:25:36,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-31 18:25:36,212 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:25:36,212 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] [2018-12-31 18:25:36,213 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:25:36,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:25:36,213 INFO L82 PathProgramCache]: Analyzing trace with hash -401490602, now seen corresponding path program 1 times [2018-12-31 18:25:36,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:25:36,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:25:36,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:36,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:25:36,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:36,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:25:36,366 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-31 18:25:36,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:25:36,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:25:36,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:25:36,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:25:36,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:25:36,367 INFO L87 Difference]: Start difference. First operand 23284 states and 71849 transitions. Second operand 6 states. [2018-12-31 18:25:37,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:25:37,584 INFO L93 Difference]: Finished difference Result 27964 states and 85091 transitions. [2018-12-31 18:25:37,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 18:25:37,585 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-12-31 18:25:37,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:25:37,633 INFO L225 Difference]: With dead ends: 27964 [2018-12-31 18:25:37,634 INFO L226 Difference]: Without dead ends: 27964 [2018-12-31 18:25:37,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:25:37,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27964 states. [2018-12-31 18:25:38,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27964 to 26476. [2018-12-31 18:25:38,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26476 states. [2018-12-31 18:25:38,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26476 states to 26476 states and 81094 transitions. [2018-12-31 18:25:38,072 INFO L78 Accepts]: Start accepts. Automaton has 26476 states and 81094 transitions. Word has length 69 [2018-12-31 18:25:38,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:25:38,072 INFO L480 AbstractCegarLoop]: Abstraction has 26476 states and 81094 transitions. [2018-12-31 18:25:38,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:25:38,072 INFO L276 IsEmpty]: Start isEmpty. Operand 26476 states and 81094 transitions. [2018-12-31 18:25:38,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-31 18:25:38,087 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:25:38,087 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] [2018-12-31 18:25:38,087 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:25:38,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:25:38,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1816267351, now seen corresponding path program 1 times [2018-12-31 18:25:38,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:25:38,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:25:38,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:38,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:25:38,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:38,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:25:38,261 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-31 18:25:38,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:25:38,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:25:38,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:25:38,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:25:38,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:25:38,263 INFO L87 Difference]: Start difference. First operand 26476 states and 81094 transitions. Second operand 6 states. [2018-12-31 18:25:39,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:25:39,062 INFO L93 Difference]: Finished difference Result 30144 states and 89716 transitions. [2018-12-31 18:25:39,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 18:25:39,063 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-12-31 18:25:39,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:25:39,123 INFO L225 Difference]: With dead ends: 30144 [2018-12-31 18:25:39,124 INFO L226 Difference]: Without dead ends: 30144 [2018-12-31 18:25:39,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-31 18:25:39,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30144 states. [2018-12-31 18:25:39,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30144 to 26872. [2018-12-31 18:25:39,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26872 states. [2018-12-31 18:25:39,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26872 states to 26872 states and 81197 transitions. [2018-12-31 18:25:39,607 INFO L78 Accepts]: Start accepts. Automaton has 26872 states and 81197 transitions. Word has length 69 [2018-12-31 18:25:39,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:25:39,607 INFO L480 AbstractCegarLoop]: Abstraction has 26872 states and 81197 transitions. [2018-12-31 18:25:39,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:25:39,607 INFO L276 IsEmpty]: Start isEmpty. Operand 26872 states and 81197 transitions. [2018-12-31 18:25:39,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-31 18:25:39,623 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:25:39,623 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] [2018-12-31 18:25:39,624 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:25:39,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:25:39,624 INFO L82 PathProgramCache]: Analyzing trace with hash 2027618264, now seen corresponding path program 1 times [2018-12-31 18:25:39,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:25:39,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:25:39,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:39,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:25:39,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:39,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:25:39,932 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-31 18:25:39,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:25:39,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:25:39,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:25:39,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:25:39,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:25:39,933 INFO L87 Difference]: Start difference. First operand 26872 states and 81197 transitions. Second operand 5 states. [2018-12-31 18:25:40,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:25:40,429 INFO L93 Difference]: Finished difference Result 32055 states and 96368 transitions. [2018-12-31 18:25:40,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 18:25:40,430 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-12-31 18:25:40,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:25:40,491 INFO L225 Difference]: With dead ends: 32055 [2018-12-31 18:25:40,491 INFO L226 Difference]: Without dead ends: 32055 [2018-12-31 18:25:40,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:25:40,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32055 states. [2018-12-31 18:25:40,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32055 to 29288. [2018-12-31 18:25:40,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29288 states. [2018-12-31 18:25:40,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29288 states to 29288 states and 87955 transitions. [2018-12-31 18:25:40,966 INFO L78 Accepts]: Start accepts. Automaton has 29288 states and 87955 transitions. Word has length 69 [2018-12-31 18:25:40,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:25:40,966 INFO L480 AbstractCegarLoop]: Abstraction has 29288 states and 87955 transitions. [2018-12-31 18:25:40,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:25:40,967 INFO L276 IsEmpty]: Start isEmpty. Operand 29288 states and 87955 transitions. [2018-12-31 18:25:40,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-31 18:25:40,981 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:25:40,981 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] [2018-12-31 18:25:40,981 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:25:40,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:25:40,981 INFO L82 PathProgramCache]: Analyzing trace with hash -279867272, now seen corresponding path program 1 times [2018-12-31 18:25:40,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:25:40,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:25:40,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:40,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:25:40,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:25:41,094 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-31 18:25:41,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:25:41,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 18:25:41,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 18:25:41,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 18:25:41,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:25:41,099 INFO L87 Difference]: Start difference. First operand 29288 states and 87955 transitions. Second operand 3 states. [2018-12-31 18:25:41,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:25:41,485 INFO L93 Difference]: Finished difference Result 41748 states and 124592 transitions. [2018-12-31 18:25:41,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 18:25:41,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-12-31 18:25:41,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:25:41,555 INFO L225 Difference]: With dead ends: 41748 [2018-12-31 18:25:41,555 INFO L226 Difference]: Without dead ends: 41748 [2018-12-31 18:25:41,556 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-31 18:25:41,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41748 states. [2018-12-31 18:25:42,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41748 to 31196. [2018-12-31 18:25:42,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31196 states. [2018-12-31 18:25:42,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31196 states to 31196 states and 94070 transitions. [2018-12-31 18:25:42,338 INFO L78 Accepts]: Start accepts. Automaton has 31196 states and 94070 transitions. Word has length 69 [2018-12-31 18:25:42,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:25:42,339 INFO L480 AbstractCegarLoop]: Abstraction has 31196 states and 94070 transitions. [2018-12-31 18:25:42,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 18:25:42,339 INFO L276 IsEmpty]: Start isEmpty. Operand 31196 states and 94070 transitions. [2018-12-31 18:25:42,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-31 18:25:42,350 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:25:42,350 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] [2018-12-31 18:25:42,350 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:25:42,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:25:42,351 INFO L82 PathProgramCache]: Analyzing trace with hash -2087321735, now seen corresponding path program 1 times [2018-12-31 18:25:42,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:25:42,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:25:42,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:42,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:25:42,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:42,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:25:42,582 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-31 18:25:42,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:25:42,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:25:42,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:25:42,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:25:42,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:25:42,583 INFO L87 Difference]: Start difference. First operand 31196 states and 94070 transitions. Second operand 5 states. [2018-12-31 18:25:42,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:25:42,791 INFO L93 Difference]: Finished difference Result 7936 states and 19189 transitions. [2018-12-31 18:25:42,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 18:25:42,792 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-12-31 18:25:42,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:25:42,801 INFO L225 Difference]: With dead ends: 7936 [2018-12-31 18:25:42,801 INFO L226 Difference]: Without dead ends: 6454 [2018-12-31 18:25:42,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:25:42,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6454 states. [2018-12-31 18:25:42,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6454 to 5802. [2018-12-31 18:25:42,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5802 states. [2018-12-31 18:25:42,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5802 states to 5802 states and 13607 transitions. [2018-12-31 18:25:42,869 INFO L78 Accepts]: Start accepts. Automaton has 5802 states and 13607 transitions. Word has length 69 [2018-12-31 18:25:42,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:25:42,870 INFO L480 AbstractCegarLoop]: Abstraction has 5802 states and 13607 transitions. [2018-12-31 18:25:42,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:25:42,870 INFO L276 IsEmpty]: Start isEmpty. Operand 5802 states and 13607 transitions. [2018-12-31 18:25:42,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-31 18:25:42,875 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:25:42,875 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] [2018-12-31 18:25:42,875 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:25:42,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:25:42,876 INFO L82 PathProgramCache]: Analyzing trace with hash 916580311, now seen corresponding path program 1 times [2018-12-31 18:25:42,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:25:42,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:25:42,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:42,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:25:42,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:42,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:25:42,953 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-31 18:25:42,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:25:42,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 18:25:42,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 18:25:42,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 18:25:42,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:25:42,954 INFO L87 Difference]: Start difference. First operand 5802 states and 13607 transitions. Second operand 3 states. [2018-12-31 18:25:43,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:25:43,197 INFO L93 Difference]: Finished difference Result 7700 states and 17933 transitions. [2018-12-31 18:25:43,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 18:25:43,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-12-31 18:25:43,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:25:43,212 INFO L225 Difference]: With dead ends: 7700 [2018-12-31 18:25:43,212 INFO L226 Difference]: Without dead ends: 7700 [2018-12-31 18:25:43,212 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-31 18:25:43,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7700 states. [2018-12-31 18:25:43,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7700 to 5741. [2018-12-31 18:25:43,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5741 states. [2018-12-31 18:25:43,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5741 states to 5741 states and 13147 transitions. [2018-12-31 18:25:43,319 INFO L78 Accepts]: Start accepts. Automaton has 5741 states and 13147 transitions. Word has length 69 [2018-12-31 18:25:43,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:25:43,320 INFO L480 AbstractCegarLoop]: Abstraction has 5741 states and 13147 transitions. [2018-12-31 18:25:43,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 18:25:43,320 INFO L276 IsEmpty]: Start isEmpty. Operand 5741 states and 13147 transitions. [2018-12-31 18:25:43,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-31 18:25:43,330 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:25:43,330 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] [2018-12-31 18:25:43,331 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:25:43,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:25:43,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1596601910, now seen corresponding path program 1 times [2018-12-31 18:25:43,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:25:43,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:25:43,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:43,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:25:43,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:43,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:25:43,708 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-31 18:25:43,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:25:43,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:25:43,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:25:43,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:25:43,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:25:43,711 INFO L87 Difference]: Start difference. First operand 5741 states and 13147 transitions. Second operand 5 states. [2018-12-31 18:25:45,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:25:45,184 INFO L93 Difference]: Finished difference Result 6905 states and 15771 transitions. [2018-12-31 18:25:45,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 18:25:45,185 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2018-12-31 18:25:45,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:25:45,195 INFO L225 Difference]: With dead ends: 6905 [2018-12-31 18:25:45,195 INFO L226 Difference]: Without dead ends: 6905 [2018-12-31 18:25:45,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 18:25:45,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6905 states. [2018-12-31 18:25:45,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6905 to 6185. [2018-12-31 18:25:45,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6185 states. [2018-12-31 18:25:45,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6185 states to 6185 states and 14151 transitions. [2018-12-31 18:25:45,275 INFO L78 Accepts]: Start accepts. Automaton has 6185 states and 14151 transitions. Word has length 75 [2018-12-31 18:25:45,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:25:45,275 INFO L480 AbstractCegarLoop]: Abstraction has 6185 states and 14151 transitions. [2018-12-31 18:25:45,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:25:45,276 INFO L276 IsEmpty]: Start isEmpty. Operand 6185 states and 14151 transitions. [2018-12-31 18:25:45,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-31 18:25:45,282 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:25:45,282 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] [2018-12-31 18:25:45,283 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:25:45,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:25:45,283 INFO L82 PathProgramCache]: Analyzing trace with hash 146208425, now seen corresponding path program 1 times [2018-12-31 18:25:45,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:25:45,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:25:45,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:45,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:25:45,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:45,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:25:45,464 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-31 18:25:45,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:25:45,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:25:45,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:25:45,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:25:45,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:25:45,466 INFO L87 Difference]: Start difference. First operand 6185 states and 14151 transitions. Second operand 7 states. [2018-12-31 18:25:45,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:25:45,975 INFO L93 Difference]: Finished difference Result 7563 states and 17122 transitions. [2018-12-31 18:25:45,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 18:25:45,976 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2018-12-31 18:25:45,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:25:45,986 INFO L225 Difference]: With dead ends: 7563 [2018-12-31 18:25:45,987 INFO L226 Difference]: Without dead ends: 7444 [2018-12-31 18:25:45,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-31 18:25:45,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7444 states. [2018-12-31 18:25:46,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7444 to 6282. [2018-12-31 18:25:46,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6282 states. [2018-12-31 18:25:46,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6282 states to 6282 states and 14244 transitions. [2018-12-31 18:25:46,070 INFO L78 Accepts]: Start accepts. Automaton has 6282 states and 14244 transitions. Word has length 75 [2018-12-31 18:25:46,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:25:46,070 INFO L480 AbstractCegarLoop]: Abstraction has 6282 states and 14244 transitions. [2018-12-31 18:25:46,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:25:46,070 INFO L276 IsEmpty]: Start isEmpty. Operand 6282 states and 14244 transitions. [2018-12-31 18:25:46,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 18:25:46,077 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:25:46,078 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] [2018-12-31 18:25:46,078 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:25:46,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:25:46,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1874738626, now seen corresponding path program 1 times [2018-12-31 18:25:46,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:25:46,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:25:46,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:46,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:25:46,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:46,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:25:46,231 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-31 18:25:46,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:25:46,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:25:46,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:25:46,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:25:46,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:25:46,232 INFO L87 Difference]: Start difference. First operand 6282 states and 14244 transitions. Second operand 4 states. [2018-12-31 18:25:46,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:25:46,561 INFO L93 Difference]: Finished difference Result 10017 states and 22619 transitions. [2018-12-31 18:25:46,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 18:25:46,562 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-31 18:25:46,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:25:46,575 INFO L225 Difference]: With dead ends: 10017 [2018-12-31 18:25:46,576 INFO L226 Difference]: Without dead ends: 10017 [2018-12-31 18:25:46,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:25:46,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10017 states. [2018-12-31 18:25:46,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10017 to 7402. [2018-12-31 18:25:46,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7402 states. [2018-12-31 18:25:46,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7402 states to 7402 states and 16578 transitions. [2018-12-31 18:25:46,684 INFO L78 Accepts]: Start accepts. Automaton has 7402 states and 16578 transitions. Word has length 94 [2018-12-31 18:25:46,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:25:46,684 INFO L480 AbstractCegarLoop]: Abstraction has 7402 states and 16578 transitions. [2018-12-31 18:25:46,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:25:46,685 INFO L276 IsEmpty]: Start isEmpty. Operand 7402 states and 16578 transitions. [2018-12-31 18:25:46,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 18:25:46,696 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:25:46,696 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] [2018-12-31 18:25:46,696 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:25:46,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:25:46,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1947207202, now seen corresponding path program 2 times [2018-12-31 18:25:46,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:25:46,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:25:46,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:46,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:25:46,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:25:46,899 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-31 18:25:46,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:25:46,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:25:46,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:25:46,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:25:46,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:25:46,901 INFO L87 Difference]: Start difference. First operand 7402 states and 16578 transitions. Second operand 4 states. [2018-12-31 18:25:48,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:25:48,957 INFO L93 Difference]: Finished difference Result 10390 states and 22984 transitions. [2018-12-31 18:25:48,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 18:25:48,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-31 18:25:48,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:25:48,977 INFO L225 Difference]: With dead ends: 10390 [2018-12-31 18:25:48,977 INFO L226 Difference]: Without dead ends: 10390 [2018-12-31 18:25:48,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:25:49,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10390 states. [2018-12-31 18:25:49,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10390 to 8515. [2018-12-31 18:25:49,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8515 states. [2018-12-31 18:25:49,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8515 states to 8515 states and 19095 transitions. [2018-12-31 18:25:49,138 INFO L78 Accepts]: Start accepts. Automaton has 8515 states and 19095 transitions. Word has length 94 [2018-12-31 18:25:49,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:25:49,138 INFO L480 AbstractCegarLoop]: Abstraction has 8515 states and 19095 transitions. [2018-12-31 18:25:49,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:25:49,139 INFO L276 IsEmpty]: Start isEmpty. Operand 8515 states and 19095 transitions. [2018-12-31 18:25:49,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 18:25:49,155 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:25:49,155 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] [2018-12-31 18:25:49,156 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:25:49,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:25:49,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1945663173, now seen corresponding path program 1 times [2018-12-31 18:25:49,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:25:49,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:25:49,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:49,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 18:25:49,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:49,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:25:49,391 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-31 18:25:49,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:25:49,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:25:49,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:25:49,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:25:49,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:25:49,393 INFO L87 Difference]: Start difference. First operand 8515 states and 19095 transitions. Second operand 4 states. [2018-12-31 18:25:50,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:25:50,250 INFO L93 Difference]: Finished difference Result 8204 states and 18457 transitions. [2018-12-31 18:25:50,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 18:25:50,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-31 18:25:50,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:25:50,262 INFO L225 Difference]: With dead ends: 8204 [2018-12-31 18:25:50,262 INFO L226 Difference]: Without dead ends: 8204 [2018-12-31 18:25:50,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:25:50,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8204 states. [2018-12-31 18:25:50,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8204 to 7608. [2018-12-31 18:25:50,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7608 states. [2018-12-31 18:25:50,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7608 states to 7608 states and 17194 transitions. [2018-12-31 18:25:50,362 INFO L78 Accepts]: Start accepts. Automaton has 7608 states and 17194 transitions. Word has length 94 [2018-12-31 18:25:50,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:25:50,363 INFO L480 AbstractCegarLoop]: Abstraction has 7608 states and 17194 transitions. [2018-12-31 18:25:50,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:25:50,363 INFO L276 IsEmpty]: Start isEmpty. Operand 7608 states and 17194 transitions. [2018-12-31 18:25:50,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:25:50,373 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:25:50,373 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:25:50,373 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:25:50,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:25:50,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1777281593, now seen corresponding path program 1 times [2018-12-31 18:25:50,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:25:50,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:25:50,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:50,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:25:50,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:25:50,855 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-31 18:25:50,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:25:50,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:25:50,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:25:50,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:25:50,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:25:50,857 INFO L87 Difference]: Start difference. First operand 7608 states and 17194 transitions. Second operand 7 states. [2018-12-31 18:25:51,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:25:51,639 INFO L93 Difference]: Finished difference Result 9491 states and 21419 transitions. [2018-12-31 18:25:51,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 18:25:51,640 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-31 18:25:51,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:25:51,653 INFO L225 Difference]: With dead ends: 9491 [2018-12-31 18:25:51,653 INFO L226 Difference]: Without dead ends: 9491 [2018-12-31 18:25:51,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:25:51,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9491 states. [2018-12-31 18:25:51,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9491 to 7697. [2018-12-31 18:25:51,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7697 states. [2018-12-31 18:25:51,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7697 states to 7697 states and 17465 transitions. [2018-12-31 18:25:51,759 INFO L78 Accepts]: Start accepts. Automaton has 7697 states and 17465 transitions. Word has length 96 [2018-12-31 18:25:51,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:25:51,759 INFO L480 AbstractCegarLoop]: Abstraction has 7697 states and 17465 transitions. [2018-12-31 18:25:51,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:25:51,759 INFO L276 IsEmpty]: Start isEmpty. Operand 7697 states and 17465 transitions. [2018-12-31 18:25:51,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:25:51,769 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:25:51,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, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 18:25:51,769 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:25:51,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:25:51,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1611485258, now seen corresponding path program 1 times [2018-12-31 18:25:51,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:25:51,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:25:51,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:51,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:25:51,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:25:52,099 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-31 18:25:52,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:25:52,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:25:52,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:25:52,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:25:52,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:25:52,100 INFO L87 Difference]: Start difference. First operand 7697 states and 17465 transitions. Second operand 5 states. [2018-12-31 18:25:52,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:25:52,302 INFO L93 Difference]: Finished difference Result 8560 states and 19324 transitions. [2018-12-31 18:25:52,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 18:25:52,303 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-31 18:25:52,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:25:52,315 INFO L225 Difference]: With dead ends: 8560 [2018-12-31 18:25:52,315 INFO L226 Difference]: Without dead ends: 8560 [2018-12-31 18:25:52,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:25:52,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8560 states. [2018-12-31 18:25:52,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8560 to 6593. [2018-12-31 18:25:52,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6593 states. [2018-12-31 18:25:52,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6593 states to 6593 states and 14984 transitions. [2018-12-31 18:25:52,410 INFO L78 Accepts]: Start accepts. Automaton has 6593 states and 14984 transitions. Word has length 96 [2018-12-31 18:25:52,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:25:52,410 INFO L480 AbstractCegarLoop]: Abstraction has 6593 states and 14984 transitions. [2018-12-31 18:25:52,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:25:52,410 INFO L276 IsEmpty]: Start isEmpty. Operand 6593 states and 14984 transitions. [2018-12-31 18:25:52,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:25:52,419 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:25:52,419 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:25:52,419 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:25:52,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:25:52,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1356748713, now seen corresponding path program 1 times [2018-12-31 18:25:52,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:25:52,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:25:52,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:52,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:25:52,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:25:52,555 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-31 18:25:52,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:25:52,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:25:52,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:25:52,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:25:52,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:25:52,556 INFO L87 Difference]: Start difference. First operand 6593 states and 14984 transitions. Second operand 5 states. [2018-12-31 18:25:53,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:25:53,119 INFO L93 Difference]: Finished difference Result 10094 states and 22980 transitions. [2018-12-31 18:25:53,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 18:25:53,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-31 18:25:53,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:25:53,133 INFO L225 Difference]: With dead ends: 10094 [2018-12-31 18:25:53,133 INFO L226 Difference]: Without dead ends: 10016 [2018-12-31 18:25:53,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 18:25:53,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10016 states. [2018-12-31 18:25:53,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10016 to 7487. [2018-12-31 18:25:53,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7487 states. [2018-12-31 18:25:53,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7487 states to 7487 states and 17008 transitions. [2018-12-31 18:25:53,228 INFO L78 Accepts]: Start accepts. Automaton has 7487 states and 17008 transitions. Word has length 96 [2018-12-31 18:25:53,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:25:53,228 INFO L480 AbstractCegarLoop]: Abstraction has 7487 states and 17008 transitions. [2018-12-31 18:25:53,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:25:53,228 INFO L276 IsEmpty]: Start isEmpty. Operand 7487 states and 17008 transitions. [2018-12-31 18:25:53,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:25:53,236 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:25:53,236 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:25:53,237 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:25:53,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:25:53,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1693454102, now seen corresponding path program 1 times [2018-12-31 18:25:53,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:25:53,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:25:53,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:53,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:25:53,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:25:53,397 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-31 18:25:53,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:25:53,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:25:53,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:25:53,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:25:53,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:25:53,398 INFO L87 Difference]: Start difference. First operand 7487 states and 17008 transitions. Second operand 6 states. [2018-12-31 18:25:53,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:25:53,784 INFO L93 Difference]: Finished difference Result 9453 states and 21289 transitions. [2018-12-31 18:25:53,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 18:25:53,785 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-31 18:25:53,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:25:53,798 INFO L225 Difference]: With dead ends: 9453 [2018-12-31 18:25:53,798 INFO L226 Difference]: Without dead ends: 9365 [2018-12-31 18:25:53,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-31 18:25:53,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9365 states. [2018-12-31 18:25:53,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9365 to 7032. [2018-12-31 18:25:53,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7032 states. [2018-12-31 18:25:53,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7032 states to 7032 states and 16004 transitions. [2018-12-31 18:25:53,888 INFO L78 Accepts]: Start accepts. Automaton has 7032 states and 16004 transitions. Word has length 96 [2018-12-31 18:25:53,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:25:53,888 INFO L480 AbstractCegarLoop]: Abstraction has 7032 states and 16004 transitions. [2018-12-31 18:25:53,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:25:53,889 INFO L276 IsEmpty]: Start isEmpty. Operand 7032 states and 16004 transitions. [2018-12-31 18:25:53,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:25:53,896 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:25:53,896 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:25:53,896 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:25:53,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:25:53,897 INFO L82 PathProgramCache]: Analyzing trace with hash -564113265, now seen corresponding path program 1 times [2018-12-31 18:25:53,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:25:53,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:25:53,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:53,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:25:53,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:25:54,023 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-31 18:25:54,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:25:54,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 18:25:54,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 18:25:54,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 18:25:54,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:25:54,024 INFO L87 Difference]: Start difference. First operand 7032 states and 16004 transitions. Second operand 8 states. [2018-12-31 18:25:54,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:25:54,575 INFO L93 Difference]: Finished difference Result 10295 states and 23705 transitions. [2018-12-31 18:25:54,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 18:25:54,576 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-12-31 18:25:54,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:25:54,590 INFO L225 Difference]: With dead ends: 10295 [2018-12-31 18:25:54,590 INFO L226 Difference]: Without dead ends: 10295 [2018-12-31 18:25:54,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-12-31 18:25:54,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10295 states. [2018-12-31 18:25:54,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10295 to 7469. [2018-12-31 18:25:54,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7469 states. [2018-12-31 18:25:54,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7469 states to 7469 states and 17150 transitions. [2018-12-31 18:25:54,697 INFO L78 Accepts]: Start accepts. Automaton has 7469 states and 17150 transitions. Word has length 96 [2018-12-31 18:25:54,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:25:54,697 INFO L480 AbstractCegarLoop]: Abstraction has 7469 states and 17150 transitions. [2018-12-31 18:25:54,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 18:25:54,698 INFO L276 IsEmpty]: Start isEmpty. Operand 7469 states and 17150 transitions. [2018-12-31 18:25:54,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:25:54,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:25:54,705 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:25:54,706 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:25:54,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:25:54,706 INFO L82 PathProgramCache]: Analyzing trace with hash 323390416, now seen corresponding path program 1 times [2018-12-31 18:25:54,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:25:54,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:25:54,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:54,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:25:54,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:25:54,932 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-31 18:25:54,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:25:54,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 18:25:54,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 18:25:54,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 18:25:54,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-12-31 18:25:54,934 INFO L87 Difference]: Start difference. First operand 7469 states and 17150 transitions. Second operand 10 states. [2018-12-31 18:25:55,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:25:55,920 INFO L93 Difference]: Finished difference Result 11592 states and 26583 transitions. [2018-12-31 18:25:55,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-31 18:25:55,922 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2018-12-31 18:25:55,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:25:55,938 INFO L225 Difference]: With dead ends: 11592 [2018-12-31 18:25:55,938 INFO L226 Difference]: Without dead ends: 11592 [2018-12-31 18:25:55,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2018-12-31 18:25:55,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11592 states. [2018-12-31 18:25:56,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11592 to 9095. [2018-12-31 18:25:56,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9095 states. [2018-12-31 18:25:56,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9095 states to 9095 states and 20675 transitions. [2018-12-31 18:25:56,091 INFO L78 Accepts]: Start accepts. Automaton has 9095 states and 20675 transitions. Word has length 96 [2018-12-31 18:25:56,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:25:56,091 INFO L480 AbstractCegarLoop]: Abstraction has 9095 states and 20675 transitions. [2018-12-31 18:25:56,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 18:25:56,091 INFO L276 IsEmpty]: Start isEmpty. Operand 9095 states and 20675 transitions. [2018-12-31 18:25:56,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:25:56,102 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:25:56,103 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:25:56,103 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:25:56,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:25:56,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1408585136, now seen corresponding path program 1 times [2018-12-31 18:25:56,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:25:56,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:25:56,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:56,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:25:56,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:56,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:25:56,718 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 9 [2018-12-31 18:25:56,738 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-31 18:25:56,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:25:56,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:25:56,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:25:56,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:25:56,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:25:56,740 INFO L87 Difference]: Start difference. First operand 9095 states and 20675 transitions. Second operand 6 states. [2018-12-31 18:25:57,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:25:57,513 INFO L93 Difference]: Finished difference Result 8775 states and 19683 transitions. [2018-12-31 18:25:57,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 18:25:57,515 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-31 18:25:57,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:25:57,528 INFO L225 Difference]: With dead ends: 8775 [2018-12-31 18:25:57,528 INFO L226 Difference]: Without dead ends: 8775 [2018-12-31 18:25:57,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:25:57,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8775 states. [2018-12-31 18:25:57,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8775 to 7134. [2018-12-31 18:25:57,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7134 states. [2018-12-31 18:25:57,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7134 states to 7134 states and 16071 transitions. [2018-12-31 18:25:57,654 INFO L78 Accepts]: Start accepts. Automaton has 7134 states and 16071 transitions. Word has length 96 [2018-12-31 18:25:57,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:25:57,654 INFO L480 AbstractCegarLoop]: Abstraction has 7134 states and 16071 transitions. [2018-12-31 18:25:57,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:25:57,654 INFO L276 IsEmpty]: Start isEmpty. Operand 7134 states and 16071 transitions. [2018-12-31 18:25:57,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 18:25:57,663 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:25:57,663 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:25:57,664 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:25:57,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:25:57,664 INFO L82 PathProgramCache]: Analyzing trace with hash -287165680, now seen corresponding path program 1 times [2018-12-31 18:25:57,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:25:57,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:25:57,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:57,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:25:57,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:57,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:25:58,863 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-31 18:25:58,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:25:58,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-31 18:25:58,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-31 18:25:58,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-31 18:25:58,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-12-31 18:25:58,865 INFO L87 Difference]: Start difference. First operand 7134 states and 16071 transitions. Second operand 13 states. [2018-12-31 18:26:00,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:26:00,113 INFO L93 Difference]: Finished difference Result 9861 states and 21847 transitions. [2018-12-31 18:26:00,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-31 18:26:00,115 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 98 [2018-12-31 18:26:00,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:26:00,127 INFO L225 Difference]: With dead ends: 9861 [2018-12-31 18:26:00,128 INFO L226 Difference]: Without dead ends: 9861 [2018-12-31 18:26:00,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2018-12-31 18:26:00,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9861 states. [2018-12-31 18:26:00,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9861 to 7851. [2018-12-31 18:26:00,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7851 states. [2018-12-31 18:26:00,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7851 states to 7851 states and 17644 transitions. [2018-12-31 18:26:00,307 INFO L78 Accepts]: Start accepts. Automaton has 7851 states and 17644 transitions. Word has length 98 [2018-12-31 18:26:00,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:26:00,307 INFO L480 AbstractCegarLoop]: Abstraction has 7851 states and 17644 transitions. [2018-12-31 18:26:00,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-31 18:26:00,307 INFO L276 IsEmpty]: Start isEmpty. Operand 7851 states and 17644 transitions. [2018-12-31 18:26:00,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 18:26:00,315 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:26:00,316 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:26:00,316 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:26:00,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:26:00,316 INFO L82 PathProgramCache]: Analyzing trace with hash 600338001, now seen corresponding path program 1 times [2018-12-31 18:26:00,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:26:00,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:26:00,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:26:00,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:26:00,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:26:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:26:00,544 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-31 18:26:00,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:26:00,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 18:26:00,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 18:26:00,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 18:26:00,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-31 18:26:00,545 INFO L87 Difference]: Start difference. First operand 7851 states and 17644 transitions. Second operand 9 states. [2018-12-31 18:26:01,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:26:01,466 INFO L93 Difference]: Finished difference Result 12120 states and 27159 transitions. [2018-12-31 18:26:01,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 18:26:01,467 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2018-12-31 18:26:01,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:26:01,479 INFO L225 Difference]: With dead ends: 12120 [2018-12-31 18:26:01,479 INFO L226 Difference]: Without dead ends: 8883 [2018-12-31 18:26:01,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-12-31 18:26:01,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8883 states. [2018-12-31 18:26:01,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8883 to 7908. [2018-12-31 18:26:01,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7908 states. [2018-12-31 18:26:01,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7908 states to 7908 states and 17761 transitions. [2018-12-31 18:26:01,577 INFO L78 Accepts]: Start accepts. Automaton has 7908 states and 17761 transitions. Word has length 98 [2018-12-31 18:26:01,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:26:01,577 INFO L480 AbstractCegarLoop]: Abstraction has 7908 states and 17761 transitions. [2018-12-31 18:26:01,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 18:26:01,577 INFO L276 IsEmpty]: Start isEmpty. Operand 7908 states and 17761 transitions. [2018-12-31 18:26:01,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 18:26:01,586 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:26:01,587 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:26:01,587 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:26:01,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:26:01,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1430813447, now seen corresponding path program 1 times [2018-12-31 18:26:01,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:26:01,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:26:01,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:26:01,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:26:01,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:26:01,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:26:02,016 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-12-31 18:26:02,483 WARN L181 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2018-12-31 18:26:02,505 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-31 18:26:02,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:26:02,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:26:02,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:26:02,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:26:02,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:26:02,507 INFO L87 Difference]: Start difference. First operand 7908 states and 17761 transitions. Second operand 6 states. [2018-12-31 18:26:02,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:26:02,768 INFO L93 Difference]: Finished difference Result 8785 states and 19481 transitions. [2018-12-31 18:26:02,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 18:26:02,769 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2018-12-31 18:26:02,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:26:02,780 INFO L225 Difference]: With dead ends: 8785 [2018-12-31 18:26:02,780 INFO L226 Difference]: Without dead ends: 8735 [2018-12-31 18:26:02,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:26:02,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8735 states. [2018-12-31 18:26:02,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8735 to 7859. [2018-12-31 18:26:02,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7859 states. [2018-12-31 18:26:02,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7859 states to 7859 states and 17516 transitions. [2018-12-31 18:26:02,878 INFO L78 Accepts]: Start accepts. Automaton has 7859 states and 17516 transitions. Word has length 98 [2018-12-31 18:26:02,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:26:02,879 INFO L480 AbstractCegarLoop]: Abstraction has 7859 states and 17516 transitions. [2018-12-31 18:26:02,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:26:02,879 INFO L276 IsEmpty]: Start isEmpty. Operand 7859 states and 17516 transitions. [2018-12-31 18:26:02,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 18:26:02,888 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:26:02,888 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:26:02,888 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:26:02,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:26:02,889 INFO L82 PathProgramCache]: Analyzing trace with hash 774269081, now seen corresponding path program 2 times [2018-12-31 18:26:02,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:26:02,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:26:02,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:26:02,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:26:02,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:26:02,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:26:03,574 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-31 18:26:03,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:26:03,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:26:03,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:26:03,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:26:03,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:26:03,576 INFO L87 Difference]: Start difference. First operand 7859 states and 17516 transitions. Second operand 7 states. [2018-12-31 18:26:04,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:26:04,259 INFO L93 Difference]: Finished difference Result 9487 states and 20865 transitions. [2018-12-31 18:26:04,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 18:26:04,261 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2018-12-31 18:26:04,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:26:04,272 INFO L225 Difference]: With dead ends: 9487 [2018-12-31 18:26:04,272 INFO L226 Difference]: Without dead ends: 9487 [2018-12-31 18:26:04,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-31 18:26:04,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9487 states. [2018-12-31 18:26:04,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9487 to 7884. [2018-12-31 18:26:04,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7884 states. [2018-12-31 18:26:04,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7884 states to 7884 states and 17568 transitions. [2018-12-31 18:26:04,368 INFO L78 Accepts]: Start accepts. Automaton has 7884 states and 17568 transitions. Word has length 98 [2018-12-31 18:26:04,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:26:04,368 INFO L480 AbstractCegarLoop]: Abstraction has 7884 states and 17568 transitions. [2018-12-31 18:26:04,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:26:04,368 INFO L276 IsEmpty]: Start isEmpty. Operand 7884 states and 17568 transitions. [2018-12-31 18:26:04,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 18:26:04,377 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:26:04,378 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:26:04,378 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:26:04,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:26:04,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1306740200, now seen corresponding path program 2 times [2018-12-31 18:26:04,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:26:04,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:26:04,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:26:04,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 18:26:04,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:26:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:26:04,699 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-31 18:26:04,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:26:04,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 18:26:04,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 18:26:04,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 18:26:04,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:26:04,700 INFO L87 Difference]: Start difference. First operand 7884 states and 17568 transitions. Second operand 8 states. [2018-12-31 18:26:05,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:26:05,172 INFO L93 Difference]: Finished difference Result 9422 states and 20846 transitions. [2018-12-31 18:26:05,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 18:26:05,173 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 98 [2018-12-31 18:26:05,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:26:05,186 INFO L225 Difference]: With dead ends: 9422 [2018-12-31 18:26:05,186 INFO L226 Difference]: Without dead ends: 9422 [2018-12-31 18:26:05,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2018-12-31 18:26:05,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9422 states. [2018-12-31 18:26:05,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9422 to 8274. [2018-12-31 18:26:05,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8274 states. [2018-12-31 18:26:05,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8274 states to 8274 states and 18395 transitions. [2018-12-31 18:26:05,295 INFO L78 Accepts]: Start accepts. Automaton has 8274 states and 18395 transitions. Word has length 98 [2018-12-31 18:26:05,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:26:05,296 INFO L480 AbstractCegarLoop]: Abstraction has 8274 states and 18395 transitions. [2018-12-31 18:26:05,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 18:26:05,296 INFO L276 IsEmpty]: Start isEmpty. Operand 8274 states and 18395 transitions. [2018-12-31 18:26:05,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 18:26:05,306 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:26:05,306 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:26:05,307 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:26:05,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:26:05,307 INFO L82 PathProgramCache]: Analyzing trace with hash -419236519, now seen corresponding path program 2 times [2018-12-31 18:26:05,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:26:05,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:26:05,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:26:05,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 18:26:05,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:26:05,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:26:05,489 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-31 18:26:05,579 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-31 18:26:05,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:26:05,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 18:26:05,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 18:26:05,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 18:26:05,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-31 18:26:05,581 INFO L87 Difference]: Start difference. First operand 8274 states and 18395 transitions. Second operand 9 states. [2018-12-31 18:26:05,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:26:05,792 INFO L93 Difference]: Finished difference Result 11279 states and 25102 transitions. [2018-12-31 18:26:05,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 18:26:05,793 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2018-12-31 18:26:05,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:26:05,802 INFO L225 Difference]: With dead ends: 11279 [2018-12-31 18:26:05,802 INFO L226 Difference]: Without dead ends: 7208 [2018-12-31 18:26:05,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-12-31 18:26:05,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7208 states. [2018-12-31 18:26:05,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7208 to 6395. [2018-12-31 18:26:05,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6395 states. [2018-12-31 18:26:05,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6395 states to 6395 states and 14157 transitions. [2018-12-31 18:26:05,879 INFO L78 Accepts]: Start accepts. Automaton has 6395 states and 14157 transitions. Word has length 98 [2018-12-31 18:26:05,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:26:05,880 INFO L480 AbstractCegarLoop]: Abstraction has 6395 states and 14157 transitions. [2018-12-31 18:26:05,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 18:26:05,880 INFO L276 IsEmpty]: Start isEmpty. Operand 6395 states and 14157 transitions. [2018-12-31 18:26:05,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 18:26:05,887 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:26:05,887 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:26:05,888 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:26:05,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:26:05,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1919498867, now seen corresponding path program 3 times [2018-12-31 18:26:05,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:26:05,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:26:05,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:26:05,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 18:26:05,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:26:05,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:26:06,141 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-31 18:26:06,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:26:06,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 18:26:06,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 18:26:06,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 18:26:06,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-31 18:26:06,143 INFO L87 Difference]: Start difference. First operand 6395 states and 14157 transitions. Second operand 9 states. [2018-12-31 18:26:06,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:26:06,423 INFO L93 Difference]: Finished difference Result 8970 states and 19951 transitions. [2018-12-31 18:26:06,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 18:26:06,425 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2018-12-31 18:26:06,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:26:06,435 INFO L225 Difference]: With dead ends: 8970 [2018-12-31 18:26:06,435 INFO L226 Difference]: Without dead ends: 7302 [2018-12-31 18:26:06,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-12-31 18:26:06,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7302 states. [2018-12-31 18:26:06,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7302 to 6462. [2018-12-31 18:26:06,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6462 states. [2018-12-31 18:26:06,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6462 states to 6462 states and 14296 transitions. [2018-12-31 18:26:06,516 INFO L78 Accepts]: Start accepts. Automaton has 6462 states and 14296 transitions. Word has length 98 [2018-12-31 18:26:06,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:26:06,516 INFO L480 AbstractCegarLoop]: Abstraction has 6462 states and 14296 transitions. [2018-12-31 18:26:06,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 18:26:06,516 INFO L276 IsEmpty]: Start isEmpty. Operand 6462 states and 14296 transitions. [2018-12-31 18:26:06,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 18:26:06,525 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:26:06,525 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:26:06,525 INFO L423 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:26:06,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:26:06,525 INFO L82 PathProgramCache]: Analyzing trace with hash -2050487941, now seen corresponding path program 4 times [2018-12-31 18:26:06,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:26:06,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:26:06,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:26:06,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 18:26:06,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:26:06,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:26:06,738 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-31 18:26:06,836 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-31 18:26:06,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:26:06,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-31 18:26:06,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 18:26:06,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 18:26:06,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-31 18:26:06,837 INFO L87 Difference]: Start difference. First operand 6462 states and 14296 transitions. Second operand 11 states. [2018-12-31 18:26:07,121 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2018-12-31 18:26:09,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:26:09,126 INFO L93 Difference]: Finished difference Result 11999 states and 26613 transitions. [2018-12-31 18:26:09,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-31 18:26:09,128 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 98 [2018-12-31 18:26:09,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:26:09,141 INFO L225 Difference]: With dead ends: 11999 [2018-12-31 18:26:09,141 INFO L226 Difference]: Without dead ends: 8252 [2018-12-31 18:26:09,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2018-12-31 18:26:09,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8252 states. [2018-12-31 18:26:09,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8252 to 6342. [2018-12-31 18:26:09,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6342 states. [2018-12-31 18:26:09,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6342 states to 6342 states and 13974 transitions. [2018-12-31 18:26:09,224 INFO L78 Accepts]: Start accepts. Automaton has 6342 states and 13974 transitions. Word has length 98 [2018-12-31 18:26:09,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:26:09,224 INFO L480 AbstractCegarLoop]: Abstraction has 6342 states and 13974 transitions. [2018-12-31 18:26:09,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 18:26:09,224 INFO L276 IsEmpty]: Start isEmpty. Operand 6342 states and 13974 transitions. [2018-12-31 18:26:09,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 18:26:09,234 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:26:09,235 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:26:09,235 INFO L423 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:26:09,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:26:09,235 INFO L82 PathProgramCache]: Analyzing trace with hash -450396822, now seen corresponding path program 1 times [2018-12-31 18:26:09,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:26:09,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:26:09,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:26:09,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 18:26:09,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:26:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:26:09,443 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-31 18:26:09,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:26:09,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:26:09,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:26:09,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:26:09,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:26:09,445 INFO L87 Difference]: Start difference. First operand 6342 states and 13974 transitions. Second operand 7 states. [2018-12-31 18:26:09,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:26:09,841 INFO L93 Difference]: Finished difference Result 6514 states and 14283 transitions. [2018-12-31 18:26:09,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 18:26:09,843 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2018-12-31 18:26:09,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:26:09,852 INFO L225 Difference]: With dead ends: 6514 [2018-12-31 18:26:09,852 INFO L226 Difference]: Without dead ends: 6514 [2018-12-31 18:26:09,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-12-31 18:26:09,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6514 states. [2018-12-31 18:26:09,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6514 to 6137. [2018-12-31 18:26:09,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6137 states. [2018-12-31 18:26:09,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6137 states to 6137 states and 13518 transitions. [2018-12-31 18:26:09,920 INFO L78 Accepts]: Start accepts. Automaton has 6137 states and 13518 transitions. Word has length 98 [2018-12-31 18:26:09,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:26:09,921 INFO L480 AbstractCegarLoop]: Abstraction has 6137 states and 13518 transitions. [2018-12-31 18:26:09,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:26:09,921 INFO L276 IsEmpty]: Start isEmpty. Operand 6137 states and 13518 transitions. [2018-12-31 18:26:09,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 18:26:09,928 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:26:09,928 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:26:09,928 INFO L423 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:26:09,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:26:09,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1013715753, now seen corresponding path program 5 times [2018-12-31 18:26:09,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:26:09,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:26:09,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:26:09,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:26:09,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:26:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 18:26:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 18:26:10,042 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 18:26:10,276 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-31 18:26:10,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 06:26:10 BasicIcfg [2018-12-31 18:26:10,278 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 18:26:10,281 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 18:26:10,281 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 18:26:10,281 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 18:26:10,282 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 06:25:01" (3/4) ... [2018-12-31 18:26:10,287 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 18:26:10,493 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 18:26:10,493 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 18:26:10,496 INFO L168 Benchmark]: Toolchain (without parser) took 71669.94 ms. Allocated memory was 1.0 GB in the beginning and 4.5 GB in the end (delta: 3.5 GB). Free memory was 947.3 MB in the beginning and 2.5 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2018-12-31 18:26:10,497 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 18:26:10,497 INFO L168 Benchmark]: CACSL2BoogieTranslator took 937.66 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -139.7 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2018-12-31 18:26:10,498 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-31 18:26:10,498 INFO L168 Benchmark]: Boogie Preprocessor took 48.78 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-31 18:26:10,498 INFO L168 Benchmark]: RCFGBuilder took 1468.78 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: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 11.5 GB. [2018-12-31 18:26:10,499 INFO L168 Benchmark]: TraceAbstraction took 68919.29 ms. Allocated memory was 1.1 GB in the beginning and 4.5 GB in the end (delta: 3.4 GB). Free memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2018-12-31 18:26:10,499 INFO L168 Benchmark]: Witness Printer took 212.75 ms. Allocated memory is still 4.5 GB. Free memory was 2.6 GB in the beginning and 2.5 GB in the end (delta: 52.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. [2018-12-31 18:26:10,507 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 937.66 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -139.7 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.78 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. * RCFGBuilder took 1468.78 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: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 68919.29 ms. Allocated memory was 1.1 GB in the beginning and 4.5 GB in the end (delta: 3.4 GB). Free memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. * Witness Printer took 212.75 ms. Allocated memory is still 4.5 GB. Free memory was 2.6 GB in the beginning and 2.5 GB in the end (delta: 52.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L677] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L679] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L680] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L681] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L683] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L685] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L687] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L688] -1 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L689] -1 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L690] -1 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L691] -1 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L692] -1 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L693] -1 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0] [L694] -1 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, z$r_buff1_thd1=0] [L695] -1 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L696] -1 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0] [L697] -1 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L698] -1 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L699] -1 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L700] -1 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L701] -1 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L702] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L703] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L785] -1 pthread_t t255; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L786] FCALL, FORK -1 pthread_create(&t255, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L707] 0 z$w_buff1 = z$w_buff0 [L708] 0 z$w_buff0 = 1 [L709] 0 z$w_buff1_used = z$w_buff0_used [L710] 0 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] -1 pthread_t t256; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L788] FCALL, FORK -1 pthread_create(&t256, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L712] 0 z$r_buff1_thd0 = z$r_buff0_thd0 [L713] 0 z$r_buff1_thd1 = z$r_buff0_thd1 [L714] 0 z$r_buff1_thd2 = z$r_buff0_thd2 [L715] 0 z$r_buff0_thd1 = (_Bool)1 [L718] 0 x = 1 [L721] 0 __unbuffered_p0_EAX = x [L724] 0 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L741] 1 y = 1 [L744] 1 __unbuffered_p1_EAX = y [L747] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L748] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L749] 1 z$flush_delayed = weak$$choice2 [L750] 1 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L751] EXPR 1 !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=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L751] 1 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) [L752] EXPR 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L752] 1 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)) [L727] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L753] EXPR 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L753] 1 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)) [L754] EXPR 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L754] 1 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)) [L755] EXPR 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L755] 1 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)) [L756] EXPR 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L756] 1 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)) [L757] EXPR 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L757] 1 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)) [L758] 1 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L727] 0 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L728] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L728] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L729] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L729] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L730] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L730] 0 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L759] EXPR 1 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L759] 1 z = z$flush_delayed ? z$mem_tmp : z [L760] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L763] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L763] EXPR 1 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L763] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L763] 1 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L764] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L764] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L765] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L765] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L766] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L766] 1 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L767] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L767] 1 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L770] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L731] 0 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L734] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L790] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L794] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L794] EXPR -1 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L794] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L794] -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) [L795] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L795] -1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L796] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] -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 [L797] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L797] -1 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L798] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] -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 [L801] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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 5 procedures, 225 locations, 3 error locations. UNSAFE Result, 68.7s OverallTime, 40 OverallIterations, 1 TraceHistogramMax, 38.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10404 SDtfs, 12250 SDslu, 25676 SDs, 0 SdLazy, 11722 SolverSat, 638 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 439 GetRequests, 107 SyntacticMatches, 30 SemanticMatches, 302 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 12.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66523occurred in iteration=5, 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: 14.9s AutomataMinimizationTime, 39 MinimizatonAttempts, 143599 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 3176 NumberOfCodeBlocks, 3176 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 3039 ConstructedInterpolants, 0 QuantifiedInterpolants, 714632 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 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...