./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e6092b6e2bef07c2401a6d2b7c5ee309bc5dbc34 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 00:25:08,119 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:25:08,121 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:25:08,133 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:25:08,134 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:25:08,135 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:25:08,136 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:25:08,138 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:25:08,140 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:25:08,141 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:25:08,142 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:25:08,144 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:25:08,144 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:25:08,145 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:25:08,146 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:25:08,147 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:25:08,148 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:25:08,150 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:25:08,151 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:25:08,153 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:25:08,155 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:25:08,156 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:25:08,158 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:25:08,159 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:25:08,161 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:25:08,162 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:25:08,162 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:25:08,163 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:25:08,163 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:25:08,164 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:25:08,165 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:25:08,166 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:25:08,167 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:25:08,168 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:25:08,169 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:25:08,172 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:25:08,173 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:25:08,174 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:25:08,174 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:25:08,175 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:25:08,179 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:25:08,181 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:25:08,206 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:25:08,206 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:25:08,208 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:25:08,209 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:25:08,209 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:25:08,209 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:25:08,210 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:25:08,210 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:25:08,210 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:25:08,211 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:25:08,212 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:25:08,212 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:25:08,212 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:25:08,213 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:25:08,213 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:25:08,213 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:25:08,214 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:25:08,214 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:25:08,214 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:25:08,215 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:25:08,215 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:25:08,215 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:25:08,216 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:25:08,216 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:25:08,216 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:25:08,217 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:25:08,217 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:25:08,217 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:25:08,218 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e6092b6e2bef07c2401a6d2b7c5ee309bc5dbc34 [2019-11-28 00:25:08,543 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:25:08,560 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:25:08,564 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:25:08,566 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:25:08,567 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:25:08,568 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c [2019-11-28 00:25:08,643 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ad01b0c8/72e50cc0aca64ebe9d9ed2c182907cb9/FLAGcd35c18ba [2019-11-28 00:25:09,116 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:25:09,119 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c [2019-11-28 00:25:09,127 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ad01b0c8/72e50cc0aca64ebe9d9ed2c182907cb9/FLAGcd35c18ba [2019-11-28 00:25:09,517 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ad01b0c8/72e50cc0aca64ebe9d9ed2c182907cb9 [2019-11-28 00:25:09,521 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:25:09,523 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:25:09,524 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:25:09,525 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:25:09,529 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:25:09,530 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:25:09" (1/1) ... [2019-11-28 00:25:09,533 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@569f7f9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:09, skipping insertion in model container [2019-11-28 00:25:09,533 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:25:09" (1/1) ... [2019-11-28 00:25:09,542 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:25:09,561 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:25:09,748 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:25:09,752 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:25:09,774 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:25:09,785 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:25:09,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:09 WrapperNode [2019-11-28 00:25:09,785 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:25:09,788 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:25:09,788 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:25:09,788 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:25:09,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:09" (1/1) ... [2019-11-28 00:25:09,801 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:09" (1/1) ... [2019-11-28 00:25:09,869 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:25:09,869 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:25:09,869 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:25:09,870 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:25:09,879 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:09" (1/1) ... [2019-11-28 00:25:09,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:09" (1/1) ... [2019-11-28 00:25:09,880 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:09" (1/1) ... [2019-11-28 00:25:09,881 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:09" (1/1) ... [2019-11-28 00:25:09,883 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:09" (1/1) ... [2019-11-28 00:25:09,886 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:09" (1/1) ... [2019-11-28 00:25:09,887 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:09" (1/1) ... [2019-11-28 00:25:09,888 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:25:09,889 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:25:09,889 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:25:09,889 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:25:09,890 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:09" (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-11-28 00:25:09,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:25:09,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:25:09,951 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2019-11-28 00:25:09,951 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2019-11-28 00:25:09,952 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2019-11-28 00:25:09,952 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2019-11-28 00:25:10,146 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:25:10,146 INFO L297 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 00:25:10,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:25:10 BoogieIcfgContainer [2019-11-28 00:25:10,148 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:25:10,150 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:25:10,150 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:25:10,153 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:25:10,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:25:09" (1/3) ... [2019-11-28 00:25:10,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5330b92c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:25:10, skipping insertion in model container [2019-11-28 00:25:10,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:09" (2/3) ... [2019-11-28 00:25:10,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5330b92c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:25:10, skipping insertion in model container [2019-11-28 00:25:10,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:25:10" (3/3) ... [2019-11-28 00:25:10,158 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_5-1.c [2019-11-28 00:25:10,173 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:25:10,188 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 00:25:10,208 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 00:25:10,242 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:25:10,243 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:25:10,243 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:25:10,243 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:25:10,244 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:25:10,244 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:25:10,244 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:25:10,245 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:25:10,265 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-11-28 00:25:10,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 00:25:10,272 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:10,274 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:10,274 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:10,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:10,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1871295635, now seen corresponding path program 1 times [2019-11-28 00:25:10,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:10,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220655654] [2019-11-28 00:25:10,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:10,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:10,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:25:10,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220655654] [2019-11-28 00:25:10,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:25:10,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:25:10,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25367927] [2019-11-28 00:25:10,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:25:10,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:10,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:25:10,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:25:10,584 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. [2019-11-28 00:25:10,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:10,730 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2019-11-28 00:25:10,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:25:10,732 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-28 00:25:10,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:10,743 INFO L225 Difference]: With dead ends: 38 [2019-11-28 00:25:10,743 INFO L226 Difference]: Without dead ends: 26 [2019-11-28 00:25:10,747 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:25:10,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-28 00:25:10,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-28 00:25:10,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 00:25:10,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-11-28 00:25:10,790 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2019-11-28 00:25:10,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:10,790 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-28 00:25:10,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:25:10,791 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-11-28 00:25:10,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 00:25:10,792 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:10,793 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:10,793 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:10,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:10,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1404217650, now seen corresponding path program 1 times [2019-11-28 00:25:10,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:10,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483867331] [2019-11-28 00:25:10,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:10,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:25:10,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483867331] [2019-11-28 00:25:10,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:25:10,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:25:10,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435890334] [2019-11-28 00:25:10,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:25:10,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:10,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:25:10,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:25:10,852 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 5 states. [2019-11-28 00:25:10,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:10,918 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2019-11-28 00:25:10,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:25:10,919 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-28 00:25:10,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:10,921 INFO L225 Difference]: With dead ends: 32 [2019-11-28 00:25:10,921 INFO L226 Difference]: Without dead ends: 28 [2019-11-28 00:25:10,922 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:25:10,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-28 00:25:10,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-11-28 00:25:10,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 00:25:10,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-11-28 00:25:10,931 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2019-11-28 00:25:10,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:10,931 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-28 00:25:10,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:25:10,931 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-11-28 00:25:10,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 00:25:10,933 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:10,933 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:10,933 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:10,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:10,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1629927371, now seen corresponding path program 1 times [2019-11-28 00:25:10,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:10,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774739705] [2019-11-28 00:25:10,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:10,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:11,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:11,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:11,146 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 00:25:11,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774739705] [2019-11-28 00:25:11,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751962622] [2019-11-28 00:25:11,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:11,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 00:25:11,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:11,300 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 00:25:11,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:11,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2019-11-28 00:25:11,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219519905] [2019-11-28 00:25:11,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 00:25:11,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:11,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 00:25:11,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-28 00:25:11,305 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 10 states. [2019-11-28 00:25:11,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:11,473 INFO L93 Difference]: Finished difference Result 59 states and 83 transitions. [2019-11-28 00:25:11,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 00:25:11,475 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-28 00:25:11,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:11,476 INFO L225 Difference]: With dead ends: 59 [2019-11-28 00:25:11,477 INFO L226 Difference]: Without dead ends: 35 [2019-11-28 00:25:11,478 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-28 00:25:11,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-28 00:25:11,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2019-11-28 00:25:11,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-28 00:25:11,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2019-11-28 00:25:11,488 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 22 [2019-11-28 00:25:11,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:11,488 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2019-11-28 00:25:11,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 00:25:11,489 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2019-11-28 00:25:11,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 00:25:11,491 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:11,491 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:11,696 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:11,701 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:11,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:11,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1285987244, now seen corresponding path program 1 times [2019-11-28 00:25:11,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:11,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768919272] [2019-11-28 00:25:11,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:11,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:11,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:11,845 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 00:25:11,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768919272] [2019-11-28 00:25:11,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516284232] [2019-11-28 00:25:11,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:11,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:11,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 00:25:11,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:11,923 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 00:25:11,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:11,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2019-11-28 00:25:11,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255849374] [2019-11-28 00:25:11,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 00:25:11,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:11,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 00:25:11,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-28 00:25:11,927 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand 10 states. [2019-11-28 00:25:12,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:12,169 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2019-11-28 00:25:12,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:25:12,170 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-11-28 00:25:12,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:12,173 INFO L225 Difference]: With dead ends: 55 [2019-11-28 00:25:12,174 INFO L226 Difference]: Without dead ends: 51 [2019-11-28 00:25:12,175 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-28 00:25:12,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-28 00:25:12,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2019-11-28 00:25:12,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-28 00:25:12,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2019-11-28 00:25:12,194 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 23 [2019-11-28 00:25:12,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:12,196 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2019-11-28 00:25:12,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 00:25:12,197 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2019-11-28 00:25:12,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 00:25:12,202 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:12,203 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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-11-28 00:25:12,407 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:12,408 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:12,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:12,408 INFO L82 PathProgramCache]: Analyzing trace with hash -649262923, now seen corresponding path program 1 times [2019-11-28 00:25:12,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:12,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718513676] [2019-11-28 00:25:12,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:12,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:12,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:12,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:12,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:12,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:12,595 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 00:25:12,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718513676] [2019-11-28 00:25:12,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479608898] [2019-11-28 00:25:12,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:12,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:12,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 00:25:12,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:12,716 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 00:25:12,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:12,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2019-11-28 00:25:12,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592188535] [2019-11-28 00:25:12,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 00:25:12,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:12,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 00:25:12,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-28 00:25:12,719 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand 12 states. [2019-11-28 00:25:13,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:13,043 INFO L93 Difference]: Finished difference Result 114 states and 187 transitions. [2019-11-28 00:25:13,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 00:25:13,043 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2019-11-28 00:25:13,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:13,046 INFO L225 Difference]: With dead ends: 114 [2019-11-28 00:25:13,046 INFO L226 Difference]: Without dead ends: 68 [2019-11-28 00:25:13,048 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2019-11-28 00:25:13,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-28 00:25:13,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-11-28 00:25:13,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-28 00:25:13,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 98 transitions. [2019-11-28 00:25:13,066 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 98 transitions. Word has length 35 [2019-11-28 00:25:13,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:13,066 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 98 transitions. [2019-11-28 00:25:13,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 00:25:13,067 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 98 transitions. [2019-11-28 00:25:13,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 00:25:13,069 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:13,069 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-28 00:25:13,276 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:13,277 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:13,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:13,278 INFO L82 PathProgramCache]: Analyzing trace with hash 2000747716, now seen corresponding path program 1 times [2019-11-28 00:25:13,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:13,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755982466] [2019-11-28 00:25:13,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:13,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:13,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:13,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:13,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:13,432 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 00:25:13,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755982466] [2019-11-28 00:25:13,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831919115] [2019-11-28 00:25:13,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:13,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 00:25:13,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:13,549 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 00:25:13,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:13,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2019-11-28 00:25:13,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573399367] [2019-11-28 00:25:13,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 00:25:13,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:13,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 00:25:13,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-28 00:25:13,552 INFO L87 Difference]: Start difference. First operand 66 states and 98 transitions. Second operand 12 states. [2019-11-28 00:25:13,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:13,836 INFO L93 Difference]: Finished difference Result 147 states and 239 transitions. [2019-11-28 00:25:13,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 00:25:13,837 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2019-11-28 00:25:13,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:13,839 INFO L225 Difference]: With dead ends: 147 [2019-11-28 00:25:13,839 INFO L226 Difference]: Without dead ends: 83 [2019-11-28 00:25:13,842 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2019-11-28 00:25:13,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-28 00:25:13,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 66. [2019-11-28 00:25:13,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-28 00:25:13,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 96 transitions. [2019-11-28 00:25:13,857 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 96 transitions. Word has length 36 [2019-11-28 00:25:13,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:13,857 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 96 transitions. [2019-11-28 00:25:13,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 00:25:13,858 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 96 transitions. [2019-11-28 00:25:13,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 00:25:13,860 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:13,861 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:14,064 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:14,065 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:14,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:14,066 INFO L82 PathProgramCache]: Analyzing trace with hash -434541687, now seen corresponding path program 1 times [2019-11-28 00:25:14,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:14,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464578628] [2019-11-28 00:25:14,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:14,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:14,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:14,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:14,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:14,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:14,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:14,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:14,265 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-28 00:25:14,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464578628] [2019-11-28 00:25:14,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514060660] [2019-11-28 00:25:14,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:14,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 00:25:14,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:14,402 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-28 00:25:14,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:14,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2019-11-28 00:25:14,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716475771] [2019-11-28 00:25:14,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-28 00:25:14,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:14,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 00:25:14,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-11-28 00:25:14,404 INFO L87 Difference]: Start difference. First operand 66 states and 96 transitions. Second operand 16 states. [2019-11-28 00:25:14,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:14,945 INFO L93 Difference]: Finished difference Result 164 states and 279 transitions. [2019-11-28 00:25:14,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 00:25:14,946 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2019-11-28 00:25:14,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:14,949 INFO L225 Difference]: With dead ends: 164 [2019-11-28 00:25:14,949 INFO L226 Difference]: Without dead ends: 100 [2019-11-28 00:25:14,950 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2019-11-28 00:25:14,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-28 00:25:14,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2019-11-28 00:25:14,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-28 00:25:14,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 145 transitions. [2019-11-28 00:25:14,969 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 145 transitions. Word has length 50 [2019-11-28 00:25:14,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:14,969 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 145 transitions. [2019-11-28 00:25:14,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-28 00:25:14,970 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 145 transitions. [2019-11-28 00:25:14,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-28 00:25:14,974 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:14,974 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:15,180 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:15,181 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:15,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:15,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1917551255, now seen corresponding path program 1 times [2019-11-28 00:25:15,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:15,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477843097] [2019-11-28 00:25:15,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:15,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:15,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:15,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:15,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:15,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:15,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:15,466 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 33 proven. 58 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-11-28 00:25:15,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477843097] [2019-11-28 00:25:15,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811873430] [2019-11-28 00:25:15,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:15,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:15,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 00:25:15,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:15,627 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 23 proven. 65 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-28 00:25:15,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:15,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 17 [2019-11-28 00:25:15,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67875621] [2019-11-28 00:25:15,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-28 00:25:15,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:15,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-28 00:25:15,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-11-28 00:25:15,630 INFO L87 Difference]: Start difference. First operand 89 states and 145 transitions. Second operand 17 states. [2019-11-28 00:25:16,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:16,145 INFO L93 Difference]: Finished difference Result 222 states and 415 transitions. [2019-11-28 00:25:16,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-28 00:25:16,146 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 91 [2019-11-28 00:25:16,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:16,150 INFO L225 Difference]: With dead ends: 222 [2019-11-28 00:25:16,150 INFO L226 Difference]: Without dead ends: 138 [2019-11-28 00:25:16,152 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2019-11-28 00:25:16,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-11-28 00:25:16,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 112. [2019-11-28 00:25:16,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-28 00:25:16,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 186 transitions. [2019-11-28 00:25:16,187 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 186 transitions. Word has length 91 [2019-11-28 00:25:16,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:16,188 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 186 transitions. [2019-11-28 00:25:16,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-28 00:25:16,188 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 186 transitions. [2019-11-28 00:25:16,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-28 00:25:16,196 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:16,196 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 8, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:16,397 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:16,397 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:16,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:16,398 INFO L82 PathProgramCache]: Analyzing trace with hash -590215841, now seen corresponding path program 2 times [2019-11-28 00:25:16,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:16,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492979430] [2019-11-28 00:25:16,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:16,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:16,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:16,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:16,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:16,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:16,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:16,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:16,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:16,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:16,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:16,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:16,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:16,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:16,997 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 100 proven. 152 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2019-11-28 00:25:16,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492979430] [2019-11-28 00:25:16,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116801686] [2019-11-28 00:25:16,998 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:17,076 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 00:25:17,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:17,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 00:25:17,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:17,249 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 81 proven. 83 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2019-11-28 00:25:17,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:17,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10] total 26 [2019-11-28 00:25:17,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433710926] [2019-11-28 00:25:17,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-28 00:25:17,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:17,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-28 00:25:17,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2019-11-28 00:25:17,255 INFO L87 Difference]: Start difference. First operand 112 states and 186 transitions. Second operand 26 states. [2019-11-28 00:25:18,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:18,147 INFO L93 Difference]: Finished difference Result 285 states and 569 transitions. [2019-11-28 00:25:18,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-28 00:25:18,148 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 132 [2019-11-28 00:25:18,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:18,150 INFO L225 Difference]: With dead ends: 285 [2019-11-28 00:25:18,151 INFO L226 Difference]: Without dead ends: 105 [2019-11-28 00:25:18,154 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=244, Invalid=1478, Unknown=0, NotChecked=0, Total=1722 [2019-11-28 00:25:18,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-28 00:25:18,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 83. [2019-11-28 00:25:18,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-28 00:25:18,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 108 transitions. [2019-11-28 00:25:18,165 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 108 transitions. Word has length 132 [2019-11-28 00:25:18,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:18,166 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 108 transitions. [2019-11-28 00:25:18,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-28 00:25:18,166 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 108 transitions. [2019-11-28 00:25:18,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-28 00:25:18,168 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:18,169 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:18,373 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:18,373 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:18,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:18,374 INFO L82 PathProgramCache]: Analyzing trace with hash 350372983, now seen corresponding path program 3 times [2019-11-28 00:25:18,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:18,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067045722] [2019-11-28 00:25:18,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:18,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:18,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:18,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:18,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:18,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:18,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:18,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:18,715 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 105 proven. 103 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-11-28 00:25:18,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067045722] [2019-11-28 00:25:18,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951918139] [2019-11-28 00:25:18,716 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:18,760 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-28 00:25:18,761 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:18,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 00:25:18,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:18,850 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 139 proven. 18 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2019-11-28 00:25:18,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:18,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10] total 23 [2019-11-28 00:25:18,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225833580] [2019-11-28 00:25:18,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-28 00:25:18,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:18,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-28 00:25:18,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2019-11-28 00:25:18,854 INFO L87 Difference]: Start difference. First operand 83 states and 108 transitions. Second operand 23 states. [2019-11-28 00:25:19,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:19,509 INFO L93 Difference]: Finished difference Result 176 states and 247 transitions. [2019-11-28 00:25:19,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-28 00:25:19,510 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 119 [2019-11-28 00:25:19,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:19,512 INFO L225 Difference]: With dead ends: 176 [2019-11-28 00:25:19,512 INFO L226 Difference]: Without dead ends: 86 [2019-11-28 00:25:19,514 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=1057, Unknown=0, NotChecked=0, Total=1260 [2019-11-28 00:25:19,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-28 00:25:19,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2019-11-28 00:25:19,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-28 00:25:19,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 100 transitions. [2019-11-28 00:25:19,525 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 100 transitions. Word has length 119 [2019-11-28 00:25:19,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:19,526 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 100 transitions. [2019-11-28 00:25:19,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-28 00:25:19,526 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 100 transitions. [2019-11-28 00:25:19,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-28 00:25:19,527 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:19,528 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:19,741 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:19,741 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:19,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:19,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1882786525, now seen corresponding path program 4 times [2019-11-28 00:25:19,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:19,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326598777] [2019-11-28 00:25:19,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:19,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:19,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:19,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:19,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:19,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:19,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:19,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:20,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:20,034 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 60 proven. 49 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-28 00:25:20,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326598777] [2019-11-28 00:25:20,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522238666] [2019-11-28 00:25:20,035 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:20,083 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 00:25:20,083 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:20,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 00:25:20,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:20,157 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 58 proven. 15 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-11-28 00:25:20,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:20,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8] total 19 [2019-11-28 00:25:20,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127871726] [2019-11-28 00:25:20,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-28 00:25:20,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:20,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-28 00:25:20,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2019-11-28 00:25:20,159 INFO L87 Difference]: Start difference. First operand 83 states and 100 transitions. Second operand 19 states. [2019-11-28 00:25:20,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:20,502 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2019-11-28 00:25:20,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-28 00:25:20,503 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 91 [2019-11-28 00:25:20,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:20,504 INFO L225 Difference]: With dead ends: 103 [2019-11-28 00:25:20,504 INFO L226 Difference]: Without dead ends: 92 [2019-11-28 00:25:20,505 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2019-11-28 00:25:20,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-28 00:25:20,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2019-11-28 00:25:20,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-28 00:25:20,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 102 transitions. [2019-11-28 00:25:20,511 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 102 transitions. Word has length 91 [2019-11-28 00:25:20,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:20,511 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 102 transitions. [2019-11-28 00:25:20,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-28 00:25:20,511 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 102 transitions. [2019-11-28 00:25:20,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-28 00:25:20,513 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:20,513 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:20,713 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:20,714 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:20,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:20,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1335172610, now seen corresponding path program 5 times [2019-11-28 00:25:20,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:20,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81123608] [2019-11-28 00:25:20,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:20,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:20,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:20,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:21,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:21,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:21,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:21,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:21,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:21,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:21,432 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2019-11-28 00:25:21,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81123608] [2019-11-28 00:25:21,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174660410] [2019-11-28 00:25:21,433 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:21,496 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-28 00:25:21,496 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:21,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 63 conjunts are in the unsatisfiable core [2019-11-28 00:25:21,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:21,901 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2019-11-28 00:25:21,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:21,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 28 [2019-11-28 00:25:21,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212013153] [2019-11-28 00:25:21,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-28 00:25:21,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:21,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-28 00:25:21,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=691, Unknown=0, NotChecked=0, Total=756 [2019-11-28 00:25:21,903 INFO L87 Difference]: Start difference. First operand 87 states and 102 transitions. Second operand 28 states. [2019-11-28 00:25:22,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:22,189 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2019-11-28 00:25:22,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-28 00:25:22,190 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 105 [2019-11-28 00:25:22,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:22,191 INFO L225 Difference]: With dead ends: 100 [2019-11-28 00:25:22,191 INFO L226 Difference]: Without dead ends: 90 [2019-11-28 00:25:22,192 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 133 SyntacticMatches, 8 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=691, Unknown=0, NotChecked=0, Total=756 [2019-11-28 00:25:22,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-28 00:25:22,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-11-28 00:25:22,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-28 00:25:22,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 105 transitions. [2019-11-28 00:25:22,198 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 105 transitions. Word has length 105 [2019-11-28 00:25:22,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:22,199 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 105 transitions. [2019-11-28 00:25:22,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-28 00:25:22,199 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 105 transitions. [2019-11-28 00:25:22,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-28 00:25:22,200 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:22,200 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:22,405 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:22,405 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:22,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:22,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1449179333, now seen corresponding path program 6 times [2019-11-28 00:25:22,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:22,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880024263] [2019-11-28 00:25:22,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:22,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:22,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:22,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:22,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:22,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:22,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:22,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:22,548 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 71 proven. 6 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-11-28 00:25:22,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880024263] [2019-11-28 00:25:22,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075978807] [2019-11-28 00:25:22,549 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:22,658 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-11-28 00:25:22,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:22,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 00:25:22,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:22,700 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-11-28 00:25:22,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 00:25:22,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2019-11-28 00:25:22,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964503186] [2019-11-28 00:25:22,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:25:22,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:22,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:25:22,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:25:22,708 INFO L87 Difference]: Start difference. First operand 89 states and 105 transitions. Second operand 6 states. [2019-11-28 00:25:22,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:22,775 INFO L93 Difference]: Finished difference Result 101 states and 117 transitions. [2019-11-28 00:25:22,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:25:22,776 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2019-11-28 00:25:22,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:22,777 INFO L225 Difference]: With dead ends: 101 [2019-11-28 00:25:22,777 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 00:25:22,777 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:25:22,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 00:25:22,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 00:25:22,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 00:25:22,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 00:25:22,781 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 104 [2019-11-28 00:25:22,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:22,781 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 00:25:22,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:25:22,782 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 00:25:22,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 00:25:22,986 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:22,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 00:25:23,588 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 25 [2019-11-28 00:25:23,878 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 22 [2019-11-28 00:25:23,881 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 00:25:23,882 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 00:25:23,882 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 00:25:23,882 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2019-11-28 00:25:23,882 INFO L242 CegarLoopResult]: At program point L41(lines 35 42) the Hoare annotation is: (<= 5 ULTIMATE.start_main_~x~0) [2019-11-28 00:25:23,882 INFO L246 CegarLoopResult]: For program point L39(line 39) no Hoare annotation was computed. [2019-11-28 00:25:23,882 INFO L246 CegarLoopResult]: For program point L38(lines 38 40) no Hoare annotation was computed. [2019-11-28 00:25:23,883 INFO L242 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (and (<= 5 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 5)) [2019-11-28 00:25:23,883 INFO L246 CegarLoopResult]: For program point L37-1(line 37) no Hoare annotation was computed. [2019-11-28 00:25:23,883 INFO L246 CegarLoopResult]: For program point L38-2(lines 38 40) no Hoare annotation was computed. [2019-11-28 00:25:23,883 INFO L249 CegarLoopResult]: At program point fibo2ENTRY(lines 17 25) the Hoare annotation is: true [2019-11-28 00:25:23,883 INFO L242 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (not (<= |fibo2_#in~n| 2))) [2019-11-28 00:25:23,884 INFO L246 CegarLoopResult]: For program point L23-1(line 23) no Hoare annotation was computed. [2019-11-28 00:25:23,884 INFO L242 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: (and (or (and (<= 1 |fibo2_#t~ret2|) (<= |fibo2_#t~ret2| 1)) (<= 4 fibo2_~n)) (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= |fibo2_#in~n| 3) .cse0) (and (<= |fibo2_#t~ret2| 2) .cse0 (<= 2 |fibo2_#t~ret2|)) (and (<= 5 |fibo2_#in~n|) .cse0))) (not (<= |fibo2_#in~n| 2))) [2019-11-28 00:25:23,884 INFO L246 CegarLoopResult]: For program point L20(lines 20 24) no Hoare annotation was computed. [2019-11-28 00:25:23,884 INFO L246 CegarLoopResult]: For program point L23-3(line 23) no Hoare annotation was computed. [2019-11-28 00:25:23,884 INFO L246 CegarLoopResult]: For program point L18(lines 18 24) no Hoare annotation was computed. [2019-11-28 00:25:23,884 INFO L246 CegarLoopResult]: For program point fibo2FINAL(lines 17 25) no Hoare annotation was computed. [2019-11-28 00:25:23,885 INFO L246 CegarLoopResult]: For program point fibo2EXIT(lines 17 25) no Hoare annotation was computed. [2019-11-28 00:25:23,885 INFO L249 CegarLoopResult]: At program point fibo1ENTRY(lines 7 15) the Hoare annotation is: true [2019-11-28 00:25:23,885 INFO L242 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (not (<= |fibo1_#in~n| 1)) (= fibo1_~n |fibo1_#in~n|)) [2019-11-28 00:25:23,885 INFO L246 CegarLoopResult]: For program point L13-1(line 13) no Hoare annotation was computed. [2019-11-28 00:25:23,885 INFO L242 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (and (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 4 fibo1_~n) .cse0) (and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1) .cse0))) (< 1 fibo1_~n) (or (<= 6 |fibo1_#in~n|) (and (<= 3 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 3)) (<= |fibo1_#in~n| 4))) [2019-11-28 00:25:23,885 INFO L246 CegarLoopResult]: For program point fibo1FINAL(lines 7 15) no Hoare annotation was computed. [2019-11-28 00:25:23,885 INFO L246 CegarLoopResult]: For program point L10(lines 10 14) no Hoare annotation was computed. [2019-11-28 00:25:23,885 INFO L246 CegarLoopResult]: For program point L13-3(line 13) no Hoare annotation was computed. [2019-11-28 00:25:23,886 INFO L246 CegarLoopResult]: For program point L8(lines 8 14) no Hoare annotation was computed. [2019-11-28 00:25:23,886 INFO L246 CegarLoopResult]: For program point fibo1EXIT(lines 7 15) no Hoare annotation was computed. [2019-11-28 00:25:23,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:25:23 BoogieIcfgContainer [2019-11-28 00:25:23,900 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:25:23,901 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:25:23,901 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:25:23,901 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:25:23,902 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:25:10" (3/4) ... [2019-11-28 00:25:23,904 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 00:25:23,910 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo2 [2019-11-28 00:25:23,910 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo1 [2019-11-28 00:25:23,915 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 00:25:23,915 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 00:25:23,959 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:25:23,960 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:25:23,961 INFO L168 Benchmark]: Toolchain (without parser) took 14438.62 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 384.3 MB). Free memory was 953.7 MB in the beginning and 1.2 GB in the end (delta: -218.1 MB). Peak memory consumption was 166.2 MB. Max. memory is 11.5 GB. [2019-11-28 00:25:23,962 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:25:23,963 INFO L168 Benchmark]: CACSL2BoogieTranslator took 263.12 ms. Allocated memory is still 1.0 GB. Free memory was 953.7 MB in the beginning and 941.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-11-28 00:25:23,963 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -190.5 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. [2019-11-28 00:25:23,964 INFO L168 Benchmark]: Boogie Preprocessor took 19.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-11-28 00:25:23,964 INFO L168 Benchmark]: RCFGBuilder took 259.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:25:23,965 INFO L168 Benchmark]: TraceAbstraction took 13750.55 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 255.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -70.5 MB). Peak memory consumption was 184.8 MB. Max. memory is 11.5 GB. [2019-11-28 00:25:23,966 INFO L168 Benchmark]: Witness Printer took 59.14 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-11-28 00:25:23,969 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 263.12 ms. Allocated memory is still 1.0 GB. Free memory was 953.7 MB in the beginning and 941.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 81.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -190.5 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 259.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13750.55 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 255.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -70.5 MB). Peak memory consumption was 184.8 MB. Max. memory is 11.5 GB. * Witness Printer took 59.14 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: 5 <= x - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 1 error locations. Result: SAFE, OverallTime: 12.7s, OverallIterations: 13, TraceHistogramMax: 10, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, HoareTripleCheckerStatistics: 350 SDtfs, 544 SDslu, 2847 SDs, 0 SdLazy, 3657 SolverSat, 544 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1266 GetRequests, 1021 SyntacticMatches, 10 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1129 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 94 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 368 PreInvPairs, 511 NumberOfFragments, 105 HoareAnnotationTreeSize, 368 FomulaSimplifications, 1916 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 8 FomulaSimplificationsInter, 3623 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 1635 NumberOfCodeBlocks, 1541 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1611 ConstructedInterpolants, 0 QuantifiedInterpolants, 319341 SizeOfPredicates, 41 NumberOfNonLiveVariables, 1595 ConjunctsInSsa, 145 ConjunctsInUnsatCore, 24 InterpolantComputations, 3 PerfectInterpolantSequences, 2724/3528 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...