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/Problem16_label49.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 03:33:21,893 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 03:33:21,896 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 03:33:21,908 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 03:33:21,908 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 03:33:21,909 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 03:33:21,910 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 03:33:21,912 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 03:33:21,914 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 03:33:21,915 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 03:33:21,916 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 03:33:21,920 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 03:33:21,921 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 03:33:21,922 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 03:33:21,924 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 03:33:21,926 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 03:33:21,927 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 03:33:21,930 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 03:33:21,932 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 03:33:21,936 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 03:33:21,938 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 03:33:21,939 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 03:33:21,940 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 03:33:21,942 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 03:33:21,947 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 03:33:21,947 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 03:33:21,947 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 03:33:21,949 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 03:33:21,950 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 03:33:21,952 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 03:33:21,953 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 03:33:21,955 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 03:33:21,955 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 03:33:21,956 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 03:33:21,958 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 03:33:21,958 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 03:33:21,959 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 03:33:21,959 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 03:33:21,959 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 03:33:21,962 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 03:33:21,965 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 03:33:21,966 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:33:21,987 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 03:33:21,987 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 03:33:21,989 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 03:33:21,989 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 03:33:21,989 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 03:33:21,990 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 03:33:21,990 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 03:33:21,990 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 03:33:21,990 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 03:33:21,991 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 03:33:21,992 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 03:33:21,992 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 03:33:21,992 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 03:33:21,993 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 03:33:21,993 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 03:33:21,993 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 03:33:21,993 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 03:33:21,993 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 03:33:21,994 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 03:33:21,994 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 03:33:21,994 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 03:33:21,994 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 03:33:21,994 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 03:33:21,995 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 03:33:21,995 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 03:33:21,995 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 03:33:21,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 03:33:21,995 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 03:33:21,996 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:33:22,257 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 03:33:22,270 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 03:33:22,273 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 03:33:22,275 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 03:33:22,275 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 03:33:22,276 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label49.c [2019-10-07 03:33:22,349 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/276b3b160/8f58fc76667942599770ac5233ef0858/FLAGf540ff774 [2019-10-07 03:33:23,027 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 03:33:23,028 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label49.c [2019-10-07 03:33:23,045 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/276b3b160/8f58fc76667942599770ac5233ef0858/FLAGf540ff774 [2019-10-07 03:33:23,196 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/276b3b160/8f58fc76667942599770ac5233ef0858 [2019-10-07 03:33:23,206 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 03:33:23,207 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 03:33:23,208 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 03:33:23,209 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 03:33:23,212 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 03:33:23,213 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:33:23" (1/1) ... [2019-10-07 03:33:23,216 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ee337c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:33:23, skipping insertion in model container [2019-10-07 03:33:23,216 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:33:23" (1/1) ... [2019-10-07 03:33:23,223 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 03:33:23,306 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 03:33:24,055 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:33:24,061 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 03:33:24,659 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:33:24,680 INFO L192 MainTranslator]: Completed translation [2019-10-07 03:33:24,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:33:24 WrapperNode [2019-10-07 03:33:24,682 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 03:33:24,683 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 03:33:24,683 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 03:33:24,683 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 03:33:24,698 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:33:24" (1/1) ... [2019-10-07 03:33:24,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:33:24" (1/1) ... [2019-10-07 03:33:24,743 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:33:24" (1/1) ... [2019-10-07 03:33:24,744 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:33:24" (1/1) ... [2019-10-07 03:33:24,814 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:33:24" (1/1) ... [2019-10-07 03:33:24,848 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:33:24" (1/1) ... [2019-10-07 03:33:24,872 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:33:24" (1/1) ... [2019-10-07 03:33:24,886 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 03:33:24,886 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 03:33:24,887 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 03:33:24,887 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 03:33:24,888 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:33:24" (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:33:24,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 03:33:24,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 03:33:24,964 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-07 03:33:24,964 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-10-07 03:33:24,964 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 03:33:24,965 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-07 03:33:24,966 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-10-07 03:33:24,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 03:33:24,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 03:33:24,967 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 03:33:24,967 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 03:33:24,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 03:33:24,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 03:33:37,523 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 03:33:37,524 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 03:33:37,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:33:37 BoogieIcfgContainer [2019-10-07 03:33:37,526 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 03:33:37,527 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 03:33:37,527 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 03:33:37,530 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 03:33:37,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 03:33:23" (1/3) ... [2019-10-07 03:33:37,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36a40b02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:33:37, skipping insertion in model container [2019-10-07 03:33:37,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:33:24" (2/3) ... [2019-10-07 03:33:37,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36a40b02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:33:37, skipping insertion in model container [2019-10-07 03:33:37,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:33:37" (3/3) ... [2019-10-07 03:33:37,534 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem16_label49.c [2019-10-07 03:33:37,544 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 03:33:37,554 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 03:33:37,566 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 03:33:37,596 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 03:33:37,596 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 03:33:37,596 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 03:33:37,596 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 03:33:37,597 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 03:33:37,597 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 03:33:37,597 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 03:33:37,597 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 03:33:37,622 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states. [2019-10-07 03:33:37,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-07 03:33:37,628 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:33:37,629 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:33:37,631 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:33:37,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:33:37,637 INFO L82 PathProgramCache]: Analyzing trace with hash 863568191, now seen corresponding path program 1 times [2019-10-07 03:33:37,646 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:33:37,646 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:33:37,647 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:33:37,647 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:33:37,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:33:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:33:37,869 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:33:37,869 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:33:37,870 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:33:37,870 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 03:33:37,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 03:33:37,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 03:33:37,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 03:33:37,892 INFO L87 Difference]: Start difference. First operand 244 states. Second operand 4 states. [2019-10-07 03:33:40,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:33:40,624 INFO L93 Difference]: Finished difference Result 953 states and 1852 transitions. [2019-10-07 03:33:40,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 03:33:40,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-07 03:33:40,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:33:40,651 INFO L225 Difference]: With dead ends: 953 [2019-10-07 03:33:40,651 INFO L226 Difference]: Without dead ends: 702 [2019-10-07 03:33:40,661 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:33:40,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2019-10-07 03:33:40,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 468. [2019-10-07 03:33:40,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2019-10-07 03:33:40,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 853 transitions. [2019-10-07 03:33:40,773 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 853 transitions. Word has length 11 [2019-10-07 03:33:40,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:33:40,774 INFO L462 AbstractCegarLoop]: Abstraction has 468 states and 853 transitions. [2019-10-07 03:33:40,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 03:33:40,775 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 853 transitions. [2019-10-07 03:33:40,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-07 03:33:40,777 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:33:40,777 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:33:40,777 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:33:40,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:33:40,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1777186902, now seen corresponding path program 1 times [2019-10-07 03:33:40,779 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:33:40,779 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:33:40,779 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:33:40,779 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:33:40,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:33:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:33:40,940 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:33:40,941 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:33:40,941 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:33:40,941 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 03:33:40,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 03:33:40,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 03:33:40,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 03:33:40,944 INFO L87 Difference]: Start difference. First operand 468 states and 853 transitions. Second operand 6 states. [2019-10-07 03:33:43,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:33:43,563 INFO L93 Difference]: Finished difference Result 1410 states and 2605 transitions. [2019-10-07 03:33:43,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 03:33:43,565 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-10-07 03:33:43,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:33:43,578 INFO L225 Difference]: With dead ends: 1410 [2019-10-07 03:33:43,578 INFO L226 Difference]: Without dead ends: 947 [2019-10-07 03:33:43,581 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:33:43,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2019-10-07 03:33:43,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 924. [2019-10-07 03:33:43,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 924 states. [2019-10-07 03:33:43,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1604 transitions. [2019-10-07 03:33:43,647 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1604 transitions. Word has length 22 [2019-10-07 03:33:43,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:33:43,647 INFO L462 AbstractCegarLoop]: Abstraction has 924 states and 1604 transitions. [2019-10-07 03:33:43,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 03:33:43,647 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1604 transitions. [2019-10-07 03:33:43,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-07 03:33:43,649 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:33:43,649 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:33:43,649 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:33:43,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:33:43,650 INFO L82 PathProgramCache]: Analyzing trace with hash -962035583, now seen corresponding path program 1 times [2019-10-07 03:33:43,650 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:33:43,650 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:33:43,651 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:33:43,651 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:33:43,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:33:43,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:33:43,787 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:33:43,788 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:33:43,788 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:33:43,789 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 03:33:43,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 03:33:43,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 03:33:43,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 03:33:43,790 INFO L87 Difference]: Start difference. First operand 924 states and 1604 transitions. Second operand 5 states. [2019-10-07 03:33:46,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:33:46,005 INFO L93 Difference]: Finished difference Result 2556 states and 4514 transitions. [2019-10-07 03:33:46,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 03:33:46,007 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-10-07 03:33:46,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:33:46,018 INFO L225 Difference]: With dead ends: 2556 [2019-10-07 03:33:46,019 INFO L226 Difference]: Without dead ends: 1637 [2019-10-07 03:33:46,022 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-07 03:33:46,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states. [2019-10-07 03:33:46,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 1605. [2019-10-07 03:33:46,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1605 states. [2019-10-07 03:33:46,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 2404 transitions. [2019-10-07 03:33:46,105 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 2404 transitions. Word has length 23 [2019-10-07 03:33:46,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:33:46,106 INFO L462 AbstractCegarLoop]: Abstraction has 1605 states and 2404 transitions. [2019-10-07 03:33:46,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 03:33:46,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 2404 transitions. [2019-10-07 03:33:46,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-07 03:33:46,112 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:33:46,113 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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 03:33:46,114 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:33:46,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:33:46,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1706761348, now seen corresponding path program 1 times [2019-10-07 03:33:46,114 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:33:46,114 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:33:46,115 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:33:46,116 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:33:46,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:33:46,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:33:46,345 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 03:33:46,345 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:33:46,345 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:33:46,346 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:33:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:33:46,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-07 03:33:46,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:33:46,515 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-07 03:33:46,516 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:33:46,577 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-07 03:33:46,578 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 03:33:46,578 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-10-07 03:33:46,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 03:33:46,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 03:33:46,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-07 03:33:46,580 INFO L87 Difference]: Start difference. First operand 1605 states and 2404 transitions. Second operand 4 states. [2019-10-07 03:33:49,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:33:49,288 INFO L93 Difference]: Finished difference Result 5917 states and 8818 transitions. [2019-10-07 03:33:49,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 03:33:49,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-10-07 03:33:49,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:33:49,315 INFO L225 Difference]: With dead ends: 5917 [2019-10-07 03:33:49,316 INFO L226 Difference]: Without dead ends: 4317 [2019-10-07 03:33:49,320 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-07 03:33:49,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4317 states. [2019-10-07 03:33:49,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4317 to 4150. [2019-10-07 03:33:49,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4150 states. [2019-10-07 03:33:49,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4150 states to 4150 states and 5465 transitions. [2019-10-07 03:33:49,424 INFO L78 Accepts]: Start accepts. Automaton has 4150 states and 5465 transitions. Word has length 92 [2019-10-07 03:33:49,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:33:49,425 INFO L462 AbstractCegarLoop]: Abstraction has 4150 states and 5465 transitions. [2019-10-07 03:33:49,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 03:33:49,426 INFO L276 IsEmpty]: Start isEmpty. Operand 4150 states and 5465 transitions. [2019-10-07 03:33:49,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-07 03:33:49,429 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:33:49,429 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:49,643 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:33:49,643 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:33:49,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:33:49,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1378196599, now seen corresponding path program 1 times [2019-10-07 03:33:49,644 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:33:49,644 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:33:49,644 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:33:49,644 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:33:49,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:33:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:33:49,810 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:33:49,812 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:33:49,812 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:33:49,812 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 03:33:49,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 03:33:49,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 03:33:49,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 03:33:49,815 INFO L87 Difference]: Start difference. First operand 4150 states and 5465 transitions. Second operand 6 states. [2019-10-07 03:33:51,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:33:51,893 INFO L93 Difference]: Finished difference Result 8674 states and 11553 transitions. [2019-10-07 03:33:51,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 03:33:51,897 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2019-10-07 03:33:51,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:33:51,923 INFO L225 Difference]: With dead ends: 8674 [2019-10-07 03:33:51,923 INFO L226 Difference]: Without dead ends: 4529 [2019-10-07 03:33:51,934 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 03:33:51,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4529 states. [2019-10-07 03:33:52,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4529 to 4401. [2019-10-07 03:33:52,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4401 states. [2019-10-07 03:33:52,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4401 states to 4401 states and 5808 transitions. [2019-10-07 03:33:52,087 INFO L78 Accepts]: Start accepts. Automaton has 4401 states and 5808 transitions. Word has length 115 [2019-10-07 03:33:52,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:33:52,089 INFO L462 AbstractCegarLoop]: Abstraction has 4401 states and 5808 transitions. [2019-10-07 03:33:52,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 03:33:52,089 INFO L276 IsEmpty]: Start isEmpty. Operand 4401 states and 5808 transitions. [2019-10-07 03:33:52,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-07 03:33:52,094 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:33:52,094 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:52,095 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:33:52,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:33:52,095 INFO L82 PathProgramCache]: Analyzing trace with hash 345652897, now seen corresponding path program 1 times [2019-10-07 03:33:52,095 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:33:52,095 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:33:52,096 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:33:52,096 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:33:52,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:33:52,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:33:52,332 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:33:52,332 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:33:52,332 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:33:52,333 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 03:33:52,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 03:33:52,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 03:33:52,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 03:33:52,334 INFO L87 Difference]: Start difference. First operand 4401 states and 5808 transitions. Second operand 6 states. [2019-10-07 03:33:54,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:33:54,471 INFO L93 Difference]: Finished difference Result 9967 states and 13392 transitions. [2019-10-07 03:33:54,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 03:33:54,479 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2019-10-07 03:33:54,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:33:54,503 INFO L225 Difference]: With dead ends: 9967 [2019-10-07 03:33:54,504 INFO L226 Difference]: Without dead ends: 5571 [2019-10-07 03:33:54,519 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 03:33:54,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5571 states. [2019-10-07 03:33:54,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5571 to 5528. [2019-10-07 03:33:54,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5528 states. [2019-10-07 03:33:54,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5528 states to 5528 states and 7375 transitions. [2019-10-07 03:33:54,654 INFO L78 Accepts]: Start accepts. Automaton has 5528 states and 7375 transitions. Word has length 135 [2019-10-07 03:33:54,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:33:54,656 INFO L462 AbstractCegarLoop]: Abstraction has 5528 states and 7375 transitions. [2019-10-07 03:33:54,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 03:33:54,656 INFO L276 IsEmpty]: Start isEmpty. Operand 5528 states and 7375 transitions. [2019-10-07 03:33:54,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-07 03:33:54,658 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:33:54,659 INFO L385 BasicCegarLoop]: trace histogram [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, 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] [2019-10-07 03:33:54,659 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:33:54,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:33:54,660 INFO L82 PathProgramCache]: Analyzing trace with hash -552315495, now seen corresponding path program 1 times [2019-10-07 03:33:54,661 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:33:54,661 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:33:54,661 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:33:54,661 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:33:54,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:33:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:33:54,876 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 73 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 03:33:54,876 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:33:54,877 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:33:54,877 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:33:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:33:54,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-07 03:33:55,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:33:55,045 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 87 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 03:33:55,045 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:33:55,219 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 73 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 03:33:55,221 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 03:33:55,266 INFO L162 IcfgInterpreter]: Started Sifa with 77 locations of interest [2019-10-07 03:33:55,267 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 03:33:55,274 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 03:33:55,283 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 03:33:55,284 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 03:33:55,465 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 55 for LOIs [2019-10-07 03:33:55,601 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 54 [2019-10-07 03:33:56,001 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 54 [2019-10-07 03:33:56,194 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-10-07 03:33:56,197 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-10-07 03:33:56,489 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:33:56,490 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:33:56,499 INFO L168 Benchmark]: Toolchain (without parser) took 33289.95 ms. Allocated memory was 137.9 MB in the beginning and 567.3 MB in the end (delta: 429.4 MB). Free memory was 97.5 MB in the beginning and 174.0 MB in the end (delta: -76.5 MB). Peak memory consumption was 352.9 MB. Max. memory is 7.1 GB. [2019-10-07 03:33:56,501 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 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:33:56,502 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1473.96 ms. Allocated memory was 137.9 MB in the beginning and 207.6 MB in the end (delta: 69.7 MB). Free memory was 97.3 MB in the beginning and 137.9 MB in the end (delta: -40.5 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. [2019-10-07 03:33:56,503 INFO L168 Benchmark]: Boogie Preprocessor took 203.31 ms. Allocated memory is still 207.6 MB. Free memory was 137.9 MB in the beginning and 127.4 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2019-10-07 03:33:56,505 INFO L168 Benchmark]: RCFGBuilder took 12639.54 ms. Allocated memory was 207.6 MB in the beginning and 302.5 MB in the end (delta: 94.9 MB). Free memory was 127.4 MB in the beginning and 112.4 MB in the end (delta: 15.0 MB). Peak memory consumption was 145.8 MB. Max. memory is 7.1 GB. [2019-10-07 03:33:56,510 INFO L168 Benchmark]: TraceAbstraction took 18968.62 ms. Allocated memory was 302.5 MB in the beginning and 567.3 MB in the end (delta: 264.8 MB). Free memory was 112.4 MB in the beginning and 174.0 MB in the end (delta: -61.6 MB). Peak memory consumption was 203.1 MB. Max. memory is 7.1 GB. [2019-10-07 03:33:56,522 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 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1473.96 ms. Allocated memory was 137.9 MB in the beginning and 207.6 MB in the end (delta: 69.7 MB). Free memory was 97.3 MB in the beginning and 137.9 MB in the end (delta: -40.5 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 203.31 ms. Allocated memory is still 207.6 MB. Free memory was 137.9 MB in the beginning and 127.4 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 12639.54 ms. Allocated memory was 207.6 MB in the beginning and 302.5 MB in the end (delta: 94.9 MB). Free memory was 127.4 MB in the beginning and 112.4 MB in the end (delta: 15.0 MB). Peak memory consumption was 145.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18968.62 ms. Allocated memory was 302.5 MB in the beginning and 567.3 MB in the end (delta: 264.8 MB). Free memory was 112.4 MB in the beginning and 174.0 MB in the end (delta: -61.6 MB). Peak memory consumption was 203.1 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...