./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix009_pso.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_pso.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 2e38c8c330a9981b6cf3f5b505fe1b87957b6fde ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:23:39,993 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 18:23:39,995 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 18:23:40,009 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 18:23:40,009 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 18:23:40,011 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 18:23:40,012 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 18:23:40,015 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 18:23:40,017 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 18:23:40,018 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 18:23:40,019 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 18:23:40,019 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 18:23:40,020 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 18:23:40,022 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 18:23:40,023 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 18:23:40,024 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 18:23:40,025 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 18:23:40,027 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 18:23:40,030 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 18:23:40,032 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 18:23:40,033 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 18:23:40,035 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 18:23:40,038 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 18:23:40,038 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 18:23:40,038 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 18:23:40,039 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 18:23:40,041 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 18:23:40,042 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 18:23:40,043 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 18:23:40,044 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 18:23:40,044 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 18:23:40,046 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 18:23:40,046 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 18:23:40,046 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 18:23:40,047 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 18:23:40,048 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 18:23:40,048 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:23:40,078 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 18:23:40,079 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 18:23:40,083 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 18:23:40,084 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 18:23:40,084 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 18:23:40,084 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 18:23:40,084 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 18:23:40,085 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 18:23:40,085 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 18:23:40,085 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 18:23:40,085 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 18:23:40,085 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 18:23:40,085 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 18:23:40,087 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 18:23:40,087 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 18:23:40,088 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 18:23:40,088 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 18:23:40,088 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 18:23:40,088 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 18:23:40,088 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 18:23:40,091 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 18:23:40,091 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 18:23:40,091 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 18:23:40,091 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 18:23:40,091 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 18:23:40,092 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 18:23:40,093 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 18:23:40,093 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 18:23:40,093 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 -> 2e38c8c330a9981b6cf3f5b505fe1b87957b6fde [2018-12-31 18:23:40,158 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 18:23:40,177 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 18:23:40,183 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 18:23:40,185 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 18:23:40,186 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 18:23:40,187 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix009_pso.oepc_false-unreach-call.i [2018-12-31 18:23:40,260 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7d200d8c/8bb8330f6d9446808578e6de9d3cf493/FLAG832db3701 [2018-12-31 18:23:40,897 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 18:23:40,898 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix009_pso.oepc_false-unreach-call.i [2018-12-31 18:23:40,922 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7d200d8c/8bb8330f6d9446808578e6de9d3cf493/FLAG832db3701 [2018-12-31 18:23:41,102 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7d200d8c/8bb8330f6d9446808578e6de9d3cf493 [2018-12-31 18:23:41,106 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 18:23:41,109 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 18:23:41,110 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 18:23:41,110 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 18:23:41,114 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 18:23:41,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 06:23:41" (1/1) ... [2018-12-31 18:23:41,121 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a30119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:23:41, skipping insertion in model container [2018-12-31 18:23:41,122 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 06:23:41" (1/1) ... [2018-12-31 18:23:41,131 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 18:23:41,187 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 18:23:41,723 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 18:23:41,747 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 18:23:41,901 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 18:23:42,016 INFO L195 MainTranslator]: Completed translation [2018-12-31 18:23:42,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:23:42 WrapperNode [2018-12-31 18:23:42,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 18:23:42,019 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 18:23:42,019 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 18:23:42,019 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 18:23:42,031 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:23:42" (1/1) ... [2018-12-31 18:23:42,066 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:23:42" (1/1) ... [2018-12-31 18:23:42,111 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 18:23:42,112 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 18:23:42,112 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 18:23:42,112 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 18:23:42,130 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:23:42" (1/1) ... [2018-12-31 18:23:42,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:23:42" (1/1) ... [2018-12-31 18:23:42,142 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:23:42" (1/1) ... [2018-12-31 18:23:42,142 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:23:42" (1/1) ... [2018-12-31 18:23:42,155 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:23:42" (1/1) ... [2018-12-31 18:23:42,160 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:23:42" (1/1) ... [2018-12-31 18:23:42,163 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:23:42" (1/1) ... [2018-12-31 18:23:42,169 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 18:23:42,170 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 18:23:42,170 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 18:23:42,170 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 18:23:42,171 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:23:42" (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:23:42,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 18:23:42,256 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-31 18:23:42,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 18:23:42,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 18:23:42,256 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-31 18:23:42,257 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-31 18:23:42,257 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-31 18:23:42,257 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-31 18:23:42,257 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-31 18:23:42,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 18:23:42,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 18:23:42,261 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:23:43,483 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 18:23:43,484 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-31 18:23:43,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 06:23:43 BoogieIcfgContainer [2018-12-31 18:23:43,485 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 18:23:43,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 18:23:43,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 18:23:43,490 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 18:23:43,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 06:23:41" (1/3) ... [2018-12-31 18:23:43,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c5e654d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 06:23:43, skipping insertion in model container [2018-12-31 18:23:43,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:23:42" (2/3) ... [2018-12-31 18:23:43,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c5e654d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 06:23:43, skipping insertion in model container [2018-12-31 18:23:43,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 06:23:43" (3/3) ... [2018-12-31 18:23:43,494 INFO L112 eAbstractionObserver]: Analyzing ICFG mix009_pso.oepc_false-unreach-call.i [2018-12-31 18:23:43,545 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,546 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,546 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,546 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,546 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,546 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:23:43,547 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,547 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,548 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,548 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,548 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,548 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,549 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,549 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,549 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,549 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,549 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,550 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,550 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,550 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,550 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,550 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,551 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,551 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,551 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,551 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,551 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,552 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,552 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,552 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,552 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,553 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,553 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,553 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,553 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,553 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,554 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,554 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,555 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,555 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,555 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,555 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,556 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,557 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,557 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,557 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,557 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,558 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,558 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,558 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,558 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,558 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,559 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,559 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,559 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,559 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,559 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,560 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,560 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,560 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,560 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,560 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,561 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,561 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,561 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,561 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,562 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,562 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,562 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,562 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,563 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,563 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,563 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,563 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,563 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,564 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,564 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,564 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,564 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,564 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,565 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,565 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,565 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,565 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,566 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,566 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,566 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,566 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,566 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,567 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,567 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,567 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,567 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,567 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,568 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,568 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,568 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,568 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,569 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,569 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,569 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,569 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,569 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,570 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,570 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,570 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,570 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,571 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,571 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,571 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,571 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,571 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,572 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,572 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,572 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,572 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,572 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,573 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,573 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,573 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,573 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,574 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,574 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,574 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,574 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,574 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,575 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,575 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,575 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,575 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,575 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,576 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,576 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,576 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,576 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,577 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,577 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,577 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,577 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,577 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,579 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,579 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,579 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,579 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,581 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,581 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,581 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,581 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,581 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,582 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:23:43,613 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-31 18:23:43,614 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 18:23:43,623 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 18:23:43,643 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 18:23:43,672 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 18:23:43,673 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 18:23:43,673 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 18:23:43,674 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 18:23:43,674 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 18:23:43,674 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 18:23:43,674 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 18:23:43,674 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 18:23:43,674 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 18:23:43,690 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 145places, 183 transitions [2018-12-31 18:23:46,440 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34809 states. [2018-12-31 18:23:46,442 INFO L276 IsEmpty]: Start isEmpty. Operand 34809 states. [2018-12-31 18:23:46,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-31 18:23:46,452 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:23:46,453 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:23:46,456 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:23:46,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:23:46,462 INFO L82 PathProgramCache]: Analyzing trace with hash 787354290, now seen corresponding path program 1 times [2018-12-31 18:23:46,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:23:46,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:23:46,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:23:46,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:23:46,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:23:46,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:23:46,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:23:46,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:23:46,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:23:46,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:23:46,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:23:46,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:23:46,851 INFO L87 Difference]: Start difference. First operand 34809 states. Second operand 4 states. [2018-12-31 18:23:48,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:23:48,636 INFO L93 Difference]: Finished difference Result 60793 states and 234496 transitions. [2018-12-31 18:23:48,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 18:23:48,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-12-31 18:23:48,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:23:49,048 INFO L225 Difference]: With dead ends: 60793 [2018-12-31 18:23:49,049 INFO L226 Difference]: Without dead ends: 44273 [2018-12-31 18:23:49,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:23:49,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44273 states. [2018-12-31 18:23:50,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44273 to 27341. [2018-12-31 18:23:50,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27341 states. [2018-12-31 18:23:51,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27341 states to 27341 states and 105502 transitions. [2018-12-31 18:23:51,043 INFO L78 Accepts]: Start accepts. Automaton has 27341 states and 105502 transitions. Word has length 36 [2018-12-31 18:23:51,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:23:51,047 INFO L480 AbstractCegarLoop]: Abstraction has 27341 states and 105502 transitions. [2018-12-31 18:23:51,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:23:51,048 INFO L276 IsEmpty]: Start isEmpty. Operand 27341 states and 105502 transitions. [2018-12-31 18:23:51,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-31 18:23:51,068 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:23:51,068 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:23:51,068 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:23:51,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:23:51,069 INFO L82 PathProgramCache]: Analyzing trace with hash 901056929, now seen corresponding path program 1 times [2018-12-31 18:23:51,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:23:51,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:23:51,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:23:51,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:23:51,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:23:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:23:51,282 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:23:51,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:23:51,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:23:51,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:23:51,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:23:51,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:23:51,286 INFO L87 Difference]: Start difference. First operand 27341 states and 105502 transitions. Second operand 5 states. [2018-12-31 18:23:54,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:23:54,131 INFO L93 Difference]: Finished difference Result 64007 states and 235337 transitions. [2018-12-31 18:23:54,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 18:23:54,131 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-12-31 18:23:54,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:23:55,125 INFO L225 Difference]: With dead ends: 64007 [2018-12-31 18:23:55,125 INFO L226 Difference]: Without dead ends: 63455 [2018-12-31 18:23:55,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:23:55,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63455 states. [2018-12-31 18:23:56,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63455 to 41423. [2018-12-31 18:23:56,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41423 states. [2018-12-31 18:23:56,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41423 states to 41423 states and 152332 transitions. [2018-12-31 18:23:56,691 INFO L78 Accepts]: Start accepts. Automaton has 41423 states and 152332 transitions. Word has length 48 [2018-12-31 18:23:56,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:23:56,693 INFO L480 AbstractCegarLoop]: Abstraction has 41423 states and 152332 transitions. [2018-12-31 18:23:56,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:23:56,693 INFO L276 IsEmpty]: Start isEmpty. Operand 41423 states and 152332 transitions. [2018-12-31 18:23:56,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-31 18:23:56,702 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:23:56,702 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:23:56,702 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:23:56,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:23:56,704 INFO L82 PathProgramCache]: Analyzing trace with hash 2027995578, now seen corresponding path program 1 times [2018-12-31 18:23:56,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:23:56,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:23:56,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:23:56,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:23:56,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:23:56,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:23:56,998 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:23:56,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:23:56,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:23:56,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:23:56,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:23:56,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:23:56,999 INFO L87 Difference]: Start difference. First operand 41423 states and 152332 transitions. Second operand 6 states. [2018-12-31 18:23:58,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:23:58,606 INFO L93 Difference]: Finished difference Result 52773 states and 191027 transitions. [2018-12-31 18:23:58,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 18:23:58,607 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2018-12-31 18:23:58,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:23:58,785 INFO L225 Difference]: With dead ends: 52773 [2018-12-31 18:23:58,785 INFO L226 Difference]: Without dead ends: 52261 [2018-12-31 18:23:58,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-31 18:23:59,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52261 states. [2018-12-31 18:23:59,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52261 to 45377. [2018-12-31 18:23:59,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45377 states. [2018-12-31 18:24:01,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45377 states to 45377 states and 166020 transitions. [2018-12-31 18:24:01,109 INFO L78 Accepts]: Start accepts. Automaton has 45377 states and 166020 transitions. Word has length 49 [2018-12-31 18:24:01,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:01,109 INFO L480 AbstractCegarLoop]: Abstraction has 45377 states and 166020 transitions. [2018-12-31 18:24:01,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:24:01,110 INFO L276 IsEmpty]: Start isEmpty. Operand 45377 states and 166020 transitions. [2018-12-31 18:24:01,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-31 18:24:01,120 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:01,120 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:24:01,120 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:01,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:01,120 INFO L82 PathProgramCache]: Analyzing trace with hash -39217920, now seen corresponding path program 1 times [2018-12-31 18:24:01,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:01,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:01,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:01,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:01,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:01,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:01,206 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:24:01,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:01,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 18:24:01,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 18:24:01,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 18:24:01,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:24:01,207 INFO L87 Difference]: Start difference. First operand 45377 states and 166020 transitions. Second operand 3 states. [2018-12-31 18:24:01,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:01,554 INFO L93 Difference]: Finished difference Result 65253 states and 235816 transitions. [2018-12-31 18:24:01,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 18:24:01,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-12-31 18:24:01,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:01,729 INFO L225 Difference]: With dead ends: 65253 [2018-12-31 18:24:01,729 INFO L226 Difference]: Without dead ends: 65253 [2018-12-31 18:24:01,730 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:24:02,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65253 states. [2018-12-31 18:24:02,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65253 to 50947. [2018-12-31 18:24:02,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50947 states. [2018-12-31 18:24:03,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50947 states to 50947 states and 184327 transitions. [2018-12-31 18:24:03,049 INFO L78 Accepts]: Start accepts. Automaton has 50947 states and 184327 transitions. Word has length 51 [2018-12-31 18:24:03,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:03,050 INFO L480 AbstractCegarLoop]: Abstraction has 50947 states and 184327 transitions. [2018-12-31 18:24:03,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 18:24:03,050 INFO L276 IsEmpty]: Start isEmpty. Operand 50947 states and 184327 transitions. [2018-12-31 18:24:03,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-31 18:24:03,070 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:03,071 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:24:03,071 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:03,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:03,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1723497845, now seen corresponding path program 1 times [2018-12-31 18:24:03,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:03,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:03,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:03,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:03,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:03,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:03,427 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:24:03,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:03,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:24:03,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:24:03,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:24:03,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:24:03,429 INFO L87 Difference]: Start difference. First operand 50947 states and 184327 transitions. Second operand 7 states. [2018-12-31 18:24:08,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:08,411 INFO L93 Difference]: Finished difference Result 83876 states and 290140 transitions. [2018-12-31 18:24:08,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 18:24:08,412 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2018-12-31 18:24:08,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:08,622 INFO L225 Difference]: With dead ends: 83876 [2018-12-31 18:24:08,622 INFO L226 Difference]: Without dead ends: 83876 [2018-12-31 18:24:08,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-31 18:24:08,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83876 states. [2018-12-31 18:24:09,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83876 to 66523. [2018-12-31 18:24:09,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66523 states. [2018-12-31 18:24:10,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66523 states to 66523 states and 234927 transitions. [2018-12-31 18:24:10,148 INFO L78 Accepts]: Start accepts. Automaton has 66523 states and 234927 transitions. Word has length 55 [2018-12-31 18:24:10,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:10,149 INFO L480 AbstractCegarLoop]: Abstraction has 66523 states and 234927 transitions. [2018-12-31 18:24:10,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:24:10,149 INFO L276 IsEmpty]: Start isEmpty. Operand 66523 states and 234927 transitions. [2018-12-31 18:24:10,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-31 18:24:10,169 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:10,170 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:24:10,171 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:10,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:10,171 INFO L82 PathProgramCache]: Analyzing trace with hash -835994164, now seen corresponding path program 1 times [2018-12-31 18:24:10,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:10,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:10,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:10,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:10,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:10,333 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:24:10,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:10,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 18:24:10,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 18:24:10,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 18:24:10,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:24:10,335 INFO L87 Difference]: Start difference. First operand 66523 states and 234927 transitions. Second operand 3 states. [2018-12-31 18:24:11,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:11,336 INFO L93 Difference]: Finished difference Result 51865 states and 182888 transitions. [2018-12-31 18:24:11,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 18:24:11,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-12-31 18:24:11,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:11,475 INFO L225 Difference]: With dead ends: 51865 [2018-12-31 18:24:11,475 INFO L226 Difference]: Without dead ends: 51865 [2018-12-31 18:24:11,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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:24:11,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51865 states. [2018-12-31 18:24:12,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51865 to 51146. [2018-12-31 18:24:12,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51146 states. [2018-12-31 18:24:12,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51146 states to 51146 states and 180500 transitions. [2018-12-31 18:24:12,682 INFO L78 Accepts]: Start accepts. Automaton has 51146 states and 180500 transitions. Word has length 55 [2018-12-31 18:24:12,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:12,682 INFO L480 AbstractCegarLoop]: Abstraction has 51146 states and 180500 transitions. [2018-12-31 18:24:12,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 18:24:12,683 INFO L276 IsEmpty]: Start isEmpty. Operand 51146 states and 180500 transitions. [2018-12-31 18:24:12,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-31 18:24:12,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:12,694 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:24:12,694 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:12,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:12,694 INFO L82 PathProgramCache]: Analyzing trace with hash -557670517, now seen corresponding path program 1 times [2018-12-31 18:24:12,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:12,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:12,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:12,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:12,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:12,897 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:24:12,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:12,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:24:12,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:24:12,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:24:12,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:24:12,899 INFO L87 Difference]: Start difference. First operand 51146 states and 180500 transitions. Second operand 6 states. [2018-12-31 18:24:14,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:14,024 INFO L93 Difference]: Finished difference Result 90371 states and 318143 transitions. [2018-12-31 18:24:14,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 18:24:14,025 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-12-31 18:24:14,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:14,278 INFO L225 Difference]: With dead ends: 90371 [2018-12-31 18:24:14,278 INFO L226 Difference]: Without dead ends: 89795 [2018-12-31 18:24:14,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-31 18:24:14,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89795 states. [2018-12-31 18:24:16,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89795 to 51193. [2018-12-31 18:24:16,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51193 states. [2018-12-31 18:24:16,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51193 states to 51193 states and 181120 transitions. [2018-12-31 18:24:16,628 INFO L78 Accepts]: Start accepts. Automaton has 51193 states and 181120 transitions. Word has length 55 [2018-12-31 18:24:16,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:16,629 INFO L480 AbstractCegarLoop]: Abstraction has 51193 states and 181120 transitions. [2018-12-31 18:24:16,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:24:16,629 INFO L276 IsEmpty]: Start isEmpty. Operand 51193 states and 181120 transitions. [2018-12-31 18:24:16,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-31 18:24:16,640 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:16,640 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:24:16,640 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:16,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:16,641 INFO L82 PathProgramCache]: Analyzing trace with hash -399513608, now seen corresponding path program 1 times [2018-12-31 18:24:16,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:16,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:16,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:16,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:16,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:16,778 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:24:16,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:16,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:24:16,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:24:16,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:24:16,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:24:16,779 INFO L87 Difference]: Start difference. First operand 51193 states and 181120 transitions. Second operand 6 states. [2018-12-31 18:24:17,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:17,789 INFO L93 Difference]: Finished difference Result 101360 states and 349044 transitions. [2018-12-31 18:24:17,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 18:24:17,790 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-12-31 18:24:17,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:18,054 INFO L225 Difference]: With dead ends: 101360 [2018-12-31 18:24:18,055 INFO L226 Difference]: Without dead ends: 101360 [2018-12-31 18:24:18,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:24:18,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101360 states. [2018-12-31 18:24:19,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101360 to 71290. [2018-12-31 18:24:19,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71290 states. [2018-12-31 18:24:19,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71290 states to 71290 states and 248039 transitions. [2018-12-31 18:24:19,831 INFO L78 Accepts]: Start accepts. Automaton has 71290 states and 248039 transitions. Word has length 56 [2018-12-31 18:24:19,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:19,832 INFO L480 AbstractCegarLoop]: Abstraction has 71290 states and 248039 transitions. [2018-12-31 18:24:19,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:24:19,832 INFO L276 IsEmpty]: Start isEmpty. Operand 71290 states and 248039 transitions. [2018-12-31 18:24:19,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-31 18:24:19,845 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:19,845 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:24:19,845 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:19,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:19,846 INFO L82 PathProgramCache]: Analyzing trace with hash 487990073, now seen corresponding path program 1 times [2018-12-31 18:24:19,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:19,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:19,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:19,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:19,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:19,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:20,015 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:24:20,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:20,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:24:20,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:24:20,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:24:20,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:24:20,017 INFO L87 Difference]: Start difference. First operand 71290 states and 248039 transitions. Second operand 4 states. [2018-12-31 18:24:20,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:20,299 INFO L93 Difference]: Finished difference Result 15623 states and 48375 transitions. [2018-12-31 18:24:20,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 18:24:20,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-12-31 18:24:20,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:20,336 INFO L225 Difference]: With dead ends: 15623 [2018-12-31 18:24:20,336 INFO L226 Difference]: Without dead ends: 13805 [2018-12-31 18:24:20,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:24:20,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13805 states. [2018-12-31 18:24:20,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13805 to 13757. [2018-12-31 18:24:20,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13757 states. [2018-12-31 18:24:20,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13757 states to 13757 states and 42191 transitions. [2018-12-31 18:24:20,600 INFO L78 Accepts]: Start accepts. Automaton has 13757 states and 42191 transitions. Word has length 56 [2018-12-31 18:24:20,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:20,601 INFO L480 AbstractCegarLoop]: Abstraction has 13757 states and 42191 transitions. [2018-12-31 18:24:20,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:24:20,601 INFO L276 IsEmpty]: Start isEmpty. Operand 13757 states and 42191 transitions. [2018-12-31 18:24:20,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-31 18:24:20,605 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:20,605 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:24:20,606 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:20,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:20,606 INFO L82 PathProgramCache]: Analyzing trace with hash -3940633, now seen corresponding path program 1 times [2018-12-31 18:24:20,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:20,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:20,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:20,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:20,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:20,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:20,854 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:24:20,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:20,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:24:20,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:24:20,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:24:20,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:24:20,856 INFO L87 Difference]: Start difference. First operand 13757 states and 42191 transitions. Second operand 4 states. [2018-12-31 18:24:21,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:21,192 INFO L93 Difference]: Finished difference Result 15684 states and 48197 transitions. [2018-12-31 18:24:21,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 18:24:21,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-31 18:24:21,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:21,221 INFO L225 Difference]: With dead ends: 15684 [2018-12-31 18:24:21,221 INFO L226 Difference]: Without dead ends: 15684 [2018-12-31 18:24:21,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:24:21,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15684 states. [2018-12-31 18:24:21,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15684 to 14157. [2018-12-31 18:24:21,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14157 states. [2018-12-31 18:24:21,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14157 states to 14157 states and 43446 transitions. [2018-12-31 18:24:21,449 INFO L78 Accepts]: Start accepts. Automaton has 14157 states and 43446 transitions. Word has length 63 [2018-12-31 18:24:21,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:21,449 INFO L480 AbstractCegarLoop]: Abstraction has 14157 states and 43446 transitions. [2018-12-31 18:24:21,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:24:21,449 INFO L276 IsEmpty]: Start isEmpty. Operand 14157 states and 43446 transitions. [2018-12-31 18:24:21,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-31 18:24:21,454 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:21,454 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:24:21,454 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:21,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:21,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1738869702, now seen corresponding path program 1 times [2018-12-31 18:24:21,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:21,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:21,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:21,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:21,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:21,717 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:24:21,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:21,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 18:24:21,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 18:24:21,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 18:24:21,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:24:21,718 INFO L87 Difference]: Start difference. First operand 14157 states and 43446 transitions. Second operand 8 states. [2018-12-31 18:24:23,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:23,058 INFO L93 Difference]: Finished difference Result 19379 states and 58570 transitions. [2018-12-31 18:24:23,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 18:24:23,059 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2018-12-31 18:24:23,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:23,098 INFO L225 Difference]: With dead ends: 19379 [2018-12-31 18:24:23,098 INFO L226 Difference]: Without dead ends: 19308 [2018-12-31 18:24:23,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-12-31 18:24:23,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19308 states. [2018-12-31 18:24:23,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19308 to 16576. [2018-12-31 18:24:23,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16576 states. [2018-12-31 18:24:23,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16576 states to 16576 states and 50495 transitions. [2018-12-31 18:24:23,365 INFO L78 Accepts]: Start accepts. Automaton has 16576 states and 50495 transitions. Word has length 63 [2018-12-31 18:24:23,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:23,365 INFO L480 AbstractCegarLoop]: Abstraction has 16576 states and 50495 transitions. [2018-12-31 18:24:23,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 18:24:23,365 INFO L276 IsEmpty]: Start isEmpty. Operand 16576 states and 50495 transitions. [2018-12-31 18:24:23,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-31 18:24:23,373 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:23,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] [2018-12-31 18:24:23,373 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:23,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:23,374 INFO L82 PathProgramCache]: Analyzing trace with hash -955693609, now seen corresponding path program 1 times [2018-12-31 18:24:23,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:23,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:23,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:23,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:23,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:23,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:23,528 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:24:23,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:23,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 18:24:23,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 18:24:23,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 18:24:23,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:24:23,531 INFO L87 Difference]: Start difference. First operand 16576 states and 50495 transitions. Second operand 3 states. [2018-12-31 18:24:23,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:23,812 INFO L93 Difference]: Finished difference Result 19752 states and 60221 transitions. [2018-12-31 18:24:23,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 18:24:23,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-12-31 18:24:23,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:23,849 INFO L225 Difference]: With dead ends: 19752 [2018-12-31 18:24:23,849 INFO L226 Difference]: Without dead ends: 19752 [2018-12-31 18:24:23,849 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:24:23,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19752 states. [2018-12-31 18:24:24,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19752 to 19332. [2018-12-31 18:24:24,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19332 states. [2018-12-31 18:24:24,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19332 states to 19332 states and 58922 transitions. [2018-12-31 18:24:24,126 INFO L78 Accepts]: Start accepts. Automaton has 19332 states and 58922 transitions. Word has length 69 [2018-12-31 18:24:24,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:24,127 INFO L480 AbstractCegarLoop]: Abstraction has 19332 states and 58922 transitions. [2018-12-31 18:24:24,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 18:24:24,127 INFO L276 IsEmpty]: Start isEmpty. Operand 19332 states and 58922 transitions. [2018-12-31 18:24:24,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-31 18:24:24,135 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:24,136 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:24:24,136 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:24,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:24,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1728761431, now seen corresponding path program 1 times [2018-12-31 18:24:24,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:24,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:24,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:24,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:24,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:24,326 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:24:24,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:24,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:24:24,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:24:24,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:24:24,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:24:24,327 INFO L87 Difference]: Start difference. First operand 19332 states and 58922 transitions. Second operand 4 states. [2018-12-31 18:24:24,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:24,777 INFO L93 Difference]: Finished difference Result 24729 states and 74596 transitions. [2018-12-31 18:24:24,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 18:24:24,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2018-12-31 18:24:24,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:24,819 INFO L225 Difference]: With dead ends: 24729 [2018-12-31 18:24:24,819 INFO L226 Difference]: Without dead ends: 24729 [2018-12-31 18:24:24,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 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:24:24,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24729 states. [2018-12-31 18:24:25,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24729 to 21566. [2018-12-31 18:24:25,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21566 states. [2018-12-31 18:24:25,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21566 states to 21566 states and 65327 transitions. [2018-12-31 18:24:25,178 INFO L78 Accepts]: Start accepts. Automaton has 21566 states and 65327 transitions. Word has length 69 [2018-12-31 18:24:25,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:25,179 INFO L480 AbstractCegarLoop]: Abstraction has 21566 states and 65327 transitions. [2018-12-31 18:24:25,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:24:25,179 INFO L276 IsEmpty]: Start isEmpty. Operand 21566 states and 65327 transitions. [2018-12-31 18:24:25,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-31 18:24:25,191 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:25,191 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:24:25,191 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:25,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:25,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1321441384, now seen corresponding path program 1 times [2018-12-31 18:24:25,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:25,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:25,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:25,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:25,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:25,773 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:24:25,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:25,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:24:25,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:24:25,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:24:25,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:24:25,776 INFO L87 Difference]: Start difference. First operand 21566 states and 65327 transitions. Second operand 6 states. [2018-12-31 18:24:27,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:27,111 INFO L93 Difference]: Finished difference Result 26052 states and 77633 transitions. [2018-12-31 18:24:27,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 18:24:27,119 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-12-31 18:24:27,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:27,174 INFO L225 Difference]: With dead ends: 26052 [2018-12-31 18:24:27,174 INFO L226 Difference]: Without dead ends: 26052 [2018-12-31 18:24:27,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:24:27,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26052 states. [2018-12-31 18:24:27,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26052 to 24938. [2018-12-31 18:24:27,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24938 states. [2018-12-31 18:24:27,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24938 states to 24938 states and 74788 transitions. [2018-12-31 18:24:27,575 INFO L78 Accepts]: Start accepts. Automaton has 24938 states and 74788 transitions. Word has length 69 [2018-12-31 18:24:27,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:27,575 INFO L480 AbstractCegarLoop]: Abstraction has 24938 states and 74788 transitions. [2018-12-31 18:24:27,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:24:27,575 INFO L276 IsEmpty]: Start isEmpty. Operand 24938 states and 74788 transitions. [2018-12-31 18:24:27,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-31 18:24:27,589 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:27,589 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:24:27,589 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:27,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:27,590 INFO L82 PathProgramCache]: Analyzing trace with hash 896316569, now seen corresponding path program 1 times [2018-12-31 18:24:27,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:27,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:27,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:27,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:27,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:27,946 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-12-31 18:24:27,982 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:24:27,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:27,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:24:27,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:24:27,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:24:27,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:24:27,985 INFO L87 Difference]: Start difference. First operand 24938 states and 74788 transitions. Second operand 6 states. [2018-12-31 18:24:28,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:28,588 INFO L93 Difference]: Finished difference Result 28251 states and 82473 transitions. [2018-12-31 18:24:28,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 18:24:28,588 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-12-31 18:24:28,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:28,635 INFO L225 Difference]: With dead ends: 28251 [2018-12-31 18:24:28,635 INFO L226 Difference]: Without dead ends: 28251 [2018-12-31 18:24:28,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-31 18:24:28,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28251 states. [2018-12-31 18:24:28,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28251 to 25152. [2018-12-31 18:24:28,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25152 states. [2018-12-31 18:24:29,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25152 states to 25152 states and 74492 transitions. [2018-12-31 18:24:29,040 INFO L78 Accepts]: Start accepts. Automaton has 25152 states and 74492 transitions. Word has length 69 [2018-12-31 18:24:29,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:29,040 INFO L480 AbstractCegarLoop]: Abstraction has 25152 states and 74492 transitions. [2018-12-31 18:24:29,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:24:29,040 INFO L276 IsEmpty]: Start isEmpty. Operand 25152 states and 74492 transitions. [2018-12-31 18:24:29,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-31 18:24:29,055 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:29,055 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:24:29,055 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:29,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:29,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1107667482, now seen corresponding path program 1 times [2018-12-31 18:24:29,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:29,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:29,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:29,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:29,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:29,469 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:24:29,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:29,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:24:29,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:24:29,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:24:29,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:24:29,470 INFO L87 Difference]: Start difference. First operand 25152 states and 74492 transitions. Second operand 5 states. [2018-12-31 18:24:30,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:30,400 INFO L93 Difference]: Finished difference Result 29895 states and 87944 transitions. [2018-12-31 18:24:30,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 18:24:30,401 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-12-31 18:24:30,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:30,454 INFO L225 Difference]: With dead ends: 29895 [2018-12-31 18:24:30,455 INFO L226 Difference]: Without dead ends: 29895 [2018-12-31 18:24:30,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:24:30,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29895 states. [2018-12-31 18:24:30,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29895 to 27556. [2018-12-31 18:24:30,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27556 states. [2018-12-31 18:24:30,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27556 states to 27556 states and 81052 transitions. [2018-12-31 18:24:30,961 INFO L78 Accepts]: Start accepts. Automaton has 27556 states and 81052 transitions. Word has length 69 [2018-12-31 18:24:30,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:30,962 INFO L480 AbstractCegarLoop]: Abstraction has 27556 states and 81052 transitions. [2018-12-31 18:24:30,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:24:30,962 INFO L276 IsEmpty]: Start isEmpty. Operand 27556 states and 81052 transitions. [2018-12-31 18:24:30,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-31 18:24:30,973 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:30,973 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:24:30,973 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:30,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:30,974 INFO L82 PathProgramCache]: Analyzing trace with hash -2087321735, now seen corresponding path program 1 times [2018-12-31 18:24:30,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:30,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:30,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:30,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:30,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:30,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:31,188 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:24:31,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:31,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:24:31,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:24:31,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:24:31,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:24:31,190 INFO L87 Difference]: Start difference. First operand 27556 states and 81052 transitions. Second operand 7 states. [2018-12-31 18:24:32,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:32,041 INFO L93 Difference]: Finished difference Result 27314 states and 78217 transitions. [2018-12-31 18:24:32,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 18:24:32,042 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2018-12-31 18:24:32,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:32,086 INFO L225 Difference]: With dead ends: 27314 [2018-12-31 18:24:32,086 INFO L226 Difference]: Without dead ends: 27314 [2018-12-31 18:24:32,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-12-31 18:24:32,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27314 states. [2018-12-31 18:24:32,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27314 to 24927. [2018-12-31 18:24:32,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24927 states. [2018-12-31 18:24:32,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24927 states to 24927 states and 71599 transitions. [2018-12-31 18:24:32,429 INFO L78 Accepts]: Start accepts. Automaton has 24927 states and 71599 transitions. Word has length 69 [2018-12-31 18:24:32,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:32,430 INFO L480 AbstractCegarLoop]: Abstraction has 24927 states and 71599 transitions. [2018-12-31 18:24:32,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:24:32,430 INFO L276 IsEmpty]: Start isEmpty. Operand 24927 states and 71599 transitions. [2018-12-31 18:24:32,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-31 18:24:32,440 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:32,440 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:24:32,441 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:32,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:32,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1199818054, now seen corresponding path program 1 times [2018-12-31 18:24:32,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:32,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:32,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:32,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:32,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:32,614 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:24:32,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:32,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:24:32,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:24:32,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:24:32,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:24:32,616 INFO L87 Difference]: Start difference. First operand 24927 states and 71599 transitions. Second operand 5 states. [2018-12-31 18:24:32,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:32,673 INFO L93 Difference]: Finished difference Result 7463 states and 17981 transitions. [2018-12-31 18:24:32,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 18:24:32,674 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-12-31 18:24:32,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:32,682 INFO L225 Difference]: With dead ends: 7463 [2018-12-31 18:24:32,682 INFO L226 Difference]: Without dead ends: 6138 [2018-12-31 18:24:32,683 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:24:32,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6138 states. [2018-12-31 18:24:32,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6138 to 5532. [2018-12-31 18:24:32,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5532 states. [2018-12-31 18:24:32,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5532 states to 5532 states and 12870 transitions. [2018-12-31 18:24:32,745 INFO L78 Accepts]: Start accepts. Automaton has 5532 states and 12870 transitions. Word has length 69 [2018-12-31 18:24:32,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:32,745 INFO L480 AbstractCegarLoop]: Abstraction has 5532 states and 12870 transitions. [2018-12-31 18:24:32,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:24:32,746 INFO L276 IsEmpty]: Start isEmpty. Operand 5532 states and 12870 transitions. [2018-12-31 18:24:32,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-31 18:24:32,751 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:32,751 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:24:32,751 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:32,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:32,752 INFO L82 PathProgramCache]: Analyzing trace with hash 916580311, now seen corresponding path program 1 times [2018-12-31 18:24:32,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:32,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:32,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:32,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:32,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:32,821 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:24:32,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:32,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 18:24:32,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 18:24:32,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 18:24:32,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:24:32,822 INFO L87 Difference]: Start difference. First operand 5532 states and 12870 transitions. Second operand 3 states. [2018-12-31 18:24:32,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:32,874 INFO L93 Difference]: Finished difference Result 7168 states and 16476 transitions. [2018-12-31 18:24:32,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 18:24:32,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-12-31 18:24:32,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:32,884 INFO L225 Difference]: With dead ends: 7168 [2018-12-31 18:24:32,884 INFO L226 Difference]: Without dead ends: 7168 [2018-12-31 18:24:32,885 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:24:32,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7168 states. [2018-12-31 18:24:32,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7168 to 5471. [2018-12-31 18:24:32,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5471 states. [2018-12-31 18:24:32,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5471 states to 5471 states and 12410 transitions. [2018-12-31 18:24:32,949 INFO L78 Accepts]: Start accepts. Automaton has 5471 states and 12410 transitions. Word has length 69 [2018-12-31 18:24:32,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:32,950 INFO L480 AbstractCegarLoop]: Abstraction has 5471 states and 12410 transitions. [2018-12-31 18:24:32,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 18:24:32,950 INFO L276 IsEmpty]: Start isEmpty. Operand 5471 states and 12410 transitions. [2018-12-31 18:24:32,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-31 18:24:32,955 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:32,956 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:24:32,956 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:32,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:32,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1596601910, now seen corresponding path program 1 times [2018-12-31 18:24:32,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:32,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:32,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:32,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:32,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:32,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:33,060 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:24:33,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:33,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:24:33,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:24:33,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:24:33,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:24:33,062 INFO L87 Difference]: Start difference. First operand 5471 states and 12410 transitions. Second operand 5 states. [2018-12-31 18:24:33,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:33,255 INFO L93 Difference]: Finished difference Result 6625 states and 15015 transitions. [2018-12-31 18:24:33,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 18:24:33,256 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2018-12-31 18:24:33,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:33,265 INFO L225 Difference]: With dead ends: 6625 [2018-12-31 18:24:33,265 INFO L226 Difference]: Without dead ends: 6625 [2018-12-31 18:24:33,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 18:24:33,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6625 states. [2018-12-31 18:24:33,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6625 to 5915. [2018-12-31 18:24:33,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5915 states. [2018-12-31 18:24:33,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5915 states to 5915 states and 13414 transitions. [2018-12-31 18:24:33,339 INFO L78 Accepts]: Start accepts. Automaton has 5915 states and 13414 transitions. Word has length 75 [2018-12-31 18:24:33,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:33,339 INFO L480 AbstractCegarLoop]: Abstraction has 5915 states and 13414 transitions. [2018-12-31 18:24:33,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:24:33,339 INFO L276 IsEmpty]: Start isEmpty. Operand 5915 states and 13414 transitions. [2018-12-31 18:24:33,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-31 18:24:33,346 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:33,346 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:24:33,347 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:33,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:33,347 INFO L82 PathProgramCache]: Analyzing trace with hash 146208425, now seen corresponding path program 1 times [2018-12-31 18:24:33,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:33,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:33,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:33,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:33,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:33,528 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:24:33,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:33,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:24:33,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:24:33,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:24:33,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:24:33,530 INFO L87 Difference]: Start difference. First operand 5915 states and 13414 transitions. Second operand 7 states. [2018-12-31 18:24:36,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:36,324 INFO L93 Difference]: Finished difference Result 6842 states and 15342 transitions. [2018-12-31 18:24:36,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 18:24:36,326 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2018-12-31 18:24:36,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:36,335 INFO L225 Difference]: With dead ends: 6842 [2018-12-31 18:24:36,335 INFO L226 Difference]: Without dead ends: 6740 [2018-12-31 18:24:36,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-31 18:24:36,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6740 states. [2018-12-31 18:24:36,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6740 to 6012. [2018-12-31 18:24:36,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6012 states. [2018-12-31 18:24:36,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6012 states to 6012 states and 13507 transitions. [2018-12-31 18:24:36,409 INFO L78 Accepts]: Start accepts. Automaton has 6012 states and 13507 transitions. Word has length 75 [2018-12-31 18:24:36,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:36,409 INFO L480 AbstractCegarLoop]: Abstraction has 6012 states and 13507 transitions. [2018-12-31 18:24:36,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:24:36,410 INFO L276 IsEmpty]: Start isEmpty. Operand 6012 states and 13507 transitions. [2018-12-31 18:24:36,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:24:36,417 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:36,417 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:24:36,417 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:36,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:36,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1408908402, now seen corresponding path program 1 times [2018-12-31 18:24:36,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:36,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:36,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:36,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:36,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:36,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:37,248 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2018-12-31 18:24:37,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:24:37,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:37,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:24:37,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:24:37,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:24:37,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:24:37,275 INFO L87 Difference]: Start difference. First operand 6012 states and 13507 transitions. Second operand 7 states. [2018-12-31 18:24:38,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:38,680 INFO L93 Difference]: Finished difference Result 7492 states and 16836 transitions. [2018-12-31 18:24:38,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 18:24:38,682 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-31 18:24:38,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:38,691 INFO L225 Difference]: With dead ends: 7492 [2018-12-31 18:24:38,691 INFO L226 Difference]: Without dead ends: 7492 [2018-12-31 18:24:38,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:24:38,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7492 states. [2018-12-31 18:24:38,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7492 to 6152. [2018-12-31 18:24:38,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6152 states. [2018-12-31 18:24:38,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6152 states to 6152 states and 13895 transitions. [2018-12-31 18:24:38,771 INFO L78 Accepts]: Start accepts. Automaton has 6152 states and 13895 transitions. Word has length 96 [2018-12-31 18:24:38,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:38,772 INFO L480 AbstractCegarLoop]: Abstraction has 6152 states and 13895 transitions. [2018-12-31 18:24:38,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:24:38,772 INFO L276 IsEmpty]: Start isEmpty. Operand 6152 states and 13895 transitions. [2018-12-31 18:24:38,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:24:38,780 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:38,781 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:24:38,781 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:38,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:38,781 INFO L82 PathProgramCache]: Analyzing trace with hash -424461199, now seen corresponding path program 1 times [2018-12-31 18:24:38,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:38,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:38,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:38,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:38,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:38,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:38,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:24:38,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:38,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:24:38,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:24:38,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:24:38,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:24:38,983 INFO L87 Difference]: Start difference. First operand 6152 states and 13895 transitions. Second operand 4 states. [2018-12-31 18:24:39,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:39,100 INFO L93 Difference]: Finished difference Result 7319 states and 16393 transitions. [2018-12-31 18:24:39,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 18:24:39,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-12-31 18:24:39,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:39,109 INFO L225 Difference]: With dead ends: 7319 [2018-12-31 18:24:39,110 INFO L226 Difference]: Without dead ends: 7319 [2018-12-31 18:24:39,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:24:39,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7319 states. [2018-12-31 18:24:39,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7319 to 6509. [2018-12-31 18:24:39,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6509 states. [2018-12-31 18:24:39,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6509 states to 6509 states and 14665 transitions. [2018-12-31 18:24:39,193 INFO L78 Accepts]: Start accepts. Automaton has 6509 states and 14665 transitions. Word has length 96 [2018-12-31 18:24:39,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:39,193 INFO L480 AbstractCegarLoop]: Abstraction has 6509 states and 14665 transitions. [2018-12-31 18:24:39,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:24:39,194 INFO L276 IsEmpty]: Start isEmpty. Operand 6509 states and 14665 transitions. [2018-12-31 18:24:39,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 18:24:39,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:39,204 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:24:39,204 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:39,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:39,204 INFO L82 PathProgramCache]: Analyzing trace with hash 2041064747, now seen corresponding path program 1 times [2018-12-31 18:24:39,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:39,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:39,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:39,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:39,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:39,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:39,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:24:39,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:39,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:24:39,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:24:39,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:24:39,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:24:39,542 INFO L87 Difference]: Start difference. First operand 6509 states and 14665 transitions. Second operand 5 states. [2018-12-31 18:24:39,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:39,737 INFO L93 Difference]: Finished difference Result 7016 states and 15753 transitions. [2018-12-31 18:24:39,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 18:24:39,738 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2018-12-31 18:24:39,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:39,747 INFO L225 Difference]: With dead ends: 7016 [2018-12-31 18:24:39,747 INFO L226 Difference]: Without dead ends: 7016 [2018-12-31 18:24:39,747 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:24:39,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7016 states. [2018-12-31 18:24:39,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7016 to 5405. [2018-12-31 18:24:39,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5405 states. [2018-12-31 18:24:39,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5405 states to 5405 states and 12181 transitions. [2018-12-31 18:24:39,815 INFO L78 Accepts]: Start accepts. Automaton has 5405 states and 12181 transitions. Word has length 98 [2018-12-31 18:24:39,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:39,815 INFO L480 AbstractCegarLoop]: Abstraction has 5405 states and 12181 transitions. [2018-12-31 18:24:39,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:24:39,815 INFO L276 IsEmpty]: Start isEmpty. Operand 5405 states and 12181 transitions. [2018-12-31 18:24:39,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 18:24:39,821 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:39,821 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:24:39,821 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:39,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:39,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1903102612, now seen corresponding path program 1 times [2018-12-31 18:24:39,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:39,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:39,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:39,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:39,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:40,014 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:24:40,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:40,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:24:40,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:24:40,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:24:40,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:24:40,016 INFO L87 Difference]: Start difference. First operand 5405 states and 12181 transitions. Second operand 4 states. [2018-12-31 18:24:40,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:40,287 INFO L93 Difference]: Finished difference Result 6953 states and 15553 transitions. [2018-12-31 18:24:40,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 18:24:40,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-12-31 18:24:40,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:40,298 INFO L225 Difference]: With dead ends: 6953 [2018-12-31 18:24:40,299 INFO L226 Difference]: Without dead ends: 6886 [2018-12-31 18:24:40,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:24:40,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6886 states. [2018-12-31 18:24:40,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6886 to 6454. [2018-12-31 18:24:40,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6454 states. [2018-12-31 18:24:40,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6454 states to 6454 states and 14500 transitions. [2018-12-31 18:24:40,380 INFO L78 Accepts]: Start accepts. Automaton has 6454 states and 14500 transitions. Word has length 98 [2018-12-31 18:24:40,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:40,380 INFO L480 AbstractCegarLoop]: Abstraction has 6454 states and 14500 transitions. [2018-12-31 18:24:40,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:24:40,380 INFO L276 IsEmpty]: Start isEmpty. Operand 6454 states and 14500 transitions. [2018-12-31 18:24:40,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 18:24:40,391 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:40,391 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:24:40,391 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:40,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:40,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1872082805, now seen corresponding path program 1 times [2018-12-31 18:24:40,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:40,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:40,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:40,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:40,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:40,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:40,666 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:24:40,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:40,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 18:24:40,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 18:24:40,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 18:24:40,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-31 18:24:40,667 INFO L87 Difference]: Start difference. First operand 6454 states and 14500 transitions. Second operand 9 states. [2018-12-31 18:24:41,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:41,436 INFO L93 Difference]: Finished difference Result 8235 states and 18257 transitions. [2018-12-31 18:24:41,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-31 18:24:41,437 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2018-12-31 18:24:41,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:41,447 INFO L225 Difference]: With dead ends: 8235 [2018-12-31 18:24:41,447 INFO L226 Difference]: Without dead ends: 8235 [2018-12-31 18:24:41,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2018-12-31 18:24:41,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8235 states. [2018-12-31 18:24:41,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8235 to 7030. [2018-12-31 18:24:41,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7030 states. [2018-12-31 18:24:41,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7030 states to 7030 states and 15670 transitions. [2018-12-31 18:24:41,533 INFO L78 Accepts]: Start accepts. Automaton has 7030 states and 15670 transitions. Word has length 98 [2018-12-31 18:24:41,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:41,533 INFO L480 AbstractCegarLoop]: Abstraction has 7030 states and 15670 transitions. [2018-12-31 18:24:41,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 18:24:41,533 INFO L276 IsEmpty]: Start isEmpty. Operand 7030 states and 15670 transitions. [2018-12-31 18:24:41,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 18:24:41,541 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:41,541 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:24:41,541 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:41,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:41,542 INFO L82 PathProgramCache]: Analyzing trace with hash 384828202, now seen corresponding path program 1 times [2018-12-31 18:24:41,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:41,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:41,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:41,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:41,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:41,829 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:24:41,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:41,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-31 18:24:41,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-31 18:24:41,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-31 18:24:41,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-12-31 18:24:41,833 INFO L87 Difference]: Start difference. First operand 7030 states and 15670 transitions. Second operand 13 states. [2018-12-31 18:24:43,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:43,100 INFO L93 Difference]: Finished difference Result 10125 states and 22304 transitions. [2018-12-31 18:24:43,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-31 18:24:43,102 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 98 [2018-12-31 18:24:43,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:43,113 INFO L225 Difference]: With dead ends: 10125 [2018-12-31 18:24:43,114 INFO L226 Difference]: Without dead ends: 10125 [2018-12-31 18:24:43,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2018-12-31 18:24:43,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10125 states. [2018-12-31 18:24:43,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10125 to 7185. [2018-12-31 18:24:43,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7185 states. [2018-12-31 18:24:43,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7185 states to 7185 states and 16014 transitions. [2018-12-31 18:24:43,212 INFO L78 Accepts]: Start accepts. Automaton has 7185 states and 16014 transitions. Word has length 98 [2018-12-31 18:24:43,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:43,213 INFO L480 AbstractCegarLoop]: Abstraction has 7185 states and 16014 transitions. [2018-12-31 18:24:43,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-31 18:24:43,213 INFO L276 IsEmpty]: Start isEmpty. Operand 7185 states and 16014 transitions. [2018-12-31 18:24:43,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 18:24:43,221 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:43,222 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:24:43,222 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:43,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:43,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1272331883, now seen corresponding path program 1 times [2018-12-31 18:24:43,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:43,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:43,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:43,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:43,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:43,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:43,421 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-31 18:24:43,494 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:24:43,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:43,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 18:24:43,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 18:24:43,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 18:24:43,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-31 18:24:43,496 INFO L87 Difference]: Start difference. First operand 7185 states and 16014 transitions. Second operand 9 states. [2018-12-31 18:24:44,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:44,411 INFO L93 Difference]: Finished difference Result 11538 states and 25666 transitions. [2018-12-31 18:24:44,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 18:24:44,412 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2018-12-31 18:24:44,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:44,425 INFO L225 Difference]: With dead ends: 11538 [2018-12-31 18:24:44,425 INFO L226 Difference]: Without dead ends: 8214 [2018-12-31 18:24:44,426 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:24:44,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8214 states. [2018-12-31 18:24:44,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8214 to 7242. [2018-12-31 18:24:44,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7242 states. [2018-12-31 18:24:44,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7242 states to 7242 states and 16131 transitions. [2018-12-31 18:24:44,515 INFO L78 Accepts]: Start accepts. Automaton has 7242 states and 16131 transitions. Word has length 98 [2018-12-31 18:24:44,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:44,516 INFO L480 AbstractCegarLoop]: Abstraction has 7242 states and 16131 transitions. [2018-12-31 18:24:44,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 18:24:44,516 INFO L276 IsEmpty]: Start isEmpty. Operand 7242 states and 16131 transitions. [2018-12-31 18:24:44,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 18:24:44,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:44,524 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:24:44,525 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:44,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:44,525 INFO L82 PathProgramCache]: Analyzing trace with hash -758819565, now seen corresponding path program 1 times [2018-12-31 18:24:44,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:44,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:44,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:44,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:44,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:45,006 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-12-31 18:24:45,461 WARN L181 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2018-12-31 18:24:45,472 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:24:45,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:45,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:24:45,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:24:45,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:24:45,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:24:45,473 INFO L87 Difference]: Start difference. First operand 7242 states and 16131 transitions. Second operand 6 states. [2018-12-31 18:24:45,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:45,719 INFO L93 Difference]: Finished difference Result 8205 states and 18021 transitions. [2018-12-31 18:24:45,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 18:24:45,720 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2018-12-31 18:24:45,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:45,729 INFO L225 Difference]: With dead ends: 8205 [2018-12-31 18:24:45,729 INFO L226 Difference]: Without dead ends: 8157 [2018-12-31 18:24:45,730 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:24:45,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8157 states. [2018-12-31 18:24:45,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8157 to 7230. [2018-12-31 18:24:45,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7230 states. [2018-12-31 18:24:45,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7230 states to 7230 states and 15941 transitions. [2018-12-31 18:24:45,817 INFO L78 Accepts]: Start accepts. Automaton has 7230 states and 15941 transitions. Word has length 98 [2018-12-31 18:24:45,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:45,818 INFO L480 AbstractCegarLoop]: Abstraction has 7230 states and 15941 transitions. [2018-12-31 18:24:45,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:24:45,818 INFO L276 IsEmpty]: Start isEmpty. Operand 7230 states and 15941 transitions. [2018-12-31 18:24:45,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 18:24:45,826 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:45,826 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:24:45,827 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:45,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:45,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1510408459, now seen corresponding path program 2 times [2018-12-31 18:24:45,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:45,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:45,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:45,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:45,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:45,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:46,326 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:24:46,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:46,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:24:46,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:24:46,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:24:46,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:24:46,328 INFO L87 Difference]: Start difference. First operand 7230 states and 15941 transitions. Second operand 6 states. [2018-12-31 18:24:46,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:46,757 INFO L93 Difference]: Finished difference Result 7459 states and 16369 transitions. [2018-12-31 18:24:46,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 18:24:46,759 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2018-12-31 18:24:46,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:46,768 INFO L225 Difference]: With dead ends: 7459 [2018-12-31 18:24:46,768 INFO L226 Difference]: Without dead ends: 7459 [2018-12-31 18:24:46,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:24:46,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7459 states. [2018-12-31 18:24:46,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7459 to 7036. [2018-12-31 18:24:46,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7036 states. [2018-12-31 18:24:46,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7036 states to 7036 states and 15501 transitions. [2018-12-31 18:24:46,851 INFO L78 Accepts]: Start accepts. Automaton has 7036 states and 15501 transitions. Word has length 98 [2018-12-31 18:24:46,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:46,852 INFO L480 AbstractCegarLoop]: Abstraction has 7036 states and 15501 transitions. [2018-12-31 18:24:46,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:24:46,852 INFO L276 IsEmpty]: Start isEmpty. Operand 7036 states and 15501 transitions. [2018-12-31 18:24:46,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 18:24:46,860 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:46,860 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:24:46,861 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:46,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:46,861 INFO L82 PathProgramCache]: Analyzing trace with hash -634746318, now seen corresponding path program 2 times [2018-12-31 18:24:46,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:46,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:46,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:46,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 18:24:46,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:46,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:47,521 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:24:47,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:47,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 18:24:47,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 18:24:47,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 18:24:47,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:24:47,522 INFO L87 Difference]: Start difference. First operand 7036 states and 15501 transitions. Second operand 8 states. [2018-12-31 18:24:47,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:47,937 INFO L93 Difference]: Finished difference Result 8686 states and 19048 transitions. [2018-12-31 18:24:47,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 18:24:47,939 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 98 [2018-12-31 18:24:47,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:47,949 INFO L225 Difference]: With dead ends: 8686 [2018-12-31 18:24:47,950 INFO L226 Difference]: Without dead ends: 8601 [2018-12-31 18:24:47,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2018-12-31 18:24:47,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8601 states. [2018-12-31 18:24:48,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8601 to 7130. [2018-12-31 18:24:48,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7130 states. [2018-12-31 18:24:48,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7130 states to 7130 states and 15720 transitions. [2018-12-31 18:24:48,042 INFO L78 Accepts]: Start accepts. Automaton has 7130 states and 15720 transitions. Word has length 98 [2018-12-31 18:24:48,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:48,043 INFO L480 AbstractCegarLoop]: Abstraction has 7130 states and 15720 transitions. [2018-12-31 18:24:48,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 18:24:48,043 INFO L276 IsEmpty]: Start isEmpty. Operand 7130 states and 15720 transitions. [2018-12-31 18:24:48,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 18:24:48,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:48,056 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:24:48,056 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:48,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:48,057 INFO L82 PathProgramCache]: Analyzing trace with hash 252757363, now seen corresponding path program 2 times [2018-12-31 18:24:48,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:48,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:48,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:48,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 18:24:48,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:48,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:48,476 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 6 [2018-12-31 18:24:48,513 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:24:48,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:48,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 18:24:48,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 18:24:48,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 18:24:48,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-31 18:24:48,514 INFO L87 Difference]: Start difference. First operand 7130 states and 15720 transitions. Second operand 9 states. [2018-12-31 18:24:48,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:48,712 INFO L93 Difference]: Finished difference Result 10451 states and 23127 transitions. [2018-12-31 18:24:48,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 18:24:48,713 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2018-12-31 18:24:48,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:48,723 INFO L225 Difference]: With dead ends: 10451 [2018-12-31 18:24:48,723 INFO L226 Difference]: Without dead ends: 7311 [2018-12-31 18:24:48,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-12-31 18:24:48,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7311 states. [2018-12-31 18:24:48,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7311 to 6104. [2018-12-31 18:24:48,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6104 states. [2018-12-31 18:24:48,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6104 states to 6104 states and 13456 transitions. [2018-12-31 18:24:48,798 INFO L78 Accepts]: Start accepts. Automaton has 6104 states and 13456 transitions. Word has length 98 [2018-12-31 18:24:48,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:48,798 INFO L480 AbstractCegarLoop]: Abstraction has 6104 states and 13456 transitions. [2018-12-31 18:24:48,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 18:24:48,798 INFO L276 IsEmpty]: Start isEmpty. Operand 6104 states and 13456 transitions. [2018-12-31 18:24:48,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 18:24:48,806 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:48,806 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:24:48,807 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:48,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:48,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1703474547, now seen corresponding path program 3 times [2018-12-31 18:24:48,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:48,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:48,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:48,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 18:24:48,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:48,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:49,006 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-31 18:24:49,174 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-31 18:24:49,524 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 6 [2018-12-31 18:24:49,561 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:24:49,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:49,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 18:24:49,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 18:24:49,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 18:24:49,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-31 18:24:49,562 INFO L87 Difference]: Start difference. First operand 6104 states and 13456 transitions. Second operand 9 states. [2018-12-31 18:24:50,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:50,014 INFO L93 Difference]: Finished difference Result 9349 states and 20725 transitions. [2018-12-31 18:24:50,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 18:24:50,016 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2018-12-31 18:24:50,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:50,024 INFO L225 Difference]: With dead ends: 9349 [2018-12-31 18:24:50,024 INFO L226 Difference]: Without dead ends: 7405 [2018-12-31 18:24:50,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-12-31 18:24:50,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7405 states. [2018-12-31 18:24:50,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7405 to 6171. [2018-12-31 18:24:50,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6171 states. [2018-12-31 18:24:50,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6171 states to 6171 states and 13595 transitions. [2018-12-31 18:24:50,093 INFO L78 Accepts]: Start accepts. Automaton has 6171 states and 13595 transitions. Word has length 98 [2018-12-31 18:24:50,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:50,093 INFO L480 AbstractCegarLoop]: Abstraction has 6171 states and 13595 transitions. [2018-12-31 18:24:50,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 18:24:50,093 INFO L276 IsEmpty]: Start isEmpty. Operand 6171 states and 13595 transitions. [2018-12-31 18:24:50,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 18:24:50,100 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:50,100 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:24:50,101 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:50,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:50,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1378494059, now seen corresponding path program 4 times [2018-12-31 18:24:50,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:50,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:50,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:50,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 18:24:50,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:50,329 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:24:50,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:50,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-31 18:24:50,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 18:24:50,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 18:24:50,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-31 18:24:50,330 INFO L87 Difference]: Start difference. First operand 6171 states and 13595 transitions. Second operand 11 states. [2018-12-31 18:24:52,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:52,314 INFO L93 Difference]: Finished difference Result 11646 states and 25752 transitions. [2018-12-31 18:24:52,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-31 18:24:52,316 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 98 [2018-12-31 18:24:52,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:52,327 INFO L225 Difference]: With dead ends: 11646 [2018-12-31 18:24:52,327 INFO L226 Difference]: Without dead ends: 7931 [2018-12-31 18:24:52,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2018-12-31 18:24:52,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7931 states. [2018-12-31 18:24:52,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7931 to 6106. [2018-12-31 18:24:52,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6106 states. [2018-12-31 18:24:52,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6106 states to 6106 states and 13386 transitions. [2018-12-31 18:24:52,410 INFO L78 Accepts]: Start accepts. Automaton has 6106 states and 13386 transitions. Word has length 98 [2018-12-31 18:24:52,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:52,410 INFO L480 AbstractCegarLoop]: Abstraction has 6106 states and 13386 transitions. [2018-12-31 18:24:52,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 18:24:52,410 INFO L276 IsEmpty]: Start isEmpty. Operand 6106 states and 13386 transitions. [2018-12-31 18:24:52,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 18:24:52,418 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:52,418 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:24:52,418 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:52,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:52,419 INFO L82 PathProgramCache]: Analyzing trace with hash 735273941, now seen corresponding path program 1 times [2018-12-31 18:24:52,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:52,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:52,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:52,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 18:24:52,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:52,606 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:24:52,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:52,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:24:52,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:24:52,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:24:52,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:24:52,608 INFO L87 Difference]: Start difference. First operand 6106 states and 13386 transitions. Second operand 7 states. [2018-12-31 18:24:53,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:53,007 INFO L93 Difference]: Finished difference Result 6371 states and 13902 transitions. [2018-12-31 18:24:53,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 18:24:53,009 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2018-12-31 18:24:53,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:53,017 INFO L225 Difference]: With dead ends: 6371 [2018-12-31 18:24:53,017 INFO L226 Difference]: Without dead ends: 6371 [2018-12-31 18:24:53,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-12-31 18:24:53,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6371 states. [2018-12-31 18:24:53,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6371 to 5998. [2018-12-31 18:24:53,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5998 states. [2018-12-31 18:24:53,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5998 states to 5998 states and 13146 transitions. [2018-12-31 18:24:53,087 INFO L78 Accepts]: Start accepts. Automaton has 5998 states and 13146 transitions. Word has length 98 [2018-12-31 18:24:53,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:53,088 INFO L480 AbstractCegarLoop]: Abstraction has 5998 states and 13146 transitions. [2018-12-31 18:24:53,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:24:53,088 INFO L276 IsEmpty]: Start isEmpty. Operand 5998 states and 13146 transitions. [2018-12-31 18:24:53,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 18:24:53,095 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:53,095 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:24:53,096 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:53,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:53,096 INFO L82 PathProgramCache]: Analyzing trace with hash -506237266, now seen corresponding path program 1 times [2018-12-31 18:24:53,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:53,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:53,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:53,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:53,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:53,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:53,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:24:53,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:53,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:24:53,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:24:53,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:24:53,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:24:53,584 INFO L87 Difference]: Start difference. First operand 5998 states and 13146 transitions. Second operand 7 states. [2018-12-31 18:24:54,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:54,306 INFO L93 Difference]: Finished difference Result 8278 states and 17954 transitions. [2018-12-31 18:24:54,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 18:24:54,308 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2018-12-31 18:24:54,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:54,318 INFO L225 Difference]: With dead ends: 8278 [2018-12-31 18:24:54,318 INFO L226 Difference]: Without dead ends: 8199 [2018-12-31 18:24:54,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-12-31 18:24:54,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8199 states. [2018-12-31 18:24:54,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8199 to 6248. [2018-12-31 18:24:54,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6248 states. [2018-12-31 18:24:54,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6248 states to 6248 states and 13709 transitions. [2018-12-31 18:24:54,402 INFO L78 Accepts]: Start accepts. Automaton has 6248 states and 13709 transitions. Word has length 98 [2018-12-31 18:24:54,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:54,402 INFO L480 AbstractCegarLoop]: Abstraction has 6248 states and 13709 transitions. [2018-12-31 18:24:54,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:24:54,402 INFO L276 IsEmpty]: Start isEmpty. Operand 6248 states and 13709 transitions. [2018-12-31 18:24:54,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 18:24:54,410 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:54,410 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:24:54,411 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:54,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:54,411 INFO L82 PathProgramCache]: Analyzing trace with hash 738527215, now seen corresponding path program 5 times [2018-12-31 18:24:54,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:54,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:54,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:54,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:54,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 18:24:54,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 18:24:54,514 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 18:24:54,707 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-31 18:24:54,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 06:24:54 BasicIcfg [2018-12-31 18:24:54,712 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 18:24:54,712 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 18:24:54,713 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 18:24:54,713 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 18:24:54,713 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 06:23:43" (3/4) ... [2018-12-31 18:24:54,719 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 18:24:54,928 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 18:24:54,929 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 18:24:54,930 INFO L168 Benchmark]: Toolchain (without parser) took 73823.04 ms. Allocated memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: 4.0 GB). Free memory was 951.4 MB in the beginning and 3.7 GB in the end (delta: -2.7 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-12-31 18:24:54,931 INFO L168 Benchmark]: CDTParser took 0.17 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:24:54,931 INFO L168 Benchmark]: CACSL2BoogieTranslator took 908.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -143.9 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. [2018-12-31 18:24:54,931 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.71 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-31 18:24:54,934 INFO L168 Benchmark]: Boogie Preprocessor took 57.84 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:24:54,935 INFO L168 Benchmark]: RCFGBuilder took 1314.82 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: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 11.5 GB. [2018-12-31 18:24:54,935 INFO L168 Benchmark]: TraceAbstraction took 71226.02 ms. Allocated memory was 1.1 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 1.0 GB in the beginning and 3.7 GB in the end (delta: -2.7 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-12-31 18:24:54,935 INFO L168 Benchmark]: Witness Printer took 216.59 ms. Allocated memory is still 5.0 GB. Free memory was 3.7 GB in the beginning and 3.7 GB in the end (delta: 61.3 MB). Peak memory consumption was 61.3 MB. Max. memory is 11.5 GB. [2018-12-31 18:24:54,941 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.17 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 908.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -143.9 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 92.71 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 57.84 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 1314.82 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: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 71226.02 ms. Allocated memory was 1.1 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 1.0 GB in the beginning and 3.7 GB in the end (delta: -2.7 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 216.59 ms. Allocated memory is still 5.0 GB. Free memory was 3.7 GB in the beginning and 3.7 GB in the end (delta: 61.3 MB). Peak memory consumption was 61.3 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 t247; 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(&t247, ((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 t248; 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(&t248, ((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] [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 [L730] 0 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [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] [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] 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=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, 71.0s OverallTime, 37 OverallIterations, 1 TraceHistogramMax, 37.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10044 SDtfs, 12724 SDslu, 26024 SDs, 0 SdLazy, 11593 SolverSat, 574 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 425 GetRequests, 93 SyntacticMatches, 40 SemanticMatches, 292 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 13.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71290occurred in iteration=8, 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: 18.5s AutomataMinimizationTime, 36 MinimizatonAttempts, 186189 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 2853 NumberOfCodeBlocks, 2853 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2719 ConstructedInterpolants, 0 QuantifiedInterpolants, 649664 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 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...