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/Problem01_label47.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:56:53,660 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:56:53,662 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:56:53,682 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:56:53,682 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:56:53,684 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:56:53,686 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:56:53,689 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:56:53,692 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:56:53,694 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:56:53,695 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:56:53,696 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:56:53,697 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:56:53,698 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:56:53,702 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:56:53,703 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:56:53,704 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:56:53,705 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:56:53,706 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:56:53,708 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:56:53,710 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:56:53,712 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:56:53,714 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:56:53,716 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:56:53,719 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:56:53,719 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:56:53,722 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:56:53,723 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:56:53,723 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:56:53,724 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:56:53,726 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:56:53,727 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:56:53,728 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:56:53,730 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:56:53,731 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:56:53,731 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:56:53,735 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:56:53,735 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:56:53,735 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:56:53,737 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:56:53,738 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:56:53,739 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 00:56:53,764 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:56:53,765 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:56:53,767 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:56:53,767 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:56:53,768 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:56:53,768 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:56:53,768 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:56:53,768 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:56:53,769 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:56:53,769 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:56:53,770 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:56:53,770 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:56:53,770 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:56:53,771 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:56:53,771 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:56:53,771 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:56:53,771 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:56:53,772 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:56:53,772 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:56:53,772 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:56:53,772 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:56:53,773 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:56:53,773 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:56:53,773 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:56:53,773 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:56:53,773 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:56:53,774 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:56:53,774 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:56:53,774 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 00:56:54,059 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:56:54,074 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:56:54,080 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:56:54,081 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:56:54,082 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:56:54,082 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label47.c [2019-10-07 00:56:54,159 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cba682963/a7c2fec7986349a58fb1e7249837ca23/FLAG9fa370d9f [2019-10-07 00:56:54,740 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:56:54,741 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label47.c [2019-10-07 00:56:54,754 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cba682963/a7c2fec7986349a58fb1e7249837ca23/FLAG9fa370d9f [2019-10-07 00:56:54,977 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cba682963/a7c2fec7986349a58fb1e7249837ca23 [2019-10-07 00:56:54,990 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:56:54,992 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:56:54,993 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:56:54,993 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:56:54,997 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:56:54,998 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:56:54" (1/1) ... [2019-10-07 00:56:55,002 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25396617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:56:54, skipping insertion in model container [2019-10-07 00:56:55,002 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:56:54" (1/1) ... [2019-10-07 00:56:55,010 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:56:55,060 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:56:55,603 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:56:55,612 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:56:55,773 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:56:55,792 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:56:55,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:56:55 WrapperNode [2019-10-07 00:56:55,792 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:56:55,793 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:56:55,793 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:56:55,794 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:56:55,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:56:55" (1/1) ... [2019-10-07 00:56:55,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:56:55" (1/1) ... [2019-10-07 00:56:55,824 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:56:55" (1/1) ... [2019-10-07 00:56:55,825 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:56:55" (1/1) ... [2019-10-07 00:56:55,869 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:56:55" (1/1) ... [2019-10-07 00:56:55,886 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:56:55" (1/1) ... [2019-10-07 00:56:55,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:56:55" (1/1) ... [2019-10-07 00:56:55,906 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:56:55,906 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:56:55,906 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:56:55,906 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:56:55,907 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:56:55" (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 00:56:55,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:56:55,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:56:55,968 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-07 00:56:55,968 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:56:55,968 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-07 00:56:55,969 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:56:55,969 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 00:56:55,969 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 00:56:55,969 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:56:55,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:56:55,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:56:57,977 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:56:57,978 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 00:56:57,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:56:57 BoogieIcfgContainer [2019-10-07 00:56:57,980 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:56:57,981 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:56:57,981 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:56:57,984 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:56:57,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:56:54" (1/3) ... [2019-10-07 00:56:57,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d74e421 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:56:57, skipping insertion in model container [2019-10-07 00:56:57,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:56:55" (2/3) ... [2019-10-07 00:56:57,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d74e421 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:56:57, skipping insertion in model container [2019-10-07 00:56:57,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:56:57" (3/3) ... [2019-10-07 00:56:57,989 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label47.c [2019-10-07 00:56:57,999 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:56:58,008 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:56:58,020 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:56:58,060 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:56:58,060 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:56:58,060 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:56:58,061 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:56:58,061 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:56:58,061 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:56:58,061 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:56:58,061 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:56:58,081 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2019-10-07 00:56:58,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-07 00:56:58,090 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:56:58,091 INFO L385 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] [2019-10-07 00:56:58,092 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:56:58,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:56:58,098 INFO L82 PathProgramCache]: Analyzing trace with hash 826719236, now seen corresponding path program 1 times [2019-10-07 00:56:58,106 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:56:58,106 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:56:58,107 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:56:58,107 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:56:58,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:56:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:56:58,506 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 00:56:58,507 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:56:58,508 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:56:58,508 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:56:58,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:56:58,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:56:58,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:56:58,532 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 3 states. [2019-10-07 00:56:59,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:56:59,046 INFO L93 Difference]: Finished difference Result 246 states and 454 transitions. [2019-10-07 00:56:59,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:56:59,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-10-07 00:56:59,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:56:59,073 INFO L225 Difference]: With dead ends: 246 [2019-10-07 00:56:59,073 INFO L226 Difference]: Without dead ends: 157 [2019-10-07 00:56:59,080 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:56:59,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-10-07 00:56:59,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-10-07 00:56:59,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-07 00:56:59,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 279 transitions. [2019-10-07 00:56:59,193 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 279 transitions. Word has length 77 [2019-10-07 00:56:59,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:56:59,195 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 279 transitions. [2019-10-07 00:56:59,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:56:59,196 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 279 transitions. [2019-10-07 00:56:59,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-07 00:56:59,205 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:56:59,205 INFO L385 BasicCegarLoop]: trace histogram [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] [2019-10-07 00:56:59,206 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:56:59,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:56:59,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1195767397, now seen corresponding path program 1 times [2019-10-07 00:56:59,207 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:56:59,208 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:56:59,208 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:56:59,209 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:56:59,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:56:59,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:56:59,397 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:56:59,397 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:56:59,398 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:56:59,398 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 00:56:59,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 00:56:59,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 00:56:59,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 00:56:59,401 INFO L87 Difference]: Start difference. First operand 157 states and 279 transitions. Second operand 6 states. [2019-10-07 00:57:00,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:57:00,010 INFO L93 Difference]: Finished difference Result 402 states and 725 transitions. [2019-10-07 00:57:00,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 00:57:00,011 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2019-10-07 00:57:00,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:57:00,016 INFO L225 Difference]: With dead ends: 402 [2019-10-07 00:57:00,016 INFO L226 Difference]: Without dead ends: 250 [2019-10-07 00:57:00,018 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 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 00:57:00,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-10-07 00:57:00,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 238. [2019-10-07 00:57:00,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-10-07 00:57:00,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 407 transitions. [2019-10-07 00:57:00,049 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 407 transitions. Word has length 87 [2019-10-07 00:57:00,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:57:00,050 INFO L462 AbstractCegarLoop]: Abstraction has 238 states and 407 transitions. [2019-10-07 00:57:00,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 00:57:00,050 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 407 transitions. [2019-10-07 00:57:00,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-07 00:57:00,053 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:57:00,054 INFO L385 BasicCegarLoop]: trace histogram [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] [2019-10-07 00:57:00,054 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:57:00,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:57:00,055 INFO L82 PathProgramCache]: Analyzing trace with hash -2128789001, now seen corresponding path program 1 times [2019-10-07 00:57:00,055 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:57:00,055 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:00,055 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:00,055 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:00,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:57:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:57:00,166 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:57:00,166 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:00,167 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:57:00,167 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:57:00,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:57:00,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:57:00,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:57:00,168 INFO L87 Difference]: Start difference. First operand 238 states and 407 transitions. Second operand 3 states. [2019-10-07 00:57:00,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:57:00,611 INFO L93 Difference]: Finished difference Result 700 states and 1242 transitions. [2019-10-07 00:57:00,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:57:00,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-10-07 00:57:00,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:57:00,616 INFO L225 Difference]: With dead ends: 700 [2019-10-07 00:57:00,617 INFO L226 Difference]: Without dead ends: 467 [2019-10-07 00:57:00,618 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:57:00,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-10-07 00:57:00,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 467. [2019-10-07 00:57:00,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2019-10-07 00:57:00,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 737 transitions. [2019-10-07 00:57:00,653 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 737 transitions. Word has length 88 [2019-10-07 00:57:00,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:57:00,654 INFO L462 AbstractCegarLoop]: Abstraction has 467 states and 737 transitions. [2019-10-07 00:57:00,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:57:00,655 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 737 transitions. [2019-10-07 00:57:00,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-07 00:57:00,659 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:57:00,660 INFO L385 BasicCegarLoop]: trace histogram [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] [2019-10-07 00:57:00,660 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:57:00,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:57:00,661 INFO L82 PathProgramCache]: Analyzing trace with hash -847394153, now seen corresponding path program 1 times [2019-10-07 00:57:00,661 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:57:00,661 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:00,661 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:00,661 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:00,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:57:00,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:57:00,755 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:57:00,756 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:00,756 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:57:00,756 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 00:57:00,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 00:57:00,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 00:57:00,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 00:57:00,758 INFO L87 Difference]: Start difference. First operand 467 states and 737 transitions. Second operand 4 states. [2019-10-07 00:57:01,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:57:01,564 INFO L93 Difference]: Finished difference Result 1539 states and 2560 transitions. [2019-10-07 00:57:01,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 00:57:01,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-10-07 00:57:01,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:57:01,574 INFO L225 Difference]: With dead ends: 1539 [2019-10-07 00:57:01,574 INFO L226 Difference]: Without dead ends: 1077 [2019-10-07 00:57:01,576 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 00:57:01,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-10-07 00:57:01,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 700. [2019-10-07 00:57:01,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2019-10-07 00:57:01,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 1148 transitions. [2019-10-07 00:57:01,636 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 1148 transitions. Word has length 89 [2019-10-07 00:57:01,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:57:01,637 INFO L462 AbstractCegarLoop]: Abstraction has 700 states and 1148 transitions. [2019-10-07 00:57:01,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 00:57:01,637 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 1148 transitions. [2019-10-07 00:57:01,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-07 00:57:01,640 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:57:01,641 INFO L385 BasicCegarLoop]: trace histogram [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] [2019-10-07 00:57:01,641 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:57:01,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:57:01,642 INFO L82 PathProgramCache]: Analyzing trace with hash 579694187, now seen corresponding path program 1 times [2019-10-07 00:57:01,642 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:57:01,642 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:01,643 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:01,643 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:01,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:57:01,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:57:01,799 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:57:01,800 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:01,800 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:57:01,800 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:57:01,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:57:01,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:57:01,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:57:01,804 INFO L87 Difference]: Start difference. First operand 700 states and 1148 transitions. Second operand 3 states. [2019-10-07 00:57:02,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:57:02,249 INFO L93 Difference]: Finished difference Result 1932 states and 3329 transitions. [2019-10-07 00:57:02,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:57:02,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-10-07 00:57:02,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:57:02,260 INFO L225 Difference]: With dead ends: 1932 [2019-10-07 00:57:02,260 INFO L226 Difference]: Without dead ends: 1237 [2019-10-07 00:57:02,264 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:57:02,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2019-10-07 00:57:02,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 1237. [2019-10-07 00:57:02,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1237 states. [2019-10-07 00:57:02,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 2003 transitions. [2019-10-07 00:57:02,324 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 2003 transitions. Word has length 94 [2019-10-07 00:57:02,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:57:02,325 INFO L462 AbstractCegarLoop]: Abstraction has 1237 states and 2003 transitions. [2019-10-07 00:57:02,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:57:02,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 2003 transitions. [2019-10-07 00:57:02,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-07 00:57:02,331 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:57:02,332 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-07 00:57:02,332 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:57:02,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:57:02,333 INFO L82 PathProgramCache]: Analyzing trace with hash 95050327, now seen corresponding path program 1 times [2019-10-07 00:57:02,333 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:57:02,333 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:02,333 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:02,334 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:02,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:57:02,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:57:02,497 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:57:02,498 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:02,499 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:57:02,499 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 00:57:02,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 00:57:02,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 00:57:02,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 00:57:02,501 INFO L87 Difference]: Start difference. First operand 1237 states and 2003 transitions. Second operand 6 states. [2019-10-07 00:57:03,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:57:03,140 INFO L93 Difference]: Finished difference Result 2677 states and 4482 transitions. [2019-10-07 00:57:03,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 00:57:03,140 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2019-10-07 00:57:03,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:57:03,153 INFO L225 Difference]: With dead ends: 2677 [2019-10-07 00:57:03,154 INFO L226 Difference]: Without dead ends: 1445 [2019-10-07 00:57:03,160 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 00:57:03,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-10-07 00:57:03,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1036. [2019-10-07 00:57:03,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2019-10-07 00:57:03,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1455 transitions. [2019-10-07 00:57:03,214 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1455 transitions. Word has length 121 [2019-10-07 00:57:03,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:57:03,215 INFO L462 AbstractCegarLoop]: Abstraction has 1036 states and 1455 transitions. [2019-10-07 00:57:03,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 00:57:03,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1455 transitions. [2019-10-07 00:57:03,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-07 00:57:03,219 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:57:03,219 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-07 00:57:03,220 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:57:03,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:57:03,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1205469238, now seen corresponding path program 1 times [2019-10-07 00:57:03,224 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:57:03,224 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:03,224 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:03,225 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:03,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:57:03,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:57:03,324 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 58 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:57:03,325 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:03,333 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:57:03,334 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 00:57:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:57:03,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-07 00:57:03,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:57:03,594 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 58 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:57:03,595 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:57:03,754 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 58 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:57:03,754 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:57:03,795 INFO L162 IcfgInterpreter]: Started Sifa with 81 locations of interest [2019-10-07 00:57:03,795 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:57:03,803 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:57:03,812 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:57:03,813 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:57:04,217 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 98 for LOIs [2019-10-07 00:57:04,699 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:57:04,700 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 00:57:04,711 INFO L168 Benchmark]: Toolchain (without parser) took 9717.42 ms. Allocated memory was 138.4 MB in the beginning and 329.8 MB in the end (delta: 191.4 MB). Free memory was 101.0 MB in the beginning and 140.3 MB in the end (delta: -39.3 MB). Peak memory consumption was 152.1 MB. Max. memory is 7.1 GB. [2019-10-07 00:57:04,712 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 00:57:04,714 INFO L168 Benchmark]: CACSL2BoogieTranslator took 799.97 ms. Allocated memory was 138.4 MB in the beginning and 205.5 MB in the end (delta: 67.1 MB). Free memory was 100.8 MB in the beginning and 171.6 MB in the end (delta: -70.8 MB). Peak memory consumption was 35.8 MB. Max. memory is 7.1 GB. [2019-10-07 00:57:04,715 INFO L168 Benchmark]: Boogie Preprocessor took 112.45 ms. Allocated memory is still 205.5 MB. Free memory was 171.6 MB in the beginning and 166.7 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. [2019-10-07 00:57:04,716 INFO L168 Benchmark]: RCFGBuilder took 2073.77 ms. Allocated memory was 205.5 MB in the beginning and 249.6 MB in the end (delta: 44.0 MB). Free memory was 166.7 MB in the beginning and 207.1 MB in the end (delta: -40.4 MB). Peak memory consumption was 117.2 MB. Max. memory is 7.1 GB. [2019-10-07 00:57:04,722 INFO L168 Benchmark]: TraceAbstraction took 6726.53 ms. Allocated memory was 249.6 MB in the beginning and 329.8 MB in the end (delta: 80.2 MB). Free memory was 205.3 MB in the beginning and 140.3 MB in the end (delta: 65.0 MB). Peak memory consumption was 145.2 MB. Max. memory is 7.1 GB. [2019-10-07 00:57:04,730 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 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 799.97 ms. Allocated memory was 138.4 MB in the beginning and 205.5 MB in the end (delta: 67.1 MB). Free memory was 100.8 MB in the beginning and 171.6 MB in the end (delta: -70.8 MB). Peak memory consumption was 35.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 112.45 ms. Allocated memory is still 205.5 MB. Free memory was 171.6 MB in the beginning and 166.7 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2073.77 ms. Allocated memory was 205.5 MB in the beginning and 249.6 MB in the end (delta: 44.0 MB). Free memory was 166.7 MB in the beginning and 207.1 MB in the end (delta: -40.4 MB). Peak memory consumption was 117.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6726.53 ms. Allocated memory was 249.6 MB in the beginning and 329.8 MB in the end (delta: 80.2 MB). Free memory was 205.3 MB in the beginning and 140.3 MB in the end (delta: 65.0 MB). Peak memory consumption was 145.2 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...