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-36ac518-m [2019-10-07 17:15:26,727 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 17:15:26,729 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 17:15:26,745 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 17:15:26,746 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 17:15:26,747 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 17:15:26,749 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 17:15:26,762 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 17:15:26,764 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 17:15:26,764 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 17:15:26,765 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 17:15:26,766 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 17:15:26,767 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 17:15:26,768 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 17:15:26,769 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 17:15:26,770 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 17:15:26,770 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 17:15:26,771 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 17:15:26,773 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 17:15:26,775 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 17:15:26,776 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 17:15:26,777 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 17:15:26,778 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 17:15:26,779 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 17:15:26,781 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 17:15:26,781 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 17:15:26,781 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 17:15:26,782 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 17:15:26,783 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 17:15:26,784 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 17:15:26,784 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 17:15:26,784 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 17:15:26,785 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 17:15:26,786 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 17:15:26,787 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 17:15:26,787 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 17:15:26,788 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 17:15:26,788 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 17:15:26,788 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 17:15:26,790 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 17:15:26,790 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 17:15:26,791 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 17:15:26,813 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 17:15:26,814 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 17:15:26,815 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 17:15:26,816 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 17:15:26,816 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 17:15:26,816 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 17:15:26,816 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 17:15:26,816 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 17:15:26,817 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 17:15:26,817 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 17:15:26,818 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 17:15:26,818 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 17:15:26,818 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 17:15:26,819 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 17:15:26,819 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 17:15:26,819 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 17:15:26,819 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 17:15:26,820 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 17:15:26,820 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 17:15:26,820 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 17:15:26,820 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 17:15:26,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 17:15:26,821 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 17:15:26,821 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 17:15:26,821 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 17:15:26,821 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 17:15:26,821 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 17:15:26,822 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 17:15:26,822 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 17:15:27,089 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 17:15:27,102 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 17:15:27,105 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 17:15:27,107 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 17:15:27,107 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 17:15:27,108 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-07 17:15:27,169 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00fa2b457/1c720c02cdfb41449bb6368b19ba0b9d/FLAG541abcaf0 [2019-10-07 17:15:27,673 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 17:15:27,676 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/toy1.cil.c [2019-10-07 17:15:27,688 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00fa2b457/1c720c02cdfb41449bb6368b19ba0b9d/FLAG541abcaf0 [2019-10-07 17:15:28,021 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00fa2b457/1c720c02cdfb41449bb6368b19ba0b9d [2019-10-07 17:15:28,031 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 17:15:28,033 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 17:15:28,034 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 17:15:28,034 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 17:15:28,037 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 17:15:28,038 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 05:15:28" (1/1) ... [2019-10-07 17:15:28,041 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b2e1afb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:15:28, skipping insertion in model container [2019-10-07 17:15:28,042 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 05:15:28" (1/1) ... [2019-10-07 17:15:28,050 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 17:15:28,104 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 17:15:28,346 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 17:15:28,353 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 17:15:28,526 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 17:15:28,544 INFO L192 MainTranslator]: Completed translation [2019-10-07 17:15:28,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:15:28 WrapperNode [2019-10-07 17:15:28,545 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 17:15:28,546 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 17:15:28,546 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 17:15:28,546 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 17:15:28,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:15:28" (1/1) ... [2019-10-07 17:15:28,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:15:28" (1/1) ... [2019-10-07 17:15:28,565 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:15:28" (1/1) ... [2019-10-07 17:15:28,565 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:15:28" (1/1) ... [2019-10-07 17:15:28,576 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:15:28" (1/1) ... [2019-10-07 17:15:28,591 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:15:28" (1/1) ... [2019-10-07 17:15:28,594 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:15:28" (1/1) ... [2019-10-07 17:15:28,598 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 17:15:28,598 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 17:15:28,598 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 17:15:28,599 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 17:15:28,600 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:15:28" (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 17:15:28,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 17:15:28,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 17:15:28,662 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-07 17:15:28,662 INFO L138 BoogieDeclarations]: Found implementation of procedure write_loop [2019-10-07 17:15:28,662 INFO L138 BoogieDeclarations]: Found implementation of procedure compute1 [2019-10-07 17:15:28,662 INFO L138 BoogieDeclarations]: Found implementation of procedure compute2 [2019-10-07 17:15:28,663 INFO L138 BoogieDeclarations]: Found implementation of procedure write_back [2019-10-07 17:15:28,663 INFO L138 BoogieDeclarations]: Found implementation of procedure read [2019-10-07 17:15:28,663 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-07 17:15:28,663 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-07 17:15:28,663 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 17:15:28,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 17:15:28,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 17:15:28,664 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-07 17:15:28,664 INFO L130 BoogieDeclarations]: Found specification of procedure write_loop [2019-10-07 17:15:28,664 INFO L130 BoogieDeclarations]: Found specification of procedure compute1 [2019-10-07 17:15:28,664 INFO L130 BoogieDeclarations]: Found specification of procedure compute2 [2019-10-07 17:15:28,664 INFO L130 BoogieDeclarations]: Found specification of procedure write_back [2019-10-07 17:15:28,665 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-07 17:15:28,665 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-07 17:15:28,665 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-07 17:15:28,665 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 17:15:28,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 17:15:28,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 17:15:30,084 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 17:15:30,084 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-07 17:15:30,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 05:15:30 BoogieIcfgContainer [2019-10-07 17:15:30,086 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 17:15:30,087 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 17:15:30,087 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 17:15:30,090 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 17:15:30,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 05:15:28" (1/3) ... [2019-10-07 17:15:30,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@514e4bb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 05:15:30, skipping insertion in model container [2019-10-07 17:15:30,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:15:28" (2/3) ... [2019-10-07 17:15:30,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@514e4bb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 05:15:30, skipping insertion in model container [2019-10-07 17:15:30,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 05:15:30" (3/3) ... [2019-10-07 17:15:30,094 INFO L109 eAbstractionObserver]: Analyzing ICFG toy1.cil.c [2019-10-07 17:15:30,104 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 17:15:30,113 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 17:15:30,124 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 17:15:30,147 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 17:15:30,148 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 17:15:30,148 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 17:15:30,148 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 17:15:30,148 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 17:15:30,149 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 17:15:30,149 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 17:15:30,149 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 17:15:30,169 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states. [2019-10-07 17:15:30,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-07 17:15:30,177 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:15:30,178 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] [2019-10-07 17:15:30,180 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:15:30,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:15:30,185 INFO L82 PathProgramCache]: Analyzing trace with hash -853662082, now seen corresponding path program 1 times [2019-10-07 17:15:30,191 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:15:30,191 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:30,192 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:30,192 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:30,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:15:30,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:15:30,612 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 17:15:30,613 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:30,616 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:15:30,618 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 17:15:30,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 17:15:30,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 17:15:30,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 17:15:30,643 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 3 states. [2019-10-07 17:15:30,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:15:30,782 INFO L93 Difference]: Finished difference Result 208 states and 309 transitions. [2019-10-07 17:15:30,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 17:15:30,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-07 17:15:30,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:15:30,807 INFO L225 Difference]: With dead ends: 208 [2019-10-07 17:15:30,808 INFO L226 Difference]: Without dead ends: 126 [2019-10-07 17:15:30,815 INFO L606 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-07 17:15:30,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-10-07 17:15:30,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-10-07 17:15:30,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-10-07 17:15:30,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 182 transitions. [2019-10-07 17:15:30,897 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 182 transitions. Word has length 25 [2019-10-07 17:15:30,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:15:30,898 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 182 transitions. [2019-10-07 17:15:30,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 17:15:30,898 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 182 transitions. [2019-10-07 17:15:30,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-07 17:15:30,902 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:15:30,902 INFO L385 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-07 17:15:30,902 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:15:30,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:15:30,903 INFO L82 PathProgramCache]: Analyzing trace with hash -890517348, now seen corresponding path program 1 times [2019-10-07 17:15:30,903 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:15:30,903 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:30,904 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:30,904 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:30,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:15:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:15:31,049 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-07 17:15:31,049 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:31,050 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:15:31,051 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 17:15:31,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 17:15:31,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 17:15:31,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 17:15:31,057 INFO L87 Difference]: Start difference. First operand 125 states and 182 transitions. Second operand 5 states. [2019-10-07 17:15:31,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:15:31,635 INFO L93 Difference]: Finished difference Result 478 states and 795 transitions. [2019-10-07 17:15:31,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 17:15:31,636 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-10-07 17:15:31,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:15:31,643 INFO L225 Difference]: With dead ends: 478 [2019-10-07 17:15:31,644 INFO L226 Difference]: Without dead ends: 361 [2019-10-07 17:15:31,653 INFO L606 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-07 17:15:31,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-10-07 17:15:31,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 344. [2019-10-07 17:15:31,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-10-07 17:15:31,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 562 transitions. [2019-10-07 17:15:31,736 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 562 transitions. Word has length 41 [2019-10-07 17:15:31,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:15:31,737 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 562 transitions. [2019-10-07 17:15:31,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 17:15:31,737 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 562 transitions. [2019-10-07 17:15:31,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-07 17:15:31,741 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:15:31,742 INFO L385 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-07 17:15:31,743 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:15:31,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:15:31,743 INFO L82 PathProgramCache]: Analyzing trace with hash -497151362, now seen corresponding path program 1 times [2019-10-07 17:15:31,743 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:15:31,744 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:31,744 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:31,744 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:31,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:15:31,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:15:31,916 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-07 17:15:31,917 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:31,917 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:15:31,918 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 17:15:32,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:15:32,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-07 17:15:32,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:15:32,111 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-07 17:15:32,112 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:15:32,152 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-07 17:15:32,153 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 17:15:32,153 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7, 3] total 9 [2019-10-07 17:15:32,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 17:15:32,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 17:15:32,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-07 17:15:32,155 INFO L87 Difference]: Start difference. First operand 344 states and 562 transitions. Second operand 3 states. [2019-10-07 17:15:32,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:15:32,216 INFO L93 Difference]: Finished difference Result 769 states and 1271 transitions. [2019-10-07 17:15:32,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 17:15:32,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-10-07 17:15:32,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:15:32,221 INFO L225 Difference]: With dead ends: 769 [2019-10-07 17:15:32,222 INFO L226 Difference]: Without dead ends: 435 [2019-10-07 17:15:32,223 INFO L606 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-07 17:15:32,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-10-07 17:15:32,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 408. [2019-10-07 17:15:32,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-10-07 17:15:32,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 660 transitions. [2019-10-07 17:15:32,260 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 660 transitions. Word has length 55 [2019-10-07 17:15:32,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:15:32,262 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 660 transitions. [2019-10-07 17:15:32,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 17:15:32,263 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 660 transitions. [2019-10-07 17:15:32,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-07 17:15:32,268 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:15:32,268 INFO L385 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-07 17:15:32,491 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:15:32,492 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:15:32,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:15:32,493 INFO L82 PathProgramCache]: Analyzing trace with hash -602034395, now seen corresponding path program 1 times [2019-10-07 17:15:32,493 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:15:32,494 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:32,494 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:32,494 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:32,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:15:32,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:15:32,614 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-07 17:15:32,614 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:32,614 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:15:32,614 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 17:15:32,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:15:32,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 784 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-07 17:15:32,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:15:32,813 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-07 17:15:32,813 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:15:32,874 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-07 17:15:32,874 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 17:15:32,875 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8, 4] total 10 [2019-10-07 17:15:32,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 17:15:32,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 17:15:32,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-07 17:15:32,877 INFO L87 Difference]: Start difference. First operand 408 states and 660 transitions. Second operand 3 states. [2019-10-07 17:15:32,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:15:32,931 INFO L93 Difference]: Finished difference Result 992 states and 1593 transitions. [2019-10-07 17:15:32,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 17:15:32,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-10-07 17:15:32,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:15:32,936 INFO L225 Difference]: With dead ends: 992 [2019-10-07 17:15:32,936 INFO L226 Difference]: Without dead ends: 594 [2019-10-07 17:15:32,939 INFO L606 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-07 17:15:32,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-10-07 17:15:32,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 555. [2019-10-07 17:15:32,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-10-07 17:15:32,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 868 transitions. [2019-10-07 17:15:32,975 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 868 transitions. Word has length 69 [2019-10-07 17:15:32,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:15:32,976 INFO L462 AbstractCegarLoop]: Abstraction has 555 states and 868 transitions. [2019-10-07 17:15:32,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 17:15:32,976 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 868 transitions. [2019-10-07 17:15:32,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-07 17:15:32,980 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:15:32,980 INFO L385 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-07 17:15:33,183 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:15:33,185 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:15:33,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:15:33,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1445071072, now seen corresponding path program 1 times [2019-10-07 17:15:33,186 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:15:33,186 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:33,187 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:33,187 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:33,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:15:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:15:33,256 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-07 17:15:33,256 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:33,257 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:15:33,257 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 17:15:33,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 17:15:33,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 17:15:33,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 17:15:33,259 INFO L87 Difference]: Start difference. First operand 555 states and 868 transitions. Second operand 4 states. [2019-10-07 17:15:33,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:15:33,431 INFO L93 Difference]: Finished difference Result 1528 states and 2451 transitions. [2019-10-07 17:15:33,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 17:15:33,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-10-07 17:15:33,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:15:33,441 INFO L225 Difference]: With dead ends: 1528 [2019-10-07 17:15:33,441 INFO L226 Difference]: Without dead ends: 983 [2019-10-07 17:15:33,446 INFO L606 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-07 17:15:33,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2019-10-07 17:15:33,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 979. [2019-10-07 17:15:33,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 979 states. [2019-10-07 17:15:33,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1526 transitions. [2019-10-07 17:15:33,534 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1526 transitions. Word has length 70 [2019-10-07 17:15:33,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:15:33,535 INFO L462 AbstractCegarLoop]: Abstraction has 979 states and 1526 transitions. [2019-10-07 17:15:33,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 17:15:33,535 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1526 transitions. [2019-10-07 17:15:33,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-07 17:15:33,541 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:15:33,542 INFO L385 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-07 17:15:33,546 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:15:33,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:15:33,547 INFO L82 PathProgramCache]: Analyzing trace with hash 456248088, now seen corresponding path program 1 times [2019-10-07 17:15:33,547 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:15:33,547 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:33,547 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:33,548 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:33,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:15:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:15:33,707 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-07 17:15:33,708 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:33,708 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:15:33,708 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 17:15:33,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:15:33,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-07 17:15:33,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:15:33,879 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-07 17:15:33,879 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:15:33,935 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-07 17:15:33,936 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 17:15:33,936 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12, 3] total 14 [2019-10-07 17:15:33,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 17:15:33,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 17:15:33,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-10-07 17:15:33,939 INFO L87 Difference]: Start difference. First operand 979 states and 1526 transitions. Second operand 3 states. [2019-10-07 17:15:34,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:15:34,024 INFO L93 Difference]: Finished difference Result 1939 states and 3006 transitions. [2019-10-07 17:15:34,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 17:15:34,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-10-07 17:15:34,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:15:34,033 INFO L225 Difference]: With dead ends: 1939 [2019-10-07 17:15:34,033 INFO L226 Difference]: Without dead ends: 970 [2019-10-07 17:15:34,045 INFO L606 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-07 17:15:34,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2019-10-07 17:15:34,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 941. [2019-10-07 17:15:34,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2019-10-07 17:15:34,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1389 transitions. [2019-10-07 17:15:34,123 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1389 transitions. Word has length 72 [2019-10-07 17:15:34,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:15:34,124 INFO L462 AbstractCegarLoop]: Abstraction has 941 states and 1389 transitions. [2019-10-07 17:15:34,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 17:15:34,124 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1389 transitions. [2019-10-07 17:15:34,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-07 17:15:34,132 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:15:34,132 INFO L385 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-07 17:15:34,368 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:15:34,369 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:15:34,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:15:34,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1626708363, now seen corresponding path program 1 times [2019-10-07 17:15:34,369 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:15:34,369 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:34,370 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:34,370 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:34,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:15:34,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:15:34,453 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-07 17:15:34,453 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:34,453 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:15:34,453 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 17:15:34,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 17:15:34,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 17:15:34,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 17:15:34,455 INFO L87 Difference]: Start difference. First operand 941 states and 1389 transitions. Second operand 3 states. [2019-10-07 17:15:34,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:15:34,518 INFO L93 Difference]: Finished difference Result 948 states and 1399 transitions. [2019-10-07 17:15:34,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 17:15:34,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-10-07 17:15:34,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:15:34,526 INFO L225 Difference]: With dead ends: 948 [2019-10-07 17:15:34,526 INFO L226 Difference]: Without dead ends: 945 [2019-10-07 17:15:34,527 INFO L606 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-07 17:15:34,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-10-07 17:15:34,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 945. [2019-10-07 17:15:34,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2019-10-07 17:15:34,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1393 transitions. [2019-10-07 17:15:34,587 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1393 transitions. Word has length 82 [2019-10-07 17:15:34,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:15:34,587 INFO L462 AbstractCegarLoop]: Abstraction has 945 states and 1393 transitions. [2019-10-07 17:15:34,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 17:15:34,588 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1393 transitions. [2019-10-07 17:15:34,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-07 17:15:34,592 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:15:34,592 INFO L385 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-07 17:15:34,593 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:15:34,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:15:34,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1626655570, now seen corresponding path program 1 times [2019-10-07 17:15:34,593 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:15:34,593 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:34,594 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:34,594 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:34,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:15:34,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:15:34,979 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-07 17:15:34,980 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:34,980 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:15:34,980 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 17:15:35,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:15:35,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-07 17:15:35,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:15:35,348 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-07 17:15:35,348 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:15:35,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:35,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:35,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:35,541 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-07 17:15:35,542 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 17:15:35,542 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16, 6] total 26 [2019-10-07 17:15:35,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 17:15:35,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 17:15:35,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2019-10-07 17:15:35,544 INFO L87 Difference]: Start difference. First operand 945 states and 1393 transitions. Second operand 9 states. [2019-10-07 17:15:36,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:15:36,517 INFO L93 Difference]: Finished difference Result 4167 states and 6469 transitions. [2019-10-07 17:15:36,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-07 17:15:36,517 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-10-07 17:15:36,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:15:36,540 INFO L225 Difference]: With dead ends: 4167 [2019-10-07 17:15:36,540 INFO L226 Difference]: Without dead ends: 3232 [2019-10-07 17:15:36,551 INFO L606 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-07 17:15:36,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3232 states. [2019-10-07 17:15:36,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3232 to 3043. [2019-10-07 17:15:36,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3043 states. [2019-10-07 17:15:36,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3043 states to 3043 states and 4534 transitions. [2019-10-07 17:15:36,739 INFO L78 Accepts]: Start accepts. Automaton has 3043 states and 4534 transitions. Word has length 82 [2019-10-07 17:15:36,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:15:36,739 INFO L462 AbstractCegarLoop]: Abstraction has 3043 states and 4534 transitions. [2019-10-07 17:15:36,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 17:15:36,740 INFO L276 IsEmpty]: Start isEmpty. Operand 3043 states and 4534 transitions. [2019-10-07 17:15:36,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-07 17:15:36,770 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:15:36,770 INFO L385 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-07 17:15:36,975 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:15:36,976 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:15:36,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:15:36,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1549355052, now seen corresponding path program 1 times [2019-10-07 17:15:36,976 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:15:36,976 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:36,977 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:36,977 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:36,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:15:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:15:37,068 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-07 17:15:37,069 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:37,069 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:15:37,069 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 17:15:37,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 17:15:37,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 17:15:37,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-07 17:15:37,070 INFO L87 Difference]: Start difference. First operand 3043 states and 4534 transitions. Second operand 5 states. [2019-10-07 17:15:37,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:15:37,362 INFO L93 Difference]: Finished difference Result 5931 states and 8892 transitions. [2019-10-07 17:15:37,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 17:15:37,363 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-10-07 17:15:37,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:15:37,384 INFO L225 Difference]: With dead ends: 5931 [2019-10-07 17:15:37,385 INFO L226 Difference]: Without dead ends: 3185 [2019-10-07 17:15:37,405 INFO L606 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-07 17:15:37,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3185 states. [2019-10-07 17:15:37,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3185 to 3043. [2019-10-07 17:15:37,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3043 states. [2019-10-07 17:15:37,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3043 states to 3043 states and 4544 transitions. [2019-10-07 17:15:37,583 INFO L78 Accepts]: Start accepts. Automaton has 3043 states and 4544 transitions. Word has length 86 [2019-10-07 17:15:37,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:15:37,585 INFO L462 AbstractCegarLoop]: Abstraction has 3043 states and 4544 transitions. [2019-10-07 17:15:37,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 17:15:37,585 INFO L276 IsEmpty]: Start isEmpty. Operand 3043 states and 4544 transitions. [2019-10-07 17:15:37,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-07 17:15:37,606 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:15:37,607 INFO L385 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-07 17:15:37,607 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:15:37,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:15:37,607 INFO L82 PathProgramCache]: Analyzing trace with hash -857073703, now seen corresponding path program 1 times [2019-10-07 17:15:37,608 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:15:37,608 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:37,608 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:37,608 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:37,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:15:37,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:15:38,099 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-07 17:15:38,099 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:38,099 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:15:38,099 INFO L95 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-07 17:15:38,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:15:38,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 933 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-07 17:15:38,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:15:38,483 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-07 17:15:38,484 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:15:38,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:38,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:38,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:38,674 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-07 17:15:38,675 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 17:15:38,675 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [19, 6] total 29 [2019-10-07 17:15:38,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 17:15:38,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 17:15:38,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2019-10-07 17:15:38,676 INFO L87 Difference]: Start difference. First operand 3043 states and 4544 transitions. Second operand 9 states. [2019-10-07 17:15:39,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:15:39,815 INFO L93 Difference]: Finished difference Result 13801 states and 21165 transitions. [2019-10-07 17:15:39,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-07 17:15:39,816 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-10-07 17:15:39,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:15:39,905 INFO L225 Difference]: With dead ends: 13801 [2019-10-07 17:15:39,905 INFO L226 Difference]: Without dead ends: 10771 [2019-10-07 17:15:39,947 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 165 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=155, Invalid=1177, Unknown=0, NotChecked=0, Total=1332 [2019-10-07 17:15:39,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10771 states. [2019-10-07 17:15:40,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10771 to 10312. [2019-10-07 17:15:40,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10312 states. [2019-10-07 17:15:40,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10312 states to 10312 states and 15001 transitions. [2019-10-07 17:15:40,669 INFO L78 Accepts]: Start accepts. Automaton has 10312 states and 15001 transitions. Word has length 87 [2019-10-07 17:15:40,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:15:40,670 INFO L462 AbstractCegarLoop]: Abstraction has 10312 states and 15001 transitions. [2019-10-07 17:15:40,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 17:15:40,670 INFO L276 IsEmpty]: Start isEmpty. Operand 10312 states and 15001 transitions. [2019-10-07 17:15:40,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-07 17:15:40,768 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:15:40,769 INFO L385 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-07 17:15:40,974 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:15:40,975 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:15:40,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:15:40,975 INFO L82 PathProgramCache]: Analyzing trace with hash -747680870, now seen corresponding path program 1 times [2019-10-07 17:15:40,975 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:15:40,976 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:40,976 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:40,976 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:40,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:15:41,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:15:41,059 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-07 17:15:41,060 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:41,060 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:15:41,060 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 17:15:41,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 17:15:41,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 17:15:41,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-07 17:15:41,063 INFO L87 Difference]: Start difference. First operand 10312 states and 15001 transitions. Second operand 5 states. [2019-10-07 17:15:41,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:15:41,626 INFO L93 Difference]: Finished difference Result 19262 states and 28249 transitions. [2019-10-07 17:15:41,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 17:15:41,627 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-10-07 17:15:41,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:15:41,693 INFO L225 Difference]: With dead ends: 19262 [2019-10-07 17:15:41,693 INFO L226 Difference]: Without dead ends: 10539 [2019-10-07 17:15:41,741 INFO L606 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-07 17:15:41,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10539 states. [2019-10-07 17:15:42,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10539 to 10292. [2019-10-07 17:15:42,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10292 states. [2019-10-07 17:15:42,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10292 states to 10292 states and 14977 transitions. [2019-10-07 17:15:42,234 INFO L78 Accepts]: Start accepts. Automaton has 10292 states and 14977 transitions. Word has length 91 [2019-10-07 17:15:42,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:15:42,234 INFO L462 AbstractCegarLoop]: Abstraction has 10292 states and 14977 transitions. [2019-10-07 17:15:42,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 17:15:42,235 INFO L276 IsEmpty]: Start isEmpty. Operand 10292 states and 14977 transitions. [2019-10-07 17:15:42,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-07 17:15:42,315 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:15:42,315 INFO L385 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-07 17:15:42,315 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:15:42,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:15:42,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1922322228, now seen corresponding path program 1 times [2019-10-07 17:15:42,317 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:15:42,317 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:42,317 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:42,317 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:42,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:15:42,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:15:43,315 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-07 17:15:43,316 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:43,316 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:15:43,316 INFO L95 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-07 17:15:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:15:43,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 69 conjunts are in the unsatisfiable core [2019-10-07 17:15:43,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:15:43,930 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-07 17:15:43,931 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:15:44,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:44,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:44,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:44,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:44,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:44,288 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2019-10-07 17:15:44,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:44,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:44,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:44,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:44,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-07 17:15:44,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:44,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-07 17:15:44,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:44,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:44,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:44,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:44,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:44,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:44,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:45,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:45,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:45,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:45,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:45,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:45,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:45,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:45,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 17:15:45,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:45,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:45,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:45,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 17:15:45,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:45,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:45,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-07 17:15:45,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:45,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-07 17:15:45,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:45,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:45,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-07 17:15:45,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-07 17:15:45,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:45,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-07 17:15:45,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-07 17:15:45,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:45,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:45,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 17:15:45,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-07 17:15:45,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:45,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-07 17:15:45,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:45,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:45,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:45,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:45,516 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-07 17:15:45,517 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 17:15:45,559 INFO L162 IcfgInterpreter]: Started Sifa with 65 locations of interest [2019-10-07 17:15:45,559 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 17:15:45,565 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 17:15:45,572 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 17:15:45,572 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 17:15:46,072 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 144 for LOIs [2019-10-07 17:15:46,553 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 224 [2019-10-07 17:15:46,563 INFO L199 IcfgInterpreter]: Interpreting procedure start_simulation with input of size 116 for LOIs [2019-10-07 17:15:46,836 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-10-07 17:15:49,907 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-10-07 17:15:52,880 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-10-07 17:15:56,078 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:15:56,079 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:133) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε at de.uni_freiburg.informatik.ultimate.lib.sifa.PriorityWorklist.add(PriorityWorklist.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.lambda$2(DagInterpreter.java:135) at java.lang.Iterable.forEach(Iterable.java:75) at java.util.Collections$UnmodifiableCollection.forEach(Collections.java:1080) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:135) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:104) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.computeTopSummary(TopInputCallSummarizer.java:78) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:67) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:230) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:214) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:197) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:166) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.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 17:15:56,086 INFO L168 Benchmark]: Toolchain (without parser) took 28053.01 ms. Allocated memory was 145.8 MB in the beginning and 888.7 MB in the end (delta: 742.9 MB). Free memory was 102.0 MB in the beginning and 511.7 MB in the end (delta: -409.7 MB). Peak memory consumption was 333.3 MB. Max. memory is 7.1 GB. [2019-10-07 17:15:56,087 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.8 MB. Free memory was 120.9 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-07 17:15:56,088 INFO L168 Benchmark]: CACSL2BoogieTranslator took 511.96 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.8 MB in the beginning and 178.8 MB in the end (delta: -77.0 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. [2019-10-07 17:15:56,089 INFO L168 Benchmark]: Boogie Preprocessor took 51.97 ms. Allocated memory is still 202.9 MB. Free memory was 178.8 MB in the beginning and 176.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-10-07 17:15:56,090 INFO L168 Benchmark]: RCFGBuilder took 1487.77 ms. Allocated memory was 202.9 MB in the beginning and 235.4 MB in the end (delta: 32.5 MB). Free memory was 176.1 MB in the beginning and 164.1 MB in the end (delta: 12.1 MB). Peak memory consumption was 89.5 MB. Max. memory is 7.1 GB. [2019-10-07 17:15:56,091 INFO L168 Benchmark]: TraceAbstraction took 25996.65 ms. Allocated memory was 235.4 MB in the beginning and 888.7 MB in the end (delta: 653.3 MB). Free memory was 164.1 MB in the beginning and 511.7 MB in the end (delta: -347.6 MB). Peak memory consumption was 305.6 MB. Max. memory is 7.1 GB. [2019-10-07 17:15:56,100 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.22 ms. Allocated memory is still 145.8 MB. Free memory was 120.9 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 511.96 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.8 MB in the beginning and 178.8 MB in the end (delta: -77.0 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.97 ms. Allocated memory is still 202.9 MB. Free memory was 178.8 MB in the beginning and 176.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1487.77 ms. Allocated memory was 202.9 MB in the beginning and 235.4 MB in the end (delta: 32.5 MB). Free memory was 176.1 MB in the beginning and 164.1 MB in the end (delta: 12.1 MB). Peak memory consumption was 89.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 25996.65 ms. Allocated memory was 235.4 MB in the beginning and 888.7 MB in the end (delta: 653.3 MB). Free memory was 164.1 MB in the beginning and 511.7 MB in the end (delta: -347.6 MB). Peak memory consumption was 305.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...