./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix045_tso.opt_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/mix045_tso.opt_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 681e0475f78a5efa68ae10892d48464d4d57efbf ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 21:33:03,864 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 21:33:03,866 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 21:33:03,878 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 21:33:03,879 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 21:33:03,880 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 21:33:03,881 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 21:33:03,884 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 21:33:03,886 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 21:33:03,887 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 21:33:03,888 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 21:33:03,888 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 21:33:03,890 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 21:33:03,891 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 21:33:03,892 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 21:33:03,893 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 21:33:03,894 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 21:33:03,897 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 21:33:03,899 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 21:33:03,901 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 21:33:03,902 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 21:33:03,904 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 21:33:03,907 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 21:33:03,907 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 21:33:03,908 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 21:33:03,909 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 21:33:03,910 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 21:33:03,911 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 21:33:03,913 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 21:33:03,914 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 21:33:03,914 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 21:33:03,916 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 21:33:03,916 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 21:33:03,916 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 21:33:03,918 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 21:33:03,919 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 21:33:03,919 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 21:33:03,936 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 21:33:03,937 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 21:33:03,940 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 21:33:03,940 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 21:33:03,940 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 21:33:03,944 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 21:33:03,944 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 21:33:03,944 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 21:33:03,944 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 21:33:03,945 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 21:33:03,945 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 21:33:03,945 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 21:33:03,945 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 21:33:03,945 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 21:33:03,945 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 21:33:03,946 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 21:33:03,946 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 21:33:03,946 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 21:33:03,946 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 21:33:03,946 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 21:33:03,950 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 21:33:03,950 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 21:33:03,950 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 21:33:03,950 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 21:33:03,951 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 21:33:03,951 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 21:33:03,951 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 21:33:03,951 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 21:33:03,951 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 -> 681e0475f78a5efa68ae10892d48464d4d57efbf [2018-12-31 21:33:04,013 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 21:33:04,027 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 21:33:04,031 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 21:33:04,032 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 21:33:04,033 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 21:33:04,034 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix045_tso.opt_false-unreach-call.i [2018-12-31 21:33:04,105 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cbb8eb0d/bebdf199933a42cfae90332a8ac61d41/FLAG961883da0 [2018-12-31 21:33:04,651 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 21:33:04,652 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix045_tso.opt_false-unreach-call.i [2018-12-31 21:33:04,673 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cbb8eb0d/bebdf199933a42cfae90332a8ac61d41/FLAG961883da0 [2018-12-31 21:33:04,909 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cbb8eb0d/bebdf199933a42cfae90332a8ac61d41 [2018-12-31 21:33:04,916 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 21:33:04,918 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 21:33:04,920 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 21:33:04,925 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 21:33:04,931 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 21:33:04,932 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:33:04" (1/1) ... [2018-12-31 21:33:04,935 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4327ac50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:33:04, skipping insertion in model container [2018-12-31 21:33:04,936 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:33:04" (1/1) ... [2018-12-31 21:33:04,947 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 21:33:05,022 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 21:33:05,527 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 21:33:05,549 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 21:33:05,763 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 21:33:05,846 INFO L195 MainTranslator]: Completed translation [2018-12-31 21:33:05,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:33:05 WrapperNode [2018-12-31 21:33:05,847 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 21:33:05,848 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 21:33:05,848 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 21:33:05,848 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 21:33:05,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:33:05" (1/1) ... [2018-12-31 21:33:05,884 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:33:05" (1/1) ... [2018-12-31 21:33:05,931 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 21:33:05,932 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 21:33:05,932 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 21:33:05,932 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 21:33:05,944 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:33:05" (1/1) ... [2018-12-31 21:33:05,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:33:05" (1/1) ... [2018-12-31 21:33:05,950 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:33:05" (1/1) ... [2018-12-31 21:33:05,951 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:33:05" (1/1) ... [2018-12-31 21:33:05,963 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:33:05" (1/1) ... [2018-12-31 21:33:05,968 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:33:05" (1/1) ... [2018-12-31 21:33:05,972 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:33:05" (1/1) ... [2018-12-31 21:33:05,978 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 21:33:05,978 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 21:33:05,978 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 21:33:05,979 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 21:33:05,980 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:33:05" (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 21:33:06,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 21:33:06,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-31 21:33:06,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 21:33:06,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 21:33:06,048 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-31 21:33:06,048 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-31 21:33:06,048 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-31 21:33:06,049 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-31 21:33:06,050 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-31 21:33:06,050 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-31 21:33:06,051 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-31 21:33:06,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 21:33:06,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 21:33:06,054 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 21:33:07,635 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 21:33:07,636 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-31 21:33:07,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:33:07 BoogieIcfgContainer [2018-12-31 21:33:07,636 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 21:33:07,637 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 21:33:07,637 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 21:33:07,641 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 21:33:07,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:33:04" (1/3) ... [2018-12-31 21:33:07,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51810ca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:33:07, skipping insertion in model container [2018-12-31 21:33:07,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:33:05" (2/3) ... [2018-12-31 21:33:07,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51810ca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:33:07, skipping insertion in model container [2018-12-31 21:33:07,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:33:07" (3/3) ... [2018-12-31 21:33:07,645 INFO L112 eAbstractionObserver]: Analyzing ICFG mix045_tso.opt_false-unreach-call.i [2018-12-31 21:33:07,690 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,691 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,691 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,691 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,692 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,692 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,692 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,692 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,693 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,693 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,694 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,694 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,694 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,694 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,694 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,695 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,695 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,695 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,695 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,696 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,696 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,696 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,696 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,696 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,697 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,697 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,697 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,697 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,698 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,698 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,698 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,698 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,698 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,699 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,699 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,699 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,699 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,700 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,700 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,700 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,700 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,700 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,701 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,701 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,702 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,702 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,702 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,702 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,702 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,702 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,703 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,703 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,703 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,704 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,704 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,704 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,704 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,705 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,705 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,705 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,705 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,705 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,706 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,706 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,706 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,706 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,707 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,707 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,707 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,707 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,708 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,708 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,708 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,708 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,709 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,709 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,709 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,709 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,709 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,710 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,710 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,710 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:33:07,759 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-31 21:33:07,759 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 21:33:07,769 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 21:33:07,790 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 21:33:07,821 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 21:33:07,822 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 21:33:07,822 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 21:33:07,822 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 21:33:07,822 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 21:33:07,822 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 21:33:07,823 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 21:33:07,823 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 21:33:07,823 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 21:33:07,840 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 157places, 194 transitions [2018-12-31 21:33:31,692 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128914 states. [2018-12-31 21:33:31,695 INFO L276 IsEmpty]: Start isEmpty. Operand 128914 states. [2018-12-31 21:33:31,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-31 21:33:31,712 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:33:31,713 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] [2018-12-31 21:33:31,716 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:33:31,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:33:31,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1531198028, now seen corresponding path program 1 times [2018-12-31 21:33:31,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:33:31,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:33:31,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:33:31,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:33:31,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:33:31,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:33:32,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:33:32,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:33:32,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 21:33:32,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 21:33:32,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 21:33:32,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:33:32,188 INFO L87 Difference]: Start difference. First operand 128914 states. Second operand 4 states. [2018-12-31 21:33:34,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:33:34,759 INFO L93 Difference]: Finished difference Result 233474 states and 1098326 transitions. [2018-12-31 21:33:34,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 21:33:34,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-31 21:33:34,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:33:36,057 INFO L225 Difference]: With dead ends: 233474 [2018-12-31 21:33:36,057 INFO L226 Difference]: Without dead ends: 203724 [2018-12-31 21:33:36,059 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 21:33:45,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203724 states. [2018-12-31 21:33:48,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203724 to 118894. [2018-12-31 21:33:48,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118894 states. [2018-12-31 21:33:50,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118894 states to 118894 states and 559777 transitions. [2018-12-31 21:33:50,624 INFO L78 Accepts]: Start accepts. Automaton has 118894 states and 559777 transitions. Word has length 45 [2018-12-31 21:33:50,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:33:50,626 INFO L480 AbstractCegarLoop]: Abstraction has 118894 states and 559777 transitions. [2018-12-31 21:33:50,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 21:33:50,626 INFO L276 IsEmpty]: Start isEmpty. Operand 118894 states and 559777 transitions. [2018-12-31 21:33:50,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-31 21:33:50,641 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:33:50,642 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] [2018-12-31 21:33:50,642 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:33:50,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:33:50,642 INFO L82 PathProgramCache]: Analyzing trace with hash -834891017, now seen corresponding path program 1 times [2018-12-31 21:33:50,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:33:50,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:33:50,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:33:50,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:33:50,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:33:50,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:33:50,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:33:50,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:33:50,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 21:33:50,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 21:33:50,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 21:33:50,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 21:33:50,779 INFO L87 Difference]: Start difference. First operand 118894 states and 559777 transitions. Second operand 3 states. [2018-12-31 21:33:52,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:33:52,019 INFO L93 Difference]: Finished difference Result 118894 states and 559662 transitions. [2018-12-31 21:33:52,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 21:33:52,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-31 21:33:52,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:33:52,603 INFO L225 Difference]: With dead ends: 118894 [2018-12-31 21:33:52,603 INFO L226 Difference]: Without dead ends: 118894 [2018-12-31 21:33:52,604 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 21:33:53,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118894 states. [2018-12-31 21:33:57,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118894 to 118894. [2018-12-31 21:33:57,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118894 states. [2018-12-31 21:33:58,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118894 states to 118894 states and 559662 transitions. [2018-12-31 21:33:58,191 INFO L78 Accepts]: Start accepts. Automaton has 118894 states and 559662 transitions. Word has length 52 [2018-12-31 21:33:58,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:33:58,191 INFO L480 AbstractCegarLoop]: Abstraction has 118894 states and 559662 transitions. [2018-12-31 21:33:58,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 21:33:58,192 INFO L276 IsEmpty]: Start isEmpty. Operand 118894 states and 559662 transitions. [2018-12-31 21:33:58,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-31 21:33:58,197 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:33:58,197 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] [2018-12-31 21:33:58,197 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:33:58,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:33:58,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1663124920, now seen corresponding path program 1 times [2018-12-31 21:33:58,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:33:58,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:33:58,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:33:58,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:33:58,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:33:58,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:33:58,453 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 21:33:58,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:33:58,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 21:33:58,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 21:33:58,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 21:33:58,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:33:58,455 INFO L87 Difference]: Start difference. First operand 118894 states and 559662 transitions. Second operand 5 states. [2018-12-31 21:34:01,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:34:01,926 INFO L93 Difference]: Finished difference Result 325274 states and 1470366 transitions. [2018-12-31 21:34:01,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 21:34:01,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-12-31 21:34:01,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:34:03,509 INFO L225 Difference]: With dead ends: 325274 [2018-12-31 21:34:03,509 INFO L226 Difference]: Without dead ends: 324274 [2018-12-31 21:34:03,510 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 21:34:15,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324274 states. [2018-12-31 21:34:19,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324274 to 186424. [2018-12-31 21:34:19,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186424 states. [2018-12-31 21:34:22,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186424 states to 186424 states and 842761 transitions. [2018-12-31 21:34:22,069 INFO L78 Accepts]: Start accepts. Automaton has 186424 states and 842761 transitions. Word has length 52 [2018-12-31 21:34:22,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:34:22,070 INFO L480 AbstractCegarLoop]: Abstraction has 186424 states and 842761 transitions. [2018-12-31 21:34:22,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 21:34:22,070 INFO L276 IsEmpty]: Start isEmpty. Operand 186424 states and 842761 transitions. [2018-12-31 21:34:22,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-31 21:34:22,083 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:34:22,083 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] [2018-12-31 21:34:22,084 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:34:22,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:34:22,084 INFO L82 PathProgramCache]: Analyzing trace with hash -832854916, now seen corresponding path program 1 times [2018-12-31 21:34:22,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:34:22,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:34:22,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:34:22,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:34:22,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:34:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:34:22,252 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 21:34:22,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:34:22,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 21:34:22,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 21:34:22,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 21:34:22,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:34:22,255 INFO L87 Difference]: Start difference. First operand 186424 states and 842761 transitions. Second operand 4 states. [2018-12-31 21:34:23,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:34:23,368 INFO L93 Difference]: Finished difference Result 163600 states and 726962 transitions. [2018-12-31 21:34:23,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 21:34:23,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-12-31 21:34:23,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:34:24,032 INFO L225 Difference]: With dead ends: 163600 [2018-12-31 21:34:24,032 INFO L226 Difference]: Without dead ends: 160995 [2018-12-31 21:34:24,032 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 21:34:25,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160995 states. [2018-12-31 21:34:29,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160995 to 160995. [2018-12-31 21:34:29,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160995 states. [2018-12-31 21:34:41,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160995 states to 160995 states and 718280 transitions. [2018-12-31 21:34:41,753 INFO L78 Accepts]: Start accepts. Automaton has 160995 states and 718280 transitions. Word has length 53 [2018-12-31 21:34:41,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:34:41,753 INFO L480 AbstractCegarLoop]: Abstraction has 160995 states and 718280 transitions. [2018-12-31 21:34:41,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 21:34:41,753 INFO L276 IsEmpty]: Start isEmpty. Operand 160995 states and 718280 transitions. [2018-12-31 21:34:41,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-31 21:34:41,763 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:34:41,763 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 21:34:41,764 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:34:41,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:34:41,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1416535676, now seen corresponding path program 1 times [2018-12-31 21:34:41,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:34:41,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:34:41,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:34:41,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:34:41,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:34:41,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:34:41,892 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 21:34:41,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:34:41,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 21:34:41,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 21:34:41,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 21:34:41,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:34:41,895 INFO L87 Difference]: Start difference. First operand 160995 states and 718280 transitions. Second operand 5 states. [2018-12-31 21:34:42,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:34:42,223 INFO L93 Difference]: Finished difference Result 51407 states and 209141 transitions. [2018-12-31 21:34:42,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 21:34:42,224 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-12-31 21:34:42,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:34:42,356 INFO L225 Difference]: With dead ends: 51407 [2018-12-31 21:34:42,356 INFO L226 Difference]: Without dead ends: 49095 [2018-12-31 21:34:42,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:34:42,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49095 states. [2018-12-31 21:34:43,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49095 to 49095. [2018-12-31 21:34:43,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49095 states. [2018-12-31 21:34:43,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49095 states to 49095 states and 200479 transitions. [2018-12-31 21:34:43,301 INFO L78 Accepts]: Start accepts. Automaton has 49095 states and 200479 transitions. Word has length 54 [2018-12-31 21:34:43,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:34:43,301 INFO L480 AbstractCegarLoop]: Abstraction has 49095 states and 200479 transitions. [2018-12-31 21:34:43,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 21:34:43,301 INFO L276 IsEmpty]: Start isEmpty. Operand 49095 states and 200479 transitions. [2018-12-31 21:34:43,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 21:34:43,317 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:34:43,317 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:34:43,318 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:34:43,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:34:43,318 INFO L82 PathProgramCache]: Analyzing trace with hash -106888934, now seen corresponding path program 1 times [2018-12-31 21:34:43,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:34:43,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:34:43,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:34:43,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:34:43,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:34:43,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:34:43,473 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 21:34:43,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:34:43,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 21:34:43,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 21:34:43,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 21:34:43,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:34:43,476 INFO L87 Difference]: Start difference. First operand 49095 states and 200479 transitions. Second operand 4 states. [2018-12-31 21:34:44,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:34:44,386 INFO L93 Difference]: Finished difference Result 70363 states and 282268 transitions. [2018-12-31 21:34:44,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 21:34:44,387 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-31 21:34:44,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:34:44,633 INFO L225 Difference]: With dead ends: 70363 [2018-12-31 21:34:44,634 INFO L226 Difference]: Without dead ends: 70363 [2018-12-31 21:34:44,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:34:44,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70363 states. [2018-12-31 21:34:46,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70363 to 53659. [2018-12-31 21:34:46,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53659 states. [2018-12-31 21:34:46,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53659 states to 53659 states and 217420 transitions. [2018-12-31 21:34:46,765 INFO L78 Accepts]: Start accepts. Automaton has 53659 states and 217420 transitions. Word has length 67 [2018-12-31 21:34:46,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:34:46,766 INFO L480 AbstractCegarLoop]: Abstraction has 53659 states and 217420 transitions. [2018-12-31 21:34:46,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 21:34:46,766 INFO L276 IsEmpty]: Start isEmpty. Operand 53659 states and 217420 transitions. [2018-12-31 21:34:46,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 21:34:46,785 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:34:46,785 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:34:46,786 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:34:46,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:34:46,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1635921401, now seen corresponding path program 1 times [2018-12-31 21:34:46,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:34:46,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:34:46,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:34:46,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:34:46,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:34:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:34:47,110 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-31 21:34:47,202 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 21:34:47,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:34:47,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 21:34:47,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 21:34:47,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 21:34:47,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:34:47,203 INFO L87 Difference]: Start difference. First operand 53659 states and 217420 transitions. Second operand 6 states. [2018-12-31 21:34:47,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:34:47,826 INFO L93 Difference]: Finished difference Result 69865 states and 278246 transitions. [2018-12-31 21:34:47,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 21:34:47,827 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-31 21:34:47,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:34:48,031 INFO L225 Difference]: With dead ends: 69865 [2018-12-31 21:34:48,031 INFO L226 Difference]: Without dead ends: 69865 [2018-12-31 21:34:48,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:34:48,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69865 states. [2018-12-31 21:34:49,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69865 to 50545. [2018-12-31 21:34:49,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50545 states. [2018-12-31 21:34:49,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50545 states to 50545 states and 197928 transitions. [2018-12-31 21:34:49,160 INFO L78 Accepts]: Start accepts. Automaton has 50545 states and 197928 transitions. Word has length 67 [2018-12-31 21:34:49,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:34:49,160 INFO L480 AbstractCegarLoop]: Abstraction has 50545 states and 197928 transitions. [2018-12-31 21:34:49,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 21:34:49,161 INFO L276 IsEmpty]: Start isEmpty. Operand 50545 states and 197928 transitions. [2018-12-31 21:34:49,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 21:34:49,172 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:34:49,172 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:34:49,173 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:34:49,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:34:49,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1336738137, now seen corresponding path program 1 times [2018-12-31 21:34:49,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:34:49,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:34:49,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:34:49,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:34:49,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:34:49,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:34:49,373 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 21:34:49,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:34:49,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 21:34:49,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 21:34:49,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 21:34:49,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:34:49,374 INFO L87 Difference]: Start difference. First operand 50545 states and 197928 transitions. Second operand 6 states. [2018-12-31 21:34:51,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:34:51,017 INFO L93 Difference]: Finished difference Result 73905 states and 287304 transitions. [2018-12-31 21:34:51,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 21:34:51,017 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-31 21:34:51,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:34:51,242 INFO L225 Difference]: With dead ends: 73905 [2018-12-31 21:34:51,242 INFO L226 Difference]: Without dead ends: 73745 [2018-12-31 21:34:51,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-31 21:34:51,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73745 states. [2018-12-31 21:34:52,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73745 to 56929. [2018-12-31 21:34:52,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56929 states. [2018-12-31 21:34:52,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56929 states to 56929 states and 222384 transitions. [2018-12-31 21:34:52,535 INFO L78 Accepts]: Start accepts. Automaton has 56929 states and 222384 transitions. Word has length 67 [2018-12-31 21:34:52,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:34:52,535 INFO L480 AbstractCegarLoop]: Abstraction has 56929 states and 222384 transitions. [2018-12-31 21:34:52,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 21:34:52,535 INFO L276 IsEmpty]: Start isEmpty. Operand 56929 states and 222384 transitions. [2018-12-31 21:34:52,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-31 21:34:52,602 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:34:52,602 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:34:52,602 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:34:52,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:34:52,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1512918475, now seen corresponding path program 1 times [2018-12-31 21:34:52,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:34:52,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:34:52,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:34:52,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:34:52,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:34:52,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:34:52,921 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 21:34:52,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:34:52,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 21:34:52,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 21:34:52,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 21:34:52,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-31 21:34:52,922 INFO L87 Difference]: Start difference. First operand 56929 states and 222384 transitions. Second operand 8 states. [2018-12-31 21:34:54,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:34:54,794 INFO L93 Difference]: Finished difference Result 82753 states and 317488 transitions. [2018-12-31 21:34:54,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-31 21:34:54,794 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 81 [2018-12-31 21:34:54,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:34:55,039 INFO L225 Difference]: With dead ends: 82753 [2018-12-31 21:34:55,040 INFO L226 Difference]: Without dead ends: 82433 [2018-12-31 21:34:55,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2018-12-31 21:34:55,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82433 states. [2018-12-31 21:34:56,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82433 to 63233. [2018-12-31 21:34:56,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63233 states. [2018-12-31 21:34:57,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63233 states to 63233 states and 246512 transitions. [2018-12-31 21:34:57,108 INFO L78 Accepts]: Start accepts. Automaton has 63233 states and 246512 transitions. Word has length 81 [2018-12-31 21:34:57,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:34:57,109 INFO L480 AbstractCegarLoop]: Abstraction has 63233 states and 246512 transitions. [2018-12-31 21:34:57,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 21:34:57,109 INFO L276 IsEmpty]: Start isEmpty. Operand 63233 states and 246512 transitions. [2018-12-31 21:34:57,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-31 21:34:57,176 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:34:57,177 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] [2018-12-31 21:34:57,177 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:34:57,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:34:57,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1009306043, now seen corresponding path program 1 times [2018-12-31 21:34:57,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:34:57,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:34:57,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:34:57,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:34:57,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:34:57,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:34:57,283 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 21:34:57,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:34:57,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 21:34:57,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 21:34:57,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 21:34:57,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 21:34:57,284 INFO L87 Difference]: Start difference. First operand 63233 states and 246512 transitions. Second operand 3 states. [2018-12-31 21:34:57,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:34:57,696 INFO L93 Difference]: Finished difference Result 75473 states and 289336 transitions. [2018-12-31 21:34:57,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 21:34:57,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-12-31 21:34:57,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:34:57,909 INFO L225 Difference]: With dead ends: 75473 [2018-12-31 21:34:57,909 INFO L226 Difference]: Without dead ends: 75473 [2018-12-31 21:34:57,910 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 21:34:58,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75473 states. [2018-12-31 21:34:59,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75473 to 65889. [2018-12-31 21:34:59,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65889 states. [2018-12-31 21:35:00,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65889 states to 65889 states and 255232 transitions. [2018-12-31 21:35:00,424 INFO L78 Accepts]: Start accepts. Automaton has 65889 states and 255232 transitions. Word has length 83 [2018-12-31 21:35:00,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:35:00,425 INFO L480 AbstractCegarLoop]: Abstraction has 65889 states and 255232 transitions. [2018-12-31 21:35:00,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 21:35:00,425 INFO L276 IsEmpty]: Start isEmpty. Operand 65889 states and 255232 transitions. [2018-12-31 21:35:00,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-31 21:35:00,508 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:35:00,508 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] [2018-12-31 21:35:00,508 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:35:00,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:35:00,509 INFO L82 PathProgramCache]: Analyzing trace with hash 502433506, now seen corresponding path program 1 times [2018-12-31 21:35:00,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:35:00,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:35:00,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:35:00,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:35:00,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:35:00,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:35:00,684 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 21:35:00,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:35:00,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 21:35:00,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 21:35:00,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 21:35:00,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-31 21:35:00,686 INFO L87 Difference]: Start difference. First operand 65889 states and 255232 transitions. Second operand 8 states. [2018-12-31 21:35:02,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:35:02,629 INFO L93 Difference]: Finished difference Result 82545 states and 315608 transitions. [2018-12-31 21:35:02,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-31 21:35:02,630 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 87 [2018-12-31 21:35:02,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:35:02,861 INFO L225 Difference]: With dead ends: 82545 [2018-12-31 21:35:02,862 INFO L226 Difference]: Without dead ends: 82225 [2018-12-31 21:35:02,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2018-12-31 21:35:03,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82225 states. [2018-12-31 21:35:04,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82225 to 68209. [2018-12-31 21:35:04,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68209 states. [2018-12-31 21:35:04,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68209 states to 68209 states and 264760 transitions. [2018-12-31 21:35:04,297 INFO L78 Accepts]: Start accepts. Automaton has 68209 states and 264760 transitions. Word has length 87 [2018-12-31 21:35:04,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:35:04,297 INFO L480 AbstractCegarLoop]: Abstraction has 68209 states and 264760 transitions. [2018-12-31 21:35:04,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 21:35:04,297 INFO L276 IsEmpty]: Start isEmpty. Operand 68209 states and 264760 transitions. [2018-12-31 21:35:04,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-31 21:35:04,374 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:35:04,374 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] [2018-12-31 21:35:04,374 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:35:04,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:35:04,376 INFO L82 PathProgramCache]: Analyzing trace with hash -678962732, now seen corresponding path program 1 times [2018-12-31 21:35:04,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:35:04,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:35:04,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:35:04,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:35:04,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:35:04,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:35:04,622 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 21:35:04,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:35:04,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 21:35:04,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 21:35:04,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 21:35:04,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:35:04,623 INFO L87 Difference]: Start difference. First operand 68209 states and 264760 transitions. Second operand 4 states. [2018-12-31 21:35:05,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:35:05,466 INFO L93 Difference]: Finished difference Result 85936 states and 329974 transitions. [2018-12-31 21:35:05,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 21:35:05,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2018-12-31 21:35:05,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:35:06,448 INFO L225 Difference]: With dead ends: 85936 [2018-12-31 21:35:06,448 INFO L226 Difference]: Without dead ends: 85936 [2018-12-31 21:35:06,448 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 21:35:06,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85936 states. [2018-12-31 21:35:07,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85936 to 79664. [2018-12-31 21:35:07,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79664 states. [2018-12-31 21:35:08,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79664 states to 79664 states and 307174 transitions. [2018-12-31 21:35:08,020 INFO L78 Accepts]: Start accepts. Automaton has 79664 states and 307174 transitions. Word has length 89 [2018-12-31 21:35:08,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:35:08,020 INFO L480 AbstractCegarLoop]: Abstraction has 79664 states and 307174 transitions. [2018-12-31 21:35:08,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 21:35:08,021 INFO L276 IsEmpty]: Start isEmpty. Operand 79664 states and 307174 transitions. [2018-12-31 21:35:08,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-31 21:35:08,120 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:35:08,120 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:35:08,121 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:35:08,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:35:08,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1680344277, now seen corresponding path program 1 times [2018-12-31 21:35:08,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:35:08,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:35:08,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:35:08,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:35:08,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:35:08,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:35:08,254 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 21:35:08,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:35:08,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 21:35:08,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 21:35:08,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 21:35:08,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 21:35:08,256 INFO L87 Difference]: Start difference. First operand 79664 states and 307174 transitions. Second operand 3 states. [2018-12-31 21:35:09,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:35:09,480 INFO L93 Difference]: Finished difference Result 85047 states and 327485 transitions. [2018-12-31 21:35:09,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 21:35:09,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2018-12-31 21:35:09,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:35:09,734 INFO L225 Difference]: With dead ends: 85047 [2018-12-31 21:35:09,734 INFO L226 Difference]: Without dead ends: 85047 [2018-12-31 21:35:09,734 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 21:35:09,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85047 states. [2018-12-31 21:35:11,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85047 to 82430. [2018-12-31 21:35:11,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82430 states. [2018-12-31 21:35:12,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82430 states to 82430 states and 317574 transitions. [2018-12-31 21:35:12,208 INFO L78 Accepts]: Start accepts. Automaton has 82430 states and 317574 transitions. Word has length 89 [2018-12-31 21:35:12,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:35:12,208 INFO L480 AbstractCegarLoop]: Abstraction has 82430 states and 317574 transitions. [2018-12-31 21:35:12,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 21:35:12,208 INFO L276 IsEmpty]: Start isEmpty. Operand 82430 states and 317574 transitions. [2018-12-31 21:35:12,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-31 21:35:12,313 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:35:12,313 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] [2018-12-31 21:35:12,314 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:35:12,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:35:12,314 INFO L82 PathProgramCache]: Analyzing trace with hash -460851379, now seen corresponding path program 1 times [2018-12-31 21:35:12,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:35:12,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:35:12,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:35:12,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:35:12,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:35:12,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:35:12,739 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-31 21:35:12,795 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 21:35:12,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:35:12,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 21:35:12,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 21:35:12,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 21:35:12,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:35:12,797 INFO L87 Difference]: Start difference. First operand 82430 states and 317574 transitions. Second operand 6 states. [2018-12-31 21:35:14,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:35:14,412 INFO L93 Difference]: Finished difference Result 158638 states and 606014 transitions. [2018-12-31 21:35:14,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 21:35:14,413 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2018-12-31 21:35:14,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:35:14,905 INFO L225 Difference]: With dead ends: 158638 [2018-12-31 21:35:14,905 INFO L226 Difference]: Without dead ends: 158638 [2018-12-31 21:35:14,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-31 21:35:15,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158638 states. [2018-12-31 21:35:18,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158638 to 102430. [2018-12-31 21:35:18,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102430 states. [2018-12-31 21:35:18,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102430 states to 102430 states and 392310 transitions. [2018-12-31 21:35:18,541 INFO L78 Accepts]: Start accepts. Automaton has 102430 states and 392310 transitions. Word has length 90 [2018-12-31 21:35:18,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:35:18,541 INFO L480 AbstractCegarLoop]: Abstraction has 102430 states and 392310 transitions. [2018-12-31 21:35:18,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 21:35:18,542 INFO L276 IsEmpty]: Start isEmpty. Operand 102430 states and 392310 transitions. [2018-12-31 21:35:18,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-31 21:35:18,691 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:35:18,691 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] [2018-12-31 21:35:18,692 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:35:18,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:35:18,692 INFO L82 PathProgramCache]: Analyzing trace with hash 783913102, now seen corresponding path program 1 times [2018-12-31 21:35:18,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:35:18,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:35:18,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:35:18,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:35:18,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:35:18,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:35:18,962 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 21:35:18,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:35:18,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 21:35:18,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 21:35:18,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 21:35:18,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:35:18,963 INFO L87 Difference]: Start difference. First operand 102430 states and 392310 transitions. Second operand 7 states. [2018-12-31 21:35:20,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:35:20,821 INFO L93 Difference]: Finished difference Result 142518 states and 538624 transitions. [2018-12-31 21:35:20,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 21:35:20,822 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2018-12-31 21:35:20,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:35:21,271 INFO L225 Difference]: With dead ends: 142518 [2018-12-31 21:35:21,271 INFO L226 Difference]: Without dead ends: 140662 [2018-12-31 21:35:21,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-12-31 21:35:21,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140662 states. [2018-12-31 21:35:24,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140662 to 114342. [2018-12-31 21:35:24,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114342 states. [2018-12-31 21:35:25,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114342 states to 114342 states and 437784 transitions. [2018-12-31 21:35:25,129 INFO L78 Accepts]: Start accepts. Automaton has 114342 states and 437784 transitions. Word has length 90 [2018-12-31 21:35:25,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:35:25,129 INFO L480 AbstractCegarLoop]: Abstraction has 114342 states and 437784 transitions. [2018-12-31 21:35:25,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 21:35:25,130 INFO L276 IsEmpty]: Start isEmpty. Operand 114342 states and 437784 transitions. [2018-12-31 21:35:25,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-31 21:35:25,282 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:35:25,282 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:35:25,282 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:35:25,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:35:25,283 INFO L82 PathProgramCache]: Analyzing trace with hash 500762638, now seen corresponding path program 1 times [2018-12-31 21:35:25,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:35:25,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:35:25,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:35:25,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:35:25,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:35:25,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:35:25,640 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 21:35:25,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:35:25,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 21:35:25,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 21:35:25,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 21:35:25,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:35:25,642 INFO L87 Difference]: Start difference. First operand 114342 states and 437784 transitions. Second operand 6 states. [2018-12-31 21:35:25,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:35:25,832 INFO L93 Difference]: Finished difference Result 18214 states and 60312 transitions. [2018-12-31 21:35:25,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 21:35:25,833 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2018-12-31 21:35:25,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:35:25,866 INFO L225 Difference]: With dead ends: 18214 [2018-12-31 21:35:25,867 INFO L226 Difference]: Without dead ends: 15878 [2018-12-31 21:35:25,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-31 21:35:25,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15878 states. [2018-12-31 21:35:26,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15878 to 14458. [2018-12-31 21:35:26,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14458 states. [2018-12-31 21:35:26,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14458 states to 14458 states and 48068 transitions. [2018-12-31 21:35:26,096 INFO L78 Accepts]: Start accepts. Automaton has 14458 states and 48068 transitions. Word has length 90 [2018-12-31 21:35:26,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:35:26,096 INFO L480 AbstractCegarLoop]: Abstraction has 14458 states and 48068 transitions. [2018-12-31 21:35:26,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 21:35:26,096 INFO L276 IsEmpty]: Start isEmpty. Operand 14458 states and 48068 transitions. [2018-12-31 21:35:26,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-31 21:35:26,112 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:35:26,113 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:35:26,113 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:35:26,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:35:26,113 INFO L82 PathProgramCache]: Analyzing trace with hash 133273571, now seen corresponding path program 1 times [2018-12-31 21:35:26,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:35:26,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:35:26,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:35:26,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:35:26,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:35:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:35:26,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 21:35:26,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:35:26,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 21:35:26,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 21:35:26,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 21:35:26,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:35:26,488 INFO L87 Difference]: Start difference. First operand 14458 states and 48068 transitions. Second operand 5 states. [2018-12-31 21:35:28,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:35:28,193 INFO L93 Difference]: Finished difference Result 15886 states and 52386 transitions. [2018-12-31 21:35:28,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 21:35:28,194 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-12-31 21:35:28,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:35:28,224 INFO L225 Difference]: With dead ends: 15886 [2018-12-31 21:35:28,224 INFO L226 Difference]: Without dead ends: 15886 [2018-12-31 21:35:28,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 21:35:28,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15886 states. [2018-12-31 21:35:28,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15886 to 14718. [2018-12-31 21:35:28,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14718 states. [2018-12-31 21:35:28,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14718 states to 14718 states and 48801 transitions. [2018-12-31 21:35:28,483 INFO L78 Accepts]: Start accepts. Automaton has 14718 states and 48801 transitions. Word has length 102 [2018-12-31 21:35:28,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:35:28,483 INFO L480 AbstractCegarLoop]: Abstraction has 14718 states and 48801 transitions. [2018-12-31 21:35:28,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 21:35:28,483 INFO L276 IsEmpty]: Start isEmpty. Operand 14718 states and 48801 transitions. [2018-12-31 21:35:28,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-31 21:35:28,505 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:35:28,505 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:35:28,505 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:35:28,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:35:28,506 INFO L82 PathProgramCache]: Analyzing trace with hash 258691989, now seen corresponding path program 1 times [2018-12-31 21:35:28,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:35:28,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:35:28,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:35:28,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:35:28,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:35:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:35:28,698 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 21:35:28,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:35:28,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 21:35:28,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 21:35:28,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 21:35:28,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:35:28,699 INFO L87 Difference]: Start difference. First operand 14718 states and 48801 transitions. Second operand 6 states. [2018-12-31 21:35:29,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:35:29,063 INFO L93 Difference]: Finished difference Result 16033 states and 52403 transitions. [2018-12-31 21:35:29,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 21:35:29,064 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-31 21:35:29,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:35:29,094 INFO L225 Difference]: With dead ends: 16033 [2018-12-31 21:35:29,094 INFO L226 Difference]: Without dead ends: 15843 [2018-12-31 21:35:29,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:35:29,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15843 states. [2018-12-31 21:35:29,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15843 to 15518. [2018-12-31 21:35:29,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15518 states. [2018-12-31 21:35:29,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15518 states to 15518 states and 51046 transitions. [2018-12-31 21:35:29,343 INFO L78 Accepts]: Start accepts. Automaton has 15518 states and 51046 transitions. Word has length 102 [2018-12-31 21:35:29,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:35:29,344 INFO L480 AbstractCegarLoop]: Abstraction has 15518 states and 51046 transitions. [2018-12-31 21:35:29,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 21:35:29,344 INFO L276 IsEmpty]: Start isEmpty. Operand 15518 states and 51046 transitions. [2018-12-31 21:35:29,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-31 21:35:29,363 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:35:29,363 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:35:29,364 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:35:29,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:35:29,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1959432468, now seen corresponding path program 1 times [2018-12-31 21:35:29,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:35:29,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:35:29,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:35:29,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:35:29,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:35:29,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:35:29,641 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 21:35:29,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:35:29,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 21:35:29,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 21:35:29,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 21:35:29,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:35:29,642 INFO L87 Difference]: Start difference. First operand 15518 states and 51046 transitions. Second operand 7 states. [2018-12-31 21:35:30,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:35:30,086 INFO L93 Difference]: Finished difference Result 16586 states and 54346 transitions. [2018-12-31 21:35:30,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 21:35:30,087 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-31 21:35:30,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:35:30,118 INFO L225 Difference]: With dead ends: 16586 [2018-12-31 21:35:30,118 INFO L226 Difference]: Without dead ends: 16586 [2018-12-31 21:35:30,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:35:30,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16586 states. [2018-12-31 21:35:30,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16586 to 15428. [2018-12-31 21:35:30,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15428 states. [2018-12-31 21:35:30,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15428 states to 15428 states and 50794 transitions. [2018-12-31 21:35:30,377 INFO L78 Accepts]: Start accepts. Automaton has 15428 states and 50794 transitions. Word has length 102 [2018-12-31 21:35:30,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:35:30,378 INFO L480 AbstractCegarLoop]: Abstraction has 15428 states and 50794 transitions. [2018-12-31 21:35:30,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 21:35:30,378 INFO L276 IsEmpty]: Start isEmpty. Operand 15428 states and 50794 transitions. [2018-12-31 21:35:30,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-31 21:35:30,399 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:35:30,399 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:35:30,399 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:35:30,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:35:30,399 INFO L82 PathProgramCache]: Analyzing trace with hash -924655308, now seen corresponding path program 1 times [2018-12-31 21:35:30,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:35:30,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:35:30,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:35:30,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:35:30,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:35:30,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:35:30,610 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 21:35:30,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:35:30,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 21:35:30,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 21:35:30,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 21:35:30,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:35:30,611 INFO L87 Difference]: Start difference. First operand 15428 states and 50794 transitions. Second operand 6 states. [2018-12-31 21:35:30,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:35:30,930 INFO L93 Difference]: Finished difference Result 15044 states and 48906 transitions. [2018-12-31 21:35:30,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 21:35:30,931 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-31 21:35:30,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:35:30,959 INFO L225 Difference]: With dead ends: 15044 [2018-12-31 21:35:30,959 INFO L226 Difference]: Without dead ends: 15044 [2018-12-31 21:35:30,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:35:30,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15044 states. [2018-12-31 21:35:31,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15044 to 12778. [2018-12-31 21:35:31,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12778 states. [2018-12-31 21:35:31,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12778 states to 12778 states and 42026 transitions. [2018-12-31 21:35:31,161 INFO L78 Accepts]: Start accepts. Automaton has 12778 states and 42026 transitions. Word has length 102 [2018-12-31 21:35:31,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:35:31,161 INFO L480 AbstractCegarLoop]: Abstraction has 12778 states and 42026 transitions. [2018-12-31 21:35:31,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 21:35:31,161 INFO L276 IsEmpty]: Start isEmpty. Operand 12778 states and 42026 transitions. [2018-12-31 21:35:31,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-31 21:35:31,175 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:35:31,176 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:35:31,176 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:35:31,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:35:31,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1941612432, now seen corresponding path program 1 times [2018-12-31 21:35:31,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:35:31,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:35:31,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:35:31,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:35:31,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:35:31,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:35:31,378 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 21:35:31,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:35:31,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 21:35:31,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 21:35:31,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 21:35:31,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:35:31,379 INFO L87 Difference]: Start difference. First operand 12778 states and 42026 transitions. Second operand 7 states. [2018-12-31 21:35:32,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:35:32,036 INFO L93 Difference]: Finished difference Result 20640 states and 65963 transitions. [2018-12-31 21:35:32,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-31 21:35:32,038 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2018-12-31 21:35:32,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:35:32,083 INFO L225 Difference]: With dead ends: 20640 [2018-12-31 21:35:32,084 INFO L226 Difference]: Without dead ends: 20512 [2018-12-31 21:35:32,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-31 21:35:32,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20512 states. [2018-12-31 21:35:32,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20512 to 15166. [2018-12-31 21:35:32,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15166 states. [2018-12-31 21:35:32,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15166 states to 15166 states and 49582 transitions. [2018-12-31 21:35:32,469 INFO L78 Accepts]: Start accepts. Automaton has 15166 states and 49582 transitions. Word has length 104 [2018-12-31 21:35:32,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:35:32,469 INFO L480 AbstractCegarLoop]: Abstraction has 15166 states and 49582 transitions. [2018-12-31 21:35:32,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 21:35:32,469 INFO L276 IsEmpty]: Start isEmpty. Operand 15166 states and 49582 transitions. [2018-12-31 21:35:32,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-31 21:35:32,498 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:35:32,498 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:35:32,500 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:35:32,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:35:32,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1108590383, now seen corresponding path program 1 times [2018-12-31 21:35:32,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:35:32,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:35:32,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:35:32,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:35:32,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:35:32,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:35:32,913 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-12-31 21:35:33,303 WARN L181 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 9 [2018-12-31 21:35:33,315 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 21:35:33,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:35:33,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 21:35:33,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 21:35:33,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 21:35:33,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:35:33,317 INFO L87 Difference]: Start difference. First operand 15166 states and 49582 transitions. Second operand 6 states. [2018-12-31 21:35:33,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:35:33,871 INFO L93 Difference]: Finished difference Result 13908 states and 44930 transitions. [2018-12-31 21:35:33,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 21:35:33,872 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-12-31 21:35:33,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:35:33,897 INFO L225 Difference]: With dead ends: 13908 [2018-12-31 21:35:33,897 INFO L226 Difference]: Without dead ends: 13908 [2018-12-31 21:35:33,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-31 21:35:33,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13908 states. [2018-12-31 21:35:34,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13908 to 12938. [2018-12-31 21:35:34,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12938 states. [2018-12-31 21:35:34,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12938 states to 12938 states and 42259 transitions. [2018-12-31 21:35:34,104 INFO L78 Accepts]: Start accepts. Automaton has 12938 states and 42259 transitions. Word has length 104 [2018-12-31 21:35:34,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:35:34,104 INFO L480 AbstractCegarLoop]: Abstraction has 12938 states and 42259 transitions. [2018-12-31 21:35:34,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 21:35:34,105 INFO L276 IsEmpty]: Start isEmpty. Operand 12938 states and 42259 transitions. [2018-12-31 21:35:34,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-31 21:35:34,119 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:35:34,120 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:35:34,120 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:35:34,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:35:34,120 INFO L82 PathProgramCache]: Analyzing trace with hash -2023589103, now seen corresponding path program 1 times [2018-12-31 21:35:34,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:35:34,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:35:34,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:35:34,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:35:34,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:35:34,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:35:34,498 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 21:35:34,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:35:34,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 21:35:34,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 21:35:34,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 21:35:34,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:35:34,501 INFO L87 Difference]: Start difference. First operand 12938 states and 42259 transitions. Second operand 5 states. [2018-12-31 21:35:34,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:35:34,843 INFO L93 Difference]: Finished difference Result 14730 states and 48019 transitions. [2018-12-31 21:35:34,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 21:35:34,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2018-12-31 21:35:34,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:35:34,872 INFO L225 Difference]: With dead ends: 14730 [2018-12-31 21:35:34,872 INFO L226 Difference]: Without dead ends: 14602 [2018-12-31 21:35:34,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:35:34,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14602 states. [2018-12-31 21:35:35,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14602 to 13130. [2018-12-31 21:35:35,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13130 states. [2018-12-31 21:35:35,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13130 states to 13130 states and 42819 transitions. [2018-12-31 21:35:35,096 INFO L78 Accepts]: Start accepts. Automaton has 13130 states and 42819 transitions. Word has length 104 [2018-12-31 21:35:35,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:35:35,096 INFO L480 AbstractCegarLoop]: Abstraction has 13130 states and 42819 transitions. [2018-12-31 21:35:35,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 21:35:35,096 INFO L276 IsEmpty]: Start isEmpty. Operand 13130 states and 42819 transitions. [2018-12-31 21:35:35,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-31 21:35:35,112 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:35:35,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, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:35:35,113 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:35:35,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:35:35,113 INFO L82 PathProgramCache]: Analyzing trace with hash -778824622, now seen corresponding path program 1 times [2018-12-31 21:35:35,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:35:35,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:35:35,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:35:35,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:35:35,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:35:35,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:35:35,402 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 21:35:35,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:35:35,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 21:35:35,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 21:35:35,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 21:35:35,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-31 21:35:35,404 INFO L87 Difference]: Start difference. First operand 13130 states and 42819 transitions. Second operand 10 states. [2018-12-31 21:35:36,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:35:36,096 INFO L93 Difference]: Finished difference Result 25326 states and 82898 transitions. [2018-12-31 21:35:36,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 21:35:36,097 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 104 [2018-12-31 21:35:36,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:35:36,122 INFO L225 Difference]: With dead ends: 25326 [2018-12-31 21:35:36,122 INFO L226 Difference]: Without dead ends: 12470 [2018-12-31 21:35:36,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-31 21:35:36,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12470 states. [2018-12-31 21:35:36,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12470 to 12470. [2018-12-31 21:35:36,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12470 states. [2018-12-31 21:35:36,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12470 states to 12470 states and 40899 transitions. [2018-12-31 21:35:36,335 INFO L78 Accepts]: Start accepts. Automaton has 12470 states and 40899 transitions. Word has length 104 [2018-12-31 21:35:36,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:35:36,335 INFO L480 AbstractCegarLoop]: Abstraction has 12470 states and 40899 transitions. [2018-12-31 21:35:36,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 21:35:36,337 INFO L276 IsEmpty]: Start isEmpty. Operand 12470 states and 40899 transitions. [2018-12-31 21:35:36,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-31 21:35:36,358 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:35:36,358 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:35:36,358 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:35:36,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:35:36,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1989616522, now seen corresponding path program 2 times [2018-12-31 21:35:36,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:35:36,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:35:36,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:35:36,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:35:36,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:35:36,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:35:36,530 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 21:35:36,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:35:36,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 21:35:36,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 21:35:36,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 21:35:36,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:35:36,532 INFO L87 Difference]: Start difference. First operand 12470 states and 40899 transitions. Second operand 7 states. [2018-12-31 21:35:36,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:35:36,981 INFO L93 Difference]: Finished difference Result 20686 states and 68353 transitions. [2018-12-31 21:35:36,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 21:35:36,981 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2018-12-31 21:35:36,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:35:37,001 INFO L225 Difference]: With dead ends: 20686 [2018-12-31 21:35:37,001 INFO L226 Difference]: Without dead ends: 8259 [2018-12-31 21:35:37,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-31 21:35:37,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8259 states. [2018-12-31 21:35:37,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8259 to 8259. [2018-12-31 21:35:37,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8259 states. [2018-12-31 21:35:37,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8259 states to 8259 states and 27565 transitions. [2018-12-31 21:35:37,132 INFO L78 Accepts]: Start accepts. Automaton has 8259 states and 27565 transitions. Word has length 104 [2018-12-31 21:35:37,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:35:37,132 INFO L480 AbstractCegarLoop]: Abstraction has 8259 states and 27565 transitions. [2018-12-31 21:35:37,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 21:35:37,132 INFO L276 IsEmpty]: Start isEmpty. Operand 8259 states and 27565 transitions. [2018-12-31 21:35:37,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-31 21:35:37,143 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:35:37,144 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:35:37,144 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:35:37,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:35:37,144 INFO L82 PathProgramCache]: Analyzing trace with hash -380023781, now seen corresponding path program 1 times [2018-12-31 21:35:37,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:35:37,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:35:37,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:35:37,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 21:35:37,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:35:37,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:35:37,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:35:37,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:35:37,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 21:35:37,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 21:35:37,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 21:35:37,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:35:37,327 INFO L87 Difference]: Start difference. First operand 8259 states and 27565 transitions. Second operand 6 states. [2018-12-31 21:35:37,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:35:37,652 INFO L93 Difference]: Finished difference Result 8499 states and 28132 transitions. [2018-12-31 21:35:37,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 21:35:37,653 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-12-31 21:35:37,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:35:37,670 INFO L225 Difference]: With dead ends: 8499 [2018-12-31 21:35:37,670 INFO L226 Difference]: Without dead ends: 8419 [2018-12-31 21:35:37,670 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 21:35:37,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8419 states. [2018-12-31 21:35:37,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8419 to 8211. [2018-12-31 21:35:37,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8211 states. [2018-12-31 21:35:37,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8211 states to 8211 states and 27380 transitions. [2018-12-31 21:35:37,797 INFO L78 Accepts]: Start accepts. Automaton has 8211 states and 27380 transitions. Word has length 104 [2018-12-31 21:35:37,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:35:37,798 INFO L480 AbstractCegarLoop]: Abstraction has 8211 states and 27380 transitions. [2018-12-31 21:35:37,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 21:35:37,798 INFO L276 IsEmpty]: Start isEmpty. Operand 8211 states and 27380 transitions. [2018-12-31 21:35:37,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-31 21:35:37,808 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:35:37,808 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:35:37,809 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:35:37,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:35:37,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1563371078, now seen corresponding path program 3 times [2018-12-31 21:35:37,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:35:37,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:35:37,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:35:37,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:35:37,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:35:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 21:35:37,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 21:35:37,905 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 21:35:38,124 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-31 21:35:38,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:35:38 BasicIcfg [2018-12-31 21:35:38,126 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 21:35:38,126 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 21:35:38,126 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 21:35:38,126 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 21:35:38,129 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:33:07" (3/4) ... [2018-12-31 21:35:38,133 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 21:35:38,351 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 21:35:38,355 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 21:35:38,356 INFO L168 Benchmark]: Toolchain (without parser) took 153439.76 ms. Allocated memory was 1.0 GB in the beginning and 6.8 GB in the end (delta: 5.8 GB). Free memory was 944.6 MB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. [2018-12-31 21:35:38,358 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 21:35:38,358 INFO L168 Benchmark]: CACSL2BoogieTranslator took 927.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -172.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2018-12-31 21:35:38,359 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.07 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-31 21:35:38,359 INFO L168 Benchmark]: Boogie Preprocessor took 46.37 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 21:35:38,359 INFO L168 Benchmark]: RCFGBuilder took 1658.09 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: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 11.5 GB. [2018-12-31 21:35:38,362 INFO L168 Benchmark]: TraceAbstraction took 150488.39 ms. Allocated memory was 1.2 GB in the beginning and 6.8 GB in the end (delta: 5.6 GB). Free memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. [2018-12-31 21:35:38,363 INFO L168 Benchmark]: Witness Printer took 229.36 ms. Allocated memory is still 6.8 GB. Free memory was 2.5 GB in the beginning and 2.5 GB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. [2018-12-31 21:35:38,367 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 927.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -172.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 83.07 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.37 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 1658.09 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: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 150488.39 ms. Allocated memory was 1.2 GB in the beginning and 6.8 GB in the end (delta: 5.6 GB). Free memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. * Witness Printer took 229.36 ms. Allocated memory is still 6.8 GB. Free memory was 2.5 GB in the beginning and 2.5 GB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L676] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L678] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L679] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L680] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L682] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L684] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L685] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L686] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L687] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L688] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L689] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L690] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L691] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L692] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L693] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L694] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L695] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L696] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L697] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L698] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L699] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L700] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L702] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L703] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L704] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] -1 pthread_t t1216; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L787] FCALL, FORK -1 pthread_create(&t1216, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] -1 pthread_t t1217; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L789] FCALL, FORK -1 pthread_create(&t1217, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] -1 pthread_t t1218; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] FCALL, FORK -1 pthread_create(&t1218, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L743] 0 y$w_buff1 = y$w_buff0 [L744] 0 y$w_buff0 = 2 [L745] 0 y$w_buff1_used = y$w_buff0_used [L746] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L748] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L749] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L750] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L751] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L752] 0 y$r_buff0_thd3 = (_Bool)1 [L755] 0 z = 1 [L758] 0 __unbuffered_p2_EAX = z [L761] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L708] 1 a = 1 [L711] 1 x = 1 [L716] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] 2 x = 2 [L726] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L729] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L729] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L730] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L730] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L731] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L765] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L767] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L768] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L731] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L732] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L733] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L736] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L771] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L793] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L798] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L799] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L800] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L801] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L804] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L805] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L806] -1 y$flush_delayed = weak$$choice2 [L807] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L809] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L810] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L811] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L812] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L813] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L814] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] -1 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] -1 y = y$flush_delayed ? y$mem_tmp : y [L817] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 200 locations, 3 error locations. UNSAFE Result, 150.3s OverallTime, 27 OverallIterations, 1 TraceHistogramMax, 35.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7164 SDtfs, 7575 SDslu, 16496 SDs, 0 SdLazy, 6098 SolverSat, 354 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 278 GetRequests, 79 SyntacticMatches, 12 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186424occurred in iteration=3, 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: 81.9s AutomataMinimizationTime, 26 MinimizatonAttempts, 424070 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 2292 NumberOfCodeBlocks, 2292 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2162 ConstructedInterpolants, 0 QuantifiedInterpolants, 445326 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...