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/Problem18_label22.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 03:41:14,514 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 03:41:14,516 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 03:41:14,534 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 03:41:14,535 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 03:41:14,537 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 03:41:14,539 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 03:41:14,548 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 03:41:14,554 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 03:41:14,556 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 03:41:14,558 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 03:41:14,559 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 03:41:14,560 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 03:41:14,561 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 03:41:14,564 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 03:41:14,565 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 03:41:14,566 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 03:41:14,567 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 03:41:14,569 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 03:41:14,573 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 03:41:14,577 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 03:41:14,580 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 03:41:14,583 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 03:41:14,584 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 03:41:14,586 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 03:41:14,586 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 03:41:14,586 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 03:41:14,588 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 03:41:14,589 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 03:41:14,590 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 03:41:14,591 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 03:41:14,592 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 03:41:14,593 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 03:41:14,594 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 03:41:14,595 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 03:41:14,595 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 03:41:14,596 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 03:41:14,596 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 03:41:14,596 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 03:41:14,597 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 03:41:14,598 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 03:41:14,599 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 03:41:14,632 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 03:41:14,632 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 03:41:14,633 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 03:41:14,633 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 03:41:14,634 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 03:41:14,634 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 03:41:14,634 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 03:41:14,634 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 03:41:14,634 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 03:41:14,635 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 03:41:14,635 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 03:41:14,635 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 03:41:14,635 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 03:41:14,635 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 03:41:14,636 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 03:41:14,636 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 03:41:14,636 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 03:41:14,636 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 03:41:14,636 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 03:41:14,636 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 03:41:14,637 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 03:41:14,637 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 03:41:14,637 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 03:41:14,637 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 03:41:14,637 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 03:41:14,638 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 03:41:14,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 03:41:14,638 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 03:41:14,638 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 03:41:14,895 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 03:41:14,919 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 03:41:14,922 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 03:41:14,924 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 03:41:14,924 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 03:41:14,925 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem18_label22.c [2019-10-07 03:41:15,000 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2423439dc/3c277d93639a4b61a96a88544256461d/FLAGaf3224f80 [2019-10-07 03:41:15,727 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 03:41:15,727 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem18_label22.c [2019-10-07 03:41:15,753 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2423439dc/3c277d93639a4b61a96a88544256461d/FLAGaf3224f80 [2019-10-07 03:41:15,864 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2423439dc/3c277d93639a4b61a96a88544256461d [2019-10-07 03:41:15,874 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 03:41:15,876 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 03:41:15,877 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 03:41:15,877 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 03:41:15,881 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 03:41:15,882 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:41:15" (1/1) ... [2019-10-07 03:41:15,885 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2347579a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:41:15, skipping insertion in model container [2019-10-07 03:41:15,885 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:41:15" (1/1) ... [2019-10-07 03:41:15,893 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 03:41:16,007 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 03:41:17,325 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:41:17,337 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 03:41:17,792 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:41:17,825 INFO L192 MainTranslator]: Completed translation [2019-10-07 03:41:17,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:41:17 WrapperNode [2019-10-07 03:41:17,826 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 03:41:17,826 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 03:41:17,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 03:41:17,827 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 03:41:17,842 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:41:17" (1/1) ... [2019-10-07 03:41:17,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:41:17" (1/1) ... [2019-10-07 03:41:17,885 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:41:17" (1/1) ... [2019-10-07 03:41:17,886 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:41:17" (1/1) ... [2019-10-07 03:41:17,983 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:41:17" (1/1) ... [2019-10-07 03:41:18,030 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:41:17" (1/1) ... [2019-10-07 03:41:18,057 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:41:17" (1/1) ... [2019-10-07 03:41:18,081 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 03:41:18,082 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 03:41:18,082 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 03:41:18,083 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 03:41:18,084 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:41:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 03:41:18,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 03:41:18,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 03:41:18,153 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-07 03:41:18,153 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-10-07 03:41:18,153 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-10-07 03:41:18,154 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 03:41:18,154 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-07 03:41:18,154 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-10-07 03:41:18,154 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-10-07 03:41:18,155 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 03:41:18,155 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 03:41:18,155 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 03:41:18,155 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 03:41:18,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 03:41:18,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 03:43:04,252 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 03:43:04,253 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 03:43:04,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:43:04 BoogieIcfgContainer [2019-10-07 03:43:04,255 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 03:43:04,257 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 03:43:04,257 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 03:43:04,260 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 03:43:04,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 03:41:15" (1/3) ... [2019-10-07 03:43:04,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@343d2256 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:43:04, skipping insertion in model container [2019-10-07 03:43:04,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:41:17" (2/3) ... [2019-10-07 03:43:04,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@343d2256 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:43:04, skipping insertion in model container [2019-10-07 03:43:04,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:43:04" (3/3) ... [2019-10-07 03:43:04,264 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem18_label22.c [2019-10-07 03:43:04,274 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 03:43:04,283 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 03:43:04,294 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 03:43:04,328 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 03:43:04,328 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 03:43:04,328 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 03:43:04,328 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 03:43:04,329 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 03:43:04,329 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 03:43:04,329 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 03:43:04,330 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 03:43:04,359 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states. [2019-10-07 03:43:04,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-07 03:43:04,365 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:43:04,366 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:43:04,368 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:43:04,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:43:04,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1816954534, now seen corresponding path program 1 times [2019-10-07 03:43:04,383 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:43:04,384 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:43:04,384 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:43:04,384 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:43:04,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:43:04,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:43:04,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:43:04,616 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:43:04,617 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:43:04,618 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 03:43:04,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 03:43:04,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 03:43:04,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 03:43:04,638 INFO L87 Difference]: Start difference. First operand 469 states. Second operand 3 states. [2019-10-07 03:43:08,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:43:08,024 INFO L93 Difference]: Finished difference Result 1393 states and 2727 transitions. [2019-10-07 03:43:08,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 03:43:08,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-10-07 03:43:08,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:43:08,051 INFO L225 Difference]: With dead ends: 1393 [2019-10-07 03:43:08,051 INFO L226 Difference]: Without dead ends: 921 [2019-10-07 03:43:08,063 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 03:43:08,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2019-10-07 03:43:08,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 916. [2019-10-07 03:43:08,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-10-07 03:43:08,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1726 transitions. [2019-10-07 03:43:08,186 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1726 transitions. Word has length 11 [2019-10-07 03:43:08,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:43:08,187 INFO L462 AbstractCegarLoop]: Abstraction has 916 states and 1726 transitions. [2019-10-07 03:43:08,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 03:43:08,187 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1726 transitions. [2019-10-07 03:43:08,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-07 03:43:08,189 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:43:08,189 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:43:08,190 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:43:08,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:43:08,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1382737978, now seen corresponding path program 1 times [2019-10-07 03:43:08,190 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:43:08,191 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:43:08,191 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:43:08,191 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:43:08,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:43:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:43:08,331 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:43:08,332 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:43:08,332 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:43:08,332 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 03:43:08,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 03:43:08,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 03:43:08,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 03:43:08,335 INFO L87 Difference]: Start difference. First operand 916 states and 1726 transitions. Second operand 5 states. [2019-10-07 03:43:12,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:43:12,152 INFO L93 Difference]: Finished difference Result 2763 states and 5240 transitions. [2019-10-07 03:43:12,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 03:43:12,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-10-07 03:43:12,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:43:12,173 INFO L225 Difference]: With dead ends: 2763 [2019-10-07 03:43:12,173 INFO L226 Difference]: Without dead ends: 1852 [2019-10-07 03:43:12,182 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-07 03:43:12,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2019-10-07 03:43:12,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 1840. [2019-10-07 03:43:12,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1840 states. [2019-10-07 03:43:12,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 3346 transitions. [2019-10-07 03:43:12,614 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 3346 transitions. Word has length 23 [2019-10-07 03:43:12,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:43:12,615 INFO L462 AbstractCegarLoop]: Abstraction has 1840 states and 3346 transitions. [2019-10-07 03:43:12,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 03:43:12,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 3346 transitions. [2019-10-07 03:43:12,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-07 03:43:12,622 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:43:12,622 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] [2019-10-07 03:43:12,623 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:43:12,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:43:12,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1506923483, now seen corresponding path program 1 times [2019-10-07 03:43:12,625 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:43:12,625 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:43:12,625 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:43:12,626 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:43:12,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:43:12,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:43:12,835 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:43:12,835 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:43:12,836 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:43:12,837 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 03:43:12,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 03:43:12,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 03:43:12,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 03:43:12,840 INFO L87 Difference]: Start difference. First operand 1840 states and 3346 transitions. Second operand 6 states. [2019-10-07 03:43:18,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:43:18,573 INFO L93 Difference]: Finished difference Result 4173 states and 7560 transitions. [2019-10-07 03:43:18,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 03:43:18,574 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-10-07 03:43:18,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:43:18,590 INFO L225 Difference]: With dead ends: 4173 [2019-10-07 03:43:18,592 INFO L226 Difference]: Without dead ends: 2338 [2019-10-07 03:43:18,601 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-07 03:43:18,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2019-10-07 03:43:18,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 2296. [2019-10-07 03:43:18,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2296 states. [2019-10-07 03:43:18,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2296 states to 2296 states and 3887 transitions. [2019-10-07 03:43:18,710 INFO L78 Accepts]: Start accepts. Automaton has 2296 states and 3887 transitions. Word has length 46 [2019-10-07 03:43:18,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:43:18,710 INFO L462 AbstractCegarLoop]: Abstraction has 2296 states and 3887 transitions. [2019-10-07 03:43:18,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 03:43:18,711 INFO L276 IsEmpty]: Start isEmpty. Operand 2296 states and 3887 transitions. [2019-10-07 03:43:18,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-07 03:43:18,715 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:43:18,716 INFO L385 BasicCegarLoop]: trace histogram [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] [2019-10-07 03:43:18,716 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:43:18,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:43:18,716 INFO L82 PathProgramCache]: Analyzing trace with hash -979099743, now seen corresponding path program 1 times [2019-10-07 03:43:18,717 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:43:18,717 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:43:18,717 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:43:18,717 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:43:18,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:43:18,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:43:18,888 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 03:43:18,888 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:43:18,889 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:43:18,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:43:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:43:18,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-07 03:43:18,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:43:19,071 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 03:43:19,072 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:43:19,154 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 03:43:19,155 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 03:43:19,155 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 10 [2019-10-07 03:43:19,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 03:43:19,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 03:43:19,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-07 03:43:19,156 INFO L87 Difference]: Start difference. First operand 2296 states and 3887 transitions. Second operand 5 states. [2019-10-07 03:43:23,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:43:23,719 INFO L93 Difference]: Finished difference Result 6565 states and 11311 transitions. [2019-10-07 03:43:23,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 03:43:23,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-10-07 03:43:23,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:43:23,762 INFO L225 Difference]: With dead ends: 6565 [2019-10-07 03:43:23,762 INFO L226 Difference]: Without dead ends: 4274 [2019-10-07 03:43:23,774 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 94 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-10-07 03:43:23,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4274 states. [2019-10-07 03:43:23,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4274 to 4175. [2019-10-07 03:43:23,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4175 states. [2019-10-07 03:43:23,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4175 states to 4175 states and 6651 transitions. [2019-10-07 03:43:23,992 INFO L78 Accepts]: Start accepts. Automaton has 4175 states and 6651 transitions. Word has length 50 [2019-10-07 03:43:23,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:43:23,993 INFO L462 AbstractCegarLoop]: Abstraction has 4175 states and 6651 transitions. [2019-10-07 03:43:23,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 03:43:23,993 INFO L276 IsEmpty]: Start isEmpty. Operand 4175 states and 6651 transitions. [2019-10-07 03:43:24,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-07 03:43:24,004 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:43:24,005 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-07 03:43:24,219 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:43:24,220 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:43:24,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:43:24,220 INFO L82 PathProgramCache]: Analyzing trace with hash 593701541, now seen corresponding path program 1 times [2019-10-07 03:43:24,221 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:43:24,221 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:43:24,221 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:43:24,222 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:43:24,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:43:24,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:43:24,358 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 03:43:24,358 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:43:24,359 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:43:24,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:43:24,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:43:24,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-07 03:43:24,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:43:24,504 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 03:43:24,504 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:43:27,245 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 03:43:27,246 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 03:43:27,246 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 12 [2019-10-07 03:43:27,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 03:43:27,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 03:43:27,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-10-07 03:43:27,247 INFO L87 Difference]: Start difference. First operand 4175 states and 6651 transitions. Second operand 5 states. [2019-10-07 03:43:30,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:43:30,924 INFO L93 Difference]: Finished difference Result 9346 states and 15111 transitions. [2019-10-07 03:43:30,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 03:43:30,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-10-07 03:43:30,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:43:30,959 INFO L225 Difference]: With dead ends: 9346 [2019-10-07 03:43:30,960 INFO L226 Difference]: Without dead ends: 5176 [2019-10-07 03:43:30,973 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-07 03:43:30,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5176 states. [2019-10-07 03:43:31,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5176 to 5156. [2019-10-07 03:43:31,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5156 states. [2019-10-07 03:43:31,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5156 states to 5156 states and 7874 transitions. [2019-10-07 03:43:31,138 INFO L78 Accepts]: Start accepts. Automaton has 5156 states and 7874 transitions. Word has length 72 [2019-10-07 03:43:31,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:43:31,141 INFO L462 AbstractCegarLoop]: Abstraction has 5156 states and 7874 transitions. [2019-10-07 03:43:31,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 03:43:31,141 INFO L276 IsEmpty]: Start isEmpty. Operand 5156 states and 7874 transitions. [2019-10-07 03:43:31,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-07 03:43:31,144 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:43:31,144 INFO L385 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:43:31,348 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:43:31,349 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:43:31,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:43:31,350 INFO L82 PathProgramCache]: Analyzing trace with hash 540844757, now seen corresponding path program 1 times [2019-10-07 03:43:31,350 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:43:31,350 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:43:31,350 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:43:31,351 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:43:31,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:43:31,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:43:31,476 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 03:43:31,477 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:43:31,477 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:43:31,477 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 03:43:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:43:31,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-07 03:43:31,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:43:31,606 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 03:43:31,606 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:43:31,691 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 03:43:31,692 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 03:43:31,692 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 9 [2019-10-07 03:43:31,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 03:43:31,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 03:43:31,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-10-07 03:43:31,696 INFO L87 Difference]: Start difference. First operand 5156 states and 7874 transitions. Second operand 5 states. [2019-10-07 03:43:36,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:43:36,571 INFO L93 Difference]: Finished difference Result 15111 states and 24053 transitions. [2019-10-07 03:43:36,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 03:43:36,573 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-10-07 03:43:36,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:43:36,636 INFO L225 Difference]: With dead ends: 15111 [2019-10-07 03:43:36,636 INFO L226 Difference]: Without dead ends: 9960 [2019-10-07 03:43:36,656 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 142 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-10-07 03:43:36,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9960 states. [2019-10-07 03:43:36,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9960 to 9557. [2019-10-07 03:43:36,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9557 states. [2019-10-07 03:43:36,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9557 states to 9557 states and 13604 transitions. [2019-10-07 03:43:36,922 INFO L78 Accepts]: Start accepts. Automaton has 9557 states and 13604 transitions. Word has length 72 [2019-10-07 03:43:36,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:43:36,922 INFO L462 AbstractCegarLoop]: Abstraction has 9557 states and 13604 transitions. [2019-10-07 03:43:36,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 03:43:36,923 INFO L276 IsEmpty]: Start isEmpty. Operand 9557 states and 13604 transitions. [2019-10-07 03:43:36,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-07 03:43:36,925 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:43:36,925 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:43:37,130 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:43:37,130 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:43:37,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:43:37,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1274417083, now seen corresponding path program 1 times [2019-10-07 03:43:37,131 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:43:37,132 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:43:37,132 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:43:37,132 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:43:37,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:43:37,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:43:37,223 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-07 03:43:37,224 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:43:37,224 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:43:37,224 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 03:43:37,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:43:37,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-07 03:43:37,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:43:37,412 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-07 03:43:37,412 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:43:37,496 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-07 03:43:37,496 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 03:43:37,496 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2019-10-07 03:43:37,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 03:43:37,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 03:43:37,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-10-07 03:43:37,498 INFO L87 Difference]: Start difference. First operand 9557 states and 13604 transitions. Second operand 5 states. [2019-10-07 03:43:41,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:43:41,887 INFO L93 Difference]: Finished difference Result 26223 states and 38296 transitions. [2019-10-07 03:43:41,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 03:43:41,892 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-10-07 03:43:41,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:43:41,966 INFO L225 Difference]: With dead ends: 26223 [2019-10-07 03:43:41,966 INFO L226 Difference]: Without dead ends: 16671 [2019-10-07 03:43:41,996 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 159 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-10-07 03:43:42,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16671 states. [2019-10-07 03:43:42,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16671 to 11983. [2019-10-07 03:43:42,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11983 states. [2019-10-07 03:43:42,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11983 states to 11983 states and 16748 transitions. [2019-10-07 03:43:42,296 INFO L78 Accepts]: Start accepts. Automaton has 11983 states and 16748 transitions. Word has length 82 [2019-10-07 03:43:42,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:43:42,296 INFO L462 AbstractCegarLoop]: Abstraction has 11983 states and 16748 transitions. [2019-10-07 03:43:42,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 03:43:42,297 INFO L276 IsEmpty]: Start isEmpty. Operand 11983 states and 16748 transitions. [2019-10-07 03:43:42,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-07 03:43:42,304 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:43:42,304 INFO L385 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-07 03:43:42,510 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:43:42,510 INFO L410 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:43:42,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:43:42,511 INFO L82 PathProgramCache]: Analyzing trace with hash 213935506, now seen corresponding path program 1 times [2019-10-07 03:43:42,511 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:43:42,511 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:43:42,512 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:43:42,512 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:43:42,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:43:42,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:43:42,681 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 36 proven. 18 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-10-07 03:43:42,681 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:43:42,681 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:43:42,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:43:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:43:42,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-07 03:43:42,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:43:42,861 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 97 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-07 03:43:42,862 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:43:42,940 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 36 proven. 18 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-10-07 03:43:42,941 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 03:43:42,970 INFO L162 IcfgInterpreter]: Started Sifa with 70 locations of interest [2019-10-07 03:43:42,970 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 03:43:42,976 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 03:43:42,984 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 03:43:42,985 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 03:43:43,131 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 51 for LOIs [2019-10-07 03:43:43,271 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 35 [2019-10-07 03:43:43,484 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 35 [2019-10-07 03:43:43,894 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 26 [2019-10-07 03:43:43,994 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 26 [2019-10-07 03:43:44,358 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:43:44,359 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: assume true; at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:133) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: assume true; at de.uni_freiburg.informatik.ultimate.lib.sifa.PriorityWorklist.add(PriorityWorklist.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.lambda$2(DagInterpreter.java:135) at java.lang.Iterable.forEach(Iterable.java:75) at java.util.Collections$UnmodifiableCollection.forEach(Collections.java:1080) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:135) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:104) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.computeTopSummary(TopInputCallSummarizer.java:78) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:67) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:230) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:214) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:197) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:166) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:104) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarizeInternal(FixpointLoopSummarizer.java:118) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:178) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:169) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:287) ... 21 more [2019-10-07 03:43:44,367 INFO L168 Benchmark]: Toolchain (without parser) took 148489.18 ms. Allocated memory was 139.5 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 94.8 MB in the beginning and 897.1 MB in the end (delta: -802.3 MB). Peak memory consumption was 341.7 MB. Max. memory is 7.1 GB. [2019-10-07 03:43:44,367 INFO L168 Benchmark]: CDTParser took 1.39 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 03:43:44,370 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1948.90 ms. Allocated memory was 139.5 MB in the beginning and 239.1 MB in the end (delta: 99.6 MB). Free memory was 94.4 MB in the beginning and 122.8 MB in the end (delta: -28.5 MB). Peak memory consumption was 78.5 MB. Max. memory is 7.1 GB. [2019-10-07 03:43:44,371 INFO L168 Benchmark]: Boogie Preprocessor took 255.27 ms. Allocated memory is still 239.1 MB. Free memory was 122.8 MB in the beginning and 102.2 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-10-07 03:43:44,372 INFO L168 Benchmark]: RCFGBuilder took 106173.16 ms. Allocated memory was 239.1 MB in the beginning and 820.5 MB in the end (delta: 581.4 MB). Free memory was 102.2 MB in the beginning and 438.4 MB in the end (delta: -336.1 MB). Peak memory consumption was 586.1 MB. Max. memory is 7.1 GB. [2019-10-07 03:43:44,373 INFO L168 Benchmark]: TraceAbstraction took 40106.78 ms. Allocated memory was 820.5 MB in the beginning and 1.3 GB in the end (delta: 462.9 MB). Free memory was 438.4 MB in the beginning and 897.1 MB in the end (delta: -458.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 7.1 GB. [2019-10-07 03:43:44,381 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.39 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1948.90 ms. Allocated memory was 139.5 MB in the beginning and 239.1 MB in the end (delta: 99.6 MB). Free memory was 94.4 MB in the beginning and 122.8 MB in the end (delta: -28.5 MB). Peak memory consumption was 78.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 255.27 ms. Allocated memory is still 239.1 MB. Free memory was 122.8 MB in the beginning and 102.2 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 106173.16 ms. Allocated memory was 239.1 MB in the beginning and 820.5 MB in the end (delta: 581.4 MB). Free memory was 102.2 MB in the beginning and 438.4 MB in the end (delta: -336.1 MB). Peak memory consumption was 586.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 40106.78 ms. Allocated memory was 820.5 MB in the beginning and 1.3 GB in the end (delta: 462.9 MB). Free memory was 438.4 MB in the beginning and 897.1 MB in the end (delta: -458.8 MB). Peak memory consumption was 4.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...