java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/eca-rers2012/Problem15_label49.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 03:30:33,543 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 03:30:33,545 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 03:30:33,561 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 03:30:33,561 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 03:30:33,562 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 03:30:33,564 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 03:30:33,565 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 03:30:33,567 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 03:30:33,568 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 03:30:33,569 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 03:30:33,570 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 03:30:33,571 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 03:30:33,572 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 03:30:33,573 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 03:30:33,574 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 03:30:33,575 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 03:30:33,575 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 03:30:33,577 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 03:30:33,579 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 03:30:33,581 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 03:30:33,582 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 03:30:33,583 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 03:30:33,584 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 03:30:33,586 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 03:30:33,586 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 03:30:33,587 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 03:30:33,588 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 03:30:33,588 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 03:30:33,589 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 03:30:33,589 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 03:30:33,591 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 03:30:33,592 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 03:30:33,593 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 03:30:33,594 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 03:30:33,595 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 03:30:33,596 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 03:30:33,596 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 03:30:33,596 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 03:30:33,597 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 03:30:33,598 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 03:30:33,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:30:33,620 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 03:30:33,621 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 03:30:33,622 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 03:30:33,623 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 03:30:33,623 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 03:30:33,623 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 03:30:33,623 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 03:30:33,623 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 03:30:33,624 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 03:30:33,624 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 03:30:33,625 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 03:30:33,625 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 03:30:33,625 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 03:30:33,626 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 03:30:33,626 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 03:30:33,626 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 03:30:33,626 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 03:30:33,627 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 03:30:33,627 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 03:30:33,627 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 03:30:33,627 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 03:30:33,628 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 03:30:33,628 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 03:30:33,628 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 03:30:33,628 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 03:30:33,628 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 03:30:33,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 03:30:33,629 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 03:30:33,629 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 03:30:33,915 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 03:30:33,932 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 03:30:33,936 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 03:30:33,937 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 03:30:33,938 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 03:30:33,938 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label49.c [2019-10-07 03:30:34,016 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ece6df00/8be3e48928b04c27af0e1e0e6679cf89/FLAG00a3970a0 [2019-10-07 03:30:34,681 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 03:30:34,682 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label49.c [2019-10-07 03:30:34,700 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ece6df00/8be3e48928b04c27af0e1e0e6679cf89/FLAG00a3970a0 [2019-10-07 03:30:34,896 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ece6df00/8be3e48928b04c27af0e1e0e6679cf89 [2019-10-07 03:30:34,905 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 03:30:34,907 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 03:30:34,908 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 03:30:34,908 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 03:30:34,912 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 03:30:34,913 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:30:34" (1/1) ... [2019-10-07 03:30:34,916 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:30:34, skipping insertion in model container [2019-10-07 03:30:34,916 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:30:34" (1/1) ... [2019-10-07 03:30:34,923 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 03:30:35,010 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 03:30:36,014 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:30:36,024 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 03:30:36,394 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:30:36,415 INFO L192 MainTranslator]: Completed translation [2019-10-07 03:30:36,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:30:36 WrapperNode [2019-10-07 03:30:36,416 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 03:30:36,417 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 03:30:36,417 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 03:30:36,417 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 03:30:36,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:30:36" (1/1) ... [2019-10-07 03:30:36,433 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:30:36" (1/1) ... [2019-10-07 03:30:36,481 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:30:36" (1/1) ... [2019-10-07 03:30:36,481 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:30:36" (1/1) ... [2019-10-07 03:30:36,537 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:30:36" (1/1) ... [2019-10-07 03:30:36,555 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:30:36" (1/1) ... [2019-10-07 03:30:36,574 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:30:36" (1/1) ... [2019-10-07 03:30:36,599 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 03:30:36,600 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 03:30:36,600 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 03:30:36,600 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 03:30:36,602 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:30:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 03:30:36,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 03:30:36,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 03:30:36,669 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-07 03:30:36,669 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-10-07 03:30:36,669 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 03:30:36,670 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-07 03:30:36,670 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-10-07 03:30:36,670 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 03:30:36,670 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 03:30:36,670 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 03:30:36,671 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 03:30:36,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 03:30:36,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 03:30:45,758 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 03:30:45,759 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 03:30:45,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:30:45 BoogieIcfgContainer [2019-10-07 03:30:45,761 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 03:30:45,762 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 03:30:45,762 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 03:30:45,767 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 03:30:45,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 03:30:34" (1/3) ... [2019-10-07 03:30:45,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d7f92a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:30:45, skipping insertion in model container [2019-10-07 03:30:45,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:30:36" (2/3) ... [2019-10-07 03:30:45,769 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d7f92a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:30:45, skipping insertion in model container [2019-10-07 03:30:45,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:30:45" (3/3) ... [2019-10-07 03:30:45,774 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label49.c [2019-10-07 03:30:45,782 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 03:30:45,791 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 03:30:45,802 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 03:30:45,837 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 03:30:45,837 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 03:30:45,837 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 03:30:45,838 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 03:30:45,838 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 03:30:45,838 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 03:30:45,838 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 03:30:45,838 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 03:30:45,865 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states. [2019-10-07 03:30:45,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-07 03:30:45,870 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:30:45,871 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:30:45,872 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:30:45,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:30:45,877 INFO L82 PathProgramCache]: Analyzing trace with hash 648052589, now seen corresponding path program 1 times [2019-10-07 03:30:45,885 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:30:45,885 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:30:45,886 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:30:45,886 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:30:45,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:30:46,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:30:46,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:30:46,135 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:30:46,137 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:30:46,137 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 03:30:46,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 03:30:46,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 03:30:46,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 03:30:46,160 INFO L87 Difference]: Start difference. First operand 244 states. Second operand 4 states. [2019-10-07 03:30:50,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:30:50,034 INFO L93 Difference]: Finished difference Result 953 states and 1852 transitions. [2019-10-07 03:30:50,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 03:30:50,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-07 03:30:50,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:30:50,060 INFO L225 Difference]: With dead ends: 953 [2019-10-07 03:30:50,060 INFO L226 Difference]: Without dead ends: 702 [2019-10-07 03:30:50,071 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 03:30:50,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2019-10-07 03:30:50,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 469. [2019-10-07 03:30:50,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2019-10-07 03:30:50,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 824 transitions. [2019-10-07 03:30:50,157 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 824 transitions. Word has length 11 [2019-10-07 03:30:50,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:30:50,158 INFO L462 AbstractCegarLoop]: Abstraction has 469 states and 824 transitions. [2019-10-07 03:30:50,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 03:30:50,158 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 824 transitions. [2019-10-07 03:30:50,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-07 03:30:50,160 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:30:50,161 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:30:50,161 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:30:50,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:30:50,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1767039151, now seen corresponding path program 1 times [2019-10-07 03:30:50,162 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:30:50,162 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:30:50,162 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:30:50,162 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:30:50,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:30:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:30:50,328 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:30:50,328 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:30:50,328 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:30:50,329 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 03:30:50,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 03:30:50,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 03:30:50,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 03:30:50,331 INFO L87 Difference]: Start difference. First operand 469 states and 824 transitions. Second operand 6 states. [2019-10-07 03:30:53,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:30:53,346 INFO L93 Difference]: Finished difference Result 1415 states and 2520 transitions. [2019-10-07 03:30:53,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 03:30:53,346 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-10-07 03:30:53,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:30:53,356 INFO L225 Difference]: With dead ends: 1415 [2019-10-07 03:30:53,356 INFO L226 Difference]: Without dead ends: 951 [2019-10-07 03:30:53,358 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-07 03:30:53,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2019-10-07 03:30:53,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 919. [2019-10-07 03:30:53,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2019-10-07 03:30:53,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1578 transitions. [2019-10-07 03:30:53,420 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1578 transitions. Word has length 23 [2019-10-07 03:30:53,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:30:53,421 INFO L462 AbstractCegarLoop]: Abstraction has 919 states and 1578 transitions. [2019-10-07 03:30:53,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 03:30:53,421 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1578 transitions. [2019-10-07 03:30:53,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-07 03:30:53,422 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:30:53,422 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:30:53,422 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:30:53,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:30:53,423 INFO L82 PathProgramCache]: Analyzing trace with hash 890756068, now seen corresponding path program 1 times [2019-10-07 03:30:53,423 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:30:53,423 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:30:53,423 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:30:53,424 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:30:53,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:30:53,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:30:53,520 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:30:53,521 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:30:53,521 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:30:53,521 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 03:30:53,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 03:30:53,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 03:30:53,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 03:30:53,523 INFO L87 Difference]: Start difference. First operand 919 states and 1578 transitions. Second operand 5 states. [2019-10-07 03:30:56,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:30:56,942 INFO L93 Difference]: Finished difference Result 2785 states and 4883 transitions. [2019-10-07 03:30:56,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 03:30:56,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-10-07 03:30:56,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:30:56,956 INFO L225 Difference]: With dead ends: 2785 [2019-10-07 03:30:56,956 INFO L226 Difference]: Without dead ends: 1871 [2019-10-07 03:30:56,960 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-07 03:30:56,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2019-10-07 03:30:57,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1396. [2019-10-07 03:30:57,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1396 states. [2019-10-07 03:30:57,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 2170 transitions. [2019-10-07 03:30:57,017 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 2170 transitions. Word has length 24 [2019-10-07 03:30:57,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:30:57,017 INFO L462 AbstractCegarLoop]: Abstraction has 1396 states and 2170 transitions. [2019-10-07 03:30:57,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 03:30:57,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 2170 transitions. [2019-10-07 03:30:57,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-07 03:30:57,019 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:30:57,019 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:30:57,019 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:30:57,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:30:57,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1484903724, now seen corresponding path program 1 times [2019-10-07 03:30:57,020 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:30:57,020 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:30:57,020 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:30:57,020 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:30:57,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:30:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:30:57,102 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:30:57,103 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:30:57,103 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:30:57,103 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 03:30:57,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 03:30:57,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 03:30:57,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 03:30:57,104 INFO L87 Difference]: Start difference. First operand 1396 states and 2170 transitions. Second operand 4 states. [2019-10-07 03:31:03,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:31:03,503 INFO L93 Difference]: Finished difference Result 5093 states and 8037 transitions. [2019-10-07 03:31:03,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 03:31:03,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-10-07 03:31:03,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:31:03,524 INFO L225 Difference]: With dead ends: 5093 [2019-10-07 03:31:03,524 INFO L226 Difference]: Without dead ends: 3702 [2019-10-07 03:31:03,529 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 03:31:03,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3702 states. [2019-10-07 03:31:03,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3702 to 3403. [2019-10-07 03:31:03,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3403 states. [2019-10-07 03:31:03,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3403 states to 3403 states and 5069 transitions. [2019-10-07 03:31:03,641 INFO L78 Accepts]: Start accepts. Automaton has 3403 states and 5069 transitions. Word has length 32 [2019-10-07 03:31:03,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:31:03,641 INFO L462 AbstractCegarLoop]: Abstraction has 3403 states and 5069 transitions. [2019-10-07 03:31:03,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 03:31:03,642 INFO L276 IsEmpty]: Start isEmpty. Operand 3403 states and 5069 transitions. [2019-10-07 03:31:03,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-07 03:31:03,643 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:31:03,643 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] [2019-10-07 03:31:03,643 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:31:03,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:31:03,644 INFO L82 PathProgramCache]: Analyzing trace with hash -2006236862, now seen corresponding path program 1 times [2019-10-07 03:31:03,644 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:31:03,644 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:31:03,645 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:31:03,645 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:31:03,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:31:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:31:03,758 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:31:03,759 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:31:03,759 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:31:03,760 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 03:31:03,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 03:31:03,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 03:31:03,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 03:31:03,761 INFO L87 Difference]: Start difference. First operand 3403 states and 5069 transitions. Second operand 6 states. [2019-10-07 03:31:06,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:31:06,691 INFO L93 Difference]: Finished difference Result 7549 states and 11615 transitions. [2019-10-07 03:31:06,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 03:31:06,695 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-10-07 03:31:06,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:31:06,719 INFO L225 Difference]: With dead ends: 7549 [2019-10-07 03:31:06,720 INFO L226 Difference]: Without dead ends: 4151 [2019-10-07 03:31:06,732 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-07 03:31:06,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4151 states. [2019-10-07 03:31:06,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4151 to 4143. [2019-10-07 03:31:06,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4143 states. [2019-10-07 03:31:06,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4143 states to 4143 states and 6205 transitions. [2019-10-07 03:31:06,891 INFO L78 Accepts]: Start accepts. Automaton has 4143 states and 6205 transitions. Word has length 36 [2019-10-07 03:31:06,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:31:06,892 INFO L462 AbstractCegarLoop]: Abstraction has 4143 states and 6205 transitions. [2019-10-07 03:31:06,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 03:31:06,893 INFO L276 IsEmpty]: Start isEmpty. Operand 4143 states and 6205 transitions. [2019-10-07 03:31:06,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-07 03:31:06,977 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:31:06,977 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-07 03:31:06,978 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:31:06,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:31:06,978 INFO L82 PathProgramCache]: Analyzing trace with hash -288591147, now seen corresponding path program 1 times [2019-10-07 03:31:06,979 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:31:06,979 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:31:06,979 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:31:06,980 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:31:06,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:31:07,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:31:07,137 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-07 03:31:07,138 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:31:07,138 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:31:07,138 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 03:31:07,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 03:31:07,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 03:31:07,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 03:31:07,140 INFO L87 Difference]: Start difference. First operand 4143 states and 6205 transitions. Second operand 4 states. [2019-10-07 03:31:11,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:31:11,447 INFO L93 Difference]: Finished difference Result 14163 states and 21642 transitions. [2019-10-07 03:31:11,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 03:31:11,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-10-07 03:31:11,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:31:11,501 INFO L225 Difference]: With dead ends: 14163 [2019-10-07 03:31:11,501 INFO L226 Difference]: Without dead ends: 10025 [2019-10-07 03:31:11,516 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 03:31:11,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10025 states. [2019-10-07 03:31:11,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10025 to 8800. [2019-10-07 03:31:11,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8800 states. [2019-10-07 03:31:11,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8800 states to 8800 states and 12965 transitions. [2019-10-07 03:31:11,800 INFO L78 Accepts]: Start accepts. Automaton has 8800 states and 12965 transitions. Word has length 49 [2019-10-07 03:31:11,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:31:11,801 INFO L462 AbstractCegarLoop]: Abstraction has 8800 states and 12965 transitions. [2019-10-07 03:31:11,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 03:31:11,802 INFO L276 IsEmpty]: Start isEmpty. Operand 8800 states and 12965 transitions. [2019-10-07 03:31:11,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-07 03:31:11,812 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:31:11,815 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:31:11,816 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:31:11,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:31:11,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1617686098, now seen corresponding path program 1 times [2019-10-07 03:31:11,816 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:31:11,817 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:31:11,817 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:31:11,817 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:31:11,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:31:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:31:12,084 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:31:12,086 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:31:12,087 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:31:12,087 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:31:12,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:31:12,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-07 03:31:12,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:31:12,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 03:31:12,457 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 03:31:12,457 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:31:12,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:31:12,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:31:12,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:31:12,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:31:12,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:31:12,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:31:12,760 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 03:31:12,760 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 03:31:12,761 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 5] total 13 [2019-10-07 03:31:12,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 03:31:12,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 03:31:12,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-10-07 03:31:12,762 INFO L87 Difference]: Start difference. First operand 8800 states and 12965 transitions. Second operand 5 states. [2019-10-07 03:31:15,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:31:15,960 INFO L93 Difference]: Finished difference Result 18099 states and 26808 transitions. [2019-10-07 03:31:15,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 03:31:15,960 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-10-07 03:31:15,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:31:16,012 INFO L225 Difference]: With dead ends: 18099 [2019-10-07 03:31:16,012 INFO L226 Difference]: Without dead ends: 9304 [2019-10-07 03:31:16,038 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-10-07 03:31:16,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9304 states. [2019-10-07 03:31:16,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9304 to 9069. [2019-10-07 03:31:16,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9069 states. [2019-10-07 03:31:16,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9069 states to 9069 states and 13480 transitions. [2019-10-07 03:31:16,446 INFO L78 Accepts]: Start accepts. Automaton has 9069 states and 13480 transitions. Word has length 79 [2019-10-07 03:31:16,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:31:16,446 INFO L462 AbstractCegarLoop]: Abstraction has 9069 states and 13480 transitions. [2019-10-07 03:31:16,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 03:31:16,447 INFO L276 IsEmpty]: Start isEmpty. Operand 9069 states and 13480 transitions. [2019-10-07 03:31:16,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-07 03:31:16,450 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:31:16,451 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:31:16,657 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:31:16,657 INFO L410 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:31:16,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:31:16,658 INFO L82 PathProgramCache]: Analyzing trace with hash 262964752, now seen corresponding path program 1 times [2019-10-07 03:31:16,658 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:31:16,659 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:31:16,659 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:31:16,659 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:31:16,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:31:16,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:31:17,256 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 34 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:31:17,256 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:31:17,256 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:31:17,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:31:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:31:17,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-07 03:31:17,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:31:17,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-07 03:31:17,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-07 03:31:17,556 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 73 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 03:31:17,556 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:31:17,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:31:17,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-07 03:31:17,846 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 23 proven. 66 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 03:31:17,847 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 03:31:17,889 INFO L162 IcfgInterpreter]: Started Sifa with 54 locations of interest [2019-10-07 03:31:17,889 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 03:31:17,898 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 03:31:17,917 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 03:31:17,918 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 03:31:18,115 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 56 for LOIs [2019-10-07 03:31:18,261 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 46 [2019-10-07 03:31:18,909 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 7277 conjuctions. This might take some time... [2019-10-07 03:31:19,061 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 46 [2019-10-07 03:31:19,306 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 7277 conjuctions. This might take some time... [2019-10-07 03:31:19,379 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2019-10-07 03:31:19,454 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2019-10-07 03:31:20,964 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:31:20,965 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: assume true; at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:133) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: assume true; at de.uni_freiburg.informatik.ultimate.lib.sifa.PriorityWorklist.add(PriorityWorklist.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.lambda$2(DagInterpreter.java:135) at java.lang.Iterable.forEach(Iterable.java:75) at java.util.Collections$UnmodifiableCollection.forEach(Collections.java:1080) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:135) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:104) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.computeTopSummary(TopInputCallSummarizer.java:78) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:67) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:230) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:214) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:197) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:166) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:104) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarizeInternal(FixpointLoopSummarizer.java:118) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:178) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:169) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:287) ... 21 more [2019-10-07 03:31:20,974 INFO L168 Benchmark]: Toolchain (without parser) took 46063.74 ms. Allocated memory was 144.7 MB in the beginning and 697.3 MB in the end (delta: 552.6 MB). Free memory was 97.5 MB in the beginning and 523.4 MB in the end (delta: -425.8 MB). Peak memory consumption was 514.2 MB. Max. memory is 7.1 GB. [2019-10-07 03:31:20,977 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 144.7 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 03:31:20,980 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1508.82 ms. Allocated memory was 144.7 MB in the beginning and 204.5 MB in the end (delta: 59.8 MB). Free memory was 97.3 MB in the beginning and 107.2 MB in the end (delta: -9.8 MB). Peak memory consumption was 57.9 MB. Max. memory is 7.1 GB. [2019-10-07 03:31:20,981 INFO L168 Benchmark]: Boogie Preprocessor took 182.82 ms. Allocated memory is still 204.5 MB. Free memory was 107.2 MB in the beginning and 95.2 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 7.1 GB. [2019-10-07 03:31:20,982 INFO L168 Benchmark]: RCFGBuilder took 9160.67 ms. Allocated memory was 204.5 MB in the beginning and 306.7 MB in the end (delta: 102.2 MB). Free memory was 94.5 MB in the beginning and 251.0 MB in the end (delta: -156.5 MB). Peak memory consumption was 124.7 MB. Max. memory is 7.1 GB. [2019-10-07 03:31:20,983 INFO L168 Benchmark]: TraceAbstraction took 35206.82 ms. Allocated memory was 306.7 MB in the beginning and 697.3 MB in the end (delta: 390.6 MB). Free memory was 247.6 MB in the beginning and 523.4 MB in the end (delta: -275.8 MB). Peak memory consumption was 502.3 MB. Max. memory is 7.1 GB. [2019-10-07 03:31:20,992 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 144.7 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1508.82 ms. Allocated memory was 144.7 MB in the beginning and 204.5 MB in the end (delta: 59.8 MB). Free memory was 97.3 MB in the beginning and 107.2 MB in the end (delta: -9.8 MB). Peak memory consumption was 57.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 182.82 ms. Allocated memory is still 204.5 MB. Free memory was 107.2 MB in the beginning and 95.2 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 9160.67 ms. Allocated memory was 204.5 MB in the beginning and 306.7 MB in the end (delta: 102.2 MB). Free memory was 94.5 MB in the beginning and 251.0 MB in the end (delta: -156.5 MB). Peak memory consumption was 124.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 35206.82 ms. Allocated memory was 306.7 MB in the beginning and 697.3 MB in the end (delta: 390.6 MB). Free memory was 247.6 MB in the beginning and 523.4 MB in the end (delta: -275.8 MB). Peak memory consumption was 502.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: assume true; de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: assume true;: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...