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/Problem03_label29.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:58:45,686 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:58:45,689 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:58:45,701 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:58:45,701 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:58:45,702 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:58:45,703 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:58:45,705 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:58:45,707 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:58:45,708 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:58:45,709 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:58:45,710 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:58:45,710 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:58:45,711 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:58:45,712 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:58:45,713 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:58:45,714 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:58:45,714 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:58:45,716 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:58:45,718 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:58:45,720 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:58:45,724 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:58:45,725 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:58:45,726 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:58:45,731 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:58:45,731 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:58:45,731 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:58:45,732 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:58:45,733 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:58:45,733 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:58:45,734 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:58:45,734 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:58:45,735 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:58:45,736 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:58:45,737 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:58:45,737 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:58:45,738 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:58:45,738 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:58:45,738 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:58:45,739 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:58:45,740 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:58:45,741 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:45,755 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:58:45,755 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:58:45,756 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:58:45,756 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:58:45,757 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:58:45,757 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:58:45,757 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:58:45,757 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:58:45,757 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:58:45,758 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:58:45,758 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:58:45,758 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:58:45,758 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:58:45,758 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:58:45,759 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:58:45,759 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:58:45,759 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:58:45,759 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:58:45,759 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:58:45,760 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:58:45,760 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:58:45,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:58:45,760 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:58:45,760 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:58:45,761 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:58:45,761 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:58:45,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:58:45,761 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:58:45,762 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:46,073 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:58:46,086 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:58:46,089 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:58:46,090 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:58:46,091 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:58:46,091 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label29.c [2019-10-07 00:58:46,152 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81798d349/6dbcb9d2b0ff49c7928b698f63885f9d/FLAG95977fd71 [2019-10-07 00:58:46,811 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:58:46,813 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label29.c [2019-10-07 00:58:46,834 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81798d349/6dbcb9d2b0ff49c7928b698f63885f9d/FLAG95977fd71 [2019-10-07 00:58:46,971 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81798d349/6dbcb9d2b0ff49c7928b698f63885f9d [2019-10-07 00:58:46,984 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:58:46,985 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:58:46,986 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:58:46,987 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:58:46,990 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:58:46,991 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:58:46" (1/1) ... [2019-10-07 00:58:46,993 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3764c2d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:46, skipping insertion in model container [2019-10-07 00:58:46,994 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:58:46" (1/1) ... [2019-10-07 00:58:47,001 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:58:47,081 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:58:47,890 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:58:47,905 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:58:48,246 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:58:48,278 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:58:48,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:48 WrapperNode [2019-10-07 00:58:48,280 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:58:48,280 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:58:48,280 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:58:48,281 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:58:48,298 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:48" (1/1) ... [2019-10-07 00:58:48,299 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:48" (1/1) ... [2019-10-07 00:58:48,343 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:48" (1/1) ... [2019-10-07 00:58:48,344 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:48" (1/1) ... [2019-10-07 00:58:48,411 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:48" (1/1) ... [2019-10-07 00:58:48,424 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:48" (1/1) ... [2019-10-07 00:58:48,439 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:48" (1/1) ... [2019-10-07 00:58:48,455 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:58:48,455 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:58:48,455 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:58:48,455 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:58:48,456 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:48" (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:48,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:58:48,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:58:48,512 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-07 00:58:48,512 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:58:48,514 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-07 00:58:48,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:58:48,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 00:58:48,514 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 00:58:48,514 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:58:48,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:58:48,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:58:51,481 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:58:51,481 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 00:58:51,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:58:51 BoogieIcfgContainer [2019-10-07 00:58:51,483 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:58:51,484 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:58:51,484 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:58:51,487 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:58:51,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:58:46" (1/3) ... [2019-10-07 00:58:51,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c7f6ef2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:58:51, skipping insertion in model container [2019-10-07 00:58:51,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:48" (2/3) ... [2019-10-07 00:58:51,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c7f6ef2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:58:51, skipping insertion in model container [2019-10-07 00:58:51,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:58:51" (3/3) ... [2019-10-07 00:58:51,491 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label29.c [2019-10-07 00:58:51,501 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:58:51,510 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:58:51,521 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:58:51,558 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:58:51,558 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:58:51,558 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:58:51,559 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:58:51,559 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:58:51,559 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:58:51,560 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:58:51,560 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:58:51,598 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states. [2019-10-07 00:58:51,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-07 00:58:51,618 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:51,620 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51,622 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:51,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:51,628 INFO L82 PathProgramCache]: Analyzing trace with hash 136472614, now seen corresponding path program 1 times [2019-10-07 00:58:51,637 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:51,637 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:51,637 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:51,638 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:51,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:52,403 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:52,403 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:52,404 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:58:52,405 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:58:52,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:58:52,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:58:52,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:58:52,427 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 3 states. [2019-10-07 00:58:53,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:58:53,482 INFO L93 Difference]: Finished difference Result 462 states and 886 transitions. [2019-10-07 00:58:53,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:58:53,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-10-07 00:58:53,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:58:53,501 INFO L225 Difference]: With dead ends: 462 [2019-10-07 00:58:53,501 INFO L226 Difference]: Without dead ends: 301 [2019-10-07 00:58:53,505 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:53,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-10-07 00:58:53,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2019-10-07 00:58:53,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-10-07 00:58:53,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 564 transitions. [2019-10-07 00:58:53,580 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 564 transitions. Word has length 149 [2019-10-07 00:58:53,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:58:53,582 INFO L462 AbstractCegarLoop]: Abstraction has 301 states and 564 transitions. [2019-10-07 00:58:53,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:58:53,582 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 564 transitions. [2019-10-07 00:58:53,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-07 00:58:53,587 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:53,588 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:58:53,588 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:53,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:53,591 INFO L82 PathProgramCache]: Analyzing trace with hash 558842557, now seen corresponding path program 1 times [2019-10-07 00:58:53,592 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:53,592 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:53,592 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:53,592 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:53,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:53,759 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:58:53,760 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:53,760 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:58:53,760 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 00:58:53,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 00:58:53,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 00:58:53,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 00:58:53,763 INFO L87 Difference]: Start difference. First operand 301 states and 564 transitions. Second operand 6 states. [2019-10-07 00:58:55,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:58:55,178 INFO L93 Difference]: Finished difference Result 929 states and 1794 transitions. [2019-10-07 00:58:55,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 00:58:55,182 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 158 [2019-10-07 00:58:55,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:58:55,190 INFO L225 Difference]: With dead ends: 929 [2019-10-07 00:58:55,191 INFO L226 Difference]: Without dead ends: 633 [2019-10-07 00:58:55,193 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:55,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-10-07 00:58:55,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 603. [2019-10-07 00:58:55,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-10-07 00:58:55,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 1113 transitions. [2019-10-07 00:58:55,266 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 1113 transitions. Word has length 158 [2019-10-07 00:58:55,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:58:55,266 INFO L462 AbstractCegarLoop]: Abstraction has 603 states and 1113 transitions. [2019-10-07 00:58:55,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 00:58:55,267 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1113 transitions. [2019-10-07 00:58:55,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-07 00:58:55,273 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:55,273 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,274 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:55,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:55,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1532429294, now seen corresponding path program 1 times [2019-10-07 00:58:55,274 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:55,275 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:55,275 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:55,275 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:55,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:55,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:55,526 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:58:55,527 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:55,528 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:58:55,528 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:58:55,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:58:55,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:58:55,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:58:55,530 INFO L87 Difference]: Start difference. First operand 603 states and 1113 transitions. Second operand 3 states. [2019-10-07 00:58:56,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:58:56,557 INFO L93 Difference]: Finished difference Result 1795 states and 3387 transitions. [2019-10-07 00:58:56,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:58:56,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-10-07 00:58:56,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:58:56,568 INFO L225 Difference]: With dead ends: 1795 [2019-10-07 00:58:56,569 INFO L226 Difference]: Without dead ends: 1197 [2019-10-07 00:58:56,572 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:56,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2019-10-07 00:58:56,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1197. [2019-10-07 00:58:56,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1197 states. [2019-10-07 00:58:56,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 2199 transitions. [2019-10-07 00:58:56,629 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 2199 transitions. Word has length 161 [2019-10-07 00:58:56,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:58:56,630 INFO L462 AbstractCegarLoop]: Abstraction has 1197 states and 2199 transitions. [2019-10-07 00:58:56,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:58:56,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 2199 transitions. [2019-10-07 00:58:56,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-07 00:58:56,638 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:56,638 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:58:56,638 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:56,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:56,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1521645618, now seen corresponding path program 1 times [2019-10-07 00:58:56,641 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:56,641 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:56,641 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:56,641 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:56,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:56,860 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 00:58:56,861 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:56,861 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:58:56,861 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:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:57,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 1032 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-07 00:58:57,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:58:57,217 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-07 00:58:57,218 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:58:57,332 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 00:58:57,332 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 00:58:57,332 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2019-10-07 00:58:57,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 00:58:57,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 00:58:57,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-10-07 00:58:57,334 INFO L87 Difference]: Start difference. First operand 1197 states and 2199 transitions. Second operand 5 states. [2019-10-07 00:58:58,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:58:58,622 INFO L93 Difference]: Finished difference Result 3665 states and 7306 transitions. [2019-10-07 00:58:58,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 00:58:58,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 171 [2019-10-07 00:58:58,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:58:58,645 INFO L225 Difference]: With dead ends: 3665 [2019-10-07 00:58:58,645 INFO L226 Difference]: Without dead ends: 2473 [2019-10-07 00:58:58,650 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 337 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-10-07 00:58:58,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2473 states. [2019-10-07 00:58:58,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2473 to 2419. [2019-10-07 00:58:58,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2419 states. [2019-10-07 00:58:58,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2419 states to 2419 states and 4339 transitions. [2019-10-07 00:58:58,775 INFO L78 Accepts]: Start accepts. Automaton has 2419 states and 4339 transitions. Word has length 171 [2019-10-07 00:58:58,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:58:58,776 INFO L462 AbstractCegarLoop]: Abstraction has 2419 states and 4339 transitions. [2019-10-07 00:58:58,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 00:58:58,776 INFO L276 IsEmpty]: Start isEmpty. Operand 2419 states and 4339 transitions. [2019-10-07 00:58:58,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-07 00:58:58,787 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:58,787 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:58:58,993 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:58:58,994 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:58,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:58,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1881797470, now seen corresponding path program 1 times [2019-10-07 00:58:58,995 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:58,995 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:58,995 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:58,997 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:58,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:59,185 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 31 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:58:59,186 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:59,186 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:58:59,186 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:59,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:59,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 1040 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-07 00:58:59,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:58:59,549 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 00:58:59,550 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:58:59,669 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 00:58:59,669 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 00:58:59,670 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 10 [2019-10-07 00:58:59,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 00:58:59,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 00:58:59,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-07 00:58:59,671 INFO L87 Difference]: Start difference. First operand 2419 states and 4339 transitions. Second operand 5 states. [2019-10-07 00:59:00,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:59:00,258 INFO L93 Difference]: Finished difference Result 7257 states and 13232 transitions. [2019-10-07 00:59:00,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 00:59:00,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 179 [2019-10-07 00:59:00,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:59:00,299 INFO L225 Difference]: With dead ends: 7257 [2019-10-07 00:59:00,300 INFO L226 Difference]: Without dead ends: 4843 [2019-10-07 00:59:00,309 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 350 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-07 00:59:00,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4843 states. [2019-10-07 00:59:00,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4843 to 4835. [2019-10-07 00:59:00,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4835 states. [2019-10-07 00:59:00,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4835 states to 4835 states and 8834 transitions. [2019-10-07 00:59:00,553 INFO L78 Accepts]: Start accepts. Automaton has 4835 states and 8834 transitions. Word has length 179 [2019-10-07 00:59:00,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:59:00,553 INFO L462 AbstractCegarLoop]: Abstraction has 4835 states and 8834 transitions. [2019-10-07 00:59:00,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 00:59:00,553 INFO L276 IsEmpty]: Start isEmpty. Operand 4835 states and 8834 transitions. [2019-10-07 00:59:00,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-07 00:59:00,572 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:59:00,573 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:59:00,788 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:59:00,789 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:59:00,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:59:00,790 INFO L82 PathProgramCache]: Analyzing trace with hash 2106578126, now seen corresponding path program 1 times [2019-10-07 00:59:00,790 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:59:00,790 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:00,790 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:00,791 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:00,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:59:00,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:00,905 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 47 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:59:00,905 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:00,905 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:59:00,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:59:01,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:01,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-07 00:59:01,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:59:01,190 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-07 00:59:01,191 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:59:01,254 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-07 00:59:01,255 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 00:59:01,255 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-07 00:59:01,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:59:01,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:59:01,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-07 00:59:01,256 INFO L87 Difference]: Start difference. First operand 4835 states and 8834 transitions. Second operand 3 states. [2019-10-07 00:59:02,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:59:02,268 INFO L93 Difference]: Finished difference Result 14282 states and 26830 transitions. [2019-10-07 00:59:02,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:59:02,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-10-07 00:59:02,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:59:02,336 INFO L225 Difference]: With dead ends: 14282 [2019-10-07 00:59:02,337 INFO L226 Difference]: Without dead ends: 9452 [2019-10-07 00:59:02,352 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 372 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-07 00:59:02,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9452 states. [2019-10-07 00:59:02,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9452 to 9452. [2019-10-07 00:59:02,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9452 states. [2019-10-07 00:59:02,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9452 states to 9452 states and 17601 transitions. [2019-10-07 00:59:02,654 INFO L78 Accepts]: Start accepts. Automaton has 9452 states and 17601 transitions. Word has length 187 [2019-10-07 00:59:02,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:59:02,655 INFO L462 AbstractCegarLoop]: Abstraction has 9452 states and 17601 transitions. [2019-10-07 00:59:02,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:59:02,656 INFO L276 IsEmpty]: Start isEmpty. Operand 9452 states and 17601 transitions. [2019-10-07 00:59:02,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-07 00:59:02,694 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:59:02,695 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:59:02,905 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:59:02,905 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:59:02,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:59:02,906 INFO L82 PathProgramCache]: Analyzing trace with hash 267570982, now seen corresponding path program 1 times [2019-10-07 00:59:02,906 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:59:02,906 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:02,906 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:02,907 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:02,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:59:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:03,043 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 51 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-07 00:59:03,043 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:03,043 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:59:03,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:59:03,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:03,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 1208 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-07 00:59:03,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:59:03,311 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 58 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-07 00:59:03,312 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:59:03,409 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 51 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-07 00:59:03,409 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:59:03,449 INFO L162 IcfgInterpreter]: Started Sifa with 153 locations of interest [2019-10-07 00:59:03,449 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:59:03,456 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:59:03,464 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:59:03,464 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:59:04,308 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 210 for LOIs [2019-10-07 00:59:04,575 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 298 [2019-10-07 00:59:05,103 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 310 [2019-10-07 00:59:05,727 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:59:05,728 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.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:59:05,733 INFO L168 Benchmark]: Toolchain (without parser) took 18746.90 ms. Allocated memory was 136.8 MB in the beginning and 751.3 MB in the end (delta: 614.5 MB). Free memory was 96.6 MB in the beginning and 466.2 MB in the end (delta: -369.6 MB). Peak memory consumption was 244.9 MB. Max. memory is 7.1 GB. [2019-10-07 00:59:05,735 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 136.8 MB. Free memory was 120.1 MB in the beginning and 119.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 00:59:05,736 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1293.61 ms. Allocated memory was 136.8 MB in the beginning and 228.1 MB in the end (delta: 91.2 MB). Free memory was 96.4 MB in the beginning and 176.9 MB in the end (delta: -80.5 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. [2019-10-07 00:59:05,737 INFO L168 Benchmark]: Boogie Preprocessor took 174.55 ms. Allocated memory is still 228.1 MB. Free memory was 176.9 MB in the beginning and 165.7 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2019-10-07 00:59:05,738 INFO L168 Benchmark]: RCFGBuilder took 3027.81 ms. Allocated memory was 228.1 MB in the beginning and 354.9 MB in the end (delta: 126.9 MB). Free memory was 165.7 MB in the beginning and 290.0 MB in the end (delta: -124.3 MB). Peak memory consumption was 132.2 MB. Max. memory is 7.1 GB. [2019-10-07 00:59:05,741 INFO L168 Benchmark]: TraceAbstraction took 14246.55 ms. Allocated memory was 354.9 MB in the beginning and 751.3 MB in the end (delta: 396.4 MB). Free memory was 290.0 MB in the beginning and 466.2 MB in the end (delta: -176.2 MB). Peak memory consumption was 220.2 MB. Max. memory is 7.1 GB. [2019-10-07 00:59:05,755 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.20 ms. Allocated memory is still 136.8 MB. Free memory was 120.1 MB in the beginning and 119.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1293.61 ms. Allocated memory was 136.8 MB in the beginning and 228.1 MB in the end (delta: 91.2 MB). Free memory was 96.4 MB in the beginning and 176.9 MB in the end (delta: -80.5 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 174.55 ms. Allocated memory is still 228.1 MB. Free memory was 176.9 MB in the beginning and 165.7 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3027.81 ms. Allocated memory was 228.1 MB in the beginning and 354.9 MB in the end (delta: 126.9 MB). Free memory was 165.7 MB in the beginning and 290.0 MB in the end (delta: -124.3 MB). Peak memory consumption was 132.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14246.55 ms. Allocated memory was 354.9 MB in the beginning and 751.3 MB in the end (delta: 396.4 MB). Free memory was 290.0 MB in the beginning and 466.2 MB in the end (delta: -176.2 MB). Peak memory consumption was 220.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: assume true; de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: assume true;: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...