java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label31.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:58:52,830 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:58:52,833 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:58:52,853 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:58:52,853 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:58:52,856 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:58:52,857 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:58:52,867 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:58:52,869 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:58:52,870 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:58:52,872 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:58:52,873 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:58:52,873 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:58:52,876 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:58:52,879 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:58:52,881 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:58:52,883 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:58:52,885 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:58:52,887 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:58:52,892 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:58:52,897 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:58:52,900 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:58:52,903 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:58:52,904 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:58:52,907 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:58:52,907 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:58:52,907 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:58:52,909 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:58:52,910 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:58:52,911 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:58:52,911 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:58:52,912 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:58:52,913 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:58:52,913 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:58:52,915 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:58:52,915 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:58:52,916 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:58:52,916 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:58:52,916 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:58:52,917 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:58:52,918 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:58:52,919 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 00:58:52,945 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:58:52,945 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:58:52,947 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:58:52,947 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:58:52,947 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:58:52,947 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:58:52,948 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:58:52,948 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:58:52,948 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:58:52,948 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:58:52,948 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:58:52,948 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:58:52,949 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:58:52,949 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:58:52,949 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:58:52,949 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:58:52,949 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:58:52,950 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:58:52,950 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:58:52,950 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:58:52,950 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:58:52,950 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:58:52,951 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:58:52,951 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:58:52,951 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:58:52,951 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:58:52,951 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:58:52,952 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:58:52,952 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 00:58:53,233 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:58:53,248 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:58:53,252 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:58:53,253 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:58:53,254 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:58:53,255 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label31.c [2019-10-07 00:58:53,333 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaaf42330/c284fb1678e641cf8be45f28fc28500e/FLAG6ed80c44a [2019-10-07 00:58:54,004 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:58:54,005 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label31.c [2019-10-07 00:58:54,026 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaaf42330/c284fb1678e641cf8be45f28fc28500e/FLAG6ed80c44a [2019-10-07 00:58:54,187 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaaf42330/c284fb1678e641cf8be45f28fc28500e [2019-10-07 00:58:54,199 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:58:54,201 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:58:54,204 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:58:54,204 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:58:54,208 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:58:54,209 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:58:54" (1/1) ... [2019-10-07 00:58:54,212 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fd9dbad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:54, skipping insertion in model container [2019-10-07 00:58:54,212 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:58:54" (1/1) ... [2019-10-07 00:58:54,222 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:58:54,319 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:58:55,257 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:58:55,270 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:58:55,654 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:58:55,684 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:58:55,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:55 WrapperNode [2019-10-07 00:58:55,685 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:58:55,686 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:58:55,686 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:58:55,686 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:58:55,703 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:55" (1/1) ... [2019-10-07 00:58:55,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:55" (1/1) ... [2019-10-07 00:58:55,744 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:55" (1/1) ... [2019-10-07 00:58:55,745 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:55" (1/1) ... [2019-10-07 00:58:55,805 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:55" (1/1) ... [2019-10-07 00:58:55,819 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:55" (1/1) ... [2019-10-07 00:58:55,835 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:55" (1/1) ... [2019-10-07 00:58:55,852 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:58:55,853 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:58:55,853 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:58:55,854 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:58:55,855 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:58:55,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:58:55,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:58:55,924 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-07 00:58:55,925 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:58:55,925 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-07 00:58:55,925 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:58:55,925 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 00:58:55,926 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 00:58:55,926 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:58:55,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:58:55,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:58:59,183 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:58:59,183 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 00:58:59,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:58:59 BoogieIcfgContainer [2019-10-07 00:58:59,185 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:58:59,186 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:58:59,186 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:58:59,190 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:58:59,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:58:54" (1/3) ... [2019-10-07 00:58:59,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3563383a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:58:59, skipping insertion in model container [2019-10-07 00:58:59,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:55" (2/3) ... [2019-10-07 00:58:59,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3563383a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:58:59, skipping insertion in model container [2019-10-07 00:58:59,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:58:59" (3/3) ... [2019-10-07 00:58:59,194 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label31.c [2019-10-07 00:58:59,205 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:58:59,219 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:58:59,232 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:58:59,275 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:58:59,275 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:58:59,275 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:58:59,275 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:58:59,275 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:58:59,276 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:58:59,276 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:58:59,276 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:58:59,306 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states. [2019-10-07 00:58:59,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-07 00:58:59,328 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:59,329 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:58:59,333 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:59,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:59,339 INFO L82 PathProgramCache]: Analyzing trace with hash 136465702, now seen corresponding path program 1 times [2019-10-07 00:58:59,348 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:59,348 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:59,349 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:59,349 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:59,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:59,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:00,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:59:00,207 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:00,208 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:59:00,208 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 00:59:00,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 00:59:00,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 00:59:00,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 00:59:00,232 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 4 states. [2019-10-07 00:59:01,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:59:01,906 INFO L93 Difference]: Finished difference Result 613 states and 1182 transitions. [2019-10-07 00:59:01,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 00:59:01,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-10-07 00:59:01,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:59:01,930 INFO L225 Difference]: With dead ends: 613 [2019-10-07 00:59:01,930 INFO L226 Difference]: Without dead ends: 448 [2019-10-07 00:59:01,935 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 00:59:01,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2019-10-07 00:59:02,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 301. [2019-10-07 00:59:02,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-10-07 00:59:02,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 579 transitions. [2019-10-07 00:59:02,011 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 579 transitions. Word has length 149 [2019-10-07 00:59:02,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:59:02,012 INFO L462 AbstractCegarLoop]: Abstraction has 301 states and 579 transitions. [2019-10-07 00:59:02,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 00:59:02,012 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 579 transitions. [2019-10-07 00:59:02,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-07 00:59:02,018 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:59:02,018 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:59:02,019 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:59:02,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:59:02,019 INFO L82 PathProgramCache]: Analyzing trace with hash -20880474, now seen corresponding path program 1 times [2019-10-07 00:59:02,020 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:59:02,020 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:02,020 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:02,020 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:02,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:59:02,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:02,268 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:59:02,269 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:02,269 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:59:02,270 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 00:59:02,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 00:59:02,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 00:59:02,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 00:59:02,273 INFO L87 Difference]: Start difference. First operand 301 states and 579 transitions. Second operand 5 states. [2019-10-07 00:59:03,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:59:03,624 INFO L93 Difference]: Finished difference Result 913 states and 1781 transitions. [2019-10-07 00:59:03,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 00:59:03,626 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-10-07 00:59:03,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:59:03,632 INFO L225 Difference]: With dead ends: 913 [2019-10-07 00:59:03,632 INFO L226 Difference]: Without dead ends: 617 [2019-10-07 00:59:03,635 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-07 00:59:03,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-10-07 00:59:03,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 601. [2019-10-07 00:59:03,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-10-07 00:59:03,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 1102 transitions. [2019-10-07 00:59:03,696 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 1102 transitions. Word has length 157 [2019-10-07 00:59:03,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:59:03,696 INFO L462 AbstractCegarLoop]: Abstraction has 601 states and 1102 transitions. [2019-10-07 00:59:03,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 00:59:03,697 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 1102 transitions. [2019-10-07 00:59:03,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-07 00:59:03,703 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:59:03,704 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:59:03,704 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:59:03,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:59:03,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1532436206, now seen corresponding path program 1 times [2019-10-07 00:59:03,705 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:59:03,705 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:03,705 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:03,706 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:03,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:59:03,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:04,096 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:59:04,096 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:04,098 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:59:04,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:59:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:04,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 839 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-07 00:59:04,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:59:04,517 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:59:04,519 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:59:04,603 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:59:04,604 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 00:59:04,605 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 8 [2019-10-07 00:59:04,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:59:04,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:59:04,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-10-07 00:59:04,609 INFO L87 Difference]: Start difference. First operand 601 states and 1102 transitions. Second operand 3 states. [2019-10-07 00:59:05,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:59:05,669 INFO L93 Difference]: Finished difference Result 1791 states and 3345 transitions. [2019-10-07 00:59:05,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:59:05,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-10-07 00:59:05,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:59:05,690 INFO L225 Difference]: With dead ends: 1791 [2019-10-07 00:59:05,691 INFO L226 Difference]: Without dead ends: 1195 [2019-10-07 00:59:05,702 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 323 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-10-07 00:59:05,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2019-10-07 00:59:05,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1046. [2019-10-07 00:59:05,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1046 states. [2019-10-07 00:59:05,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1690 transitions. [2019-10-07 00:59:05,770 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1690 transitions. Word has length 161 [2019-10-07 00:59:05,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:59:05,771 INFO L462 AbstractCegarLoop]: Abstraction has 1046 states and 1690 transitions. [2019-10-07 00:59:05,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:59:05,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1690 transitions. [2019-10-07 00:59:05,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-07 00:59:05,778 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:59:05,778 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:59:05,983 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:59:05,984 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:59:05,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:59:05,985 INFO L82 PathProgramCache]: Analyzing trace with hash 634687016, now seen corresponding path program 1 times [2019-10-07 00:59:05,985 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:59:05,986 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:05,986 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:05,986 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:05,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:59:06,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:06,152 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 00:59:06,153 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:06,153 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:59:06,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:59:06,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:06,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 979 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-07 00:59:06,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:59:06,649 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 00:59:06,650 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:59:06,761 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 00:59:06,762 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 00:59:06,762 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 10 [2019-10-07 00:59:06,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 00:59:06,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 00:59:06,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-07 00:59:06,765 INFO L87 Difference]: Start difference. First operand 1046 states and 1690 transitions. Second operand 5 states. [2019-10-07 00:59:07,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:59:07,973 INFO L93 Difference]: Finished difference Result 2586 states and 4445 transitions. [2019-10-07 00:59:07,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 00:59:07,973 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 179 [2019-10-07 00:59:07,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:59:07,985 INFO L225 Difference]: With dead ends: 2586 [2019-10-07 00:59:07,985 INFO L226 Difference]: Without dead ends: 1545 [2019-10-07 00:59:07,989 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 352 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-10-07 00:59:07,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2019-10-07 00:59:08,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1523. [2019-10-07 00:59:08,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1523 states. [2019-10-07 00:59:08,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 2574 transitions. [2019-10-07 00:59:08,059 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 2574 transitions. Word has length 179 [2019-10-07 00:59:08,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:59:08,060 INFO L462 AbstractCegarLoop]: Abstraction has 1523 states and 2574 transitions. [2019-10-07 00:59:08,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 00:59:08,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 2574 transitions. [2019-10-07 00:59:08,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-07 00:59:08,066 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:59:08,067 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:59:08,272 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:59:08,273 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:59:08,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:59:08,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1771941393, now seen corresponding path program 1 times [2019-10-07 00:59:08,274 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:59:08,275 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:08,275 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:08,275 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:08,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:59:08,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:08,456 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:59:08,457 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:08,457 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:59:08,457 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 00:59:08,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 00:59:08,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 00:59:08,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 00:59:08,459 INFO L87 Difference]: Start difference. First operand 1523 states and 2574 transitions. Second operand 6 states. [2019-10-07 00:59:09,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:59:09,772 INFO L93 Difference]: Finished difference Result 3550 states and 6246 transitions. [2019-10-07 00:59:09,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 00:59:09,772 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 180 [2019-10-07 00:59:09,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:59:09,788 INFO L225 Difference]: With dead ends: 3550 [2019-10-07 00:59:09,788 INFO L226 Difference]: Without dead ends: 2032 [2019-10-07 00:59:09,794 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-07 00:59:09,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2032 states. [2019-10-07 00:59:09,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2032 to 2010. [2019-10-07 00:59:09,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2010 states. [2019-10-07 00:59:09,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2010 states to 2010 states and 3240 transitions. [2019-10-07 00:59:09,882 INFO L78 Accepts]: Start accepts. Automaton has 2010 states and 3240 transitions. Word has length 180 [2019-10-07 00:59:09,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:59:09,882 INFO L462 AbstractCegarLoop]: Abstraction has 2010 states and 3240 transitions. [2019-10-07 00:59:09,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 00:59:09,882 INFO L276 IsEmpty]: Start isEmpty. Operand 2010 states and 3240 transitions. [2019-10-07 00:59:09,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-07 00:59:09,890 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:59:09,890 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:59:09,891 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:59:09,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:59:09,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1339448481, now seen corresponding path program 1 times [2019-10-07 00:59:09,892 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:59:09,892 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:09,892 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:09,892 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:09,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:59:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:10,079 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:59:10,080 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:10,081 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:59:10,082 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 00:59:10,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 00:59:10,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 00:59:10,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 00:59:10,089 INFO L87 Difference]: Start difference. First operand 2010 states and 3240 transitions. Second operand 6 states. [2019-10-07 00:59:11,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:59:11,668 INFO L93 Difference]: Finished difference Result 5897 states and 9958 transitions. [2019-10-07 00:59:11,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 00:59:11,672 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 183 [2019-10-07 00:59:11,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:59:11,702 INFO L225 Difference]: With dead ends: 5897 [2019-10-07 00:59:11,702 INFO L226 Difference]: Without dead ends: 3892 [2019-10-07 00:59:11,710 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-07 00:59:11,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3892 states. [2019-10-07 00:59:11,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3892 to 3272. [2019-10-07 00:59:11,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3272 states. [2019-10-07 00:59:11,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3272 states to 3272 states and 5371 transitions. [2019-10-07 00:59:11,861 INFO L78 Accepts]: Start accepts. Automaton has 3272 states and 5371 transitions. Word has length 183 [2019-10-07 00:59:11,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:59:11,861 INFO L462 AbstractCegarLoop]: Abstraction has 3272 states and 5371 transitions. [2019-10-07 00:59:11,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 00:59:11,862 INFO L276 IsEmpty]: Start isEmpty. Operand 3272 states and 5371 transitions. [2019-10-07 00:59:11,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-07 00:59:11,874 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:59:11,874 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:59:11,875 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:59:11,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:59:11,875 INFO L82 PathProgramCache]: Analyzing trace with hash -239018380, now seen corresponding path program 1 times [2019-10-07 00:59:11,875 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:59:11,876 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:11,876 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:11,876 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:11,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:59:11,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:12,026 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 57 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:59:12,026 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:12,027 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:59:12,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:59:12,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:12,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 1025 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-07 00:59:12,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:59:12,401 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-07 00:59:12,402 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:59:12,476 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 47 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 00:59:12,476 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 00:59:12,477 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 10 [2019-10-07 00:59:12,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 00:59:12,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 00:59:12,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-07 00:59:12,478 INFO L87 Difference]: Start difference. First operand 3272 states and 5371 transitions. Second operand 5 states. [2019-10-07 00:59:13,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:59:13,981 INFO L93 Difference]: Finished difference Result 9606 states and 17002 transitions. [2019-10-07 00:59:13,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 00:59:13,982 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 202 [2019-10-07 00:59:13,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:59:14,032 INFO L225 Difference]: With dead ends: 9606 [2019-10-07 00:59:14,032 INFO L226 Difference]: Without dead ends: 6339 [2019-10-07 00:59:14,045 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 401 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-07 00:59:14,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6339 states. [2019-10-07 00:59:14,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6339 to 6098. [2019-10-07 00:59:14,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6098 states. [2019-10-07 00:59:14,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6098 states to 6098 states and 10143 transitions. [2019-10-07 00:59:14,330 INFO L78 Accepts]: Start accepts. Automaton has 6098 states and 10143 transitions. Word has length 202 [2019-10-07 00:59:14,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:59:14,331 INFO L462 AbstractCegarLoop]: Abstraction has 6098 states and 10143 transitions. [2019-10-07 00:59:14,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 00:59:14,331 INFO L276 IsEmpty]: Start isEmpty. Operand 6098 states and 10143 transitions. [2019-10-07 00:59:14,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-07 00:59:14,359 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:59:14,359 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:59:14,564 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:59:14,565 INFO L410 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:59:14,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:59:14,565 INFO L82 PathProgramCache]: Analyzing trace with hash 2134020120, now seen corresponding path program 1 times [2019-10-07 00:59:14,566 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:59:14,566 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:14,567 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:14,567 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:14,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:59:14,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:14,884 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:59:14,885 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:14,885 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:59:14,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:59:15,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:15,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 1016 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-07 00:59:15,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:59:15,161 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:59:15,162 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:59:15,265 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:59:15,265 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:59:15,304 INFO L162 IcfgInterpreter]: Started Sifa with 153 locations of interest [2019-10-07 00:59:15,305 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:59:15,312 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:59:15,322 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:59:15,323 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:59:16,098 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2019-10-07 00:59:16,309 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 206 for LOIs [2019-10-07 00:59:16,591 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 298 [2019-10-07 00:59:17,683 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:59:17,684 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: assume true; at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:133) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: assume true; at de.uni_freiburg.informatik.ultimate.lib.sifa.PriorityWorklist.add(PriorityWorklist.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.lambda$2(DagInterpreter.java:135) at java.lang.Iterable.forEach(Iterable.java:75) at java.util.Collections$UnmodifiableCollection.forEach(Collections.java:1080) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:135) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:104) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.computeTopSummary(TopInputCallSummarizer.java:78) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:67) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:230) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:214) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:197) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:166) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:287) ... 21 more [2019-10-07 00:59:17,690 INFO L168 Benchmark]: Toolchain (without parser) took 23489.27 ms. Allocated memory was 146.3 MB in the beginning and 690.0 MB in the end (delta: 543.7 MB). Free memory was 97.2 MB in the beginning and 570.3 MB in the end (delta: -473.1 MB). Peak memory consumption was 70.6 MB. Max. memory is 7.1 GB. [2019-10-07 00:59:17,692 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 00:59:17,693 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1481.64 ms. Allocated memory was 146.3 MB in the beginning and 208.1 MB in the end (delta: 61.9 MB). Free memory was 97.0 MB in the beginning and 132.0 MB in the end (delta: -35.0 MB). Peak memory consumption was 34.8 MB. Max. memory is 7.1 GB. [2019-10-07 00:59:17,697 INFO L168 Benchmark]: Boogie Preprocessor took 166.84 ms. Allocated memory is still 208.1 MB. Free memory was 132.0 MB in the beginning and 120.2 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 7.1 GB. [2019-10-07 00:59:17,702 INFO L168 Benchmark]: RCFGBuilder took 3332.05 ms. Allocated memory was 208.1 MB in the beginning and 309.3 MB in the end (delta: 101.2 MB). Free memory was 120.2 MB in the beginning and 240.4 MB in the end (delta: -120.3 MB). Peak memory consumption was 82.6 MB. Max. memory is 7.1 GB. [2019-10-07 00:59:17,703 INFO L168 Benchmark]: TraceAbstraction took 18501.91 ms. Allocated memory was 309.3 MB in the beginning and 690.0 MB in the end (delta: 380.6 MB). Free memory was 240.4 MB in the beginning and 570.3 MB in the end (delta: -329.9 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. [2019-10-07 00:59:17,712 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1481.64 ms. Allocated memory was 146.3 MB in the beginning and 208.1 MB in the end (delta: 61.9 MB). Free memory was 97.0 MB in the beginning and 132.0 MB in the end (delta: -35.0 MB). Peak memory consumption was 34.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 166.84 ms. Allocated memory is still 208.1 MB. Free memory was 132.0 MB in the beginning and 120.2 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3332.05 ms. Allocated memory was 208.1 MB in the beginning and 309.3 MB in the end (delta: 101.2 MB). Free memory was 120.2 MB in the beginning and 240.4 MB in the end (delta: -120.3 MB). Peak memory consumption was 82.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18501.91 ms. Allocated memory was 309.3 MB in the beginning and 690.0 MB in the end (delta: 380.6 MB). Free memory was 240.4 MB in the beginning and 570.3 MB in the end (delta: -329.9 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: assume true; de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: assume true;: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...