java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/eca-rers2012/Problem15_label40.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 03:30:20,589 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 03:30:20,591 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 03:30:20,603 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 03:30:20,603 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 03:30:20,604 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 03:30:20,605 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 03:30:20,607 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 03:30:20,609 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 03:30:20,610 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 03:30:20,610 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 03:30:20,611 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 03:30:20,612 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 03:30:20,613 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 03:30:20,614 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 03:30:20,615 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 03:30:20,616 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 03:30:20,617 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 03:30:20,618 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 03:30:20,620 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 03:30:20,622 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 03:30:20,623 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 03:30:20,624 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 03:30:20,625 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 03:30:20,628 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 03:30:20,629 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 03:30:20,629 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 03:30:20,632 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 03:30:20,633 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 03:30:20,636 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 03:30:20,636 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 03:30:20,637 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 03:30:20,638 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 03:30:20,638 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 03:30:20,641 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 03:30:20,641 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 03:30:20,642 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 03:30:20,642 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 03:30:20,642 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 03:30:20,643 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 03:30:20,644 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 03:30:20,646 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 03:30:20,659 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 03:30:20,660 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 03:30:20,661 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 03:30:20,661 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 03:30:20,661 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 03:30:20,661 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 03:30:20,661 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 03:30:20,661 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 03:30:20,662 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 03:30:20,662 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 03:30:20,662 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 03:30:20,662 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 03:30:20,662 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 03:30:20,663 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 03:30:20,663 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 03:30:20,663 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 03:30:20,663 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 03:30:20,664 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 03:30:20,664 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 03:30:20,664 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 03:30:20,664 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 03:30:20,664 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 03:30:20,665 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 03:30:20,665 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 03:30:20,665 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 03:30:20,665 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 03:30:20,665 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 03:30:20,666 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 03:30:20,666 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 03:30:20,934 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 03:30:20,951 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 03:30:20,954 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 03:30:20,955 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 03:30:20,955 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 03:30:20,956 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label40.c [2019-10-07 03:30:21,011 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/991d234d9/3ec2526137cb435fa3ceda6fa435505b/FLAG8d197627a [2019-10-07 03:30:21,692 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 03:30:21,695 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label40.c [2019-10-07 03:30:21,722 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/991d234d9/3ec2526137cb435fa3ceda6fa435505b/FLAG8d197627a [2019-10-07 03:30:21,845 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/991d234d9/3ec2526137cb435fa3ceda6fa435505b [2019-10-07 03:30:21,853 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 03:30:21,855 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 03:30:21,856 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 03:30:21,856 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 03:30:21,860 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 03:30:21,861 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:30:21" (1/1) ... [2019-10-07 03:30:21,864 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3058475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:30:21, skipping insertion in model container [2019-10-07 03:30:21,865 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:30:21" (1/1) ... [2019-10-07 03:30:21,873 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 03:30:21,965 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 03:30:22,839 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:30:22,848 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 03:30:23,142 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:30:23,162 INFO L192 MainTranslator]: Completed translation [2019-10-07 03:30:23,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:30:23 WrapperNode [2019-10-07 03:30:23,163 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 03:30:23,164 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 03:30:23,164 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 03:30:23,164 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 03:30:23,179 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:30:23" (1/1) ... [2019-10-07 03:30:23,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:30:23" (1/1) ... [2019-10-07 03:30:23,235 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:30:23" (1/1) ... [2019-10-07 03:30:23,236 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:30:23" (1/1) ... [2019-10-07 03:30:23,310 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:30:23" (1/1) ... [2019-10-07 03:30:23,336 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:30:23" (1/1) ... [2019-10-07 03:30:23,353 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:30:23" (1/1) ... [2019-10-07 03:30:23,377 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 03:30:23,378 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 03:30:23,378 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 03:30:23,378 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 03:30:23,380 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:30:23" (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 [2019-10-07 03:30:23,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 03:30:23,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 03:30:23,447 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-07 03:30:23,447 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-10-07 03:30:23,447 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 03:30:23,448 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-07 03:30:23,448 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-10-07 03:30:23,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 03:30:23,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 03:30:23,449 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 03:30:23,449 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 03:30:23,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 03:30:23,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 03:30:40,040 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 03:30:40,040 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 03:30:40,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:30:40 BoogieIcfgContainer [2019-10-07 03:30:40,042 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 03:30:40,043 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 03:30:40,043 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 03:30:40,046 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 03:30:40,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 03:30:21" (1/3) ... [2019-10-07 03:30:40,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67250098 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:30:40, skipping insertion in model container [2019-10-07 03:30:40,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:30:23" (2/3) ... [2019-10-07 03:30:40,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67250098 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:30:40, skipping insertion in model container [2019-10-07 03:30:40,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:30:40" (3/3) ... [2019-10-07 03:30:40,050 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label40.c [2019-10-07 03:30:40,060 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 03:30:40,068 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 03:30:40,080 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 03:30:40,108 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 03:30:40,108 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 03:30:40,108 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 03:30:40,108 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 03:30:40,108 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 03:30:40,109 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 03:30:40,109 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 03:30:40,109 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 03:30:40,134 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states. [2019-10-07 03:30:40,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-07 03:30:40,140 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:30:40,141 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:30:40,143 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:30:40,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:30:40,149 INFO L82 PathProgramCache]: Analyzing trace with hash 648045933, now seen corresponding path program 1 times [2019-10-07 03:30:40,157 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:30:40,158 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:30:40,158 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:30:40,158 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:30:40,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:30:40,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:30:40,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:30:40,387 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:30:40,388 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:30:40,390 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 03:30:40,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 03:30:40,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 03:30:40,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 03:30:40,412 INFO L87 Difference]: Start difference. First operand 244 states. Second operand 4 states. [2019-10-07 03:30:44,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:30:44,917 INFO L93 Difference]: Finished difference Result 953 states and 1850 transitions. [2019-10-07 03:30:44,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 03:30:44,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-07 03:30:44,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:30:44,946 INFO L225 Difference]: With dead ends: 953 [2019-10-07 03:30:44,946 INFO L226 Difference]: Without dead ends: 702 [2019-10-07 03:30:44,955 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 03:30:44,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2019-10-07 03:30:45,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 469. [2019-10-07 03:30:45,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2019-10-07 03:30:45,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 744 transitions. [2019-10-07 03:30:45,044 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 744 transitions. Word has length 11 [2019-10-07 03:30:45,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:30:45,045 INFO L462 AbstractCegarLoop]: Abstraction has 469 states and 744 transitions. [2019-10-07 03:30:45,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 03:30:45,046 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 744 transitions. [2019-10-07 03:30:45,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-07 03:30:45,048 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:30:45,049 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:30:45,049 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:30:45,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:30:45,050 INFO L82 PathProgramCache]: Analyzing trace with hash 406805821, now seen corresponding path program 1 times [2019-10-07 03:30:45,051 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:30:45,051 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:30:45,051 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:30:45,051 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:30:45,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:30:45,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:30:45,305 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:30:45,306 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:30:45,306 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:30:45,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:30:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:30:45,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-07 03:30:45,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:30:45,471 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:30:45,472 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:30:45,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:30:45,656 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:30:45,656 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 03:30:45,656 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [7] total 11 [2019-10-07 03:30:45,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 03:30:45,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 03:30:45,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-10-07 03:30:45,662 INFO L87 Difference]: Start difference. First operand 469 states and 744 transitions. Second operand 7 states. [2019-10-07 03:30:52,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:30:52,238 INFO L93 Difference]: Finished difference Result 1637 states and 2539 transitions. [2019-10-07 03:30:52,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 03:30:52,239 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-10-07 03:30:52,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:30:52,249 INFO L225 Difference]: With dead ends: 1637 [2019-10-07 03:30:52,249 INFO L226 Difference]: Without dead ends: 1173 [2019-10-07 03:30:52,251 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-10-07 03:30:52,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2019-10-07 03:30:52,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 933. [2019-10-07 03:30:52,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2019-10-07 03:30:52,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1358 transitions. [2019-10-07 03:30:52,338 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1358 transitions. Word has length 21 [2019-10-07 03:30:52,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:30:52,339 INFO L462 AbstractCegarLoop]: Abstraction has 933 states and 1358 transitions. [2019-10-07 03:30:52,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 03:30:52,339 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1358 transitions. [2019-10-07 03:30:52,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-07 03:30:52,340 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:30:52,340 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:30:52,549 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:30:52,550 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:30:52,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:30:52,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1517665072, now seen corresponding path program 1 times [2019-10-07 03:30:52,550 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:30:52,550 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:30:52,551 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:30:52,551 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:30:52,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:30:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:30:52,653 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:30:52,654 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:30:52,655 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:30:52,655 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 03:30:52,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 03:30:52,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 03:30:52,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 03:30:52,657 INFO L87 Difference]: Start difference. First operand 933 states and 1358 transitions. Second operand 6 states. [2019-10-07 03:30:56,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:30:56,417 INFO L93 Difference]: Finished difference Result 2601 states and 3983 transitions. [2019-10-07 03:30:56,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 03:30:56,425 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-10-07 03:30:56,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:30:56,441 INFO L225 Difference]: With dead ends: 2601 [2019-10-07 03:30:56,442 INFO L226 Difference]: Without dead ends: 1673 [2019-10-07 03:30:56,445 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-07 03:30:56,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2019-10-07 03:30:56,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1588. [2019-10-07 03:30:56,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2019-10-07 03:30:56,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 2364 transitions. [2019-10-07 03:30:56,552 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 2364 transitions. Word has length 26 [2019-10-07 03:30:56,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:30:56,553 INFO L462 AbstractCegarLoop]: Abstraction has 1588 states and 2364 transitions. [2019-10-07 03:30:56,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 03:30:56,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 2364 transitions. [2019-10-07 03:30:56,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-07 03:30:56,554 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:30:56,555 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:30:56,555 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:30:56,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:30:56,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1597082628, now seen corresponding path program 1 times [2019-10-07 03:30:56,556 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:30:56,556 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:30:56,556 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:30:56,556 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:30:56,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:30:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:30:56,665 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:30:56,665 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:30:56,665 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:30:56,665 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 03:30:56,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 03:30:56,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 03:30:56,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 03:30:56,666 INFO L87 Difference]: Start difference. First operand 1588 states and 2364 transitions. Second operand 4 states. [2019-10-07 03:31:00,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:31:00,150 INFO L93 Difference]: Finished difference Result 5005 states and 7646 transitions. [2019-10-07 03:31:00,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 03:31:00,154 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-10-07 03:31:00,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:31:00,172 INFO L225 Difference]: With dead ends: 5005 [2019-10-07 03:31:00,173 INFO L226 Difference]: Without dead ends: 3422 [2019-10-07 03:31:00,177 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 03:31:00,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3422 states. [2019-10-07 03:31:00,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3422 to 3135. [2019-10-07 03:31:00,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2019-10-07 03:31:00,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 4511 transitions. [2019-10-07 03:31:00,312 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 4511 transitions. Word has length 32 [2019-10-07 03:31:00,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:31:00,312 INFO L462 AbstractCegarLoop]: Abstraction has 3135 states and 4511 transitions. [2019-10-07 03:31:00,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 03:31:00,312 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 4511 transitions. [2019-10-07 03:31:00,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-07 03:31:00,314 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:31:00,315 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:31:00,315 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:31:00,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:31:00,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1707491326, now seen corresponding path program 1 times [2019-10-07 03:31:00,315 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:31:00,316 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:31:00,316 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:31:00,316 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:31:00,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:31:00,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:31:00,460 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 03:31:00,460 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:31:00,460 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:31:00,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:31:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:31:00,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-07 03:31:00,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:31:00,580 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 03:31:00,580 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:31:00,635 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 03:31:00,636 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 03:31:00,636 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2019-10-07 03:31:00,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 03:31:00,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 03:31:00,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-10-07 03:31:00,637 INFO L87 Difference]: Start difference. First operand 3135 states and 4511 transitions. Second operand 5 states. [2019-10-07 03:31:04,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:31:04,079 INFO L93 Difference]: Finished difference Result 6563 states and 9806 transitions. [2019-10-07 03:31:04,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 03:31:04,079 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-10-07 03:31:04,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:31:04,096 INFO L225 Difference]: With dead ends: 6563 [2019-10-07 03:31:04,096 INFO L226 Difference]: Without dead ends: 3433 [2019-10-07 03:31:04,105 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-10-07 03:31:04,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3433 states. [2019-10-07 03:31:04,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3433 to 3175. [2019-10-07 03:31:04,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3175 states. [2019-10-07 03:31:04,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3175 states to 3175 states and 4409 transitions. [2019-10-07 03:31:04,203 INFO L78 Accepts]: Start accepts. Automaton has 3175 states and 4409 transitions. Word has length 46 [2019-10-07 03:31:04,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:31:04,204 INFO L462 AbstractCegarLoop]: Abstraction has 3175 states and 4409 transitions. [2019-10-07 03:31:04,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 03:31:04,204 INFO L276 IsEmpty]: Start isEmpty. Operand 3175 states and 4409 transitions. [2019-10-07 03:31:04,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-07 03:31:04,205 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:31:04,205 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:31:04,409 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:31:04,410 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:31:04,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:31:04,411 INFO L82 PathProgramCache]: Analyzing trace with hash -412861701, now seen corresponding path program 1 times [2019-10-07 03:31:04,411 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:31:04,412 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:31:04,412 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:31:04,412 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:31:04,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:31:04,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:31:04,532 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:31:04,533 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:31:04,533 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:31:04,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:31:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:31:04,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-07 03:31:04,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:31:04,638 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:31:04,639 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:31:04,728 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:31:04,728 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 03:31:04,728 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 14 [2019-10-07 03:31:04,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 03:31:04,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 03:31:04,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-10-07 03:31:04,729 INFO L87 Difference]: Start difference. First operand 3175 states and 4409 transitions. Second operand 6 states. [2019-10-07 03:31:13,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:31:13,496 INFO L93 Difference]: Finished difference Result 9337 states and 13431 transitions. [2019-10-07 03:31:13,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 03:31:13,502 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-10-07 03:31:13,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:31:13,536 INFO L225 Difference]: With dead ends: 9337 [2019-10-07 03:31:13,536 INFO L226 Difference]: Without dead ends: 6167 [2019-10-07 03:31:13,548 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-10-07 03:31:13,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6167 states. [2019-10-07 03:31:13,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6167 to 5291. [2019-10-07 03:31:13,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5291 states. [2019-10-07 03:31:13,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5291 states to 5291 states and 7685 transitions. [2019-10-07 03:31:13,703 INFO L78 Accepts]: Start accepts. Automaton has 5291 states and 7685 transitions. Word has length 47 [2019-10-07 03:31:13,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:31:13,704 INFO L462 AbstractCegarLoop]: Abstraction has 5291 states and 7685 transitions. [2019-10-07 03:31:13,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 03:31:13,704 INFO L276 IsEmpty]: Start isEmpty. Operand 5291 states and 7685 transitions. [2019-10-07 03:31:13,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-07 03:31:13,708 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:31:13,708 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:31:13,912 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:31:13,912 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:31:13,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:31:13,913 INFO L82 PathProgramCache]: Analyzing trace with hash -659190202, now seen corresponding path program 1 times [2019-10-07 03:31:13,913 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:31:13,913 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:31:13,913 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:31:13,913 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:31:13,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:31:13,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:31:14,094 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 03:31:14,095 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:31:14,095 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:31:14,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:31:14,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:31:14,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-07 03:31:14,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:31:14,236 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 03:31:14,237 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:31:14,364 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 03:31:14,365 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 03:31:14,365 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 8 [2019-10-07 03:31:14,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 03:31:14,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 03:31:14,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-07 03:31:14,368 INFO L87 Difference]: Start difference. First operand 5291 states and 7685 transitions. Second operand 5 states. [2019-10-07 03:31:17,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:31:17,909 INFO L93 Difference]: Finished difference Result 14051 states and 21337 transitions. [2019-10-07 03:31:17,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 03:31:17,911 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-10-07 03:31:17,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:31:17,959 INFO L225 Difference]: With dead ends: 14051 [2019-10-07 03:31:17,960 INFO L226 Difference]: Without dead ends: 8765 [2019-10-07 03:31:17,976 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 119 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-10-07 03:31:17,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8765 states. [2019-10-07 03:31:18,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8765 to 6045. [2019-10-07 03:31:18,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6045 states. [2019-10-07 03:31:18,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6045 states to 6045 states and 8762 transitions. [2019-10-07 03:31:18,180 INFO L78 Accepts]: Start accepts. Automaton has 6045 states and 8762 transitions. Word has length 60 [2019-10-07 03:31:18,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:31:18,182 INFO L462 AbstractCegarLoop]: Abstraction has 6045 states and 8762 transitions. [2019-10-07 03:31:18,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 03:31:18,182 INFO L276 IsEmpty]: Start isEmpty. Operand 6045 states and 8762 transitions. [2019-10-07 03:31:18,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-07 03:31:18,195 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:31:18,196 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:31:18,409 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:31:18,409 INFO L410 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:31:18,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:31:18,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1587167513, now seen corresponding path program 1 times [2019-10-07 03:31:18,410 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:31:18,410 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:31:18,410 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:31:18,410 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:31:18,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:31:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:31:18,632 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-07 03:31:18,633 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:31:18,633 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:31:18,634 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 03:31:18,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 03:31:18,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 03:31:18,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 03:31:18,635 INFO L87 Difference]: Start difference. First operand 6045 states and 8762 transitions. Second operand 4 states. [2019-10-07 03:31:21,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:31:21,979 INFO L93 Difference]: Finished difference Result 15628 states and 23358 transitions. [2019-10-07 03:31:21,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 03:31:21,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-10-07 03:31:21,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:31:22,019 INFO L225 Difference]: With dead ends: 15628 [2019-10-07 03:31:22,019 INFO L226 Difference]: Without dead ends: 9588 [2019-10-07 03:31:22,036 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 03:31:22,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9588 states. [2019-10-07 03:31:22,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9588 to 8230. [2019-10-07 03:31:22,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8230 states. [2019-10-07 03:31:22,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8230 states to 8230 states and 12444 transitions. [2019-10-07 03:31:22,347 INFO L78 Accepts]: Start accepts. Automaton has 8230 states and 12444 transitions. Word has length 192 [2019-10-07 03:31:22,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:31:22,349 INFO L462 AbstractCegarLoop]: Abstraction has 8230 states and 12444 transitions. [2019-10-07 03:31:22,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 03:31:22,349 INFO L276 IsEmpty]: Start isEmpty. Operand 8230 states and 12444 transitions. [2019-10-07 03:31:22,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-10-07 03:31:22,353 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:31:22,354 INFO L385 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:31:22,354 INFO L410 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:31:22,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:31:22,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1407634957, now seen corresponding path program 1 times [2019-10-07 03:31:22,355 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:31:22,356 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:31:22,356 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:31:22,357 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:31:22,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:31:22,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:31:22,655 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 55 proven. 26 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-07 03:31:22,656 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:31:22,656 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:31:22,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:31:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:31:22,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-07 03:31:22,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:31:22,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 03:31:23,070 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-10-07 03:31:23,070 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:31:23,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:31:23,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:31:23,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:31:23,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:31:23,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:31:23,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:31:23,590 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 20 proven. 33 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-07 03:31:23,591 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 03:31:23,591 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 5] total 16 [2019-10-07 03:31:23,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 03:31:23,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 03:31:23,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-10-07 03:31:23,593 INFO L87 Difference]: Start difference. First operand 8230 states and 12444 transitions. Second operand 5 states. [2019-10-07 03:31:27,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:31:27,949 INFO L93 Difference]: Finished difference Result 16751 states and 25379 transitions. [2019-10-07 03:31:27,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 03:31:27,949 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 197 [2019-10-07 03:31:27,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:31:27,982 INFO L225 Difference]: With dead ends: 16751 [2019-10-07 03:31:27,982 INFO L226 Difference]: Without dead ends: 8526 [2019-10-07 03:31:28,003 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 390 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2019-10-07 03:31:28,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8526 states. [2019-10-07 03:31:28,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8526 to 8508. [2019-10-07 03:31:28,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8508 states. [2019-10-07 03:31:28,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8508 states to 8508 states and 12829 transitions. [2019-10-07 03:31:28,221 INFO L78 Accepts]: Start accepts. Automaton has 8508 states and 12829 transitions. Word has length 197 [2019-10-07 03:31:28,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:31:28,222 INFO L462 AbstractCegarLoop]: Abstraction has 8508 states and 12829 transitions. [2019-10-07 03:31:28,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 03:31:28,223 INFO L276 IsEmpty]: Start isEmpty. Operand 8508 states and 12829 transitions. [2019-10-07 03:31:28,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-07 03:31:28,230 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:31:28,231 INFO L385 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:31:28,445 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:31:28,445 INFO L410 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:31:28,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:31:28,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1829705243, now seen corresponding path program 1 times [2019-10-07 03:31:28,446 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:31:28,446 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:31:28,446 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:31:28,446 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:31:28,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:31:28,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:31:29,644 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 25 proven. 156 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 03:31:29,644 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:31:29,645 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:31:29,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:31:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:31:29,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 844 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-07 03:31:29,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:31:29,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-07 03:31:29,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-07 03:31:30,159 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 104 proven. 29 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-10-07 03:31:30,159 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:31:30,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:31:30,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-07 03:31:30,580 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 41 proven. 98 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-07 03:31:30,580 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 03:31:30,614 INFO L162 IcfgInterpreter]: Started Sifa with 148 locations of interest [2019-10-07 03:31:30,614 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 03:31:30,619 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 03:31:30,628 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 03:31:30,628 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 03:31:30,767 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 58 for LOIs [2019-10-07 03:31:30,968 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 20 [2019-10-07 03:31:31,094 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 20 [2019-10-07 03:31:31,207 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 41 [2019-10-07 03:31:31,654 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 9663 conjuctions. This might take some time... [2019-10-07 03:31:31,822 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 41 [2019-10-07 03:31:32,045 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 9663 conjuctions. This might take some time... [2019-10-07 03:31:32,525 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:31:32,526 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: assume true; at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:133) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: assume true; at de.uni_freiburg.informatik.ultimate.lib.sifa.PriorityWorklist.add(PriorityWorklist.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.lambda$2(DagInterpreter.java:135) at java.lang.Iterable.forEach(Iterable.java:75) at java.util.Collections$UnmodifiableCollection.forEach(Collections.java:1080) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:135) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:104) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.computeTopSummary(TopInputCallSummarizer.java:78) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:67) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:230) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:214) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:197) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:166) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:104) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarizeInternal(FixpointLoopSummarizer.java:118) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:178) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:169) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:287) ... 21 more [2019-10-07 03:31:32,533 INFO L168 Benchmark]: Toolchain (without parser) took 70676.96 ms. Allocated memory was 146.3 MB in the beginning and 688.4 MB in the end (delta: 542.1 MB). Free memory was 97.7 MB in the beginning and 129.8 MB in the end (delta: -32.1 MB). Peak memory consumption was 510.0 MB. Max. memory is 7.1 GB. [2019-10-07 03:31:32,534 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 03:31:32,535 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1307.41 ms. Allocated memory was 146.3 MB in the beginning and 206.6 MB in the end (delta: 60.3 MB). Free memory was 97.4 MB in the beginning and 112.6 MB in the end (delta: -15.2 MB). Peak memory consumption was 53.1 MB. Max. memory is 7.1 GB. [2019-10-07 03:31:32,536 INFO L168 Benchmark]: Boogie Preprocessor took 213.65 ms. Allocated memory is still 206.6 MB. Free memory was 112.6 MB in the beginning and 99.8 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. [2019-10-07 03:31:32,537 INFO L168 Benchmark]: RCFGBuilder took 16664.12 ms. Allocated memory was 206.6 MB in the beginning and 298.3 MB in the end (delta: 91.8 MB). Free memory was 99.8 MB in the beginning and 221.7 MB in the end (delta: -121.9 MB). Peak memory consumption was 114.2 MB. Max. memory is 7.1 GB. [2019-10-07 03:31:32,539 INFO L168 Benchmark]: TraceAbstraction took 52487.14 ms. Allocated memory was 298.3 MB in the beginning and 688.4 MB in the end (delta: 390.1 MB). Free memory was 221.7 MB in the beginning and 129.8 MB in the end (delta: 92.0 MB). Peak memory consumption was 482.0 MB. Max. memory is 7.1 GB. [2019-10-07 03:31:32,546 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1307.41 ms. Allocated memory was 146.3 MB in the beginning and 206.6 MB in the end (delta: 60.3 MB). Free memory was 97.4 MB in the beginning and 112.6 MB in the end (delta: -15.2 MB). Peak memory consumption was 53.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 213.65 ms. Allocated memory is still 206.6 MB. Free memory was 112.6 MB in the beginning and 99.8 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 16664.12 ms. Allocated memory was 206.6 MB in the beginning and 298.3 MB in the end (delta: 91.8 MB). Free memory was 99.8 MB in the beginning and 221.7 MB in the end (delta: -121.9 MB). Peak memory consumption was 114.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 52487.14 ms. Allocated memory was 298.3 MB in the beginning and 688.4 MB in the end (delta: 390.1 MB). Free memory was 221.7 MB in the beginning and 129.8 MB in the end (delta: 92.0 MB). Peak memory consumption was 482.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: assume true; de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: assume true;: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...