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/systemc/toy1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 23:27:13,179 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 23:27:13,182 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 23:27:13,199 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 23:27:13,199 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 23:27:13,201 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 23:27:13,203 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 23:27:13,212 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 23:27:13,218 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 23:27:13,221 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 23:27:13,222 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 23:27:13,223 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 23:27:13,224 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 23:27:13,225 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 23:27:13,225 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 23:27:13,226 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 23:27:13,227 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 23:27:13,228 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 23:27:13,229 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 23:27:13,231 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 23:27:13,232 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 23:27:13,233 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 23:27:13,234 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 23:27:13,235 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 23:27:13,237 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 23:27:13,237 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 23:27:13,237 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 23:27:13,238 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 23:27:13,239 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 23:27:13,239 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 23:27:13,240 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 23:27:13,241 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 23:27:13,241 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 23:27:13,242 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 23:27:13,243 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 23:27:13,246 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 23:27:13,247 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 23:27:13,247 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 23:27:13,247 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 23:27:13,248 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 23:27:13,249 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 23:27:13,250 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 23:27:13,281 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 23:27:13,281 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 23:27:13,282 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 23:27:13,285 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 23:27:13,285 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 23:27:13,286 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 23:27:13,286 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 23:27:13,286 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 23:27:13,286 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 23:27:13,286 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 23:27:13,286 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 23:27:13,287 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 23:27:13,287 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 23:27:13,292 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 23:27:13,292 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 23:27:13,292 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 23:27:13,293 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 23:27:13,293 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 23:27:13,293 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 23:27:13,293 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 23:27:13,293 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 23:27:13,294 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:27:13,294 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 23:27:13,294 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 23:27:13,294 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 23:27:13,295 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 23:27:13,295 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 23:27:13,295 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 23:27:13,295 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 23:27:13,564 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 23:27:13,577 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 23:27:13,580 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 23:27:13,582 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 23:27:13,582 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 23:27:13,583 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/toy1.cil.c [2019-10-13 23:27:13,647 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68d869783/f934be5647ba4981bf08ffe9670c3f97/FLAG337a40793 [2019-10-13 23:27:14,210 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 23:27:14,211 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/toy1.cil.c [2019-10-13 23:27:14,230 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68d869783/f934be5647ba4981bf08ffe9670c3f97/FLAG337a40793 [2019-10-13 23:27:14,469 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68d869783/f934be5647ba4981bf08ffe9670c3f97 [2019-10-13 23:27:14,480 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 23:27:14,482 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 23:27:14,483 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 23:27:14,483 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 23:27:14,487 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 23:27:14,488 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:27:14" (1/1) ... [2019-10-13 23:27:14,491 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6608a0f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:27:14, skipping insertion in model container [2019-10-13 23:27:14,491 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:27:14" (1/1) ... [2019-10-13 23:27:14,499 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 23:27:14,556 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 23:27:14,797 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:27:14,804 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 23:27:14,942 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:27:14,959 INFO L192 MainTranslator]: Completed translation [2019-10-13 23:27:14,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:27:14 WrapperNode [2019-10-13 23:27:14,960 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 23:27:14,960 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 23:27:14,961 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 23:27:14,961 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 23:27:14,972 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:27:14" (1/1) ... [2019-10-13 23:27:14,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:27:14" (1/1) ... [2019-10-13 23:27:14,980 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:27:14" (1/1) ... [2019-10-13 23:27:14,981 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:27:14" (1/1) ... [2019-10-13 23:27:14,992 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:27:14" (1/1) ... [2019-10-13 23:27:15,008 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:27:14" (1/1) ... [2019-10-13 23:27:15,011 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:27:14" (1/1) ... [2019-10-13 23:27:15,016 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 23:27:15,017 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 23:27:15,017 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 23:27:15,017 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 23:27:15,018 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:27:14" (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 23:27:15,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 23:27:15,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 23:27:15,104 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-13 23:27:15,104 INFO L138 BoogieDeclarations]: Found implementation of procedure write_loop [2019-10-13 23:27:15,104 INFO L138 BoogieDeclarations]: Found implementation of procedure compute1 [2019-10-13 23:27:15,105 INFO L138 BoogieDeclarations]: Found implementation of procedure compute2 [2019-10-13 23:27:15,106 INFO L138 BoogieDeclarations]: Found implementation of procedure write_back [2019-10-13 23:27:15,107 INFO L138 BoogieDeclarations]: Found implementation of procedure read [2019-10-13 23:27:15,107 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-13 23:27:15,107 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-13 23:27:15,107 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 23:27:15,108 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 23:27:15,108 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 23:27:15,108 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-13 23:27:15,109 INFO L130 BoogieDeclarations]: Found specification of procedure write_loop [2019-10-13 23:27:15,109 INFO L130 BoogieDeclarations]: Found specification of procedure compute1 [2019-10-13 23:27:15,111 INFO L130 BoogieDeclarations]: Found specification of procedure compute2 [2019-10-13 23:27:15,111 INFO L130 BoogieDeclarations]: Found specification of procedure write_back [2019-10-13 23:27:15,111 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 23:27:15,111 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-13 23:27:15,112 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-13 23:27:15,112 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 23:27:15,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 23:27:15,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 23:27:16,592 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 23:27:16,593 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-13 23:27:16,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:27:16 BoogieIcfgContainer [2019-10-13 23:27:16,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 23:27:16,596 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 23:27:16,597 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 23:27:16,600 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 23:27:16,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:27:14" (1/3) ... [2019-10-13 23:27:16,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73fd21ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:27:16, skipping insertion in model container [2019-10-13 23:27:16,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:27:14" (2/3) ... [2019-10-13 23:27:16,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73fd21ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:27:16, skipping insertion in model container [2019-10-13 23:27:16,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:27:16" (3/3) ... [2019-10-13 23:27:16,614 INFO L109 eAbstractionObserver]: Analyzing ICFG toy1.cil.c [2019-10-13 23:27:16,626 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 23:27:16,639 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 23:27:16,651 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 23:27:16,679 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 23:27:16,679 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 23:27:16,679 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 23:27:16,679 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 23:27:16,680 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 23:27:16,680 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 23:27:16,680 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 23:27:16,680 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 23:27:16,698 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states. [2019-10-13 23:27:16,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 23:27:16,704 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:27:16,705 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] [2019-10-13 23:27:16,707 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:27:16,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:27:16,714 INFO L82 PathProgramCache]: Analyzing trace with hash -853662082, now seen corresponding path program 1 times [2019-10-13 23:27:16,724 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:27:16,724 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651222069] [2019-10-13 23:27:16,724 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:27:16,725 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:27:16,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:27:16,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:27:17,089 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 23:27:17,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651222069] [2019-10-13 23:27:17,091 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:27:17,095 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:27:17,096 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862861337] [2019-10-13 23:27:17,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:27:17,102 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:27:17,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:27:17,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:27:17,121 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 3 states. [2019-10-13 23:27:17,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:27:17,240 INFO L93 Difference]: Finished difference Result 208 states and 309 transitions. [2019-10-13 23:27:17,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:27:17,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 23:27:17,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:27:17,260 INFO L225 Difference]: With dead ends: 208 [2019-10-13 23:27:17,260 INFO L226 Difference]: Without dead ends: 126 [2019-10-13 23:27:17,265 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 23:27:17,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-10-13 23:27:17,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-10-13 23:27:17,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-10-13 23:27:17,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 182 transitions. [2019-10-13 23:27:17,334 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 182 transitions. Word has length 25 [2019-10-13 23:27:17,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:27:17,335 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 182 transitions. [2019-10-13 23:27:17,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:27:17,335 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 182 transitions. [2019-10-13 23:27:17,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-13 23:27:17,339 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:27:17,339 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 23:27:17,340 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:27:17,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:27:17,340 INFO L82 PathProgramCache]: Analyzing trace with hash -890517348, now seen corresponding path program 1 times [2019-10-13 23:27:17,341 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:27:17,341 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465601923] [2019-10-13 23:27:17,341 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:27:17,341 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:27:17,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:27:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:27:17,502 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:27:17,503 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465601923] [2019-10-13 23:27:17,504 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:27:17,504 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:27:17,504 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936157185] [2019-10-13 23:27:17,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:27:17,510 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:27:17,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:27:17,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:27:17,511 INFO L87 Difference]: Start difference. First operand 125 states and 182 transitions. Second operand 5 states. [2019-10-13 23:27:18,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:27:18,078 INFO L93 Difference]: Finished difference Result 478 states and 795 transitions. [2019-10-13 23:27:18,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 23:27:18,079 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-10-13 23:27:18,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:27:18,084 INFO L225 Difference]: With dead ends: 478 [2019-10-13 23:27:18,085 INFO L226 Difference]: Without dead ends: 361 [2019-10-13 23:27:18,088 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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 23:27:18,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-10-13 23:27:18,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 344. [2019-10-13 23:27:18,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-10-13 23:27:18,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 562 transitions. [2019-10-13 23:27:18,170 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 562 transitions. Word has length 41 [2019-10-13 23:27:18,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:27:18,171 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 562 transitions. [2019-10-13 23:27:18,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:27:18,171 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 562 transitions. [2019-10-13 23:27:18,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 23:27:18,179 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:27:18,180 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:27:18,183 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:27:18,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:27:18,184 INFO L82 PathProgramCache]: Analyzing trace with hash -497151362, now seen corresponding path program 1 times [2019-10-13 23:27:18,184 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:27:18,185 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753028591] [2019-10-13 23:27:18,187 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:27:18,187 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:27:18,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:27:18,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:27:18,351 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 23:27:18,351 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753028591] [2019-10-13 23:27:18,351 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550636004] [2019-10-13 23:27:18,352 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 23:27:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:27:18,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 23:27:18,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:27:18,574 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 23:27:18,574 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:27:18,641 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-13 23:27:18,642 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 23:27:18,642 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7, 3] total 9 [2019-10-13 23:27:18,642 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458172884] [2019-10-13 23:27:18,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:27:18,643 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:27:18,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:27:18,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:27:18,644 INFO L87 Difference]: Start difference. First operand 344 states and 562 transitions. Second operand 3 states. [2019-10-13 23:27:18,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:27:18,701 INFO L93 Difference]: Finished difference Result 769 states and 1271 transitions. [2019-10-13 23:27:18,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:27:18,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-10-13 23:27:18,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:27:18,710 INFO L225 Difference]: With dead ends: 769 [2019-10-13 23:27:18,710 INFO L226 Difference]: Without dead ends: 435 [2019-10-13 23:27:18,712 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:27:18,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-10-13 23:27:18,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 408. [2019-10-13 23:27:18,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-10-13 23:27:18,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 660 transitions. [2019-10-13 23:27:18,784 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 660 transitions. Word has length 55 [2019-10-13 23:27:18,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:27:18,784 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 660 transitions. [2019-10-13 23:27:18,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:27:18,785 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 660 transitions. [2019-10-13 23:27:18,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-13 23:27:18,794 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:27:18,794 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:27:19,018 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:27:19,019 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:27:19,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:27:19,019 INFO L82 PathProgramCache]: Analyzing trace with hash -602034395, now seen corresponding path program 1 times [2019-10-13 23:27:19,020 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:27:19,020 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5609197] [2019-10-13 23:27:19,021 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:27:19,021 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:27:19,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:27:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:27:19,134 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-13 23:27:19,134 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5609197] [2019-10-13 23:27:19,134 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583297268] [2019-10-13 23:27:19,134 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 23:27:19,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:27:19,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 784 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 23:27:19,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:27:19,297 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 23:27:19,297 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:27:19,359 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 23:27:19,359 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 23:27:19,359 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8, 4] total 10 [2019-10-13 23:27:19,360 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914268036] [2019-10-13 23:27:19,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:27:19,360 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:27:19,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:27:19,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-13 23:27:19,361 INFO L87 Difference]: Start difference. First operand 408 states and 660 transitions. Second operand 3 states. [2019-10-13 23:27:19,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:27:19,406 INFO L93 Difference]: Finished difference Result 992 states and 1593 transitions. [2019-10-13 23:27:19,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:27:19,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-10-13 23:27:19,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:27:19,411 INFO L225 Difference]: With dead ends: 992 [2019-10-13 23:27:19,412 INFO L226 Difference]: Without dead ends: 594 [2019-10-13 23:27:19,414 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 135 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-13 23:27:19,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-10-13 23:27:19,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 555. [2019-10-13 23:27:19,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-10-13 23:27:19,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 868 transitions. [2019-10-13 23:27:19,449 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 868 transitions. Word has length 69 [2019-10-13 23:27:19,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:27:19,449 INFO L462 AbstractCegarLoop]: Abstraction has 555 states and 868 transitions. [2019-10-13 23:27:19,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:27:19,450 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 868 transitions. [2019-10-13 23:27:19,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-13 23:27:19,452 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:27:19,452 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 23:27:19,664 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:27:19,664 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:27:19,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:27:19,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1445071072, now seen corresponding path program 1 times [2019-10-13 23:27:19,665 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:27:19,666 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100920877] [2019-10-13 23:27:19,666 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:27:19,666 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:27:19,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:27:19,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:27:19,735 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-13 23:27:19,736 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100920877] [2019-10-13 23:27:19,736 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:27:19,736 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:27:19,737 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062495126] [2019-10-13 23:27:19,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:27:19,740 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:27:19,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:27:19,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:27:19,740 INFO L87 Difference]: Start difference. First operand 555 states and 868 transitions. Second operand 4 states. [2019-10-13 23:27:19,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:27:19,888 INFO L93 Difference]: Finished difference Result 1528 states and 2451 transitions. [2019-10-13 23:27:19,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:27:19,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-10-13 23:27:19,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:27:19,896 INFO L225 Difference]: With dead ends: 1528 [2019-10-13 23:27:19,896 INFO L226 Difference]: Without dead ends: 983 [2019-10-13 23:27:19,899 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:27:19,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2019-10-13 23:27:19,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 979. [2019-10-13 23:27:19,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 979 states. [2019-10-13 23:27:19,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1526 transitions. [2019-10-13 23:27:19,958 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1526 transitions. Word has length 70 [2019-10-13 23:27:19,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:27:19,958 INFO L462 AbstractCegarLoop]: Abstraction has 979 states and 1526 transitions. [2019-10-13 23:27:19,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:27:19,959 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1526 transitions. [2019-10-13 23:27:19,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-13 23:27:19,963 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:27:19,963 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:27:19,963 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:27:19,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:27:19,964 INFO L82 PathProgramCache]: Analyzing trace with hash 456248088, now seen corresponding path program 1 times [2019-10-13 23:27:19,964 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:27:19,964 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385724083] [2019-10-13 23:27:19,964 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:27:19,964 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:27:19,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:27:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:27:20,117 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 23:27:20,118 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385724083] [2019-10-13 23:27:20,118 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600273704] [2019-10-13 23:27:20,118 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 23:27:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:27:20,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 23:27:20,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:27:20,298 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:27:20,298 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:27:20,331 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 23:27:20,331 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 23:27:20,332 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12, 3] total 14 [2019-10-13 23:27:20,332 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716045259] [2019-10-13 23:27:20,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:27:20,333 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:27:20,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:27:20,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-10-13 23:27:20,333 INFO L87 Difference]: Start difference. First operand 979 states and 1526 transitions. Second operand 3 states. [2019-10-13 23:27:20,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:27:20,411 INFO L93 Difference]: Finished difference Result 1939 states and 3006 transitions. [2019-10-13 23:27:20,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:27:20,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-10-13 23:27:20,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:27:20,419 INFO L225 Difference]: With dead ends: 1939 [2019-10-13 23:27:20,420 INFO L226 Difference]: Without dead ends: 970 [2019-10-13 23:27:20,431 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-10-13 23:27:20,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2019-10-13 23:27:20,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 941. [2019-10-13 23:27:20,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2019-10-13 23:27:20,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1389 transitions. [2019-10-13 23:27:20,525 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1389 transitions. Word has length 72 [2019-10-13 23:27:20,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:27:20,526 INFO L462 AbstractCegarLoop]: Abstraction has 941 states and 1389 transitions. [2019-10-13 23:27:20,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:27:20,526 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1389 transitions. [2019-10-13 23:27:20,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-13 23:27:20,533 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:27:20,534 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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] [2019-10-13 23:27:20,738 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:27:20,739 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:27:20,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:27:20,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1626708363, now seen corresponding path program 1 times [2019-10-13 23:27:20,740 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:27:20,741 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403001212] [2019-10-13 23:27:20,741 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:27:20,741 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:27:20,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:27:20,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:27:20,816 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-13 23:27:20,817 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403001212] [2019-10-13 23:27:20,817 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:27:20,817 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:27:20,817 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141068511] [2019-10-13 23:27:20,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:27:20,818 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:27:20,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:27:20,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:27:20,819 INFO L87 Difference]: Start difference. First operand 941 states and 1389 transitions. Second operand 3 states. [2019-10-13 23:27:20,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:27:20,880 INFO L93 Difference]: Finished difference Result 948 states and 1399 transitions. [2019-10-13 23:27:20,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:27:20,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-10-13 23:27:20,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:27:20,886 INFO L225 Difference]: With dead ends: 948 [2019-10-13 23:27:20,887 INFO L226 Difference]: Without dead ends: 945 [2019-10-13 23:27:20,887 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 23:27:20,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-10-13 23:27:20,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 945. [2019-10-13 23:27:20,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2019-10-13 23:27:20,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1393 transitions. [2019-10-13 23:27:20,933 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1393 transitions. Word has length 82 [2019-10-13 23:27:20,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:27:20,934 INFO L462 AbstractCegarLoop]: Abstraction has 945 states and 1393 transitions. [2019-10-13 23:27:20,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:27:20,934 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1393 transitions. [2019-10-13 23:27:20,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-13 23:27:20,938 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:27:20,938 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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] [2019-10-13 23:27:20,939 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:27:20,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:27:20,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1626655570, now seen corresponding path program 1 times [2019-10-13 23:27:20,939 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:27:20,939 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770787945] [2019-10-13 23:27:20,940 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:27:20,940 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:27:20,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:27:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:27:21,300 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 17 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 23:27:21,301 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770787945] [2019-10-13 23:27:21,301 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214981344] [2019-10-13 23:27:21,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:27:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:27:21,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-13 23:27:21,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:27:21,635 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 23:27:21,635 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:27:21,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:27:21,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:27:21,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:27:21,811 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 28 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-13 23:27:21,811 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 23:27:21,811 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16, 6] total 26 [2019-10-13 23:27:21,812 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232549444] [2019-10-13 23:27:21,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:27:21,814 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:27:21,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:27:21,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2019-10-13 23:27:21,816 INFO L87 Difference]: Start difference. First operand 945 states and 1393 transitions. Second operand 9 states. [2019-10-13 23:27:22,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:27:22,814 INFO L93 Difference]: Finished difference Result 4167 states and 6469 transitions. [2019-10-13 23:27:22,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-13 23:27:22,815 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-10-13 23:27:22,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:27:22,837 INFO L225 Difference]: With dead ends: 4167 [2019-10-13 23:27:22,837 INFO L226 Difference]: Without dead ends: 3232 [2019-10-13 23:27:22,847 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=146, Invalid=976, Unknown=0, NotChecked=0, Total=1122 [2019-10-13 23:27:22,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3232 states. [2019-10-13 23:27:22,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3232 to 3043. [2019-10-13 23:27:22,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3043 states. [2019-10-13 23:27:23,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3043 states to 3043 states and 4534 transitions. [2019-10-13 23:27:23,013 INFO L78 Accepts]: Start accepts. Automaton has 3043 states and 4534 transitions. Word has length 82 [2019-10-13 23:27:23,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:27:23,014 INFO L462 AbstractCegarLoop]: Abstraction has 3043 states and 4534 transitions. [2019-10-13 23:27:23,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:27:23,014 INFO L276 IsEmpty]: Start isEmpty. Operand 3043 states and 4534 transitions. [2019-10-13 23:27:23,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-13 23:27:23,033 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:27:23,033 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:27:23,244 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:27:23,245 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:27:23,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:27:23,246 INFO L82 PathProgramCache]: Analyzing trace with hash -828517937, now seen corresponding path program 1 times [2019-10-13 23:27:23,247 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:27:23,247 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584995161] [2019-10-13 23:27:23,248 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:27:23,248 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:27:23,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:27:23,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:27:23,309 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-13 23:27:23,310 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584995161] [2019-10-13 23:27:23,310 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:27:23,310 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:27:23,313 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501193442] [2019-10-13 23:27:23,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:27:23,314 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:27:23,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:27:23,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:27:23,315 INFO L87 Difference]: Start difference. First operand 3043 states and 4534 transitions. Second operand 3 states. [2019-10-13 23:27:23,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:27:23,571 INFO L93 Difference]: Finished difference Result 7258 states and 10962 transitions. [2019-10-13 23:27:23,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:27:23,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-10-13 23:27:23,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:27:23,604 INFO L225 Difference]: With dead ends: 7258 [2019-10-13 23:27:23,604 INFO L226 Difference]: Without dead ends: 4228 [2019-10-13 23:27:23,639 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 23:27:23,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4228 states. [2019-10-13 23:27:23,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4228 to 4206. [2019-10-13 23:27:23,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4206 states. [2019-10-13 23:27:23,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4206 states to 4206 states and 6152 transitions. [2019-10-13 23:27:23,872 INFO L78 Accepts]: Start accepts. Automaton has 4206 states and 6152 transitions. Word has length 92 [2019-10-13 23:27:23,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:27:23,873 INFO L462 AbstractCegarLoop]: Abstraction has 4206 states and 6152 transitions. [2019-10-13 23:27:23,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:27:23,873 INFO L276 IsEmpty]: Start isEmpty. Operand 4206 states and 6152 transitions. [2019-10-13 23:27:23,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-13 23:27:23,918 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:27:23,919 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:27:23,919 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:27:23,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:27:23,920 INFO L82 PathProgramCache]: Analyzing trace with hash 858969692, now seen corresponding path program 1 times [2019-10-13 23:27:23,920 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:27:23,920 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117824316] [2019-10-13 23:27:23,921 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:27:23,921 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:27:23,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:27:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:27:24,000 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-13 23:27:24,001 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117824316] [2019-10-13 23:27:24,001 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917011896] [2019-10-13 23:27:24,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:27:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:27:24,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 925 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 23:27:24,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:27:24,254 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 23:27:24,255 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:27:24,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:27:24,336 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-13 23:27:24,337 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 23:27:24,337 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 5 [2019-10-13 23:27:24,337 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131432691] [2019-10-13 23:27:24,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:27:24,338 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:27:24,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:27:24,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:27:24,339 INFO L87 Difference]: Start difference. First operand 4206 states and 6152 transitions. Second operand 4 states. [2019-10-13 23:27:24,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:27:24,660 INFO L93 Difference]: Finished difference Result 7934 states and 11548 transitions. [2019-10-13 23:27:24,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:27:24,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-10-13 23:27:24,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:27:24,689 INFO L225 Difference]: With dead ends: 7934 [2019-10-13 23:27:24,689 INFO L226 Difference]: Without dead ends: 4151 [2019-10-13 23:27:24,720 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:27:24,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4151 states. [2019-10-13 23:27:24,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4151 to 4097. [2019-10-13 23:27:24,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4097 states. [2019-10-13 23:27:24,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4097 states to 4097 states and 5891 transitions. [2019-10-13 23:27:24,935 INFO L78 Accepts]: Start accepts. Automaton has 4097 states and 5891 transitions. Word has length 88 [2019-10-13 23:27:24,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:27:24,935 INFO L462 AbstractCegarLoop]: Abstraction has 4097 states and 5891 transitions. [2019-10-13 23:27:24,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:27:24,936 INFO L276 IsEmpty]: Start isEmpty. Operand 4097 states and 5891 transitions. [2019-10-13 23:27:24,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-13 23:27:24,957 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:27:24,957 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:27:25,170 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:27:25,170 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:27:25,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:27:25,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1549355052, now seen corresponding path program 1 times [2019-10-13 23:27:25,171 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:27:25,171 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89590410] [2019-10-13 23:27:25,171 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:27:25,171 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:27:25,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:27:25,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:27:25,255 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 23:27:25,255 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89590410] [2019-10-13 23:27:25,256 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:27:25,256 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:27:25,256 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779602930] [2019-10-13 23:27:25,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:27:25,259 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:27:25,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:27:25,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:27:25,259 INFO L87 Difference]: Start difference. First operand 4097 states and 5891 transitions. Second operand 5 states. [2019-10-13 23:27:25,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:27:25,761 INFO L93 Difference]: Finished difference Result 7948 states and 11494 transitions. [2019-10-13 23:27:25,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:27:25,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-10-13 23:27:25,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:27:25,790 INFO L225 Difference]: With dead ends: 7948 [2019-10-13 23:27:25,791 INFO L226 Difference]: Without dead ends: 4274 [2019-10-13 23:27:25,806 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:27:25,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4274 states. [2019-10-13 23:27:26,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4274 to 4081. [2019-10-13 23:27:26,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4081 states. [2019-10-13 23:27:26,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4081 states to 4081 states and 5885 transitions. [2019-10-13 23:27:26,030 INFO L78 Accepts]: Start accepts. Automaton has 4081 states and 5885 transitions. Word has length 86 [2019-10-13 23:27:26,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:27:26,030 INFO L462 AbstractCegarLoop]: Abstraction has 4081 states and 5885 transitions. [2019-10-13 23:27:26,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:27:26,030 INFO L276 IsEmpty]: Start isEmpty. Operand 4081 states and 5885 transitions. [2019-10-13 23:27:26,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-13 23:27:26,050 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:27:26,050 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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] [2019-10-13 23:27:26,051 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:27:26,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:27:26,051 INFO L82 PathProgramCache]: Analyzing trace with hash -857073703, now seen corresponding path program 1 times [2019-10-13 23:27:26,051 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:27:26,051 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52142821] [2019-10-13 23:27:26,052 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:27:26,052 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:27:26,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:27:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:27:26,503 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 17 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:27:26,504 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52142821] [2019-10-13 23:27:26,504 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585935738] [2019-10-13 23:27:26,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:27:26,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:27:26,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 933 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-13 23:27:26,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:27:26,900 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 23:27:26,900 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:27:27,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:27:27,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:27:27,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:27:27,082 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-13 23:27:27,082 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 23:27:27,082 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [19, 6] total 29 [2019-10-13 23:27:27,082 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599579194] [2019-10-13 23:27:27,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:27:27,083 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:27:27,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:27:27,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2019-10-13 23:27:27,084 INFO L87 Difference]: Start difference. First operand 4081 states and 5885 transitions. Second operand 9 states. [2019-10-13 23:27:28,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:27:28,341 INFO L93 Difference]: Finished difference Result 18518 states and 27330 transitions. [2019-10-13 23:27:28,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-13 23:27:28,342 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-10-13 23:27:28,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:27:28,431 INFO L225 Difference]: With dead ends: 18518 [2019-10-13 23:27:28,432 INFO L226 Difference]: Without dead ends: 14450 [2019-10-13 23:27:28,460 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 165 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=155, Invalid=1177, Unknown=0, NotChecked=0, Total=1332 [2019-10-13 23:27:28,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14450 states. [2019-10-13 23:27:29,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14450 to 13797. [2019-10-13 23:27:29,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13797 states. [2019-10-13 23:27:29,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13797 states to 13797 states and 19403 transitions. [2019-10-13 23:27:29,353 INFO L78 Accepts]: Start accepts. Automaton has 13797 states and 19403 transitions. Word has length 87 [2019-10-13 23:27:29,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:27:29,353 INFO L462 AbstractCegarLoop]: Abstraction has 13797 states and 19403 transitions. [2019-10-13 23:27:29,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:27:29,353 INFO L276 IsEmpty]: Start isEmpty. Operand 13797 states and 19403 transitions. [2019-10-13 23:27:29,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-13 23:27:29,414 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:27:29,414 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:27:29,619 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:27:29,620 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:27:29,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:27:29,620 INFO L82 PathProgramCache]: Analyzing trace with hash -747680870, now seen corresponding path program 1 times [2019-10-13 23:27:29,620 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:27:29,621 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337304953] [2019-10-13 23:27:29,621 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:27:29,621 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:27:29,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:27:29,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:27:29,706 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 23:27:29,706 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337304953] [2019-10-13 23:27:29,706 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:27:29,706 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:27:29,707 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688970190] [2019-10-13 23:27:29,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:27:29,708 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:27:29,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:27:29,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:27:29,709 INFO L87 Difference]: Start difference. First operand 13797 states and 19403 transitions. Second operand 5 states. [2019-10-13 23:27:30,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:27:30,353 INFO L93 Difference]: Finished difference Result 25636 states and 36322 transitions. [2019-10-13 23:27:30,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:27:30,353 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-10-13 23:27:30,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:27:30,443 INFO L225 Difference]: With dead ends: 25636 [2019-10-13 23:27:30,443 INFO L226 Difference]: Without dead ends: 14074 [2019-10-13 23:27:30,497 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:27:31,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14074 states. [2019-10-13 23:27:31,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14074 to 13761. [2019-10-13 23:27:31,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13761 states. [2019-10-13 23:27:31,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13761 states to 13761 states and 19363 transitions. [2019-10-13 23:27:31,941 INFO L78 Accepts]: Start accepts. Automaton has 13761 states and 19363 transitions. Word has length 91 [2019-10-13 23:27:31,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:27:31,941 INFO L462 AbstractCegarLoop]: Abstraction has 13761 states and 19363 transitions. [2019-10-13 23:27:31,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:27:31,942 INFO L276 IsEmpty]: Start isEmpty. Operand 13761 states and 19363 transitions. [2019-10-13 23:27:31,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-13 23:27:31,997 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:27:31,997 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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] [2019-10-13 23:27:31,998 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:27:31,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:27:31,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1922322228, now seen corresponding path program 1 times [2019-10-13 23:27:31,998 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:27:31,998 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35943101] [2019-10-13 23:27:31,999 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:27:31,999 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:27:31,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:27:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:27:32,402 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 23:27:32,403 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35943101] [2019-10-13 23:27:32,403 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862439946] [2019-10-13 23:27:32,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:27:32,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:27:32,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 69 conjunts are in the unsatisfiable core [2019-10-13 23:27:32,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:27:33,103 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:27:33,103 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:27:33,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:27:33,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:27:33,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:27:33,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:27:33,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:27:33,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:27:33,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 23:27:33,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:27:33,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:27:33,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:27:33,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:27:33,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:27:34,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:27:34,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:27:34,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 23:27:34,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:27:34,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 23:27:34,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:27:34,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:27:34,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 23:27:34,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:27:34,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 23:27:34,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:27:34,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:27:34,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 23:27:34,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:27:34,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 23:27:34,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:27:34,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:27:34,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 23:27:34,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 23:27:34,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:27:34,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 23:27:34,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 23:27:34,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:27:34,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:27:34,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 23:27:34,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 23:27:34,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:27:34,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:27:34,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 23:27:34,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:27:34,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:27:34,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:27:34,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:27:34,608 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 23:27:34,608 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [397678036] [2019-10-13 23:27:34,636 INFO L162 IcfgInterpreter]: Started Sifa with 65 locations of interest [2019-10-13 23:27:34,637 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 23:27:34,643 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 23:27:34,651 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 23:27:34,652 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 23:27:35,050 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 144 for LOIs [2019-10-13 23:27:35,205 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-10-13 23:27:35,512 INFO L199 IcfgInterpreter]: Interpreting procedure start_simulation with input of size 116 for LOIs [2019-10-13 23:27:35,695 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-10-13 23:27:38,709 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-10-13 23:27:42,056 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-10-13 23:27:45,366 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:27:45,368 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.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 23:27:45,374 INFO L168 Benchmark]: Toolchain (without parser) took 30892.01 ms. Allocated memory was 138.9 MB in the beginning and 1.0 GB in the end (delta: 910.2 MB). Free memory was 101.9 MB in the beginning and 240.3 MB in the end (delta: -138.4 MB). Peak memory consumption was 771.7 MB. Max. memory is 7.1 GB. [2019-10-13 23:27:45,375 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 138.9 MB. Free memory was 121.0 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 23:27:45,376 INFO L168 Benchmark]: CACSL2BoogieTranslator took 477.05 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 101.7 MB in the beginning and 179.8 MB in the end (delta: -78.2 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-10-13 23:27:45,376 INFO L168 Benchmark]: Boogie Preprocessor took 55.79 ms. Allocated memory is still 203.9 MB. Free memory was 179.8 MB in the beginning and 177.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-10-13 23:27:45,377 INFO L168 Benchmark]: RCFGBuilder took 1578.71 ms. Allocated memory was 203.9 MB in the beginning and 235.9 MB in the end (delta: 32.0 MB). Free memory was 177.1 MB in the beginning and 165.0 MB in the end (delta: 12.1 MB). Peak memory consumption was 89.8 MB. Max. memory is 7.1 GB. [2019-10-13 23:27:45,378 INFO L168 Benchmark]: TraceAbstraction took 28775.75 ms. Allocated memory was 235.9 MB in the beginning and 1.0 GB in the end (delta: 813.2 MB). Free memory was 165.0 MB in the beginning and 240.3 MB in the end (delta: -75.3 MB). Peak memory consumption was 737.9 MB. Max. memory is 7.1 GB. [2019-10-13 23:27:45,381 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 138.9 MB. Free memory was 121.0 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 477.05 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 101.7 MB in the beginning and 179.8 MB in the end (delta: -78.2 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 55.79 ms. Allocated memory is still 203.9 MB. Free memory was 179.8 MB in the beginning and 177.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1578.71 ms. Allocated memory was 203.9 MB in the beginning and 235.9 MB in the end (delta: 32.0 MB). Free memory was 177.1 MB in the beginning and 165.0 MB in the end (delta: 12.1 MB). Peak memory consumption was 89.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28775.75 ms. Allocated memory was 235.9 MB in the beginning and 1.0 GB in the end (delta: 813.2 MB). Free memory was 165.0 MB in the beginning and 240.3 MB in the end (delta: -75.3 MB). Peak memory consumption was 737.9 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...