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/Problem02_label59.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:58:32,191 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:58:32,194 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:58:32,212 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:58:32,213 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:58:32,215 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:58:32,217 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:58:32,225 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:58:32,230 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:58:32,234 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:58:32,235 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:58:32,236 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:58:32,236 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:58:32,238 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:58:32,241 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:58:32,242 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:58:32,243 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:58:32,244 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:58:32,246 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:58:32,250 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:58:32,255 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:58:32,258 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:58:32,261 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:58:32,261 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:58:32,263 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:58:32,263 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:58:32,263 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:58:32,264 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:58:32,264 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:58:32,265 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:58:32,266 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:58:32,266 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:58:32,267 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:58:32,268 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:58:32,269 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:58:32,270 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:58:32,270 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:58:32,270 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:58:32,271 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:58:32,271 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:58:32,273 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:58:32,273 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 00:58:32,310 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:58:32,310 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:58:32,313 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:58:32,313 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:58:32,313 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:58:32,314 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:58:32,314 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:58:32,315 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:58:32,315 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:58:32,315 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:58:32,315 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:58:32,316 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:58:32,316 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:58:32,316 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:58:32,316 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:58:32,316 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:58:32,317 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:58:32,317 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:58:32,317 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:58:32,317 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:58:32,317 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:58:32,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:58:32,318 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:58:32,318 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:58:32,318 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:58:32,318 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:58:32,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:58:32,319 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:58:32,319 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 00:58:32,604 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:58:32,616 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:58:32,620 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:58:32,621 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:58:32,621 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:58:32,622 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label59.c [2019-10-07 00:58:32,679 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/576aadac4/88d61ead455448e28a924b266cfa0d4a/FLAG6f2878348 [2019-10-07 00:58:33,222 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:58:33,223 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label59.c [2019-10-07 00:58:33,236 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/576aadac4/88d61ead455448e28a924b266cfa0d4a/FLAG6f2878348 [2019-10-07 00:58:33,516 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/576aadac4/88d61ead455448e28a924b266cfa0d4a [2019-10-07 00:58:33,525 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:58:33,527 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:58:33,528 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:58:33,528 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:58:33,531 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:58:33,532 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:58:33" (1/1) ... [2019-10-07 00:58:33,534 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3304fef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:33, skipping insertion in model container [2019-10-07 00:58:33,534 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:58:33" (1/1) ... [2019-10-07 00:58:33,541 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:58:33,585 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:58:34,045 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:58:34,050 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:58:34,155 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:58:34,175 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:58:34,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:34 WrapperNode [2019-10-07 00:58:34,176 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:58:34,177 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:58:34,177 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:58:34,177 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:58:34,190 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:34" (1/1) ... [2019-10-07 00:58:34,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:34" (1/1) ... [2019-10-07 00:58:34,221 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:34" (1/1) ... [2019-10-07 00:58:34,222 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:34" (1/1) ... [2019-10-07 00:58:34,260 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:34" (1/1) ... [2019-10-07 00:58:34,276 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:34" (1/1) ... [2019-10-07 00:58:34,289 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:34" (1/1) ... [2019-10-07 00:58:34,306 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:58:34,307 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:58:34,307 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:58:34,307 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:58:34,308 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:58:34,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:58:34,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:58:34,385 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-07 00:58:34,385 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:58:34,385 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-07 00:58:34,386 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:58:34,387 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 00:58:34,388 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 00:58:34,388 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:58:34,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:58:34,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:58:36,420 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:58:36,421 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 00:58:36,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:58:36 BoogieIcfgContainer [2019-10-07 00:58:36,422 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:58:36,423 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:58:36,423 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:58:36,426 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:58:36,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:58:33" (1/3) ... [2019-10-07 00:58:36,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa35a6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:58:36, skipping insertion in model container [2019-10-07 00:58:36,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:34" (2/3) ... [2019-10-07 00:58:36,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa35a6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:58:36, skipping insertion in model container [2019-10-07 00:58:36,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:58:36" (3/3) ... [2019-10-07 00:58:36,433 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label59.c [2019-10-07 00:58:36,443 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:58:36,451 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:58:36,462 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:58:36,487 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:58:36,487 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:58:36,487 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:58:36,487 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:58:36,490 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:58:36,490 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:58:36,491 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:58:36,491 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:58:36,518 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states. [2019-10-07 00:58:36,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-07 00:58:36,531 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:36,532 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:58:36,535 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:36,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:36,541 INFO L82 PathProgramCache]: Analyzing trace with hash -219460263, now seen corresponding path program 1 times [2019-10-07 00:58:36,550 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:36,550 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:36,551 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:36,551 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:36,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:36,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:58:36,909 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:36,910 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:58:36,911 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:58:36,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:58:36,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:58:36,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:58:36,933 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 3 states. [2019-10-07 00:58:37,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:58:37,446 INFO L93 Difference]: Finished difference Result 273 states and 508 transitions. [2019-10-07 00:58:37,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:58:37,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-10-07 00:58:37,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:58:37,473 INFO L225 Difference]: With dead ends: 273 [2019-10-07 00:58:37,474 INFO L226 Difference]: Without dead ends: 175 [2019-10-07 00:58:37,480 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:58:37,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-10-07 00:58:37,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-10-07 00:58:37,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-10-07 00:58:37,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 312 transitions. [2019-10-07 00:58:37,562 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 312 transitions. Word has length 86 [2019-10-07 00:58:37,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:58:37,564 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 312 transitions. [2019-10-07 00:58:37,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:58:37,565 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 312 transitions. [2019-10-07 00:58:37,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-07 00:58:37,574 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:37,579 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] [2019-10-07 00:58:37,580 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:37,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:37,580 INFO L82 PathProgramCache]: Analyzing trace with hash -701995042, now seen corresponding path program 1 times [2019-10-07 00:58:37,581 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:37,581 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:37,581 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:37,581 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:37,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:37,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:37,789 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 00:58:37,789 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:37,789 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:58:37,790 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:58:37,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:58:37,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:58:37,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:58:37,792 INFO L87 Difference]: Start difference. First operand 175 states and 312 transitions. Second operand 3 states. [2019-10-07 00:58:38,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:58:38,173 INFO L93 Difference]: Finished difference Result 513 states and 937 transitions. [2019-10-07 00:58:38,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:58:38,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-10-07 00:58:38,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:58:38,184 INFO L225 Difference]: With dead ends: 513 [2019-10-07 00:58:38,185 INFO L226 Difference]: Without dead ends: 343 [2019-10-07 00:58:38,187 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:58:38,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-10-07 00:58:38,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 259. [2019-10-07 00:58:38,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-10-07 00:58:38,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 415 transitions. [2019-10-07 00:58:38,216 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 415 transitions. Word has length 94 [2019-10-07 00:58:38,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:58:38,217 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 415 transitions. [2019-10-07 00:58:38,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:58:38,217 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 415 transitions. [2019-10-07 00:58:38,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-07 00:58:38,220 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:38,220 INFO L385 BasicCegarLoop]: trace histogram [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] [2019-10-07 00:58:38,220 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:38,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:38,221 INFO L82 PathProgramCache]: Analyzing trace with hash -2133153300, now seen corresponding path program 1 times [2019-10-07 00:58:38,221 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:38,221 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:38,221 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:38,222 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:38,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:38,380 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:58:38,381 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:38,381 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:58:38,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:58:38,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:38,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-07 00:58:38,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:58:38,613 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:58:38,614 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:58:38,657 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:58:38,658 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 00:58:38,658 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 9 [2019-10-07 00:58:38,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 00:58:38,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 00:58:38,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-10-07 00:58:38,660 INFO L87 Difference]: Start difference. First operand 259 states and 415 transitions. Second operand 4 states. [2019-10-07 00:58:39,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:58:39,401 INFO L93 Difference]: Finished difference Result 1017 states and 1697 transitions. [2019-10-07 00:58:39,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 00:58:39,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-10-07 00:58:39,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:58:39,408 INFO L225 Difference]: With dead ends: 1017 [2019-10-07 00:58:39,408 INFO L226 Difference]: Without dead ends: 679 [2019-10-07 00:58:39,411 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-10-07 00:58:39,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2019-10-07 00:58:39,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 595. [2019-10-07 00:58:39,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-10-07 00:58:39,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 929 transitions. [2019-10-07 00:58:39,468 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 929 transitions. Word has length 99 [2019-10-07 00:58:39,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:58:39,469 INFO L462 AbstractCegarLoop]: Abstraction has 595 states and 929 transitions. [2019-10-07 00:58:39,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 00:58:39,469 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 929 transitions. [2019-10-07 00:58:39,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-07 00:58:39,474 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:39,474 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:58:39,677 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:58:39,678 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:39,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:39,678 INFO L82 PathProgramCache]: Analyzing trace with hash -217629803, now seen corresponding path program 1 times [2019-10-07 00:58:39,679 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:39,679 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:39,679 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:39,679 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:39,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:39,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:39,852 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:58:39,852 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:39,852 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:58:39,853 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 00:58:39,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 00:58:39,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 00:58:39,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-07 00:58:39,854 INFO L87 Difference]: Start difference. First operand 595 states and 929 transitions. Second operand 6 states. [2019-10-07 00:58:40,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:58:40,475 INFO L93 Difference]: Finished difference Result 1747 states and 2935 transitions. [2019-10-07 00:58:40,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 00:58:40,477 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2019-10-07 00:58:40,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:58:40,486 INFO L225 Difference]: With dead ends: 1747 [2019-10-07 00:58:40,486 INFO L226 Difference]: Without dead ends: 1157 [2019-10-07 00:58:40,489 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 00:58:40,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2019-10-07 00:58:40,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1129. [2019-10-07 00:58:40,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1129 states. [2019-10-07 00:58:40,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1758 transitions. [2019-10-07 00:58:40,579 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1758 transitions. Word has length 118 [2019-10-07 00:58:40,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:58:40,579 INFO L462 AbstractCegarLoop]: Abstraction has 1129 states and 1758 transitions. [2019-10-07 00:58:40,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 00:58:40,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1758 transitions. [2019-10-07 00:58:40,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-07 00:58:40,589 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:40,589 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-07 00:58:40,589 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:40,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:40,590 INFO L82 PathProgramCache]: Analyzing trace with hash -423602746, now seen corresponding path program 1 times [2019-10-07 00:58:40,590 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:40,590 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:40,590 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:40,591 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:40,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:40,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:40,737 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:58:40,738 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:40,738 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:58:40,738 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 00:58:40,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 00:58:40,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 00:58:40,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 00:58:40,742 INFO L87 Difference]: Start difference. First operand 1129 states and 1758 transitions. Second operand 6 states. [2019-10-07 00:58:41,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:58:41,301 INFO L93 Difference]: Finished difference Result 2301 states and 3684 transitions. [2019-10-07 00:58:41,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 00:58:41,301 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2019-10-07 00:58:41,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:58:41,317 INFO L225 Difference]: With dead ends: 2301 [2019-10-07 00:58:41,318 INFO L226 Difference]: Without dead ends: 1177 [2019-10-07 00:58:41,321 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-07 00:58:41,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2019-10-07 00:58:41,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 1153. [2019-10-07 00:58:41,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2019-10-07 00:58:41,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1719 transitions. [2019-10-07 00:58:41,380 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1719 transitions. Word has length 148 [2019-10-07 00:58:41,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:58:41,380 INFO L462 AbstractCegarLoop]: Abstraction has 1153 states and 1719 transitions. [2019-10-07 00:58:41,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 00:58:41,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1719 transitions. [2019-10-07 00:58:41,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-07 00:58:41,387 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:41,388 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-07 00:58:41,388 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:41,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:41,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1279191556, now seen corresponding path program 1 times [2019-10-07 00:58:41,389 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:41,389 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:41,389 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:41,390 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:41,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:41,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:41,570 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:58:41,571 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:41,571 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:58:41,571 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 00:58:41,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 00:58:41,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 00:58:41,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 00:58:41,573 INFO L87 Difference]: Start difference. First operand 1153 states and 1719 transitions. Second operand 6 states. [2019-10-07 00:58:42,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:58:42,296 INFO L93 Difference]: Finished difference Result 2355 states and 3705 transitions. [2019-10-07 00:58:42,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 00:58:42,297 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 157 [2019-10-07 00:58:42,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:58:42,304 INFO L225 Difference]: With dead ends: 2355 [2019-10-07 00:58:42,304 INFO L226 Difference]: Without dead ends: 1115 [2019-10-07 00:58:42,308 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-07 00:58:42,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2019-10-07 00:58:42,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1071. [2019-10-07 00:58:42,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1071 states. [2019-10-07 00:58:42,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1494 transitions. [2019-10-07 00:58:42,351 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1494 transitions. Word has length 157 [2019-10-07 00:58:42,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:58:42,351 INFO L462 AbstractCegarLoop]: Abstraction has 1071 states and 1494 transitions. [2019-10-07 00:58:42,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 00:58:42,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1494 transitions. [2019-10-07 00:58:42,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-07 00:58:42,355 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:42,356 INFO L385 BasicCegarLoop]: trace histogram [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, 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] [2019-10-07 00:58:42,356 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:42,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:42,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1688231143, now seen corresponding path program 1 times [2019-10-07 00:58:42,357 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:42,357 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:42,357 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:42,357 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:42,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:42,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:42,483 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 80 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:58:42,483 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:42,483 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:58:42,484 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 00:58:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:42,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-07 00:58:42,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:58:42,632 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 80 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:58:42,632 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:58:42,703 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 80 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:58:42,703 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:58:42,733 INFO L162 IcfgInterpreter]: Started Sifa with 90 locations of interest [2019-10-07 00:58:42,733 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:58:42,739 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:58:42,747 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:58:42,748 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:58:43,037 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 89 for LOIs [2019-10-07 00:58:43,576 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:58:43,578 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: assume true; at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:133) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: assume true; at de.uni_freiburg.informatik.ultimate.lib.sifa.PriorityWorklist.add(PriorityWorklist.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.lambda$2(DagInterpreter.java:135) at java.lang.Iterable.forEach(Iterable.java:75) at java.util.Collections$UnmodifiableCollection.forEach(Collections.java:1080) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:135) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:104) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.computeTopSummary(TopInputCallSummarizer.java:78) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:67) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:230) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:214) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:197) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:166) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:104) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarizeInternal(FixpointLoopSummarizer.java:118) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:178) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:169) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:287) ... 21 more [2019-10-07 00:58:43,584 INFO L168 Benchmark]: Toolchain (without parser) took 10056.32 ms. Allocated memory was 137.4 MB in the beginning and 410.0 MB in the end (delta: 272.6 MB). Free memory was 99.4 MB in the beginning and 252.1 MB in the end (delta: -152.7 MB). Peak memory consumption was 120.0 MB. Max. memory is 7.1 GB. [2019-10-07 00:58:43,585 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.4 MB. Free memory was 119.4 MB in the beginning and 119.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 00:58:43,586 INFO L168 Benchmark]: CACSL2BoogieTranslator took 648.74 ms. Allocated memory was 137.4 MB in the beginning and 204.5 MB in the end (delta: 67.1 MB). Free memory was 99.2 MB in the beginning and 170.4 MB in the end (delta: -71.2 MB). Peak memory consumption was 34.3 MB. Max. memory is 7.1 GB. [2019-10-07 00:58:43,587 INFO L168 Benchmark]: Boogie Preprocessor took 129.42 ms. Allocated memory is still 204.5 MB. Free memory was 170.4 MB in the beginning and 165.5 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. [2019-10-07 00:58:43,588 INFO L168 Benchmark]: RCFGBuilder took 2115.73 ms. Allocated memory was 204.5 MB in the beginning and 255.9 MB in the end (delta: 51.4 MB). Free memory was 164.8 MB in the beginning and 201.1 MB in the end (delta: -36.3 MB). Peak memory consumption was 117.0 MB. Max. memory is 7.1 GB. [2019-10-07 00:58:43,589 INFO L168 Benchmark]: TraceAbstraction took 7158.31 ms. Allocated memory was 255.9 MB in the beginning and 410.0 MB in the end (delta: 154.1 MB). Free memory was 199.2 MB in the beginning and 252.1 MB in the end (delta: -52.9 MB). Peak memory consumption was 101.3 MB. Max. memory is 7.1 GB. [2019-10-07 00:58:43,593 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.4 MB. Free memory was 119.4 MB in the beginning and 119.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 648.74 ms. Allocated memory was 137.4 MB in the beginning and 204.5 MB in the end (delta: 67.1 MB). Free memory was 99.2 MB in the beginning and 170.4 MB in the end (delta: -71.2 MB). Peak memory consumption was 34.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 129.42 ms. Allocated memory is still 204.5 MB. Free memory was 170.4 MB in the beginning and 165.5 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2115.73 ms. Allocated memory was 204.5 MB in the beginning and 255.9 MB in the end (delta: 51.4 MB). Free memory was 164.8 MB in the beginning and 201.1 MB in the end (delta: -36.3 MB). Peak memory consumption was 117.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7158.31 ms. Allocated memory was 255.9 MB in the beginning and 410.0 MB in the end (delta: 154.1 MB). Free memory was 199.2 MB in the beginning and 252.1 MB in the end (delta: -52.9 MB). Peak memory consumption was 101.3 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...