./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix034_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/mix034_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 733010b35f918d0990e31a17ab22e11c586e389b ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 20:34:41,887 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 20:34:41,889 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 20:34:41,902 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 20:34:41,902 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 20:34:41,904 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 20:34:41,905 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 20:34:41,907 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 20:34:41,909 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 20:34:41,910 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 20:34:41,911 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 20:34:41,912 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 20:34:41,912 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 20:34:41,914 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 20:34:41,915 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 20:34:41,916 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 20:34:41,917 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 20:34:41,919 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 20:34:41,922 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 20:34:41,923 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 20:34:41,925 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 20:34:41,926 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 20:34:41,929 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 20:34:41,929 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 20:34:41,930 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 20:34:41,931 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 20:34:41,932 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 20:34:41,933 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 20:34:41,934 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 20:34:41,936 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 20:34:41,936 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 20:34:41,937 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 20:34:41,937 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 20:34:41,937 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 20:34:41,939 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 20:34:41,940 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 20:34:41,940 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 20:34:41,967 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 20:34:41,967 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 20:34:41,968 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 20:34:41,968 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 20:34:41,969 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 20:34:41,969 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 20:34:41,970 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 20:34:41,970 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 20:34:41,970 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 20:34:41,970 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 20:34:41,970 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 20:34:41,971 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 20:34:41,972 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 20:34:41,972 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 20:34:41,972 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 20:34:41,972 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 20:34:41,972 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 20:34:41,973 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 20:34:41,973 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 20:34:41,973 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 20:34:41,973 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 20:34:41,973 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 20:34:41,974 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 20:34:41,975 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 20:34:41,975 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 20:34:41,975 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 20:34:41,976 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 20:34:41,976 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 20:34:41,976 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 -> 733010b35f918d0990e31a17ab22e11c586e389b [2018-12-31 20:34:42,028 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 20:34:42,043 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 20:34:42,049 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 20:34:42,051 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 20:34:42,052 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 20:34:42,052 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix034_pso.oepc_false-unreach-call.i [2018-12-31 20:34:42,117 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc676efce/d6f7f0d715454588bde258a3f0e89fa5/FLAG1b2975c16 [2018-12-31 20:34:42,765 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 20:34:42,766 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix034_pso.oepc_false-unreach-call.i [2018-12-31 20:34:42,785 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc676efce/d6f7f0d715454588bde258a3f0e89fa5/FLAG1b2975c16 [2018-12-31 20:34:43,128 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc676efce/d6f7f0d715454588bde258a3f0e89fa5 [2018-12-31 20:34:43,133 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 20:34:43,134 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 20:34:43,135 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 20:34:43,136 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 20:34:43,139 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 20:34:43,140 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 08:34:43" (1/1) ... [2018-12-31 20:34:43,144 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50395196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:34:43, skipping insertion in model container [2018-12-31 20:34:43,145 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 08:34:43" (1/1) ... [2018-12-31 20:34:43,153 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 20:34:43,220 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 20:34:43,774 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 20:34:43,794 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 20:34:43,991 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 20:34:44,073 INFO L195 MainTranslator]: Completed translation [2018-12-31 20:34:44,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:34:44 WrapperNode [2018-12-31 20:34:44,074 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 20:34:44,075 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 20:34:44,075 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 20:34:44,075 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 20:34:44,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:34:44" (1/1) ... [2018-12-31 20:34:44,114 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:34:44" (1/1) ... [2018-12-31 20:34:44,170 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 20:34:44,171 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 20:34:44,171 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 20:34:44,171 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 20:34:44,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:34:44" (1/1) ... [2018-12-31 20:34:44,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:34:44" (1/1) ... [2018-12-31 20:34:44,190 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:34:44" (1/1) ... [2018-12-31 20:34:44,191 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:34:44" (1/1) ... [2018-12-31 20:34:44,204 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:34:44" (1/1) ... [2018-12-31 20:34:44,209 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:34:44" (1/1) ... [2018-12-31 20:34:44,213 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:34:44" (1/1) ... [2018-12-31 20:34:44,218 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 20:34:44,219 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 20:34:44,225 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 20:34:44,225 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 20:34:44,226 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:34:44" (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 20:34:44,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 20:34:44,301 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-31 20:34:44,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 20:34:44,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 20:34:44,302 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-31 20:34:44,302 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-31 20:34:44,302 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-31 20:34:44,303 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-31 20:34:44,304 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-31 20:34:44,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 20:34:44,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 20:34:44,305 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 20:34:45,494 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 20:34:45,495 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-31 20:34:45,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 08:34:45 BoogieIcfgContainer [2018-12-31 20:34:45,497 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 20:34:45,498 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 20:34:45,498 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 20:34:45,502 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 20:34:45,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 08:34:43" (1/3) ... [2018-12-31 20:34:45,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d4c82fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 08:34:45, skipping insertion in model container [2018-12-31 20:34:45,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:34:44" (2/3) ... [2018-12-31 20:34:45,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d4c82fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 08:34:45, skipping insertion in model container [2018-12-31 20:34:45,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 08:34:45" (3/3) ... [2018-12-31 20:34:45,506 INFO L112 eAbstractionObserver]: Analyzing ICFG mix034_pso.oepc_false-unreach-call.i [2018-12-31 20:34:45,555 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,556 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,556 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,556 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,556 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,556 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,557 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,557 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,558 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,558 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,558 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,558 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,558 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,559 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,559 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,560 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,560 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,560 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,560 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,560 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,561 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,561 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,561 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,561 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,562 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,563 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,563 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,563 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,563 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,564 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,564 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,564 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,564 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,564 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,570 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,570 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,570 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,571 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,572 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,572 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,572 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,572 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,573 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,575 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,575 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,575 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,575 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,576 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,576 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,577 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,577 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,577 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,581 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,581 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,581 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,581 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,582 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,583 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,583 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,583 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,583 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,584 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,584 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,584 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,584 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,585 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,585 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,585 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,585 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,585 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,586 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,586 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,586 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,586 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,586 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,588 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,588 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,588 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,588 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,589 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,589 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,589 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,589 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,590 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,591 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,591 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,591 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,593 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,593 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,593 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,593 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,594 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,594 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,596 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,596 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,596 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,596 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,597 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,597 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,598 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,598 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,598 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,598 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,599 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,601 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,601 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,602 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,602 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,603 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,603 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,603 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,603 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,603 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,604 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,604 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,604 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,604 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,604 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,606 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,607 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,607 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,607 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,607 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,607 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,609 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,609 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,609 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,609 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,610 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,610 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,610 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,610 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,610 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,612 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,613 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,613 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,613 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,613 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,613 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,615 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,615 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,615 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,615 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,615 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,616 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,616 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,616 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,616 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,616 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,617 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,619 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,619 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,619 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,619 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:45,654 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-31 20:34:45,654 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 20:34:45,667 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 20:34:45,686 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 20:34:45,714 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 20:34:45,715 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 20:34:45,715 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 20:34:45,715 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 20:34:45,715 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 20:34:45,716 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 20:34:45,716 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 20:34:45,716 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 20:34:45,716 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 20:34:45,737 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 144places, 182 transitions [2018-12-31 20:34:48,266 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34808 states. [2018-12-31 20:34:48,268 INFO L276 IsEmpty]: Start isEmpty. Operand 34808 states. [2018-12-31 20:34:48,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-31 20:34:48,277 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:34:48,279 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] [2018-12-31 20:34:48,281 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:34:48,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:34:48,287 INFO L82 PathProgramCache]: Analyzing trace with hash 998748630, now seen corresponding path program 1 times [2018-12-31 20:34:48,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:34:48,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:34:48,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:34:48,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:34:48,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:34:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:34:48,619 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 20:34:48,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:34:48,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:34:48,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:34:48,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:34:48,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:34:48,648 INFO L87 Difference]: Start difference. First operand 34808 states. Second operand 4 states. [2018-12-31 20:34:50,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:34:50,359 INFO L93 Difference]: Finished difference Result 60792 states and 234495 transitions. [2018-12-31 20:34:50,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 20:34:50,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-12-31 20:34:50,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:34:50,710 INFO L225 Difference]: With dead ends: 60792 [2018-12-31 20:34:50,710 INFO L226 Difference]: Without dead ends: 44272 [2018-12-31 20:34:50,712 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 20:34:51,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44272 states. [2018-12-31 20:34:52,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44272 to 27340. [2018-12-31 20:34:52,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27340 states. [2018-12-31 20:34:52,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27340 states to 27340 states and 105501 transitions. [2018-12-31 20:34:52,628 INFO L78 Accepts]: Start accepts. Automaton has 27340 states and 105501 transitions. Word has length 35 [2018-12-31 20:34:52,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:34:52,629 INFO L480 AbstractCegarLoop]: Abstraction has 27340 states and 105501 transitions. [2018-12-31 20:34:52,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:34:52,629 INFO L276 IsEmpty]: Start isEmpty. Operand 27340 states and 105501 transitions. [2018-12-31 20:34:52,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-31 20:34:52,649 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:34:52,649 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] [2018-12-31 20:34:52,650 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:34:52,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:34:52,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1553228635, now seen corresponding path program 1 times [2018-12-31 20:34:52,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:34:52,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:34:52,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:34:52,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:34:52,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:34:52,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:34:52,861 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 20:34:52,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:34:52,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:34:52,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:34:52,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:34:52,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:34:52,865 INFO L87 Difference]: Start difference. First operand 27340 states and 105501 transitions. Second operand 5 states. [2018-12-31 20:34:55,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:34:55,345 INFO L93 Difference]: Finished difference Result 64006 states and 235336 transitions. [2018-12-31 20:34:55,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 20:34:55,346 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-31 20:34:55,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:34:56,238 INFO L225 Difference]: With dead ends: 64006 [2018-12-31 20:34:56,239 INFO L226 Difference]: Without dead ends: 63454 [2018-12-31 20:34:56,240 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 20:34:56,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63454 states. [2018-12-31 20:34:57,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63454 to 41422. [2018-12-31 20:34:57,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41422 states. [2018-12-31 20:34:57,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41422 states to 41422 states and 152331 transitions. [2018-12-31 20:34:57,739 INFO L78 Accepts]: Start accepts. Automaton has 41422 states and 152331 transitions. Word has length 47 [2018-12-31 20:34:57,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:34:57,741 INFO L480 AbstractCegarLoop]: Abstraction has 41422 states and 152331 transitions. [2018-12-31 20:34:57,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:34:57,741 INFO L276 IsEmpty]: Start isEmpty. Operand 41422 states and 152331 transitions. [2018-12-31 20:34:57,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-31 20:34:57,748 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:34:57,749 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 20:34:57,749 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:34:57,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:34:57,750 INFO L82 PathProgramCache]: Analyzing trace with hash -508045602, now seen corresponding path program 1 times [2018-12-31 20:34:57,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:34:57,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:34:57,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:34:57,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:34:57,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:34:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:34:57,906 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 20:34:57,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:34:57,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:34:57,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:34:57,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:34:57,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:34:57,908 INFO L87 Difference]: Start difference. First operand 41422 states and 152331 transitions. Second operand 5 states. [2018-12-31 20:34:59,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:34:59,508 INFO L93 Difference]: Finished difference Result 81368 states and 298049 transitions. [2018-12-31 20:34:59,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 20:34:59,508 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-12-31 20:34:59,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:34:59,774 INFO L225 Difference]: With dead ends: 81368 [2018-12-31 20:34:59,775 INFO L226 Difference]: Without dead ends: 80856 [2018-12-31 20:34:59,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 20:35:00,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80856 states. [2018-12-31 20:35:02,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80856 to 45376. [2018-12-31 20:35:02,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45376 states. [2018-12-31 20:35:02,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45376 states to 45376 states and 166019 transitions. [2018-12-31 20:35:02,144 INFO L78 Accepts]: Start accepts. Automaton has 45376 states and 166019 transitions. Word has length 48 [2018-12-31 20:35:02,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:02,145 INFO L480 AbstractCegarLoop]: Abstraction has 45376 states and 166019 transitions. [2018-12-31 20:35:02,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:35:02,145 INFO L276 IsEmpty]: Start isEmpty. Operand 45376 states and 166019 transitions. [2018-12-31 20:35:02,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-31 20:35:02,155 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:02,156 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] [2018-12-31 20:35:02,156 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:02,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:02,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1928335132, now seen corresponding path program 1 times [2018-12-31 20:35:02,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:02,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:02,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:02,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:02,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:02,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:02,267 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 20:35:02,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:02,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 20:35:02,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 20:35:02,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 20:35:02,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 20:35:02,270 INFO L87 Difference]: Start difference. First operand 45376 states and 166019 transitions. Second operand 3 states. [2018-12-31 20:35:02,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:02,638 INFO L93 Difference]: Finished difference Result 65252 states and 235815 transitions. [2018-12-31 20:35:02,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 20:35:02,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-31 20:35:02,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:02,820 INFO L225 Difference]: With dead ends: 65252 [2018-12-31 20:35:02,820 INFO L226 Difference]: Without dead ends: 65252 [2018-12-31 20:35:02,821 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 20:35:03,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65252 states. [2018-12-31 20:35:03,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65252 to 50946. [2018-12-31 20:35:03,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50946 states. [2018-12-31 20:35:04,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50946 states to 50946 states and 184326 transitions. [2018-12-31 20:35:04,046 INFO L78 Accepts]: Start accepts. Automaton has 50946 states and 184326 transitions. Word has length 50 [2018-12-31 20:35:04,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:04,047 INFO L480 AbstractCegarLoop]: Abstraction has 50946 states and 184326 transitions. [2018-12-31 20:35:04,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 20:35:04,047 INFO L276 IsEmpty]: Start isEmpty. Operand 50946 states and 184326 transitions. [2018-12-31 20:35:04,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-31 20:35:04,063 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:04,064 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] [2018-12-31 20:35:04,064 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:04,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:04,064 INFO L82 PathProgramCache]: Analyzing trace with hash -433775087, now seen corresponding path program 1 times [2018-12-31 20:35:04,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:04,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:04,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:04,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:04,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:04,336 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 20:35:04,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:04,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:35:04,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:35:04,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:35:04,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:35:04,339 INFO L87 Difference]: Start difference. First operand 50946 states and 184326 transitions. Second operand 6 states. [2018-12-31 20:35:06,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:06,427 INFO L93 Difference]: Finished difference Result 67512 states and 242186 transitions. [2018-12-31 20:35:06,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 20:35:06,428 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-12-31 20:35:06,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:06,624 INFO L225 Difference]: With dead ends: 67512 [2018-12-31 20:35:06,624 INFO L226 Difference]: Without dead ends: 67512 [2018-12-31 20:35:06,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 20:35:06,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67512 states. [2018-12-31 20:35:07,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67512 to 63437. [2018-12-31 20:35:07,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63437 states. [2018-12-31 20:35:07,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63437 states to 63437 states and 227585 transitions. [2018-12-31 20:35:07,985 INFO L78 Accepts]: Start accepts. Automaton has 63437 states and 227585 transitions. Word has length 54 [2018-12-31 20:35:07,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:07,986 INFO L480 AbstractCegarLoop]: Abstraction has 63437 states and 227585 transitions. [2018-12-31 20:35:07,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:35:07,986 INFO L276 IsEmpty]: Start isEmpty. Operand 63437 states and 227585 transitions. [2018-12-31 20:35:08,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-31 20:35:08,000 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:08,001 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] [2018-12-31 20:35:08,001 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:08,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:08,001 INFO L82 PathProgramCache]: Analyzing trace with hash 2064240850, now seen corresponding path program 1 times [2018-12-31 20:35:08,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:08,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:08,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:08,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:08,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:08,272 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 20:35:08,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:08,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 20:35:08,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 20:35:08,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 20:35:08,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:35:08,273 INFO L87 Difference]: Start difference. First operand 63437 states and 227585 transitions. Second operand 7 states. [2018-12-31 20:35:10,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:10,630 INFO L93 Difference]: Finished difference Result 88529 states and 306202 transitions. [2018-12-31 20:35:10,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 20:35:10,631 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-12-31 20:35:10,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:10,884 INFO L225 Difference]: With dead ends: 88529 [2018-12-31 20:35:10,884 INFO L226 Difference]: Without dead ends: 88529 [2018-12-31 20:35:10,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-31 20:35:11,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88529 states. [2018-12-31 20:35:12,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88529 to 74882. [2018-12-31 20:35:12,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74882 states. [2018-12-31 20:35:12,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74882 states to 74882 states and 262988 transitions. [2018-12-31 20:35:12,525 INFO L78 Accepts]: Start accepts. Automaton has 74882 states and 262988 transitions. Word has length 54 [2018-12-31 20:35:12,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:12,525 INFO L480 AbstractCegarLoop]: Abstraction has 74882 states and 262988 transitions. [2018-12-31 20:35:12,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 20:35:12,525 INFO L276 IsEmpty]: Start isEmpty. Operand 74882 states and 262988 transitions. [2018-12-31 20:35:12,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-31 20:35:12,541 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:12,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] [2018-12-31 20:35:12,541 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:12,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:12,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1343222765, now seen corresponding path program 1 times [2018-12-31 20:35:12,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:12,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:12,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:12,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:12,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:12,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:12,704 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 20:35:12,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:12,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:35:12,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:35:12,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:35:12,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:35:12,707 INFO L87 Difference]: Start difference. First operand 74882 states and 262988 transitions. Second operand 4 states. [2018-12-31 20:35:13,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:13,032 INFO L93 Difference]: Finished difference Result 15376 states and 48827 transitions. [2018-12-31 20:35:13,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 20:35:13,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-31 20:35:13,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:13,066 INFO L225 Difference]: With dead ends: 15376 [2018-12-31 20:35:13,066 INFO L226 Difference]: Without dead ends: 13790 [2018-12-31 20:35:13,066 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 20:35:13,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13790 states. [2018-12-31 20:35:13,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13790 to 13741. [2018-12-31 20:35:13,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13741 states. [2018-12-31 20:35:13,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13741 states to 13741 states and 43353 transitions. [2018-12-31 20:35:13,265 INFO L78 Accepts]: Start accepts. Automaton has 13741 states and 43353 transitions. Word has length 54 [2018-12-31 20:35:13,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:13,265 INFO L480 AbstractCegarLoop]: Abstraction has 13741 states and 43353 transitions. [2018-12-31 20:35:13,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:35:13,266 INFO L276 IsEmpty]: Start isEmpty. Operand 13741 states and 43353 transitions. [2018-12-31 20:35:13,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-31 20:35:13,267 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:13,267 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] [2018-12-31 20:35:13,268 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:13,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:13,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1510963439, now seen corresponding path program 1 times [2018-12-31 20:35:13,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:13,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:13,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:13,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:13,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:13,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:13,520 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-31 20:35:13,736 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 20:35:13,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:13,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 20:35:13,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 20:35:13,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 20:35:13,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:35:13,739 INFO L87 Difference]: Start difference. First operand 13741 states and 43353 transitions. Second operand 7 states. [2018-12-31 20:35:14,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:14,648 INFO L93 Difference]: Finished difference Result 17069 states and 53149 transitions. [2018-12-31 20:35:14,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 20:35:14,649 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-12-31 20:35:14,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:14,686 INFO L225 Difference]: With dead ends: 17069 [2018-12-31 20:35:14,686 INFO L226 Difference]: Without dead ends: 16997 [2018-12-31 20:35:14,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-31 20:35:14,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16997 states. [2018-12-31 20:35:14,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16997 to 14315. [2018-12-31 20:35:14,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14315 states. [2018-12-31 20:35:14,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14315 states to 14315 states and 45050 transitions. [2018-12-31 20:35:14,982 INFO L78 Accepts]: Start accepts. Automaton has 14315 states and 45050 transitions. Word has length 54 [2018-12-31 20:35:14,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:14,983 INFO L480 AbstractCegarLoop]: Abstraction has 14315 states and 45050 transitions. [2018-12-31 20:35:14,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 20:35:14,983 INFO L276 IsEmpty]: Start isEmpty. Operand 14315 states and 45050 transitions. [2018-12-31 20:35:14,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-31 20:35:14,988 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:14,989 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] [2018-12-31 20:35:14,989 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:14,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:14,990 INFO L82 PathProgramCache]: Analyzing trace with hash 516780875, now seen corresponding path program 1 times [2018-12-31 20:35:14,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:14,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:14,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:14,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:14,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:15,110 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 20:35:15,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:15,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:35:15,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:35:15,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:35:15,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:35:15,112 INFO L87 Difference]: Start difference. First operand 14315 states and 45050 transitions. Second operand 4 states. [2018-12-31 20:35:15,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:15,322 INFO L93 Difference]: Finished difference Result 16618 states and 52378 transitions. [2018-12-31 20:35:15,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 20:35:15,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-12-31 20:35:15,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:15,368 INFO L225 Difference]: With dead ends: 16618 [2018-12-31 20:35:15,368 INFO L226 Difference]: Without dead ends: 16618 [2018-12-31 20:35:15,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:35:15,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16618 states. [2018-12-31 20:35:15,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16618 to 15135. [2018-12-31 20:35:15,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15135 states. [2018-12-31 20:35:15,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15135 states to 15135 states and 47640 transitions. [2018-12-31 20:35:15,787 INFO L78 Accepts]: Start accepts. Automaton has 15135 states and 47640 transitions. Word has length 62 [2018-12-31 20:35:15,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:15,787 INFO L480 AbstractCegarLoop]: Abstraction has 15135 states and 47640 transitions. [2018-12-31 20:35:15,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:35:15,788 INFO L276 IsEmpty]: Start isEmpty. Operand 15135 states and 47640 transitions. [2018-12-31 20:35:15,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-31 20:35:15,793 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:15,793 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] [2018-12-31 20:35:15,793 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:15,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:15,793 INFO L82 PathProgramCache]: Analyzing trace with hash -2035376086, now seen corresponding path program 1 times [2018-12-31 20:35:15,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:15,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:15,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:15,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:15,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:15,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:15,964 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 20:35:15,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:15,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:35:15,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:35:15,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:35:15,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:35:15,965 INFO L87 Difference]: Start difference. First operand 15135 states and 47640 transitions. Second operand 6 states. [2018-12-31 20:35:16,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:16,532 INFO L93 Difference]: Finished difference Result 28107 states and 88148 transitions. [2018-12-31 20:35:16,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 20:35:16,533 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-12-31 20:35:16,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:16,588 INFO L225 Difference]: With dead ends: 28107 [2018-12-31 20:35:16,588 INFO L226 Difference]: Without dead ends: 28036 [2018-12-31 20:35:16,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-31 20:35:16,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28036 states. [2018-12-31 20:35:16,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28036 to 17413. [2018-12-31 20:35:16,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17413 states. [2018-12-31 20:35:16,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17413 states to 17413 states and 54314 transitions. [2018-12-31 20:35:16,917 INFO L78 Accepts]: Start accepts. Automaton has 17413 states and 54314 transitions. Word has length 62 [2018-12-31 20:35:16,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:16,918 INFO L480 AbstractCegarLoop]: Abstraction has 17413 states and 54314 transitions. [2018-12-31 20:35:16,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:35:16,918 INFO L276 IsEmpty]: Start isEmpty. Operand 17413 states and 54314 transitions. [2018-12-31 20:35:16,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-31 20:35:16,926 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:16,926 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] [2018-12-31 20:35:16,926 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:16,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:16,926 INFO L82 PathProgramCache]: Analyzing trace with hash 505162303, now seen corresponding path program 1 times [2018-12-31 20:35:16,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:16,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:16,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:16,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:16,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:17,126 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 20:35:17,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:17,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:35:17,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:35:17,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:35:17,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:35:17,127 INFO L87 Difference]: Start difference. First operand 17413 states and 54314 transitions. Second operand 4 states. [2018-12-31 20:35:17,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:17,636 INFO L93 Difference]: Finished difference Result 21357 states and 65803 transitions. [2018-12-31 20:35:17,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 20:35:17,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-31 20:35:17,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:17,675 INFO L225 Difference]: With dead ends: 21357 [2018-12-31 20:35:17,675 INFO L226 Difference]: Without dead ends: 21357 [2018-12-31 20:35:17,675 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 20:35:17,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21357 states. [2018-12-31 20:35:17,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21357 to 19307. [2018-12-31 20:35:17,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19307 states. [2018-12-31 20:35:17,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19307 states to 19307 states and 59693 transitions. [2018-12-31 20:35:17,957 INFO L78 Accepts]: Start accepts. Automaton has 19307 states and 59693 transitions. Word has length 66 [2018-12-31 20:35:17,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:17,957 INFO L480 AbstractCegarLoop]: Abstraction has 19307 states and 59693 transitions. [2018-12-31 20:35:17,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:35:17,958 INFO L276 IsEmpty]: Start isEmpty. Operand 19307 states and 59693 transitions. [2018-12-31 20:35:17,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-31 20:35:17,967 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:17,967 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] [2018-12-31 20:35:17,967 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:17,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:17,967 INFO L82 PathProgramCache]: Analyzing trace with hash 250425758, now seen corresponding path program 1 times [2018-12-31 20:35:17,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:17,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:17,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:17,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:17,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:18,089 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 20:35:18,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:18,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 20:35:18,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 20:35:18,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 20:35:18,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 20:35:18,091 INFO L87 Difference]: Start difference. First operand 19307 states and 59693 transitions. Second operand 3 states. [2018-12-31 20:35:18,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:18,433 INFO L93 Difference]: Finished difference Result 19947 states and 61432 transitions. [2018-12-31 20:35:18,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 20:35:18,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-31 20:35:18,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:18,471 INFO L225 Difference]: With dead ends: 19947 [2018-12-31 20:35:18,471 INFO L226 Difference]: Without dead ends: 19947 [2018-12-31 20:35:18,472 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 20:35:18,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19947 states. [2018-12-31 20:35:18,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19947 to 19647. [2018-12-31 20:35:18,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19647 states. [2018-12-31 20:35:18,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19647 states to 19647 states and 60609 transitions. [2018-12-31 20:35:18,765 INFO L78 Accepts]: Start accepts. Automaton has 19647 states and 60609 transitions. Word has length 66 [2018-12-31 20:35:18,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:18,766 INFO L480 AbstractCegarLoop]: Abstraction has 19647 states and 60609 transitions. [2018-12-31 20:35:18,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 20:35:18,766 INFO L276 IsEmpty]: Start isEmpty. Operand 19647 states and 60609 transitions. [2018-12-31 20:35:18,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-31 20:35:18,776 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:18,777 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] [2018-12-31 20:35:18,777 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:18,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:18,777 INFO L82 PathProgramCache]: Analyzing trace with hash -356405788, now seen corresponding path program 1 times [2018-12-31 20:35:18,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:18,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:18,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:18,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:18,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:18,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:19,016 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 20:35:19,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:19,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:35:19,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:35:19,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:35:19,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:35:19,017 INFO L87 Difference]: Start difference. First operand 19647 states and 60609 transitions. Second operand 6 states. [2018-12-31 20:35:20,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:20,330 INFO L93 Difference]: Finished difference Result 23815 states and 72327 transitions. [2018-12-31 20:35:20,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:35:20,331 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-31 20:35:20,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:20,375 INFO L225 Difference]: With dead ends: 23815 [2018-12-31 20:35:20,375 INFO L226 Difference]: Without dead ends: 23815 [2018-12-31 20:35:20,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:35:20,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23815 states. [2018-12-31 20:35:20,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23815 to 22475. [2018-12-31 20:35:20,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22475 states. [2018-12-31 20:35:20,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22475 states to 22475 states and 68749 transitions. [2018-12-31 20:35:20,735 INFO L78 Accepts]: Start accepts. Automaton has 22475 states and 68749 transitions. Word has length 68 [2018-12-31 20:35:20,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:20,735 INFO L480 AbstractCegarLoop]: Abstraction has 22475 states and 68749 transitions. [2018-12-31 20:35:20,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:35:20,736 INFO L276 IsEmpty]: Start isEmpty. Operand 22475 states and 68749 transitions. [2018-12-31 20:35:20,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-31 20:35:20,748 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:20,748 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] [2018-12-31 20:35:20,749 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:20,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:20,749 INFO L82 PathProgramCache]: Analyzing trace with hash -611142333, now seen corresponding path program 1 times [2018-12-31 20:35:20,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:20,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:20,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:20,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:20,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:20,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:21,001 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 20:35:21,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:21,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:35:21,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:35:21,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:35:21,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:35:21,003 INFO L87 Difference]: Start difference. First operand 22475 states and 68749 transitions. Second operand 6 states. [2018-12-31 20:35:21,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:21,643 INFO L93 Difference]: Finished difference Result 25703 states and 76209 transitions. [2018-12-31 20:35:21,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 20:35:21,643 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-31 20:35:21,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:21,691 INFO L225 Difference]: With dead ends: 25703 [2018-12-31 20:35:21,692 INFO L226 Difference]: Without dead ends: 25703 [2018-12-31 20:35:21,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-31 20:35:21,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25703 states. [2018-12-31 20:35:22,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25703 to 22859. [2018-12-31 20:35:22,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22859 states. [2018-12-31 20:35:22,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22859 states to 22859 states and 68855 transitions. [2018-12-31 20:35:22,061 INFO L78 Accepts]: Start accepts. Automaton has 22859 states and 68855 transitions. Word has length 68 [2018-12-31 20:35:22,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:22,062 INFO L480 AbstractCegarLoop]: Abstraction has 22859 states and 68855 transitions. [2018-12-31 20:35:22,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:35:22,062 INFO L276 IsEmpty]: Start isEmpty. Operand 22859 states and 68855 transitions. [2018-12-31 20:35:22,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-31 20:35:22,075 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:22,075 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] [2018-12-31 20:35:22,075 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:22,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:22,075 INFO L82 PathProgramCache]: Analyzing trace with hash -678149086, now seen corresponding path program 1 times [2018-12-31 20:35:22,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:22,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:22,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:22,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:22,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:22,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:22,490 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 20:35:22,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:22,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:35:22,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:35:22,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:35:22,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:35:22,491 INFO L87 Difference]: Start difference. First operand 22859 states and 68855 transitions. Second operand 5 states. [2018-12-31 20:35:23,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:23,399 INFO L93 Difference]: Finished difference Result 29794 states and 89420 transitions. [2018-12-31 20:35:23,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:35:23,400 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-12-31 20:35:23,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:23,457 INFO L225 Difference]: With dead ends: 29794 [2018-12-31 20:35:23,457 INFO L226 Difference]: Without dead ends: 29794 [2018-12-31 20:35:23,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:35:23,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29794 states. [2018-12-31 20:35:23,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29794 to 26815. [2018-12-31 20:35:23,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26815 states. [2018-12-31 20:35:23,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26815 states to 26815 states and 80364 transitions. [2018-12-31 20:35:23,899 INFO L78 Accepts]: Start accepts. Automaton has 26815 states and 80364 transitions. Word has length 68 [2018-12-31 20:35:23,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:23,899 INFO L480 AbstractCegarLoop]: Abstraction has 26815 states and 80364 transitions. [2018-12-31 20:35:23,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:35:23,899 INFO L276 IsEmpty]: Start isEmpty. Operand 26815 states and 80364 transitions. [2018-12-31 20:35:23,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-31 20:35:23,915 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:23,915 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] [2018-12-31 20:35:23,915 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:23,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:23,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1188683263, now seen corresponding path program 1 times [2018-12-31 20:35:23,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:23,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:23,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:23,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:23,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:23,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:24,281 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 20:35:24,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:24,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:35:24,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:35:24,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:35:24,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:35:24,282 INFO L87 Difference]: Start difference. First operand 26815 states and 80364 transitions. Second operand 5 states. [2018-12-31 20:35:24,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:24,920 INFO L93 Difference]: Finished difference Result 36421 states and 108434 transitions. [2018-12-31 20:35:24,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 20:35:24,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-12-31 20:35:24,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:24,991 INFO L225 Difference]: With dead ends: 36421 [2018-12-31 20:35:24,992 INFO L226 Difference]: Without dead ends: 36421 [2018-12-31 20:35:24,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 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 20:35:25,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36421 states. [2018-12-31 20:35:25,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36421 to 29429. [2018-12-31 20:35:25,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29429 states. [2018-12-31 20:35:25,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29429 states to 29429 states and 87840 transitions. [2018-12-31 20:35:25,542 INFO L78 Accepts]: Start accepts. Automaton has 29429 states and 87840 transitions. Word has length 68 [2018-12-31 20:35:25,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:25,543 INFO L480 AbstractCegarLoop]: Abstraction has 29429 states and 87840 transitions. [2018-12-31 20:35:25,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:35:25,543 INFO L276 IsEmpty]: Start isEmpty. Operand 29429 states and 87840 transitions. [2018-12-31 20:35:25,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-31 20:35:25,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:25,557 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] [2018-12-31 20:35:25,558 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:25,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:25,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1298829570, now seen corresponding path program 1 times [2018-12-31 20:35:25,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:25,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:25,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:25,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:25,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:25,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:25,694 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 20:35:25,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:25,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:35:25,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:35:25,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:35:25,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:35:25,695 INFO L87 Difference]: Start difference. First operand 29429 states and 87840 transitions. Second operand 6 states. [2018-12-31 20:35:25,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:25,949 INFO L93 Difference]: Finished difference Result 28041 states and 79299 transitions. [2018-12-31 20:35:25,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 20:35:25,950 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-31 20:35:25,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:25,999 INFO L225 Difference]: With dead ends: 28041 [2018-12-31 20:35:25,999 INFO L226 Difference]: Without dead ends: 28041 [2018-12-31 20:35:25,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:35:26,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28041 states. [2018-12-31 20:35:26,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28041 to 23993. [2018-12-31 20:35:26,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23993 states. [2018-12-31 20:35:26,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23993 states to 23993 states and 68156 transitions. [2018-12-31 20:35:26,370 INFO L78 Accepts]: Start accepts. Automaton has 23993 states and 68156 transitions. Word has length 68 [2018-12-31 20:35:26,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:26,370 INFO L480 AbstractCegarLoop]: Abstraction has 23993 states and 68156 transitions. [2018-12-31 20:35:26,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:35:26,371 INFO L276 IsEmpty]: Start isEmpty. Operand 23993 states and 68156 transitions. [2018-12-31 20:35:26,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-31 20:35:26,381 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:26,381 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] [2018-12-31 20:35:26,381 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:26,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:26,382 INFO L82 PathProgramCache]: Analyzing trace with hash 389381892, now seen corresponding path program 1 times [2018-12-31 20:35:26,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:26,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:26,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:26,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:26,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:26,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:26,623 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 20:35:26,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:26,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:35:26,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:35:26,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:35:26,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:35:26,626 INFO L87 Difference]: Start difference. First operand 23993 states and 68156 transitions. Second operand 5 states. [2018-12-31 20:35:26,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:26,782 INFO L93 Difference]: Finished difference Result 7181 states and 17283 transitions. [2018-12-31 20:35:26,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 20:35:26,784 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-12-31 20:35:26,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:26,793 INFO L225 Difference]: With dead ends: 7181 [2018-12-31 20:35:26,793 INFO L226 Difference]: Without dead ends: 5896 [2018-12-31 20:35:26,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:35:26,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5896 states. [2018-12-31 20:35:26,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5896 to 5236. [2018-12-31 20:35:26,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5236 states. [2018-12-31 20:35:26,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5236 states to 5236 states and 12141 transitions. [2018-12-31 20:35:26,856 INFO L78 Accepts]: Start accepts. Automaton has 5236 states and 12141 transitions. Word has length 68 [2018-12-31 20:35:26,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:26,856 INFO L480 AbstractCegarLoop]: Abstraction has 5236 states and 12141 transitions. [2018-12-31 20:35:26,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:35:26,857 INFO L276 IsEmpty]: Start isEmpty. Operand 5236 states and 12141 transitions. [2018-12-31 20:35:26,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-31 20:35:26,862 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:26,862 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] [2018-12-31 20:35:26,863 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:26,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:26,863 INFO L82 PathProgramCache]: Analyzing trace with hash -342568837, now seen corresponding path program 1 times [2018-12-31 20:35:26,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:26,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:26,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:26,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:26,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:26,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:26,935 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 20:35:26,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:26,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 20:35:26,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 20:35:26,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 20:35:26,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 20:35:26,937 INFO L87 Difference]: Start difference. First operand 5236 states and 12141 transitions. Second operand 3 states. [2018-12-31 20:35:27,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:27,152 INFO L93 Difference]: Finished difference Result 6577 states and 15019 transitions. [2018-12-31 20:35:27,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 20:35:27,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-12-31 20:35:27,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:27,162 INFO L225 Difference]: With dead ends: 6577 [2018-12-31 20:35:27,162 INFO L226 Difference]: Without dead ends: 6577 [2018-12-31 20:35:27,162 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 20:35:27,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6577 states. [2018-12-31 20:35:27,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6577 to 5175. [2018-12-31 20:35:27,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5175 states. [2018-12-31 20:35:27,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5175 states to 5175 states and 11681 transitions. [2018-12-31 20:35:27,222 INFO L78 Accepts]: Start accepts. Automaton has 5175 states and 11681 transitions. Word has length 68 [2018-12-31 20:35:27,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:27,222 INFO L480 AbstractCegarLoop]: Abstraction has 5175 states and 11681 transitions. [2018-12-31 20:35:27,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 20:35:27,222 INFO L276 IsEmpty]: Start isEmpty. Operand 5175 states and 11681 transitions. [2018-12-31 20:35:27,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-31 20:35:27,228 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:27,228 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:35:27,228 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:27,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:27,229 INFO L82 PathProgramCache]: Analyzing trace with hash -571353426, now seen corresponding path program 1 times [2018-12-31 20:35:27,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:27,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:27,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:27,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:27,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:27,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:27,571 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 20:35:27,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:27,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:35:27,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:35:27,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:35:27,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:35:27,572 INFO L87 Difference]: Start difference. First operand 5175 states and 11681 transitions. Second operand 5 states. [2018-12-31 20:35:27,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:27,827 INFO L93 Difference]: Finished difference Result 6325 states and 14274 transitions. [2018-12-31 20:35:27,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 20:35:27,828 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2018-12-31 20:35:27,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:27,837 INFO L225 Difference]: With dead ends: 6325 [2018-12-31 20:35:27,837 INFO L226 Difference]: Without dead ends: 6325 [2018-12-31 20:35:27,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 20:35:27,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6325 states. [2018-12-31 20:35:27,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6325 to 5619. [2018-12-31 20:35:27,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5619 states. [2018-12-31 20:35:27,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5619 states to 5619 states and 12685 transitions. [2018-12-31 20:35:27,906 INFO L78 Accepts]: Start accepts. Automaton has 5619 states and 12685 transitions. Word has length 74 [2018-12-31 20:35:27,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:27,906 INFO L480 AbstractCegarLoop]: Abstraction has 5619 states and 12685 transitions. [2018-12-31 20:35:27,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:35:27,906 INFO L276 IsEmpty]: Start isEmpty. Operand 5619 states and 12685 transitions. [2018-12-31 20:35:27,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-31 20:35:27,913 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:27,913 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:35:27,913 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:27,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:27,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1171456909, now seen corresponding path program 1 times [2018-12-31 20:35:27,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:27,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:27,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:27,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:27,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:28,426 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 20:35:28,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:28,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 20:35:28,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 20:35:28,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 20:35:28,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:35:28,429 INFO L87 Difference]: Start difference. First operand 5619 states and 12685 transitions. Second operand 7 states. [2018-12-31 20:35:30,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:30,885 INFO L93 Difference]: Finished difference Result 6586 states and 14710 transitions. [2018-12-31 20:35:30,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 20:35:30,886 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-12-31 20:35:30,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:30,896 INFO L225 Difference]: With dead ends: 6586 [2018-12-31 20:35:30,896 INFO L226 Difference]: Without dead ends: 6484 [2018-12-31 20:35:30,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-31 20:35:30,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6484 states. [2018-12-31 20:35:30,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6484 to 5716. [2018-12-31 20:35:30,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5716 states. [2018-12-31 20:35:30,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5716 states to 5716 states and 12778 transitions. [2018-12-31 20:35:30,966 INFO L78 Accepts]: Start accepts. Automaton has 5716 states and 12778 transitions. Word has length 74 [2018-12-31 20:35:30,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:30,966 INFO L480 AbstractCegarLoop]: Abstraction has 5716 states and 12778 transitions. [2018-12-31 20:35:30,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 20:35:30,967 INFO L276 IsEmpty]: Start isEmpty. Operand 5716 states and 12778 transitions. [2018-12-31 20:35:30,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 20:35:30,974 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:30,975 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:35:30,976 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:30,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:30,976 INFO L82 PathProgramCache]: Analyzing trace with hash 2144466605, now seen corresponding path program 1 times [2018-12-31 20:35:30,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:30,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:30,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:30,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:30,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:31,209 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 20:35:31,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:31,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 20:35:31,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 20:35:31,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 20:35:31,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:35:31,211 INFO L87 Difference]: Start difference. First operand 5716 states and 12778 transitions. Second operand 7 states. [2018-12-31 20:35:31,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:31,951 INFO L93 Difference]: Finished difference Result 7199 states and 16113 transitions. [2018-12-31 20:35:31,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:35:31,952 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-12-31 20:35:31,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:31,963 INFO L225 Difference]: With dead ends: 7199 [2018-12-31 20:35:31,963 INFO L226 Difference]: Without dead ends: 7199 [2018-12-31 20:35:31,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:35:31,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7199 states. [2018-12-31 20:35:32,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7199 to 5856. [2018-12-31 20:35:32,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5856 states. [2018-12-31 20:35:32,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5856 states to 5856 states and 13166 transitions. [2018-12-31 20:35:32,040 INFO L78 Accepts]: Start accepts. Automaton has 5856 states and 13166 transitions. Word has length 95 [2018-12-31 20:35:32,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:32,041 INFO L480 AbstractCegarLoop]: Abstraction has 5856 states and 13166 transitions. [2018-12-31 20:35:32,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 20:35:32,041 INFO L276 IsEmpty]: Start isEmpty. Operand 5856 states and 13166 transitions. [2018-12-31 20:35:32,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 20:35:32,049 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:32,050 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:35:32,050 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:32,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:32,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1598659536, now seen corresponding path program 1 times [2018-12-31 20:35:32,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:32,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:32,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:32,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:32,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:32,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:32,232 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 20:35:32,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:32,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:35:32,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:35:32,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:35:32,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:35:32,234 INFO L87 Difference]: Start difference. First operand 5856 states and 13166 transitions. Second operand 4 states. [2018-12-31 20:35:32,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:32,349 INFO L93 Difference]: Finished difference Result 6980 states and 15568 transitions. [2018-12-31 20:35:32,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 20:35:32,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-12-31 20:35:32,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:32,358 INFO L225 Difference]: With dead ends: 6980 [2018-12-31 20:35:32,359 INFO L226 Difference]: Without dead ends: 6980 [2018-12-31 20:35:32,359 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 20:35:32,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6980 states. [2018-12-31 20:35:32,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6980 to 6213. [2018-12-31 20:35:32,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2018-12-31 20:35:32,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 13936 transitions. [2018-12-31 20:35:32,439 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 13936 transitions. Word has length 95 [2018-12-31 20:35:32,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:32,439 INFO L480 AbstractCegarLoop]: Abstraction has 6213 states and 13936 transitions. [2018-12-31 20:35:32,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:35:32,439 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 13936 transitions. [2018-12-31 20:35:32,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-31 20:35:32,448 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:32,448 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:35:32,449 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:32,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:32,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1803412790, now seen corresponding path program 1 times [2018-12-31 20:35:32,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:32,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:32,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:32,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:32,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:32,568 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 20:35:32,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:32,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:35:32,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:35:32,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:35:32,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:35:32,570 INFO L87 Difference]: Start difference. First operand 6213 states and 13936 transitions. Second operand 5 states. [2018-12-31 20:35:32,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:32,699 INFO L93 Difference]: Finished difference Result 6659 states and 14882 transitions. [2018-12-31 20:35:32,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:35:32,700 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-12-31 20:35:32,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:32,708 INFO L225 Difference]: With dead ends: 6659 [2018-12-31 20:35:32,709 INFO L226 Difference]: Without dead ends: 6659 [2018-12-31 20:35:32,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:35:32,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6659 states. [2018-12-31 20:35:32,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6659 to 5109. [2018-12-31 20:35:32,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5109 states. [2018-12-31 20:35:32,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5109 states to 5109 states and 11452 transitions. [2018-12-31 20:35:32,773 INFO L78 Accepts]: Start accepts. Automaton has 5109 states and 11452 transitions. Word has length 97 [2018-12-31 20:35:32,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:32,774 INFO L480 AbstractCegarLoop]: Abstraction has 5109 states and 11452 transitions. [2018-12-31 20:35:32,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:35:32,774 INFO L276 IsEmpty]: Start isEmpty. Operand 5109 states and 11452 transitions. [2018-12-31 20:35:32,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-31 20:35:32,779 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:32,780 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] [2018-12-31 20:35:32,780 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:32,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:32,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1814728917, now seen corresponding path program 1 times [2018-12-31 20:35:32,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:32,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:32,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:32,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:32,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:32,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:32,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:35:32,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:32,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:35:32,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:35:32,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:35:32,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:35:32,857 INFO L87 Difference]: Start difference. First operand 5109 states and 11452 transitions. Second operand 4 states. [2018-12-31 20:35:33,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:33,140 INFO L93 Difference]: Finished difference Result 6613 states and 14743 transitions. [2018-12-31 20:35:33,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 20:35:33,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2018-12-31 20:35:33,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:33,151 INFO L225 Difference]: With dead ends: 6613 [2018-12-31 20:35:33,151 INFO L226 Difference]: Without dead ends: 6566 [2018-12-31 20:35:33,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:35:33,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6566 states. [2018-12-31 20:35:33,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6566 to 6157. [2018-12-31 20:35:33,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6157 states. [2018-12-31 20:35:33,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6157 states to 6157 states and 13768 transitions. [2018-12-31 20:35:33,238 INFO L78 Accepts]: Start accepts. Automaton has 6157 states and 13768 transitions. Word has length 97 [2018-12-31 20:35:33,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:33,239 INFO L480 AbstractCegarLoop]: Abstraction has 6157 states and 13768 transitions. [2018-12-31 20:35:33,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:35:33,239 INFO L276 IsEmpty]: Start isEmpty. Operand 6157 states and 13768 transitions. [2018-12-31 20:35:33,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-31 20:35:33,247 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:33,247 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] [2018-12-31 20:35:33,247 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:33,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:33,248 INFO L82 PathProgramCache]: Analyzing trace with hash -262480426, now seen corresponding path program 1 times [2018-12-31 20:35:33,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:33,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:33,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:33,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:33,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:33,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:33,506 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 20:35:33,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:33,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 20:35:33,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 20:35:33,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 20:35:33,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-31 20:35:33,507 INFO L87 Difference]: Start difference. First operand 6157 states and 13768 transitions. Second operand 9 states. [2018-12-31 20:35:34,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:34,528 INFO L93 Difference]: Finished difference Result 7878 states and 17405 transitions. [2018-12-31 20:35:34,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-31 20:35:34,530 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2018-12-31 20:35:34,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:34,542 INFO L225 Difference]: With dead ends: 7878 [2018-12-31 20:35:34,542 INFO L226 Difference]: Without dead ends: 7878 [2018-12-31 20:35:34,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2018-12-31 20:35:34,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7878 states. [2018-12-31 20:35:34,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7878 to 6683. [2018-12-31 20:35:34,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6683 states. [2018-12-31 20:35:34,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6683 states to 6683 states and 14838 transitions. [2018-12-31 20:35:34,638 INFO L78 Accepts]: Start accepts. Automaton has 6683 states and 14838 transitions. Word has length 97 [2018-12-31 20:35:34,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:34,638 INFO L480 AbstractCegarLoop]: Abstraction has 6683 states and 14838 transitions. [2018-12-31 20:35:34,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 20:35:34,639 INFO L276 IsEmpty]: Start isEmpty. Operand 6683 states and 14838 transitions. [2018-12-31 20:35:34,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-31 20:35:34,646 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:34,647 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] [2018-12-31 20:35:34,647 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:34,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:34,647 INFO L82 PathProgramCache]: Analyzing trace with hash -51129513, now seen corresponding path program 1 times [2018-12-31 20:35:34,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:34,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:34,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:34,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:34,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:34,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:34,952 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-31 20:35:35,125 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-31 20:35:35,338 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 20:35:35,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:35,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-31 20:35:35,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 20:35:35,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 20:35:35,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-31 20:35:35,339 INFO L87 Difference]: Start difference. First operand 6683 states and 14838 transitions. Second operand 11 states. [2018-12-31 20:35:37,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:37,076 INFO L93 Difference]: Finished difference Result 12276 states and 27352 transitions. [2018-12-31 20:35:37,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-31 20:35:37,078 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 97 [2018-12-31 20:35:37,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:37,091 INFO L225 Difference]: With dead ends: 12276 [2018-12-31 20:35:37,091 INFO L226 Difference]: Without dead ends: 8479 [2018-12-31 20:35:37,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-31 20:35:37,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8479 states. [2018-12-31 20:35:37,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8479 to 6439. [2018-12-31 20:35:37,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6439 states. [2018-12-31 20:35:37,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6439 states to 6439 states and 14285 transitions. [2018-12-31 20:35:37,198 INFO L78 Accepts]: Start accepts. Automaton has 6439 states and 14285 transitions. Word has length 97 [2018-12-31 20:35:37,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:37,198 INFO L480 AbstractCegarLoop]: Abstraction has 6439 states and 14285 transitions. [2018-12-31 20:35:37,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 20:35:37,198 INFO L276 IsEmpty]: Start isEmpty. Operand 6439 states and 14285 transitions. [2018-12-31 20:35:37,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-31 20:35:37,206 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:37,207 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:35:37,207 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:37,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:37,207 INFO L82 PathProgramCache]: Analyzing trace with hash 746604445, now seen corresponding path program 1 times [2018-12-31 20:35:37,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:37,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:37,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:37,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:37,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:37,638 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-12-31 20:35:38,061 WARN L181 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2018-12-31 20:35:38,083 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 20:35:38,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:38,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:35:38,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:35:38,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:35:38,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:35:38,087 INFO L87 Difference]: Start difference. First operand 6439 states and 14285 transitions. Second operand 6 states. [2018-12-31 20:35:38,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:38,300 INFO L93 Difference]: Finished difference Result 7393 states and 16150 transitions. [2018-12-31 20:35:38,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:35:38,301 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2018-12-31 20:35:38,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:38,311 INFO L225 Difference]: With dead ends: 7393 [2018-12-31 20:35:38,312 INFO L226 Difference]: Without dead ends: 7362 [2018-12-31 20:35:38,312 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 20:35:38,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7362 states. [2018-12-31 20:35:38,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7362 to 6492. [2018-12-31 20:35:38,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6492 states. [2018-12-31 20:35:38,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6492 states to 6492 states and 14216 transitions. [2018-12-31 20:35:38,460 INFO L78 Accepts]: Start accepts. Automaton has 6492 states and 14216 transitions. Word has length 97 [2018-12-31 20:35:38,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:38,460 INFO L480 AbstractCegarLoop]: Abstraction has 6492 states and 14216 transitions. [2018-12-31 20:35:38,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:35:38,460 INFO L276 IsEmpty]: Start isEmpty. Operand 6492 states and 14216 transitions. [2018-12-31 20:35:38,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-31 20:35:38,467 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:38,468 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] [2018-12-31 20:35:38,468 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:38,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:38,468 INFO L82 PathProgramCache]: Analyzing trace with hash -439969543, now seen corresponding path program 1 times [2018-12-31 20:35:38,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:38,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:38,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:38,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:38,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:38,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:38,601 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 20:35:38,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:38,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:35:38,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:35:38,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:35:38,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:35:38,602 INFO L87 Difference]: Start difference. First operand 6492 states and 14216 transitions. Second operand 5 states. [2018-12-31 20:35:38,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:38,926 INFO L93 Difference]: Finished difference Result 7692 states and 16739 transitions. [2018-12-31 20:35:38,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 20:35:38,928 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-12-31 20:35:38,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:38,939 INFO L225 Difference]: With dead ends: 7692 [2018-12-31 20:35:38,939 INFO L226 Difference]: Without dead ends: 7605 [2018-12-31 20:35:38,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 20:35:38,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7605 states. [2018-12-31 20:35:39,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7605 to 6147. [2018-12-31 20:35:39,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6147 states. [2018-12-31 20:35:39,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6147 states to 6147 states and 13534 transitions. [2018-12-31 20:35:39,019 INFO L78 Accepts]: Start accepts. Automaton has 6147 states and 13534 transitions. Word has length 97 [2018-12-31 20:35:39,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:39,019 INFO L480 AbstractCegarLoop]: Abstraction has 6147 states and 13534 transitions. [2018-12-31 20:35:39,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:35:39,020 INFO L276 IsEmpty]: Start isEmpty. Operand 6147 states and 13534 transitions. [2018-12-31 20:35:39,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-31 20:35:39,026 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:39,027 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:35:39,027 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:39,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:39,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1423115111, now seen corresponding path program 2 times [2018-12-31 20:35:39,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:39,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:39,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:39,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:39,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:39,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:39,491 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-12-31 20:35:40,001 WARN L181 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2018-12-31 20:35:40,515 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 20:35:40,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:40,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 20:35:40,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 20:35:40,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 20:35:40,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-31 20:35:40,516 INFO L87 Difference]: Start difference. First operand 6147 states and 13534 transitions. Second operand 9 states. [2018-12-31 20:35:41,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:41,476 INFO L93 Difference]: Finished difference Result 6889 states and 15104 transitions. [2018-12-31 20:35:41,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 20:35:41,478 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2018-12-31 20:35:41,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:41,487 INFO L225 Difference]: With dead ends: 6889 [2018-12-31 20:35:41,488 INFO L226 Difference]: Without dead ends: 6882 [2018-12-31 20:35:41,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-12-31 20:35:41,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6882 states. [2018-12-31 20:35:41,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6882 to 6286. [2018-12-31 20:35:41,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6286 states. [2018-12-31 20:35:41,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6286 states to 6286 states and 13832 transitions. [2018-12-31 20:35:41,559 INFO L78 Accepts]: Start accepts. Automaton has 6286 states and 13832 transitions. Word has length 97 [2018-12-31 20:35:41,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:41,559 INFO L480 AbstractCegarLoop]: Abstraction has 6286 states and 13832 transitions. [2018-12-31 20:35:41,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 20:35:41,559 INFO L276 IsEmpty]: Start isEmpty. Operand 6286 states and 13832 transitions. [2018-12-31 20:35:41,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-31 20:35:41,566 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:41,566 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] [2018-12-31 20:35:41,567 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:41,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:41,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1211764198, now seen corresponding path program 1 times [2018-12-31 20:35:41,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:41,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:41,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:41,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 20:35:41,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:42,222 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 20:35:42,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:42,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 20:35:42,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 20:35:42,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 20:35:42,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:35:42,223 INFO L87 Difference]: Start difference. First operand 6286 states and 13832 transitions. Second operand 7 states. [2018-12-31 20:35:43,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:43,243 INFO L93 Difference]: Finished difference Result 8076 states and 17595 transitions. [2018-12-31 20:35:43,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 20:35:43,244 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2018-12-31 20:35:43,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:43,255 INFO L225 Difference]: With dead ends: 8076 [2018-12-31 20:35:43,255 INFO L226 Difference]: Without dead ends: 8076 [2018-12-31 20:35:43,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-31 20:35:43,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8076 states. [2018-12-31 20:35:43,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8076 to 6350. [2018-12-31 20:35:43,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6350 states. [2018-12-31 20:35:43,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6350 states to 6350 states and 13979 transitions. [2018-12-31 20:35:43,331 INFO L78 Accepts]: Start accepts. Automaton has 6350 states and 13979 transitions. Word has length 97 [2018-12-31 20:35:43,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:43,331 INFO L480 AbstractCegarLoop]: Abstraction has 6350 states and 13979 transitions. [2018-12-31 20:35:43,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 20:35:43,331 INFO L276 IsEmpty]: Start isEmpty. Operand 6350 states and 13979 transitions. [2018-12-31 20:35:43,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-31 20:35:43,339 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:43,339 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] [2018-12-31 20:35:43,340 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:43,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:43,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1915558852, now seen corresponding path program 2 times [2018-12-31 20:35:43,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:43,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:43,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:43,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:43,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:43,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:44,461 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 6 [2018-12-31 20:35:44,486 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 20:35:44,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:44,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 20:35:44,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 20:35:44,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 20:35:44,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-31 20:35:44,488 INFO L87 Difference]: Start difference. First operand 6350 states and 13979 transitions. Second operand 8 states. [2018-12-31 20:35:45,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:45,006 INFO L93 Difference]: Finished difference Result 8172 states and 17759 transitions. [2018-12-31 20:35:45,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 20:35:45,007 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2018-12-31 20:35:45,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:45,018 INFO L225 Difference]: With dead ends: 8172 [2018-12-31 20:35:45,018 INFO L226 Difference]: Without dead ends: 8172 [2018-12-31 20:35:45,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-12-31 20:35:45,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8172 states. [2018-12-31 20:35:45,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8172 to 6484. [2018-12-31 20:35:45,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6484 states. [2018-12-31 20:35:45,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6484 states to 6484 states and 14288 transitions. [2018-12-31 20:35:45,103 INFO L78 Accepts]: Start accepts. Automaton has 6484 states and 14288 transitions. Word has length 97 [2018-12-31 20:35:45,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:45,104 INFO L480 AbstractCegarLoop]: Abstraction has 6484 states and 14288 transitions. [2018-12-31 20:35:45,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 20:35:45,104 INFO L276 IsEmpty]: Start isEmpty. Operand 6484 states and 14288 transitions. [2018-12-31 20:35:45,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-31 20:35:45,112 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:45,112 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] [2018-12-31 20:35:45,113 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:45,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:45,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1704207939, now seen corresponding path program 2 times [2018-12-31 20:35:45,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:45,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:45,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:45,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 20:35:45,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 20:35:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 20:35:45,245 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 20:35:45,479 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-31 20:35:45,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 08:35:45 BasicIcfg [2018-12-31 20:35:45,481 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 20:35:45,482 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 20:35:45,482 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 20:35:45,482 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 20:35:45,483 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 08:34:45" (3/4) ... [2018-12-31 20:35:45,488 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 20:35:45,698 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 20:35:45,702 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 20:35:45,704 INFO L168 Benchmark]: Toolchain (without parser) took 62570.28 ms. Allocated memory was 1.0 GB in the beginning and 4.0 GB in the end (delta: 2.9 GB). Free memory was 950.0 MB in the beginning and 2.6 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-12-31 20:35:45,705 INFO L168 Benchmark]: CDTParser took 0.16 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 20:35:45,705 INFO L168 Benchmark]: CACSL2BoogieTranslator took 939.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -159.1 MB). Peak memory consumption was 36.9 MB. Max. memory is 11.5 GB. [2018-12-31 20:35:45,705 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-31 20:35:45,706 INFO L168 Benchmark]: Boogie Preprocessor took 47.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 20:35:45,706 INFO L168 Benchmark]: RCFGBuilder took 1277.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. [2018-12-31 20:35:45,706 INFO L168 Benchmark]: TraceAbstraction took 59983.24 ms. Allocated memory was 1.2 GB in the beginning and 4.0 GB in the end (delta: 2.8 GB). Free memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-12-31 20:35:45,707 INFO L168 Benchmark]: Witness Printer took 220.92 ms. Allocated memory is still 4.0 GB. Free memory is still 2.6 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 20:35:45,713 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.16 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 939.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -159.1 MB). Peak memory consumption was 36.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 95.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1277.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 59983.24 ms. Allocated memory was 1.2 GB in the beginning and 4.0 GB in the end (delta: 2.8 GB). Free memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 220.92 ms. Allocated memory is still 4.0 GB. Free memory is still 2.6 GB. There was no memory consumed. 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_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L677] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L678] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L679] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L681] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L683] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L685] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L686] -1 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L687] -1 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L688] -1 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L689] -1 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L690] -1 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L691] -1 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L692] -1 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L693] -1 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L694] -1 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L695] -1 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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}] [L696] -1 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L697] -1 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L698] -1 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L699] -1 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L700] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, 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] [L701] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L780] -1 pthread_t t903; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L781] FCALL, FORK -1 pthread_create(&t903, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, 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] [L705] 0 z$w_buff1 = z$w_buff0 [L706] 0 z$w_buff0 = 1 [L707] 0 z$w_buff1_used = z$w_buff0_used [L708] 0 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L710] 0 z$r_buff1_thd0 = z$r_buff0_thd0 [L711] 0 z$r_buff1_thd1 = z$r_buff0_thd1 [L712] 0 z$r_buff1_thd2 = z$r_buff0_thd2 [L713] 0 z$r_buff0_thd1 = (_Bool)1 [L716] 0 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L719] 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=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=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] [L782] -1 pthread_t t904; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L783] FCALL, FORK -1 pthread_create(&t904, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L733] 1 x = 1 [L736] 1 y = 1 [L739] 1 __unbuffered_p1_EAX = y [L742] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L743] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L744] 1 z$flush_delayed = weak$$choice2 [L745] 1 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L746] 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=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=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L746] 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) [L747] 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=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=1, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L747] 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)) [L748] 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=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=1, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L748] 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)) [L749] 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=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=1, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L749] 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)) [L750] 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=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=1, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L750] 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)) [L751] 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=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=1, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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$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)) [L752] 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=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=1, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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$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)) [L753] 1 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] EXPR 1 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L719] 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) [L720] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L720] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L721] 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=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=1, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L721] 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 [L722] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L722] 0 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L723] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L723] 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 [L726] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L754] 1 z = z$flush_delayed ? z$mem_tmp : z [L755] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L758] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L758] EXPR 1 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L758] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L758] 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) [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L760] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L760] 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 [L761] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L761] 1 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L762] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L762] 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 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L785] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L789] 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=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=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L789] EXPR -1 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L789] 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=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=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L789] -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) [L790] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L791] 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=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=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L791] -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 [L792] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L792] -1 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L793] 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=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=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L793] -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 [L796] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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=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=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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=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=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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, 224 locations, 3 error locations. UNSAFE Result, 59.7s OverallTime, 33 OverallIterations, 1 TraceHistogramMax, 30.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9066 SDtfs, 10223 SDslu, 21038 SDs, 0 SdLazy, 9538 SolverSat, 509 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 325 GetRequests, 79 SyntacticMatches, 33 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 11.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74882occurred in iteration=6, 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: 15.1s AutomataMinimizationTime, 32 MinimizatonAttempts, 159040 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 2436 NumberOfCodeBlocks, 2436 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2307 ConstructedInterpolants, 0 QuantifiedInterpolants, 471471 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...