java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label39.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:58:56,980 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:58:56,983 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:58:56,998 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:58:56,998 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:58:56,999 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:58:57,000 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:58:57,002 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:58:57,004 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:58:57,005 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:58:57,006 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:58:57,007 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:58:57,008 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:58:57,009 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:58:57,010 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:58:57,011 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:58:57,012 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:58:57,013 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:58:57,015 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:58:57,017 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:58:57,019 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:58:57,021 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:58:57,022 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:58:57,023 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:58:57,026 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:58:57,026 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:58:57,029 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:58:57,030 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:58:57,030 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:58:57,033 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:58:57,034 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:58:57,035 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:58:57,037 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:58:57,038 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:58:57,041 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:58:57,041 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:58:57,042 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:58:57,042 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:58:57,043 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:58:57,045 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:58:57,048 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:58:57,049 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 00:58:57,064 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:58:57,064 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:58:57,065 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:58:57,065 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:58:57,066 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:58:57,066 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:58:57,066 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:58:57,066 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:58:57,067 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:58:57,067 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:58:57,067 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:58:57,067 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:58:57,067 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:58:57,068 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:58:57,068 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:58:57,068 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:58:57,068 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:58:57,068 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:58:57,069 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:58:57,069 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:58:57,069 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:58:57,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:58:57,069 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:58:57,070 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:58:57,070 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:58:57,070 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:58:57,070 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:58:57,070 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:58:57,071 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 00:58:57,370 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:58:57,384 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:58:57,388 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:58:57,390 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:58:57,390 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:58:57,391 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label39.c [2019-10-07 00:58:57,462 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/159607583/b27a9f2e62b4428e96b177f5fc213351/FLAGa88a9aea1 [2019-10-07 00:58:58,160 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:58:58,160 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label39.c [2019-10-07 00:58:58,182 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/159607583/b27a9f2e62b4428e96b177f5fc213351/FLAGa88a9aea1 [2019-10-07 00:58:58,290 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/159607583/b27a9f2e62b4428e96b177f5fc213351 [2019-10-07 00:58:58,300 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:58:58,302 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:58:58,303 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:58:58,303 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:58:58,307 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:58:58,308 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:58:58" (1/1) ... [2019-10-07 00:58:58,310 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2330e191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:58, skipping insertion in model container [2019-10-07 00:58:58,311 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:58:58" (1/1) ... [2019-10-07 00:58:58,318 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:58:58,397 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:58:59,143 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:58:59,149 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:58:59,661 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:58:59,689 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:58:59,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:59 WrapperNode [2019-10-07 00:58:59,690 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:58:59,691 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:58:59,692 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:58:59,692 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:58:59,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:59" (1/1) ... [2019-10-07 00:58:59,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:59" (1/1) ... [2019-10-07 00:58:59,746 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:59" (1/1) ... [2019-10-07 00:58:59,747 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:59" (1/1) ... [2019-10-07 00:58:59,813 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:59" (1/1) ... [2019-10-07 00:58:59,845 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:59" (1/1) ... [2019-10-07 00:58:59,855 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:59" (1/1) ... [2019-10-07 00:58:59,874 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:58:59,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:58:59,875 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:58:59,875 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:58:59,877 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:58:59,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:58:59,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:58:59,941 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-07 00:58:59,941 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:58:59,941 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-07 00:58:59,941 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:58:59,942 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 00:58:59,942 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 00:58:59,942 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:58:59,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:58:59,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:59:03,113 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:59:03,113 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 00:59:03,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:59:03 BoogieIcfgContainer [2019-10-07 00:59:03,118 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:59:03,119 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:59:03,121 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:59:03,124 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:59:03,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:58:58" (1/3) ... [2019-10-07 00:59:03,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@763b7584 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:59:03, skipping insertion in model container [2019-10-07 00:59:03,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:59" (2/3) ... [2019-10-07 00:59:03,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@763b7584 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:59:03, skipping insertion in model container [2019-10-07 00:59:03,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:59:03" (3/3) ... [2019-10-07 00:59:03,128 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label39.c [2019-10-07 00:59:03,139 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:59:03,148 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:59:03,159 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:59:03,188 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:59:03,189 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:59:03,189 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:59:03,189 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:59:03,189 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:59:03,189 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:59:03,189 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:59:03,190 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:59:03,213 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states. [2019-10-07 00:59:03,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-07 00:59:03,227 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:59:03,229 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:59:03,231 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:59:03,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:59:03,237 INFO L82 PathProgramCache]: Analyzing trace with hash 136464678, now seen corresponding path program 1 times [2019-10-07 00:59:03,246 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:59:03,246 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:03,247 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:03,247 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:03,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:59:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:03,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:59:03,945 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:03,946 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:59:03,946 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:59:03,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:59:03,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:59:03,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:59:03,973 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 3 states. [2019-10-07 00:59:05,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:59:05,083 INFO L93 Difference]: Finished difference Result 462 states and 886 transitions. [2019-10-07 00:59:05,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:59:05,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-10-07 00:59:05,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:59:05,119 INFO L225 Difference]: With dead ends: 462 [2019-10-07 00:59:05,119 INFO L226 Difference]: Without dead ends: 301 [2019-10-07 00:59:05,128 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:59:05,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-10-07 00:59:05,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2019-10-07 00:59:05,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-10-07 00:59:05,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 569 transitions. [2019-10-07 00:59:05,215 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 569 transitions. Word has length 149 [2019-10-07 00:59:05,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:59:05,216 INFO L462 AbstractCegarLoop]: Abstraction has 301 states and 569 transitions. [2019-10-07 00:59:05,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:59:05,217 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 569 transitions. [2019-10-07 00:59:05,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-07 00:59:05,223 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:59:05,224 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:59:05,224 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:59:05,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:59:05,225 INFO L82 PathProgramCache]: Analyzing trace with hash 111442247, now seen corresponding path program 1 times [2019-10-07 00:59:05,225 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:59:05,225 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:05,225 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:05,226 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:05,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:59:05,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:05,434 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:59:05,435 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:05,435 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:59:05,435 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 00:59:05,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 00:59:05,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 00:59:05,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 00:59:05,439 INFO L87 Difference]: Start difference. First operand 301 states and 569 transitions. Second operand 5 states. [2019-10-07 00:59:06,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:59:06,884 INFO L93 Difference]: Finished difference Result 917 states and 1763 transitions. [2019-10-07 00:59:06,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 00:59:06,889 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-10-07 00:59:06,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:59:06,897 INFO L225 Difference]: With dead ends: 917 [2019-10-07 00:59:06,897 INFO L226 Difference]: Without dead ends: 621 [2019-10-07 00:59:06,901 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 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 00:59:06,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-10-07 00:59:06,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 603. [2019-10-07 00:59:06,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-10-07 00:59:06,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 1088 transitions. [2019-10-07 00:59:06,967 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 1088 transitions. Word has length 157 [2019-10-07 00:59:06,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:59:06,968 INFO L462 AbstractCegarLoop]: Abstraction has 603 states and 1088 transitions. [2019-10-07 00:59:06,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 00:59:06,968 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1088 transitions. [2019-10-07 00:59:06,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-07 00:59:06,975 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:59:06,976 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:59:06,976 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:59:06,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:59:06,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1532437230, now seen corresponding path program 1 times [2019-10-07 00:59:06,977 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:59:06,977 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:06,977 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:06,977 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:06,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:59:07,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:07,335 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:59:07,335 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:07,336 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:59:07,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:59:07,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:07,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 834 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-07 00:59:07,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:59:07,731 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:59:07,732 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:59:07,937 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:59:07,938 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 00:59:07,938 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 8 [2019-10-07 00:59:07,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:59:07,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:59:07,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-10-07 00:59:07,944 INFO L87 Difference]: Start difference. First operand 603 states and 1088 transitions. Second operand 3 states. [2019-10-07 00:59:08,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:59:08,936 INFO L93 Difference]: Finished difference Result 1797 states and 3308 transitions. [2019-10-07 00:59:08,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:59:08,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-10-07 00:59:08,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:59:08,950 INFO L225 Difference]: With dead ends: 1797 [2019-10-07 00:59:08,956 INFO L226 Difference]: Without dead ends: 1199 [2019-10-07 00:59:08,960 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 323 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-10-07 00:59:08,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2019-10-07 00:59:09,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 1199. [2019-10-07 00:59:09,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1199 states. [2019-10-07 00:59:09,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1885 transitions. [2019-10-07 00:59:09,022 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1885 transitions. Word has length 161 [2019-10-07 00:59:09,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:59:09,023 INFO L462 AbstractCegarLoop]: Abstraction has 1199 states and 1885 transitions. [2019-10-07 00:59:09,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:59:09,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1885 transitions. [2019-10-07 00:59:09,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-07 00:59:09,031 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:59:09,032 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:59:09,239 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:59:09,239 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:59:09,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:59:09,240 INFO L82 PathProgramCache]: Analyzing trace with hash -660053814, now seen corresponding path program 1 times [2019-10-07 00:59:09,240 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:59:09,240 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:09,240 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:09,240 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:09,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:59:09,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:09,414 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:59:09,414 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:09,414 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:59:09,415 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 00:59:09,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 00:59:09,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 00:59:09,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-10-07 00:59:09,416 INFO L87 Difference]: Start difference. First operand 1199 states and 1885 transitions. Second operand 7 states. [2019-10-07 00:59:11,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:59:11,066 INFO L93 Difference]: Finished difference Result 3779 states and 6973 transitions. [2019-10-07 00:59:11,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-07 00:59:11,067 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 165 [2019-10-07 00:59:11,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:59:11,094 INFO L225 Difference]: With dead ends: 3779 [2019-10-07 00:59:11,094 INFO L226 Difference]: Without dead ends: 2585 [2019-10-07 00:59:11,100 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-07 00:59:11,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2585 states. [2019-10-07 00:59:11,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2585 to 2445. [2019-10-07 00:59:11,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2445 states. [2019-10-07 00:59:11,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2445 states to 2445 states and 3963 transitions. [2019-10-07 00:59:11,252 INFO L78 Accepts]: Start accepts. Automaton has 2445 states and 3963 transitions. Word has length 165 [2019-10-07 00:59:11,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:59:11,252 INFO L462 AbstractCegarLoop]: Abstraction has 2445 states and 3963 transitions. [2019-10-07 00:59:11,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 00:59:11,253 INFO L276 IsEmpty]: Start isEmpty. Operand 2445 states and 3963 transitions. [2019-10-07 00:59:11,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-07 00:59:11,261 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:59:11,262 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:59:11,262 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:59:11,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:59:11,263 INFO L82 PathProgramCache]: Analyzing trace with hash 568602441, now seen corresponding path program 1 times [2019-10-07 00:59:11,263 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:59:11,263 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:11,263 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:11,264 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:11,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:59:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:11,403 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:59:11,403 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:11,404 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:59:11,404 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 00:59:11,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 00:59:11,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 00:59:11,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 00:59:11,407 INFO L87 Difference]: Start difference. First operand 2445 states and 3963 transitions. Second operand 6 states. [2019-10-07 00:59:12,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:59:12,779 INFO L93 Difference]: Finished difference Result 7385 states and 12817 transitions. [2019-10-07 00:59:12,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 00:59:12,779 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 171 [2019-10-07 00:59:12,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:59:12,814 INFO L225 Difference]: With dead ends: 7385 [2019-10-07 00:59:12,814 INFO L226 Difference]: Without dead ends: 4945 [2019-10-07 00:59:12,823 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-07 00:59:12,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4945 states. [2019-10-07 00:59:12,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4945 to 4859. [2019-10-07 00:59:12,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4859 states. [2019-10-07 00:59:13,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4859 states to 4859 states and 7646 transitions. [2019-10-07 00:59:13,001 INFO L78 Accepts]: Start accepts. Automaton has 4859 states and 7646 transitions. Word has length 171 [2019-10-07 00:59:13,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:59:13,001 INFO L462 AbstractCegarLoop]: Abstraction has 4859 states and 7646 transitions. [2019-10-07 00:59:13,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 00:59:13,001 INFO L276 IsEmpty]: Start isEmpty. Operand 4859 states and 7646 transitions. [2019-10-07 00:59:13,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-07 00:59:13,015 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:59:13,016 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:59:13,016 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:59:13,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:59:13,017 INFO L82 PathProgramCache]: Analyzing trace with hash -693908939, now seen corresponding path program 1 times [2019-10-07 00:59:13,017 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:59:13,017 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:13,017 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:13,017 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:13,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:59:13,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:13,140 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 38 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:59:13,140 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:13,140 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:59:13,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:59:13,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:13,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 997 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-07 00:59:13,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:59:13,385 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-07 00:59:13,386 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:59:13,457 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 00:59:13,458 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 00:59:13,458 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 10 [2019-10-07 00:59:13,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 00:59:13,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 00:59:13,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-07 00:59:13,460 INFO L87 Difference]: Start difference. First operand 4859 states and 7646 transitions. Second operand 5 states. [2019-10-07 00:59:14,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:59:14,965 INFO L93 Difference]: Finished difference Result 14024 states and 23694 transitions. [2019-10-07 00:59:14,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 00:59:14,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 183 [2019-10-07 00:59:14,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:59:15,035 INFO L225 Difference]: With dead ends: 14024 [2019-10-07 00:59:15,036 INFO L226 Difference]: Without dead ends: 9170 [2019-10-07 00:59:15,058 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-07 00:59:15,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9170 states. [2019-10-07 00:59:15,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9170 to 9028. [2019-10-07 00:59:15,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9028 states. [2019-10-07 00:59:15,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9028 states to 9028 states and 14422 transitions. [2019-10-07 00:59:15,539 INFO L78 Accepts]: Start accepts. Automaton has 9028 states and 14422 transitions. Word has length 183 [2019-10-07 00:59:15,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:59:15,543 INFO L462 AbstractCegarLoop]: Abstraction has 9028 states and 14422 transitions. [2019-10-07 00:59:15,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 00:59:15,545 INFO L276 IsEmpty]: Start isEmpty. Operand 9028 states and 14422 transitions. [2019-10-07 00:59:15,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-07 00:59:15,580 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:59:15,581 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:59:15,786 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:59:15,787 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:59:15,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:59:15,787 INFO L82 PathProgramCache]: Analyzing trace with hash -865907640, now seen corresponding path program 1 times [2019-10-07 00:59:15,787 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:59:15,788 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:15,788 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:15,788 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:15,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:59:15,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:15,931 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:59:15,932 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:15,932 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:59:15,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:59:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:16,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 1001 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-07 00:59:16,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:59:16,276 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:59:16,276 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:59:16,338 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:59:16,339 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:59:16,388 INFO L162 IcfgInterpreter]: Started Sifa with 153 locations of interest [2019-10-07 00:59:16,389 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:59:16,396 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:59:16,405 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:59:16,405 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:59:17,305 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 206 for LOIs [2019-10-07 00:59:17,680 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 298 [2019-10-07 00:59:17,951 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 304 [2019-10-07 00:59:19,049 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:59:19,050 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: ε 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: ε at de.uni_freiburg.informatik.ultimate.lib.sifa.PriorityWorklist.add(PriorityWorklist.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.lambda$2(DagInterpreter.java:135) at java.lang.Iterable.forEach(Iterable.java:75) at java.util.Collections$UnmodifiableCollection.forEach(Collections.java:1080) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:135) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:104) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.computeTopSummary(TopInputCallSummarizer.java:78) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:67) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:230) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:214) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:197) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:166) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:287) ... 21 more [2019-10-07 00:59:19,056 INFO L168 Benchmark]: Toolchain (without parser) took 20754.03 ms. Allocated memory was 143.7 MB in the beginning and 691.5 MB in the end (delta: 547.9 MB). Free memory was 96.7 MB in the beginning and 128.3 MB in the end (delta: -31.6 MB). Peak memory consumption was 516.2 MB. Max. memory is 7.1 GB. [2019-10-07 00:59:19,057 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 143.7 MB. Free memory was 120.1 MB in the beginning and 119.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 00:59:19,058 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1387.41 ms. Allocated memory was 143.7 MB in the beginning and 273.2 MB in the end (delta: 129.5 MB). Free memory was 96.5 MB in the beginning and 238.8 MB in the end (delta: -142.3 MB). Peak memory consumption was 53.9 MB. Max. memory is 7.1 GB. [2019-10-07 00:59:19,059 INFO L168 Benchmark]: Boogie Preprocessor took 183.18 ms. Allocated memory is still 273.2 MB. Free memory was 238.8 MB in the beginning and 227.7 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2019-10-07 00:59:19,060 INFO L168 Benchmark]: RCFGBuilder took 3242.97 ms. Allocated memory was 273.2 MB in the beginning and 349.7 MB in the end (delta: 76.5 MB). Free memory was 227.7 MB in the beginning and 176.5 MB in the end (delta: 51.2 MB). Peak memory consumption was 144.8 MB. Max. memory is 7.1 GB. [2019-10-07 00:59:19,061 INFO L168 Benchmark]: TraceAbstraction took 15935.05 ms. Allocated memory was 349.7 MB in the beginning and 691.5 MB in the end (delta: 341.8 MB). Free memory was 173.0 MB in the beginning and 128.3 MB in the end (delta: 44.7 MB). Peak memory consumption was 386.5 MB. Max. memory is 7.1 GB. [2019-10-07 00:59:19,071 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.25 ms. Allocated memory is still 143.7 MB. Free memory was 120.1 MB in the beginning and 119.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1387.41 ms. Allocated memory was 143.7 MB in the beginning and 273.2 MB in the end (delta: 129.5 MB). Free memory was 96.5 MB in the beginning and 238.8 MB in the end (delta: -142.3 MB). Peak memory consumption was 53.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 183.18 ms. Allocated memory is still 273.2 MB. Free memory was 238.8 MB in the beginning and 227.7 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3242.97 ms. Allocated memory was 273.2 MB in the beginning and 349.7 MB in the end (delta: 76.5 MB). Free memory was 227.7 MB in the beginning and 176.5 MB in the end (delta: 51.2 MB). Peak memory consumption was 144.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15935.05 ms. Allocated memory was 349.7 MB in the beginning and 691.5 MB in the end (delta: 341.8 MB). Free memory was 173.0 MB in the beginning and 128.3 MB in the end (delta: 44.7 MB). Peak memory consumption was 386.5 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: ε de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε: 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...