java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/eca-rers2012/Problem15_label33.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 03:30:12,041 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 03:30:12,044 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 03:30:12,056 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 03:30:12,056 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 03:30:12,057 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 03:30:12,059 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 03:30:12,060 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 03:30:12,062 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 03:30:12,063 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 03:30:12,064 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 03:30:12,065 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 03:30:12,065 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 03:30:12,066 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 03:30:12,067 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 03:30:12,068 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 03:30:12,069 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 03:30:12,070 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 03:30:12,072 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 03:30:12,074 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 03:30:12,075 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 03:30:12,077 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 03:30:12,078 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 03:30:12,079 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 03:30:12,081 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 03:30:12,081 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 03:30:12,082 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 03:30:12,083 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 03:30:12,083 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 03:30:12,084 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 03:30:12,084 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 03:30:12,085 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 03:30:12,086 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 03:30:12,087 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 03:30:12,088 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 03:30:12,088 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 03:30:12,088 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 03:30:12,089 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 03:30:12,089 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 03:30:12,090 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 03:30:12,090 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 03:30:12,091 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 03:30:12,106 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 03:30:12,106 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 03:30:12,107 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 03:30:12,107 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 03:30:12,108 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 03:30:12,108 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 03:30:12,108 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 03:30:12,108 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 03:30:12,109 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 03:30:12,109 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 03:30:12,109 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 03:30:12,109 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 03:30:12,109 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 03:30:12,110 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 03:30:12,110 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 03:30:12,110 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 03:30:12,110 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 03:30:12,110 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 03:30:12,111 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 03:30:12,111 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 03:30:12,111 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 03:30:12,111 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 03:30:12,111 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 03:30:12,112 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 03:30:12,112 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 03:30:12,112 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 03:30:12,112 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 03:30:12,113 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 03:30:12,113 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 03:30:12,453 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 03:30:12,474 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 03:30:12,478 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 03:30:12,480 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 03:30:12,480 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 03:30:12,481 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label33.c [2019-10-07 03:30:12,556 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a485ac16f/a8d9029eb3244d988528111cb138608b/FLAG9796b363e [2019-10-07 03:30:13,271 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 03:30:13,271 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label33.c [2019-10-07 03:30:13,294 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a485ac16f/a8d9029eb3244d988528111cb138608b/FLAG9796b363e [2019-10-07 03:30:13,415 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a485ac16f/a8d9029eb3244d988528111cb138608b [2019-10-07 03:30:13,424 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 03:30:13,426 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 03:30:13,427 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 03:30:13,427 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 03:30:13,431 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 03:30:13,432 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:30:13" (1/1) ... [2019-10-07 03:30:13,435 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55eef33b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:30:13, skipping insertion in model container [2019-10-07 03:30:13,435 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:30:13" (1/1) ... [2019-10-07 03:30:13,442 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 03:30:13,531 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 03:30:14,553 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:30:14,566 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 03:30:14,920 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:30:14,940 INFO L192 MainTranslator]: Completed translation [2019-10-07 03:30:14,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:30:14 WrapperNode [2019-10-07 03:30:14,941 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 03:30:14,942 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 03:30:14,942 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 03:30:14,942 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 03:30:14,956 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:30:14" (1/1) ... [2019-10-07 03:30:14,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:30:14" (1/1) ... [2019-10-07 03:30:15,003 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:30:14" (1/1) ... [2019-10-07 03:30:15,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:30:14" (1/1) ... [2019-10-07 03:30:15,067 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:30:14" (1/1) ... [2019-10-07 03:30:15,098 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:30:14" (1/1) ... [2019-10-07 03:30:15,114 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:30:14" (1/1) ... [2019-10-07 03:30:15,127 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 03:30:15,128 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 03:30:15,128 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 03:30:15,128 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 03:30:15,129 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:30:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 03:30:15,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 03:30:15,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 03:30:15,191 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-07 03:30:15,191 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-10-07 03:30:15,191 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 03:30:15,192 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-07 03:30:15,192 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-10-07 03:30:15,192 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 03:30:15,192 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 03:30:15,192 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 03:30:15,193 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 03:30:15,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 03:30:15,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 03:30:28,750 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 03:30:28,750 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 03:30:28,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:30:28 BoogieIcfgContainer [2019-10-07 03:30:28,752 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 03:30:28,753 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 03:30:28,753 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 03:30:28,763 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 03:30:28,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 03:30:13" (1/3) ... [2019-10-07 03:30:28,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eb81bd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:30:28, skipping insertion in model container [2019-10-07 03:30:28,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:30:14" (2/3) ... [2019-10-07 03:30:28,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eb81bd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:30:28, skipping insertion in model container [2019-10-07 03:30:28,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:30:28" (3/3) ... [2019-10-07 03:30:28,769 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label33.c [2019-10-07 03:30:28,779 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 03:30:28,787 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 03:30:28,799 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 03:30:28,828 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 03:30:28,829 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 03:30:28,829 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 03:30:28,829 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 03:30:28,829 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 03:30:28,829 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 03:30:28,830 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 03:30:28,830 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 03:30:28,862 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states. [2019-10-07 03:30:28,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-07 03:30:28,871 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:30:28,872 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:30:28,874 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:30:28,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:30:28,879 INFO L82 PathProgramCache]: Analyzing trace with hash 648044909, now seen corresponding path program 1 times [2019-10-07 03:30:28,887 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:30:28,887 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:30:28,888 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:30:28,888 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:30:28,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:30:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:30:29,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:30:29,103 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:30:29,103 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:30:29,104 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 03:30:29,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 03:30:29,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 03:30:29,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 03:30:29,125 INFO L87 Difference]: Start difference. First operand 244 states. Second operand 4 states. [2019-10-07 03:30:32,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:30:32,823 INFO L93 Difference]: Finished difference Result 953 states and 1852 transitions. [2019-10-07 03:30:32,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 03:30:32,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-07 03:30:32,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:30:32,861 INFO L225 Difference]: With dead ends: 953 [2019-10-07 03:30:32,862 INFO L226 Difference]: Without dead ends: 702 [2019-10-07 03:30:32,875 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 03:30:32,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2019-10-07 03:30:32,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 469. [2019-10-07 03:30:32,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2019-10-07 03:30:32,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 824 transitions. [2019-10-07 03:30:32,992 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 824 transitions. Word has length 11 [2019-10-07 03:30:32,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:30:32,993 INFO L462 AbstractCegarLoop]: Abstraction has 469 states and 824 transitions. [2019-10-07 03:30:32,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 03:30:32,993 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 824 transitions. [2019-10-07 03:30:32,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-07 03:30:32,995 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:30:32,995 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:30:32,995 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:30:32,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:30:32,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1940132124, now seen corresponding path program 1 times [2019-10-07 03:30:32,996 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:30:32,996 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:30:32,996 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:30:32,997 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:30:32,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:30:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:30:33,193 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:30:33,193 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:30:33,193 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:30:33,194 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 03:30:33,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 03:30:33,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 03:30:33,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-07 03:30:33,196 INFO L87 Difference]: Start difference. First operand 469 states and 824 transitions. Second operand 6 states. [2019-10-07 03:30:40,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:30:40,932 INFO L93 Difference]: Finished difference Result 1682 states and 3010 transitions. [2019-10-07 03:30:40,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-07 03:30:40,934 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-10-07 03:30:40,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:30:40,951 INFO L225 Difference]: With dead ends: 1682 [2019-10-07 03:30:40,952 INFO L226 Difference]: Without dead ends: 1218 [2019-10-07 03:30:40,954 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-10-07 03:30:40,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2019-10-07 03:30:41,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1134. [2019-10-07 03:30:41,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1134 states. [2019-10-07 03:30:41,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1933 transitions. [2019-10-07 03:30:41,028 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1933 transitions. Word has length 23 [2019-10-07 03:30:41,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:30:41,029 INFO L462 AbstractCegarLoop]: Abstraction has 1134 states and 1933 transitions. [2019-10-07 03:30:41,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 03:30:41,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1933 transitions. [2019-10-07 03:30:41,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-07 03:30:41,030 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:30:41,031 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] [2019-10-07 03:30:41,031 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:30:41,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:30:41,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1661108783, now seen corresponding path program 1 times [2019-10-07 03:30:41,032 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:30:41,032 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:30:41,032 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:30:41,032 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:30:41,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:30:41,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:30:41,199 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:30:41,199 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:30:41,200 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:30:41,200 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 03:30:41,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 03:30:41,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 03:30:41,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 03:30:41,202 INFO L87 Difference]: Start difference. First operand 1134 states and 1933 transitions. Second operand 5 states. [2019-10-07 03:30:45,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:30:45,106 INFO L93 Difference]: Finished difference Result 3211 states and 5719 transitions. [2019-10-07 03:30:45,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 03:30:45,107 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-10-07 03:30:45,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:30:45,121 INFO L225 Difference]: With dead ends: 3211 [2019-10-07 03:30:45,121 INFO L226 Difference]: Without dead ends: 2082 [2019-10-07 03:30:45,127 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-07 03:30:45,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2082 states. [2019-10-07 03:30:45,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2082 to 1749. [2019-10-07 03:30:45,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1749 states. [2019-10-07 03:30:45,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1749 states to 1749 states and 2680 transitions. [2019-10-07 03:30:45,223 INFO L78 Accepts]: Start accepts. Automaton has 1749 states and 2680 transitions. Word has length 24 [2019-10-07 03:30:45,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:30:45,224 INFO L462 AbstractCegarLoop]: Abstraction has 1749 states and 2680 transitions. [2019-10-07 03:30:45,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 03:30:45,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1749 states and 2680 transitions. [2019-10-07 03:30:45,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-07 03:30:45,226 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:30:45,226 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:30:45,226 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:30:45,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:30:45,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1399877695, now seen corresponding path program 1 times [2019-10-07 03:30:45,227 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:30:45,227 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:30:45,227 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:30:45,227 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:30:45,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:30:45,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:30:45,336 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:30:45,336 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:30:45,337 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:30:45,337 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 03:30:45,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 03:30:45,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 03:30:45,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 03:30:45,338 INFO L87 Difference]: Start difference. First operand 1749 states and 2680 transitions. Second operand 4 states. [2019-10-07 03:30:51,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:30:51,879 INFO L93 Difference]: Finished difference Result 6620 states and 10691 transitions. [2019-10-07 03:30:51,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 03:30:51,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-10-07 03:30:51,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:30:51,914 INFO L225 Difference]: With dead ends: 6620 [2019-10-07 03:30:51,914 INFO L226 Difference]: Without dead ends: 4876 [2019-10-07 03:30:51,924 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 03:30:51,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4876 states. [2019-10-07 03:30:52,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4876 to 4290. [2019-10-07 03:30:52,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4290 states. [2019-10-07 03:30:52,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4290 states to 4290 states and 6680 transitions. [2019-10-07 03:30:52,157 INFO L78 Accepts]: Start accepts. Automaton has 4290 states and 6680 transitions. Word has length 32 [2019-10-07 03:30:52,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:30:52,157 INFO L462 AbstractCegarLoop]: Abstraction has 4290 states and 6680 transitions. [2019-10-07 03:30:52,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 03:30:52,157 INFO L276 IsEmpty]: Start isEmpty. Operand 4290 states and 6680 transitions. [2019-10-07 03:30:52,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-07 03:30:52,167 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:30:52,168 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-07 03:30:52,168 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:30:52,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:30:52,169 INFO L82 PathProgramCache]: Analyzing trace with hash 2144963697, now seen corresponding path program 1 times [2019-10-07 03:30:52,169 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:30:52,170 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:30:52,170 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:30:52,170 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:30:52,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:30:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:30:52,288 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-07 03:30:52,288 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:30:52,288 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:30:52,289 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 03:30:52,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 03:30:52,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 03:30:52,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 03:30:52,290 INFO L87 Difference]: Start difference. First operand 4290 states and 6680 transitions. Second operand 4 states. [2019-10-07 03:30:55,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:30:55,876 INFO L93 Difference]: Finished difference Result 14180 states and 23217 transitions. [2019-10-07 03:30:55,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 03:30:55,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-10-07 03:30:55,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:30:55,932 INFO L225 Difference]: With dead ends: 14180 [2019-10-07 03:30:55,932 INFO L226 Difference]: Without dead ends: 9895 [2019-10-07 03:30:55,951 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 03:30:55,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9895 states. [2019-10-07 03:30:56,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9895 to 9048. [2019-10-07 03:30:56,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9048 states. [2019-10-07 03:30:56,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9048 states to 9048 states and 13803 transitions. [2019-10-07 03:30:56,254 INFO L78 Accepts]: Start accepts. Automaton has 9048 states and 13803 transitions. Word has length 51 [2019-10-07 03:30:56,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:30:56,255 INFO L462 AbstractCegarLoop]: Abstraction has 9048 states and 13803 transitions. [2019-10-07 03:30:56,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 03:30:56,255 INFO L276 IsEmpty]: Start isEmpty. Operand 9048 states and 13803 transitions. [2019-10-07 03:30:56,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-10-07 03:30:56,274 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:30:56,275 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:30:56,275 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:30:56,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:30:56,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1915051490, now seen corresponding path program 1 times [2019-10-07 03:30:56,276 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:30:56,276 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:30:56,276 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:30:56,276 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:30:56,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:30:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:30:56,984 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 81 proven. 19 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-07 03:30:56,984 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:30:56,985 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:30:56,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:30:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:30:57,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-07 03:30:57,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:30:57,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 03:30:57,640 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-07 03:30:57,640 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:30:57,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:30:57,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:30:57,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:30:57,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:30:57,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:30:57,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:30:58,370 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 15 proven. 69 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-07 03:30:58,371 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 03:30:58,371 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9, 5] total 14 [2019-10-07 03:30:58,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 03:30:58,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 03:30:58,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-10-07 03:30:58,375 INFO L87 Difference]: Start difference. First operand 9048 states and 13803 transitions. Second operand 5 states. [2019-10-07 03:31:04,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:31:04,512 INFO L93 Difference]: Finished difference Result 18398 states and 28437 transitions. [2019-10-07 03:31:04,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 03:31:04,514 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 229 [2019-10-07 03:31:04,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:31:04,595 INFO L225 Difference]: With dead ends: 18398 [2019-10-07 03:31:04,596 INFO L226 Difference]: Without dead ends: 9355 [2019-10-07 03:31:04,642 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 457 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-10-07 03:31:04,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9355 states. [2019-10-07 03:31:05,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9355 to 9337. [2019-10-07 03:31:05,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9337 states. [2019-10-07 03:31:05,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9337 states to 9337 states and 14495 transitions. [2019-10-07 03:31:05,074 INFO L78 Accepts]: Start accepts. Automaton has 9337 states and 14495 transitions. Word has length 229 [2019-10-07 03:31:05,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:31:05,078 INFO L462 AbstractCegarLoop]: Abstraction has 9337 states and 14495 transitions. [2019-10-07 03:31:05,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 03:31:05,079 INFO L276 IsEmpty]: Start isEmpty. Operand 9337 states and 14495 transitions. [2019-10-07 03:31:05,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-10-07 03:31:05,091 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:31:05,091 INFO L385 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:31:05,298 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:31:05,300 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:31:05,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:31:05,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1062435599, now seen corresponding path program 1 times [2019-10-07 03:31:05,300 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:31:05,301 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:31:05,301 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:31:05,301 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:31:05,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:31:05,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:31:05,859 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 146 proven. 19 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-07 03:31:05,860 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:31:05,860 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:31:05,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:31:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:31:06,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-07 03:31:06,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:31:06,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-07 03:31:06,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-07 03:31:06,542 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 149 proven. 29 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-07 03:31:06,543 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:31:06,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:31:06,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-07 03:31:07,141 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 32 proven. 150 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-07 03:31:07,142 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 03:31:07,193 INFO L162 IcfgInterpreter]: Started Sifa with 148 locations of interest [2019-10-07 03:31:07,194 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 03:31:07,200 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 03:31:07,208 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 03:31:07,209 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 03:31:07,361 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 56 for LOIs [2019-10-07 03:31:07,792 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-10-07 03:31:08,057 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-10-07 03:31:08,342 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 45 [2019-10-07 03:31:09,074 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 10620 conjuctions. This might take some time... [2019-10-07 03:31:09,380 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 45 [2019-10-07 03:31:09,835 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 10620 conjuctions. This might take some time... [2019-10-07 03:31:10,606 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:31:10,607 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: assume true; at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:133) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: assume true; at de.uni_freiburg.informatik.ultimate.lib.sifa.PriorityWorklist.add(PriorityWorklist.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.lambda$2(DagInterpreter.java:135) at java.lang.Iterable.forEach(Iterable.java:75) at java.util.Collections$UnmodifiableCollection.forEach(Collections.java:1080) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:135) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:104) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.computeTopSummary(TopInputCallSummarizer.java:78) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:67) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:230) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:214) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:197) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:166) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:104) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarizeInternal(FixpointLoopSummarizer.java:118) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:178) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:169) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:287) ... 21 more [2019-10-07 03:31:10,614 INFO L168 Benchmark]: Toolchain (without parser) took 57186.46 ms. Allocated memory was 134.2 MB in the beginning and 794.3 MB in the end (delta: 660.1 MB). Free memory was 93.1 MB in the beginning and 436.0 MB in the end (delta: -342.9 MB). Peak memory consumption was 317.1 MB. Max. memory is 7.1 GB. [2019-10-07 03:31:10,618 INFO L168 Benchmark]: CDTParser took 1.27 ms. Allocated memory is still 134.2 MB. Free memory was 117.5 MB in the beginning and 117.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 03:31:10,619 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1514.30 ms. Allocated memory was 134.2 MB in the beginning and 223.3 MB in the end (delta: 89.1 MB). Free memory was 92.9 MB in the beginning and 152.3 MB in the end (delta: -59.4 MB). Peak memory consumption was 47.7 MB. Max. memory is 7.1 GB. [2019-10-07 03:31:10,619 INFO L168 Benchmark]: Boogie Preprocessor took 185.55 ms. Allocated memory is still 223.3 MB. Free memory was 152.3 MB in the beginning and 140.3 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 7.1 GB. [2019-10-07 03:31:10,624 INFO L168 Benchmark]: RCFGBuilder took 13624.46 ms. Allocated memory was 223.3 MB in the beginning and 354.9 MB in the end (delta: 131.6 MB). Free memory was 140.3 MB in the beginning and 127.8 MB in the end (delta: 12.5 MB). Peak memory consumption was 144.1 MB. Max. memory is 7.1 GB. [2019-10-07 03:31:10,625 INFO L168 Benchmark]: TraceAbstraction took 41857.63 ms. Allocated memory was 354.9 MB in the beginning and 794.3 MB in the end (delta: 439.4 MB). Free memory was 127.8 MB in the beginning and 436.0 MB in the end (delta: -308.2 MB). Peak memory consumption was 131.1 MB. Max. memory is 7.1 GB. [2019-10-07 03:31:10,637 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.27 ms. Allocated memory is still 134.2 MB. Free memory was 117.5 MB in the beginning and 117.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1514.30 ms. Allocated memory was 134.2 MB in the beginning and 223.3 MB in the end (delta: 89.1 MB). Free memory was 92.9 MB in the beginning and 152.3 MB in the end (delta: -59.4 MB). Peak memory consumption was 47.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 185.55 ms. Allocated memory is still 223.3 MB. Free memory was 152.3 MB in the beginning and 140.3 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 13624.46 ms. Allocated memory was 223.3 MB in the beginning and 354.9 MB in the end (delta: 131.6 MB). Free memory was 140.3 MB in the beginning and 127.8 MB in the end (delta: 12.5 MB). Peak memory consumption was 144.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 41857.63 ms. Allocated memory was 354.9 MB in the beginning and 794.3 MB in the end (delta: 439.4 MB). Free memory was 127.8 MB in the beginning and 436.0 MB in the end (delta: -308.2 MB). Peak memory consumption was 131.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...