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-f4eb214f-m [2019-10-13 21:41:52,035 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:41:52,039 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:41:52,059 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:41:52,059 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:41:52,061 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:41:52,063 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:41:52,076 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:41:52,078 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:41:52,079 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:41:52,080 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:41:52,082 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:41:52,082 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:41:52,086 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:41:52,089 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:41:52,090 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:41:52,092 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:41:52,095 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:41:52,096 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:41:52,103 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:41:52,107 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:41:52,108 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:41:52,110 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:41:52,110 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:41:52,114 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:41:52,115 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:41:52,115 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:41:52,117 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:41:52,118 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:41:52,119 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:41:52,119 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:41:52,121 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:41:52,122 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:41:52,123 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:41:52,124 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:41:52,125 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:41:52,125 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:41:52,126 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:41:52,126 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:41:52,128 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:41:52,131 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:41:52,132 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-13 21:41:52,151 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:41:52,152 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:41:52,154 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:41:52,154 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:41:52,154 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:41:52,155 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:41:52,155 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:41:52,155 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:41:52,155 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:41:52,155 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:41:52,156 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:41:52,157 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:41:52,157 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:41:52,157 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:41:52,158 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:41:52,158 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:41:52,158 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:41:52,158 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:41:52,158 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:41:52,159 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:41:52,159 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:41:52,159 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:41:52,159 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:41:52,159 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:41:52,160 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:41:52,160 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:41:52,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:41:52,160 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:41:52,160 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-13 21:41:52,488 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:41:52,502 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:41:52,505 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:41:52,507 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:41:52,507 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:41:52,508 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-13 21:41:52,581 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4bc30d8b/73cfd25fe0374c2a8c91259f8c3c077a/FLAG6e4f8a557 [2019-10-13 21:41:53,180 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:41:53,182 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label39.c [2019-10-13 21:41:53,202 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4bc30d8b/73cfd25fe0374c2a8c91259f8c3c077a/FLAG6e4f8a557 [2019-10-13 21:41:53,453 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4bc30d8b/73cfd25fe0374c2a8c91259f8c3c077a [2019-10-13 21:41:53,466 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:41:53,467 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:41:53,468 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:41:53,468 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:41:53,472 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:41:53,473 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:41:53" (1/1) ... [2019-10-13 21:41:53,475 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@343d4392 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:53, skipping insertion in model container [2019-10-13 21:41:53,476 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:41:53" (1/1) ... [2019-10-13 21:41:53,483 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:41:53,577 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:41:54,427 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:41:54,436 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:41:54,714 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:41:54,749 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:41:54,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:54 WrapperNode [2019-10-13 21:41:54,751 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:41:54,752 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:41:54,752 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:41:54,752 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:41:54,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:54" (1/1) ... [2019-10-13 21:41:54,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:54" (1/1) ... [2019-10-13 21:41:54,828 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:54" (1/1) ... [2019-10-13 21:41:54,829 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:54" (1/1) ... [2019-10-13 21:41:54,915 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:54" (1/1) ... [2019-10-13 21:41:54,947 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:54" (1/1) ... [2019-10-13 21:41:54,959 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:54" (1/1) ... [2019-10-13 21:41:54,969 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:41:54,970 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:41:54,970 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:41:54,970 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:41:54,971 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:54" (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-13 21:41:55,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:41:55,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:41:55,050 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-13 21:41:55,050 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:41:55,051 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-13 21:41:55,052 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:41:55,052 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:41:55,052 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:41:55,053 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:41:55,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:41:55,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:41:58,212 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:41:58,212 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 21:41:58,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:41:58 BoogieIcfgContainer [2019-10-13 21:41:58,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:41:58,215 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:41:58,215 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:41:58,218 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:41:58,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:41:53" (1/3) ... [2019-10-13 21:41:58,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78d463e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:41:58, skipping insertion in model container [2019-10-13 21:41:58,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:54" (2/3) ... [2019-10-13 21:41:58,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78d463e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:41:58, skipping insertion in model container [2019-10-13 21:41:58,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:41:58" (3/3) ... [2019-10-13 21:41:58,222 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label39.c [2019-10-13 21:41:58,231 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:41:58,240 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:41:58,251 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:41:58,277 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:41:58,277 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:41:58,277 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:41:58,277 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:41:58,278 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:41:58,278 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:41:58,278 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:41:58,278 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:41:58,300 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states. [2019-10-13 21:41:58,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-13 21:41:58,313 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:41:58,315 INFO L380 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-13 21:41:58,316 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:41:58,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:41:58,322 INFO L82 PathProgramCache]: Analyzing trace with hash 136464678, now seen corresponding path program 1 times [2019-10-13 21:41:58,330 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:41:58,330 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948097729] [2019-10-13 21:41:58,330 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:58,331 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:58,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:41:58,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:41:59,064 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-13 21:41:59,065 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948097729] [2019-10-13 21:41:59,067 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:41:59,067 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:41:59,068 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107068065] [2019-10-13 21:41:59,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:41:59,075 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:41:59,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:41:59,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:41:59,093 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 3 states. [2019-10-13 21:42:00,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:42:00,299 INFO L93 Difference]: Finished difference Result 462 states and 886 transitions. [2019-10-13 21:42:00,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:42:00,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-10-13 21:42:00,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:42:00,323 INFO L225 Difference]: With dead ends: 462 [2019-10-13 21:42:00,324 INFO L226 Difference]: Without dead ends: 301 [2019-10-13 21:42:00,328 INFO L600 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-13 21:42:00,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-10-13 21:42:00,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2019-10-13 21:42:00,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-10-13 21:42:00,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 569 transitions. [2019-10-13 21:42:00,403 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 569 transitions. Word has length 149 [2019-10-13 21:42:00,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:42:00,404 INFO L462 AbstractCegarLoop]: Abstraction has 301 states and 569 transitions. [2019-10-13 21:42:00,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:42:00,404 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 569 transitions. [2019-10-13 21:42:00,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-13 21:42:00,410 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:42:00,411 INFO L380 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-13 21:42:00,411 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:42:00,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:42:00,414 INFO L82 PathProgramCache]: Analyzing trace with hash 111442247, now seen corresponding path program 1 times [2019-10-13 21:42:00,414 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:42:00,414 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537304750] [2019-10-13 21:42:00,415 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:00,415 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:00,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:42:00,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:42:00,668 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-13 21:42:00,669 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537304750] [2019-10-13 21:42:00,669 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:42:00,669 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:42:00,670 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13652005] [2019-10-13 21:42:00,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:42:00,673 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:42:00,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:42:00,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:42:00,674 INFO L87 Difference]: Start difference. First operand 301 states and 569 transitions. Second operand 5 states. [2019-10-13 21:42:02,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:42:02,142 INFO L93 Difference]: Finished difference Result 917 states and 1763 transitions. [2019-10-13 21:42:02,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:42:02,146 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-10-13 21:42:02,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:42:02,153 INFO L225 Difference]: With dead ends: 917 [2019-10-13 21:42:02,154 INFO L226 Difference]: Without dead ends: 621 [2019-10-13 21:42:02,156 INFO L600 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-13 21:42:02,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-10-13 21:42:02,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 603. [2019-10-13 21:42:02,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-10-13 21:42:02,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 1088 transitions. [2019-10-13 21:42:02,215 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 1088 transitions. Word has length 157 [2019-10-13 21:42:02,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:42:02,216 INFO L462 AbstractCegarLoop]: Abstraction has 603 states and 1088 transitions. [2019-10-13 21:42:02,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:42:02,216 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1088 transitions. [2019-10-13 21:42:02,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-13 21:42:02,223 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:42:02,224 INFO L380 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-13 21:42:02,224 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:42:02,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:42:02,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1532437230, now seen corresponding path program 1 times [2019-10-13 21:42:02,225 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:42:02,225 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106221527] [2019-10-13 21:42:02,225 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:02,225 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:02,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:42:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:42:02,540 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-13 21:42:02,541 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106221527] [2019-10-13 21:42:02,542 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772082970] [2019-10-13 21:42:02,542 INFO L94 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-13 21:42:02,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:42:02,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 834 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:42:02,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:42:03,067 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-13 21:42:03,067 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:42:03,151 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-13 21:42:03,151 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:42:03,152 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 8 [2019-10-13 21:42:03,152 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639009691] [2019-10-13 21:42:03,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:42:03,154 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:42:03,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:42:03,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:42:03,155 INFO L87 Difference]: Start difference. First operand 603 states and 1088 transitions. Second operand 3 states. [2019-10-13 21:42:04,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:42:04,118 INFO L93 Difference]: Finished difference Result 1797 states and 3308 transitions. [2019-10-13 21:42:04,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:42:04,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-10-13 21:42:04,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:42:04,134 INFO L225 Difference]: With dead ends: 1797 [2019-10-13 21:42:04,134 INFO L226 Difference]: Without dead ends: 1199 [2019-10-13 21:42:04,137 INFO L600 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-13 21:42:04,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2019-10-13 21:42:04,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 1199. [2019-10-13 21:42:04,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1199 states. [2019-10-13 21:42:04,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1885 transitions. [2019-10-13 21:42:04,217 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1885 transitions. Word has length 161 [2019-10-13 21:42:04,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:42:04,220 INFO L462 AbstractCegarLoop]: Abstraction has 1199 states and 1885 transitions. [2019-10-13 21:42:04,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:42:04,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1885 transitions. [2019-10-13 21:42:04,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-13 21:42:04,231 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:42:04,232 INFO L380 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-13 21:42:04,437 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:42:04,437 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:42:04,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:42:04,438 INFO L82 PathProgramCache]: Analyzing trace with hash -660053814, now seen corresponding path program 1 times [2019-10-13 21:42:04,438 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:42:04,439 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685175910] [2019-10-13 21:42:04,439 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:04,439 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:04,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:42:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:42:04,669 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-13 21:42:04,669 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685175910] [2019-10-13 21:42:04,669 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:42:04,670 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:42:04,670 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137674517] [2019-10-13 21:42:04,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:42:04,671 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:42:04,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:42:04,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:42:04,672 INFO L87 Difference]: Start difference. First operand 1199 states and 1885 transitions. Second operand 7 states. [2019-10-13 21:42:06,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:42:06,194 INFO L93 Difference]: Finished difference Result 3779 states and 6973 transitions. [2019-10-13 21:42:06,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:42:06,195 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 165 [2019-10-13 21:42:06,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:42:06,221 INFO L225 Difference]: With dead ends: 3779 [2019-10-13 21:42:06,221 INFO L226 Difference]: Without dead ends: 2585 [2019-10-13 21:42:06,227 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:42:06,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2585 states. [2019-10-13 21:42:06,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2585 to 2445. [2019-10-13 21:42:06,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2445 states. [2019-10-13 21:42:06,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2445 states to 2445 states and 3963 transitions. [2019-10-13 21:42:06,432 INFO L78 Accepts]: Start accepts. Automaton has 2445 states and 3963 transitions. Word has length 165 [2019-10-13 21:42:06,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:42:06,433 INFO L462 AbstractCegarLoop]: Abstraction has 2445 states and 3963 transitions. [2019-10-13 21:42:06,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:42:06,433 INFO L276 IsEmpty]: Start isEmpty. Operand 2445 states and 3963 transitions. [2019-10-13 21:42:06,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-13 21:42:06,442 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:42:06,442 INFO L380 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-13 21:42:06,443 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:42:06,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:42:06,443 INFO L82 PathProgramCache]: Analyzing trace with hash 568602441, now seen corresponding path program 1 times [2019-10-13 21:42:06,444 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:42:06,444 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53402492] [2019-10-13 21:42:06,444 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:06,445 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:06,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:42:06,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:42:06,608 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-13 21:42:06,611 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53402492] [2019-10-13 21:42:06,611 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:42:06,612 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:42:06,612 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559503596] [2019-10-13 21:42:06,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:42:06,613 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:42:06,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:42:06,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:42:06,614 INFO L87 Difference]: Start difference. First operand 2445 states and 3963 transitions. Second operand 6 states. [2019-10-13 21:42:08,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:42:08,016 INFO L93 Difference]: Finished difference Result 7385 states and 12817 transitions. [2019-10-13 21:42:08,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:42:08,017 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 171 [2019-10-13 21:42:08,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:42:08,049 INFO L225 Difference]: With dead ends: 7385 [2019-10-13 21:42:08,050 INFO L226 Difference]: Without dead ends: 4945 [2019-10-13 21:42:08,059 INFO L600 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-13 21:42:08,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4945 states. [2019-10-13 21:42:08,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4945 to 4859. [2019-10-13 21:42:08,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4859 states. [2019-10-13 21:42:08,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4859 states to 4859 states and 7646 transitions. [2019-10-13 21:42:08,313 INFO L78 Accepts]: Start accepts. Automaton has 4859 states and 7646 transitions. Word has length 171 [2019-10-13 21:42:08,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:42:08,313 INFO L462 AbstractCegarLoop]: Abstraction has 4859 states and 7646 transitions. [2019-10-13 21:42:08,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:42:08,314 INFO L276 IsEmpty]: Start isEmpty. Operand 4859 states and 7646 transitions. [2019-10-13 21:42:08,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-13 21:42:08,335 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:42:08,336 INFO L380 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-13 21:42:08,336 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:42:08,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:42:08,337 INFO L82 PathProgramCache]: Analyzing trace with hash -693908939, now seen corresponding path program 1 times [2019-10-13 21:42:08,337 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:42:08,337 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293765302] [2019-10-13 21:42:08,338 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:08,338 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:08,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:42:08,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:42:08,495 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-13 21:42:08,496 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293765302] [2019-10-13 21:42:08,496 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288959846] [2019-10-13 21:42:08,496 INFO L94 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-13 21:42:08,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:42:08,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 997 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-13 21:42:08,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:42:08,753 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-13 21:42:08,754 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:42:08,829 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-13 21:42:08,830 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:42:08,830 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 10 [2019-10-13 21:42:08,830 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409034560] [2019-10-13 21:42:08,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:42:08,831 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:42:08,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:42:08,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:42:08,832 INFO L87 Difference]: Start difference. First operand 4859 states and 7646 transitions. Second operand 5 states. [2019-10-13 21:42:10,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:42:10,388 INFO L93 Difference]: Finished difference Result 14024 states and 23694 transitions. [2019-10-13 21:42:10,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:42:10,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 183 [2019-10-13 21:42:10,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:42:10,446 INFO L225 Difference]: With dead ends: 14024 [2019-10-13 21:42:10,447 INFO L226 Difference]: Without dead ends: 9170 [2019-10-13 21:42:10,463 INFO L600 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-13 21:42:10,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9170 states. [2019-10-13 21:42:10,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9170 to 9028. [2019-10-13 21:42:10,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9028 states. [2019-10-13 21:42:10,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9028 states to 9028 states and 14422 transitions. [2019-10-13 21:42:10,844 INFO L78 Accepts]: Start accepts. Automaton has 9028 states and 14422 transitions. Word has length 183 [2019-10-13 21:42:10,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:42:10,845 INFO L462 AbstractCegarLoop]: Abstraction has 9028 states and 14422 transitions. [2019-10-13 21:42:10,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:42:10,845 INFO L276 IsEmpty]: Start isEmpty. Operand 9028 states and 14422 transitions. [2019-10-13 21:42:10,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-13 21:42:10,872 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:42:10,873 INFO L380 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-13 21:42:11,077 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:42:11,078 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:42:11,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:42:11,079 INFO L82 PathProgramCache]: Analyzing trace with hash -865907640, now seen corresponding path program 1 times [2019-10-13 21:42:11,079 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:42:11,079 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210148472] [2019-10-13 21:42:11,080 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:11,080 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:11,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:42:11,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:42:11,282 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-13 21:42:11,282 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210148472] [2019-10-13 21:42:11,283 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566869271] [2019-10-13 21:42:11,283 INFO L94 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-13 21:42:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:42:11,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 1001 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 21:42:11,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:42:11,664 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-13 21:42:11,665 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:42:11,742 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-13 21:42:11,743 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1722559540] [2019-10-13 21:42:11,777 INFO L162 IcfgInterpreter]: Started Sifa with 153 locations of interest [2019-10-13 21:42:11,777 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:42:11,784 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:42:11,793 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:42:11,794 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:42:12,586 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 206 for LOIs [2019-10-13 21:42:12,801 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 227 [2019-10-13 21:42:12,904 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 298 [2019-10-13 21:42:13,188 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 304 [2019-10-13 21:42:13,441 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 310 [2019-10-13 21:42:14,370 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:42:14,371 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:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) 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:102) 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:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) ... 21 more [2019-10-13 21:42:14,379 INFO L168 Benchmark]: Toolchain (without parser) took 20911.61 ms. Allocated memory was 138.4 MB in the beginning and 683.1 MB in the end (delta: 544.7 MB). Free memory was 97.5 MB in the beginning and 509.6 MB in the end (delta: -412.1 MB). Peak memory consumption was 132.7 MB. Max. memory is 7.1 GB. [2019-10-13 21:42:14,380 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 21:42:14,381 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1283.08 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 97.3 MB in the beginning and 122.1 MB in the end (delta: -24.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. [2019-10-13 21:42:14,382 INFO L168 Benchmark]: Boogie Preprocessor took 217.54 ms. Allocated memory is still 202.9 MB. Free memory was 122.1 MB in the beginning and 110.8 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. [2019-10-13 21:42:14,383 INFO L168 Benchmark]: RCFGBuilder took 3244.09 ms. Allocated memory was 202.9 MB in the beginning and 313.5 MB in the end (delta: 110.6 MB). Free memory was 110.1 MB in the beginning and 257.7 MB in the end (delta: -147.7 MB). Peak memory consumption was 86.4 MB. Max. memory is 7.1 GB. [2019-10-13 21:42:14,384 INFO L168 Benchmark]: TraceAbstraction took 16162.31 ms. Allocated memory was 313.5 MB in the beginning and 683.1 MB in the end (delta: 369.6 MB). Free memory was 257.7 MB in the beginning and 509.6 MB in the end (delta: -251.8 MB). Peak memory consumption was 117.8 MB. Max. memory is 7.1 GB. [2019-10-13 21:42:14,388 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 138.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1283.08 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 97.3 MB in the beginning and 122.1 MB in the end (delta: -24.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 217.54 ms. Allocated memory is still 202.9 MB. Free memory was 122.1 MB in the beginning and 110.8 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3244.09 ms. Allocated memory was 202.9 MB in the beginning and 313.5 MB in the end (delta: 110.6 MB). Free memory was 110.1 MB in the beginning and 257.7 MB in the end (delta: -147.7 MB). Peak memory consumption was 86.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16162.31 ms. Allocated memory was 313.5 MB in the beginning and 683.1 MB in the end (delta: 369.6 MB). Free memory was 257.7 MB in the beginning and 509.6 MB in the end (delta: -251.8 MB). Peak memory consumption was 117.8 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:307) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...