./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/NestedRecursion_2c.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows 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/termination-crafted/NestedRecursion_2c.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 14df269faa4a77275028af94d8141ab36c184cf5 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 02:50:09,082 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:50:09,085 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:50:09,097 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:50:09,097 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:50:09,099 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:50:09,100 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:50:09,102 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:50:09,104 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:50:09,105 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:50:09,106 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:50:09,107 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:50:09,108 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:50:09,109 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:50:09,110 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:50:09,112 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:50:09,113 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:50:09,114 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:50:09,116 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:50:09,121 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:50:09,125 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:50:09,130 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:50:09,131 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:50:09,134 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:50:09,140 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:50:09,142 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:50:09,142 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:50:09,143 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:50:09,147 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:50:09,148 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:50:09,150 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:50:09,151 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:50:09,152 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:50:09,152 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:50:09,154 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:50:09,156 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:50:09,158 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:50:09,159 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:50:09,159 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:50:09,160 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:50:09,164 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:50:09,165 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-11-28 02:50:09,180 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:50:09,183 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:50:09,184 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:50:09,185 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:50:09,186 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:50:09,186 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:50:09,186 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:50:09,187 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:50:09,187 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:50:09,187 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 02:50:09,188 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:50:09,189 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 02:50:09,189 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-28 02:50:09,190 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 02:50:09,190 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:50:09,191 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 02:50:09,191 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:50:09,191 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:50:09,192 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:50:09,192 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:50:09,192 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:50:09,193 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:50:09,193 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:50:09,193 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 02:50:09,194 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:50:09,194 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:50:09,194 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 02:50:09,194 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 ! overflow) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 14df269faa4a77275028af94d8141ab36c184cf5 [2019-11-28 02:50:09,532 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:50:09,544 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:50:09,548 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:50:09,549 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:50:09,550 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:50:09,551 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NestedRecursion_2c.c [2019-11-28 02:50:09,610 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13f5138f5/1bb24af91e5243f3981066b713b53162/FLAGcbb885492 [2019-11-28 02:50:10,063 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:50:10,064 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NestedRecursion_2c.c [2019-11-28 02:50:10,071 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13f5138f5/1bb24af91e5243f3981066b713b53162/FLAGcbb885492 [2019-11-28 02:50:10,456 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13f5138f5/1bb24af91e5243f3981066b713b53162 [2019-11-28 02:50:10,460 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:50:10,462 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 02:50:10,463 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:50:10,463 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:50:10,467 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:50:10,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:50:10" (1/1) ... [2019-11-28 02:50:10,470 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4af92336 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:10, skipping insertion in model container [2019-11-28 02:50:10,471 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:50:10" (1/1) ... [2019-11-28 02:50:10,479 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:50:10,493 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:50:10,669 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:50:10,673 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:50:10,690 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:50:10,704 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:50:10,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:10 WrapperNode [2019-11-28 02:50:10,705 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:50:10,706 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 02:50:10,707 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 02:50:10,707 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 02:50:10,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:10" (1/1) ... [2019-11-28 02:50:10,721 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:10" (1/1) ... [2019-11-28 02:50:10,795 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 02:50:10,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:50:10,797 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:50:10,798 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:50:10,805 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:10" (1/1) ... [2019-11-28 02:50:10,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:10" (1/1) ... [2019-11-28 02:50:10,806 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:10" (1/1) ... [2019-11-28 02:50:10,806 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:10" (1/1) ... [2019-11-28 02:50:10,807 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:10" (1/1) ... [2019-11-28 02:50:10,809 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:10" (1/1) ... [2019-11-28 02:50:10,810 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:10" (1/1) ... [2019-11-28 02:50:10,811 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:50:10,811 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:50:10,812 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:50:10,812 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:50:10,812 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:10" (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 02:50:10,867 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-28 02:50:10,867 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-28 02:50:10,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:50:10,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:50:11,042 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:50:11,043 INFO L297 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 02:50:11,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:50:11 BoogieIcfgContainer [2019-11-28 02:50:11,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:50:11,053 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:50:11,054 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:50:11,057 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:50:11,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:50:10" (1/3) ... [2019-11-28 02:50:11,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b0e590a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:50:11, skipping insertion in model container [2019-11-28 02:50:11,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:10" (2/3) ... [2019-11-28 02:50:11,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b0e590a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:50:11, skipping insertion in model container [2019-11-28 02:50:11,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:50:11" (3/3) ... [2019-11-28 02:50:11,062 INFO L109 eAbstractionObserver]: Analyzing ICFG NestedRecursion_2c.c [2019-11-28 02:50:11,093 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:50:11,101 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-28 02:50:11,116 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-28 02:50:11,148 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:50:11,148 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 02:50:11,148 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:50:11,149 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:50:11,149 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:50:11,149 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:50:11,149 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:50:11,149 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:50:11,168 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-11-28 02:50:11,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-28 02:50:11,174 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:11,176 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-28 02:50:11,176 INFO L410 AbstractCegarLoop]: === Iteration 1 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:11,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:11,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1454635077, now seen corresponding path program 1 times [2019-11-28 02:50:11,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:11,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954260544] [2019-11-28 02:50:11,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:11,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:11,359 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 02:50:11,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954260544] [2019-11-28 02:50:11,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:11,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:50:11,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416235144] [2019-11-28 02:50:11,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:50:11,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:11,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:50:11,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:50:11,381 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2019-11-28 02:50:11,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:11,541 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2019-11-28 02:50:11,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:50:11,543 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-11-28 02:50:11,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:11,553 INFO L225 Difference]: With dead ends: 41 [2019-11-28 02:50:11,553 INFO L226 Difference]: Without dead ends: 36 [2019-11-28 02:50:11,557 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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 02:50:11,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-28 02:50:11,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2019-11-28 02:50:11,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-28 02:50:11,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-11-28 02:50:11,604 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 6 [2019-11-28 02:50:11,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:11,604 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-11-28 02:50:11,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:50:11,605 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2019-11-28 02:50:11,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 02:50:11,605 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:11,605 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:11,606 INFO L410 AbstractCegarLoop]: === Iteration 2 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:11,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:11,607 INFO L82 PathProgramCache]: Analyzing trace with hash 2144014465, now seen corresponding path program 1 times [2019-11-28 02:50:11,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:11,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116946272] [2019-11-28 02:50:11,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:11,648 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 02:50:11,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116946272] [2019-11-28 02:50:11,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:11,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:50:11,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595614382] [2019-11-28 02:50:11,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:50:11,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:11,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:50:11,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:50:11,654 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand 5 states. [2019-11-28 02:50:11,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:11,736 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2019-11-28 02:50:11,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:50:11,737 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-11-28 02:50:11,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:11,739 INFO L225 Difference]: With dead ends: 50 [2019-11-28 02:50:11,739 INFO L226 Difference]: Without dead ends: 46 [2019-11-28 02:50:11,740 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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 02:50:11,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-28 02:50:11,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2019-11-28 02:50:11,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-28 02:50:11,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2019-11-28 02:50:11,758 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 7 [2019-11-28 02:50:11,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:11,761 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2019-11-28 02:50:11,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:50:11,761 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2019-11-28 02:50:11,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 02:50:11,762 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:11,762 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:11,762 INFO L410 AbstractCegarLoop]: === Iteration 3 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:11,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:11,763 INFO L82 PathProgramCache]: Analyzing trace with hash -736378463, now seen corresponding path program 1 times [2019-11-28 02:50:11,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:11,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831200097] [2019-11-28 02:50:11,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:11,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:11,853 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:11,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831200097] [2019-11-28 02:50:11,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338971987] [2019-11-28 02:50:11,854 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 02:50:11,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:11,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:50:11,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:11,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:11,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:11,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-11-28 02:50:11,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54903891] [2019-11-28 02:50:11,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:50:11,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:11,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:50:11,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:50:11,961 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand 7 states. [2019-11-28 02:50:12,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:12,106 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2019-11-28 02:50:12,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:50:12,107 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-11-28 02:50:12,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:12,109 INFO L225 Difference]: With dead ends: 63 [2019-11-28 02:50:12,109 INFO L226 Difference]: Without dead ends: 62 [2019-11-28 02:50:12,110 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:50:12,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-28 02:50:12,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2019-11-28 02:50:12,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-28 02:50:12,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2019-11-28 02:50:12,126 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 12 [2019-11-28 02:50:12,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:12,127 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2019-11-28 02:50:12,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:50:12,127 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2019-11-28 02:50:12,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 02:50:12,128 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:12,128 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:12,336 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:12,336 INFO L410 AbstractCegarLoop]: === Iteration 4 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:12,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:12,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1009328462, now seen corresponding path program 1 times [2019-11-28 02:50:12,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:12,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962887520] [2019-11-28 02:50:12,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:12,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:50:12,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962887520] [2019-11-28 02:50:12,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:12,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:50:12,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550204689] [2019-11-28 02:50:12,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:50:12,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:12,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:50:12,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:50:12,400 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand 3 states. [2019-11-28 02:50:12,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:12,414 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2019-11-28 02:50:12,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:50:12,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-28 02:50:12,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:12,417 INFO L225 Difference]: With dead ends: 52 [2019-11-28 02:50:12,417 INFO L226 Difference]: Without dead ends: 51 [2019-11-28 02:50:12,418 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:50:12,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-28 02:50:12,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-11-28 02:50:12,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-28 02:50:12,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2019-11-28 02:50:12,431 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 14 [2019-11-28 02:50:12,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:12,432 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2019-11-28 02:50:12,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:50:12,432 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2019-11-28 02:50:12,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 02:50:12,433 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:12,434 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:12,434 INFO L410 AbstractCegarLoop]: === Iteration 5 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:12,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:12,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1224411294, now seen corresponding path program 1 times [2019-11-28 02:50:12,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:12,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36543391] [2019-11-28 02:50:12,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:12,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:50:12,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36543391] [2019-11-28 02:50:12,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:12,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:50:12,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410711108] [2019-11-28 02:50:12,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:50:12,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:12,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:50:12,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:50:12,488 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand 4 states. [2019-11-28 02:50:12,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:12,523 INFO L93 Difference]: Finished difference Result 77 states and 101 transitions. [2019-11-28 02:50:12,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:50:12,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-28 02:50:12,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:12,525 INFO L225 Difference]: With dead ends: 77 [2019-11-28 02:50:12,525 INFO L226 Difference]: Without dead ends: 76 [2019-11-28 02:50:12,526 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:50:12,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-28 02:50:12,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2019-11-28 02:50:12,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-28 02:50:12,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2019-11-28 02:50:12,541 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 15 [2019-11-28 02:50:12,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:12,542 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2019-11-28 02:50:12,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:50:12,543 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2019-11-28 02:50:12,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 02:50:12,543 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:12,544 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1] [2019-11-28 02:50:12,544 INFO L410 AbstractCegarLoop]: === Iteration 6 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:12,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:12,545 INFO L82 PathProgramCache]: Analyzing trace with hash -231947135, now seen corresponding path program 2 times [2019-11-28 02:50:12,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:12,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651842478] [2019-11-28 02:50:12,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:12,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:12,629 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:12,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651842478] [2019-11-28 02:50:12,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697940218] [2019-11-28 02:50:12,631 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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-11-28 02:50:12,673 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:50:12,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:50:12,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:50:12,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:12,691 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:12,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:12,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-11-28 02:50:12,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478284104] [2019-11-28 02:50:12,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 02:50:12,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:12,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:50:12,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:50:12,700 INFO L87 Difference]: Start difference. First operand 69 states and 84 transitions. Second operand 9 states. [2019-11-28 02:50:12,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:12,902 INFO L93 Difference]: Finished difference Result 90 states and 106 transitions. [2019-11-28 02:50:12,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 02:50:12,904 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-11-28 02:50:12,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:12,908 INFO L225 Difference]: With dead ends: 90 [2019-11-28 02:50:12,908 INFO L226 Difference]: Without dead ends: 89 [2019-11-28 02:50:12,909 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-11-28 02:50:12,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-28 02:50:12,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2019-11-28 02:50:12,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-28 02:50:12,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 105 transitions. [2019-11-28 02:50:12,936 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 105 transitions. Word has length 17 [2019-11-28 02:50:12,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:12,936 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 105 transitions. [2019-11-28 02:50:12,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 02:50:12,937 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 105 transitions. [2019-11-28 02:50:12,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 02:50:12,941 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:12,941 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:13,144 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:13,145 INFO L410 AbstractCegarLoop]: === Iteration 7 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:13,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:13,145 INFO L82 PathProgramCache]: Analyzing trace with hash -855233152, now seen corresponding path program 1 times [2019-11-28 02:50:13,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:13,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428428168] [2019-11-28 02:50:13,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:13,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:13,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:13,236 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:50:13,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428428168] [2019-11-28 02:50:13,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:13,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 02:50:13,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980423545] [2019-11-28 02:50:13,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:50:13,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:13,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:50:13,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:50:13,241 INFO L87 Difference]: Start difference. First operand 86 states and 105 transitions. Second operand 6 states. [2019-11-28 02:50:13,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:13,407 INFO L93 Difference]: Finished difference Result 117 states and 149 transitions. [2019-11-28 02:50:13,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:50:13,408 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-11-28 02:50:13,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:13,411 INFO L225 Difference]: With dead ends: 117 [2019-11-28 02:50:13,411 INFO L226 Difference]: Without dead ends: 116 [2019-11-28 02:50:13,412 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:50:13,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-28 02:50:13,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2019-11-28 02:50:13,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-28 02:50:13,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 143 transitions. [2019-11-28 02:50:13,456 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 143 transitions. Word has length 19 [2019-11-28 02:50:13,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:13,458 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 143 transitions. [2019-11-28 02:50:13,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:50:13,458 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 143 transitions. [2019-11-28 02:50:13,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 02:50:13,460 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:13,460 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:13,460 INFO L410 AbstractCegarLoop]: === Iteration 8 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:13,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:13,461 INFO L82 PathProgramCache]: Analyzing trace with hash -742423898, now seen corresponding path program 1 times [2019-11-28 02:50:13,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:13,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886099111] [2019-11-28 02:50:13,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:13,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:13,533 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:50:13,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886099111] [2019-11-28 02:50:13,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:13,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 02:50:13,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387766195] [2019-11-28 02:50:13,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:50:13,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:13,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:50:13,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:50:13,536 INFO L87 Difference]: Start difference. First operand 109 states and 143 transitions. Second operand 6 states. [2019-11-28 02:50:13,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:13,700 INFO L93 Difference]: Finished difference Result 135 states and 174 transitions. [2019-11-28 02:50:13,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:50:13,701 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-28 02:50:13,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:13,703 INFO L225 Difference]: With dead ends: 135 [2019-11-28 02:50:13,704 INFO L226 Difference]: Without dead ends: 134 [2019-11-28 02:50:13,705 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:50:13,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-28 02:50:13,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 125. [2019-11-28 02:50:13,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-28 02:50:13,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 160 transitions. [2019-11-28 02:50:13,733 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 160 transitions. Word has length 20 [2019-11-28 02:50:13,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:13,733 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 160 transitions. [2019-11-28 02:50:13,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:50:13,733 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 160 transitions. [2019-11-28 02:50:13,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 02:50:13,735 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:13,736 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1] [2019-11-28 02:50:13,736 INFO L410 AbstractCegarLoop]: === Iteration 9 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:13,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:13,736 INFO L82 PathProgramCache]: Analyzing trace with hash -559247967, now seen corresponding path program 3 times [2019-11-28 02:50:13,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:13,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31416575] [2019-11-28 02:50:13,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:13,839 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:13,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31416575] [2019-11-28 02:50:13,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644287978] [2019-11-28 02:50:13,840 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 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 02:50:13,871 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-28 02:50:13,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:50:13,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 02:50:13,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:13,883 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:13,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:13,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-11-28 02:50:13,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526400947] [2019-11-28 02:50:13,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 02:50:13,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:13,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 02:50:13,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:50:13,885 INFO L87 Difference]: Start difference. First operand 125 states and 160 transitions. Second operand 11 states. [2019-11-28 02:50:14,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:14,119 INFO L93 Difference]: Finished difference Result 150 states and 192 transitions. [2019-11-28 02:50:14,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 02:50:14,120 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-11-28 02:50:14,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:14,122 INFO L225 Difference]: With dead ends: 150 [2019-11-28 02:50:14,123 INFO L226 Difference]: Without dead ends: 149 [2019-11-28 02:50:14,124 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2019-11-28 02:50:14,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-28 02:50:14,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 143. [2019-11-28 02:50:14,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-28 02:50:14,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 183 transitions. [2019-11-28 02:50:14,153 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 183 transitions. Word has length 22 [2019-11-28 02:50:14,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:14,153 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 183 transitions. [2019-11-28 02:50:14,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 02:50:14,153 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 183 transitions. [2019-11-28 02:50:14,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 02:50:14,155 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:14,155 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:14,358 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:14,359 INFO L410 AbstractCegarLoop]: === Iteration 10 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:14,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:14,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1606295908, now seen corresponding path program 2 times [2019-11-28 02:50:14,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:14,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726465671] [2019-11-28 02:50:14,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:14,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:14,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:14,491 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:50:14,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726465671] [2019-11-28 02:50:14,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678507109] [2019-11-28 02:50:14,492 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-11-28 02:50:14,535 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:50:14,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:50:14,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 02:50:14,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:14,549 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:50:14,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:14,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-11-28 02:50:14,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272439806] [2019-11-28 02:50:14,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 02:50:14,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:14,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:50:14,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:50:14,551 INFO L87 Difference]: Start difference. First operand 143 states and 183 transitions. Second operand 8 states. [2019-11-28 02:50:14,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:14,771 INFO L93 Difference]: Finished difference Result 174 states and 224 transitions. [2019-11-28 02:50:14,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 02:50:14,772 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-11-28 02:50:14,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:14,774 INFO L225 Difference]: With dead ends: 174 [2019-11-28 02:50:14,774 INFO L226 Difference]: Without dead ends: 173 [2019-11-28 02:50:14,775 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-11-28 02:50:14,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-11-28 02:50:14,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 161. [2019-11-28 02:50:14,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-11-28 02:50:14,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 206 transitions. [2019-11-28 02:50:14,791 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 206 transitions. Word has length 25 [2019-11-28 02:50:14,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:14,791 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 206 transitions. [2019-11-28 02:50:14,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 02:50:14,792 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 206 transitions. [2019-11-28 02:50:14,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 02:50:14,793 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:14,793 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1] [2019-11-28 02:50:15,004 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:15,005 INFO L410 AbstractCegarLoop]: === Iteration 11 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:15,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:15,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1828550785, now seen corresponding path program 4 times [2019-11-28 02:50:15,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:15,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427953406] [2019-11-28 02:50:15,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:15,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:15,154 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:15,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427953406] [2019-11-28 02:50:15,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302666537] [2019-11-28 02:50:15,155 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 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 02:50:15,181 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 02:50:15,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:50:15,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 02:50:15,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:15,257 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-28 02:50:15,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:15,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 13 [2019-11-28 02:50:15,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973650429] [2019-11-28 02:50:15,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 02:50:15,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:15,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 02:50:15,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-11-28 02:50:15,259 INFO L87 Difference]: Start difference. First operand 161 states and 206 transitions. Second operand 14 states. [2019-11-28 02:50:15,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:15,355 INFO L93 Difference]: Finished difference Result 165 states and 215 transitions. [2019-11-28 02:50:15,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:50:15,357 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-11-28 02:50:15,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:15,358 INFO L225 Difference]: With dead ends: 165 [2019-11-28 02:50:15,359 INFO L226 Difference]: Without dead ends: 164 [2019-11-28 02:50:15,359 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-11-28 02:50:15,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-28 02:50:15,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2019-11-28 02:50:15,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-11-28 02:50:15,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 205 transitions. [2019-11-28 02:50:15,373 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 205 transitions. Word has length 27 [2019-11-28 02:50:15,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:15,374 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 205 transitions. [2019-11-28 02:50:15,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 02:50:15,374 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 205 transitions. [2019-11-28 02:50:15,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 02:50:15,375 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:15,375 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:15,578 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:15,579 INFO L410 AbstractCegarLoop]: === Iteration 12 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:15,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:15,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1103662182, now seen corresponding path program 3 times [2019-11-28 02:50:15,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:15,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360671594] [2019-11-28 02:50:15,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:15,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:15,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:15,678 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:50:15,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360671594] [2019-11-28 02:50:15,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443611390] [2019-11-28 02:50:15,679 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 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 02:50:15,716 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-28 02:50:15,716 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:50:15,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 02:50:15,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:15,728 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:50:15,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:15,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-11-28 02:50:15,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796476994] [2019-11-28 02:50:15,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 02:50:15,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:15,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 02:50:15,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:50:15,734 INFO L87 Difference]: Start difference. First operand 161 states and 205 transitions. Second operand 10 states. [2019-11-28 02:50:16,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:16,012 INFO L93 Difference]: Finished difference Result 194 states and 248 transitions. [2019-11-28 02:50:16,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-28 02:50:16,013 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2019-11-28 02:50:16,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:16,017 INFO L225 Difference]: With dead ends: 194 [2019-11-28 02:50:16,017 INFO L226 Difference]: Without dead ends: 193 [2019-11-28 02:50:16,018 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2019-11-28 02:50:16,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-11-28 02:50:16,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 179. [2019-11-28 02:50:16,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-11-28 02:50:16,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 228 transitions. [2019-11-28 02:50:16,037 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 228 transitions. Word has length 30 [2019-11-28 02:50:16,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:16,038 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 228 transitions. [2019-11-28 02:50:16,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 02:50:16,040 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 228 transitions. [2019-11-28 02:50:16,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 02:50:16,047 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:16,048 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:16,252 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:16,253 INFO L410 AbstractCegarLoop]: === Iteration 13 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:16,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:16,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1629013057, now seen corresponding path program 1 times [2019-11-28 02:50:16,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:16,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136334547] [2019-11-28 02:50:16,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:16,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:16,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:16,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:16,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:16,357 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-28 02:50:16,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136334547] [2019-11-28 02:50:16,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:16,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:50:16,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404519901] [2019-11-28 02:50:16,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:50:16,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:16,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:50:16,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:50:16,362 INFO L87 Difference]: Start difference. First operand 179 states and 228 transitions. Second operand 5 states. [2019-11-28 02:50:16,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:16,391 INFO L93 Difference]: Finished difference Result 179 states and 228 transitions. [2019-11-28 02:50:16,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:50:16,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 02:50:16,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:16,395 INFO L225 Difference]: With dead ends: 179 [2019-11-28 02:50:16,396 INFO L226 Difference]: Without dead ends: 178 [2019-11-28 02:50:16,397 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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 02:50:16,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-28 02:50:16,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2019-11-28 02:50:16,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-11-28 02:50:16,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 218 transitions. [2019-11-28 02:50:16,411 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 218 transitions. Word has length 31 [2019-11-28 02:50:16,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:16,411 INFO L462 AbstractCegarLoop]: Abstraction has 178 states and 218 transitions. [2019-11-28 02:50:16,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:50:16,412 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 218 transitions. [2019-11-28 02:50:16,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 02:50:16,415 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:16,416 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:16,418 INFO L410 AbstractCegarLoop]: === Iteration 14 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:16,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:16,419 INFO L82 PathProgramCache]: Analyzing trace with hash 857271516, now seen corresponding path program 4 times [2019-11-28 02:50:16,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:16,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095134262] [2019-11-28 02:50:16,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:16,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:16,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:16,502 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 27 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:50:16,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095134262] [2019-11-28 02:50:16,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732329114] [2019-11-28 02:50:16,502 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 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 02:50:16,524 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 02:50:16,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:50:16,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 02:50:16,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:16,604 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-28 02:50:16,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:50:16,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2019-11-28 02:50:16,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936577898] [2019-11-28 02:50:16,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:50:16,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:16,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:50:16,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-11-28 02:50:16,606 INFO L87 Difference]: Start difference. First operand 178 states and 218 transitions. Second operand 6 states. [2019-11-28 02:50:16,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:16,675 INFO L93 Difference]: Finished difference Result 239 states and 303 transitions. [2019-11-28 02:50:16,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:50:16,676 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-11-28 02:50:16,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:16,677 INFO L225 Difference]: With dead ends: 239 [2019-11-28 02:50:16,677 INFO L226 Difference]: Without dead ends: 111 [2019-11-28 02:50:16,683 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2019-11-28 02:50:16,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-28 02:50:16,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2019-11-28 02:50:16,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-28 02:50:16,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 126 transitions. [2019-11-28 02:50:16,701 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 126 transitions. Word has length 35 [2019-11-28 02:50:16,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:16,702 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 126 transitions. [2019-11-28 02:50:16,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:50:16,702 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 126 transitions. [2019-11-28 02:50:16,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 02:50:16,703 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:16,703 INFO L410 BasicCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:16,914 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:16,914 INFO L410 AbstractCegarLoop]: === Iteration 15 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:16,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:16,915 INFO L82 PathProgramCache]: Analyzing trace with hash -490250333, now seen corresponding path program 1 times [2019-11-28 02:50:16,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:16,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735921823] [2019-11-28 02:50:16,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:16,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:16,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:16,990 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-28 02:50:16,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735921823] [2019-11-28 02:50:16,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:16,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 02:50:16,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977522402] [2019-11-28 02:50:16,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:50:16,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:16,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:50:16,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:50:16,992 INFO L87 Difference]: Start difference. First operand 106 states and 126 transitions. Second operand 7 states. [2019-11-28 02:50:17,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:17,111 INFO L93 Difference]: Finished difference Result 106 states and 126 transitions. [2019-11-28 02:50:17,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:50:17,111 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-11-28 02:50:17,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:17,113 INFO L225 Difference]: With dead ends: 106 [2019-11-28 02:50:17,113 INFO L226 Difference]: Without dead ends: 105 [2019-11-28 02:50:17,114 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:50:17,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-28 02:50:17,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-11-28 02:50:17,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-28 02:50:17,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 125 transitions. [2019-11-28 02:50:17,128 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 125 transitions. Word has length 35 [2019-11-28 02:50:17,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:17,128 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 125 transitions. [2019-11-28 02:50:17,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:50:17,129 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 125 transitions. [2019-11-28 02:50:17,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 02:50:17,129 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:17,130 INFO L410 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:17,130 INFO L410 AbstractCegarLoop]: === Iteration 16 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:17,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:17,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1982108899, now seen corresponding path program 1 times [2019-11-28 02:50:17,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:17,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889320000] [2019-11-28 02:50:17,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:17,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:17,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:17,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:17,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:17,229 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-28 02:50:17,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889320000] [2019-11-28 02:50:17,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:17,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 02:50:17,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146695365] [2019-11-28 02:50:17,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:50:17,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:17,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:50:17,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:50:17,233 INFO L87 Difference]: Start difference. First operand 105 states and 125 transitions. Second operand 7 states. [2019-11-28 02:50:17,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:17,361 INFO L93 Difference]: Finished difference Result 124 states and 148 transitions. [2019-11-28 02:50:17,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:50:17,362 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2019-11-28 02:50:17,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:17,363 INFO L225 Difference]: With dead ends: 124 [2019-11-28 02:50:17,363 INFO L226 Difference]: Without dead ends: 123 [2019-11-28 02:50:17,364 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:50:17,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-28 02:50:17,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2019-11-28 02:50:17,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-28 02:50:17,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 140 transitions. [2019-11-28 02:50:17,374 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 140 transitions. Word has length 36 [2019-11-28 02:50:17,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:17,374 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 140 transitions. [2019-11-28 02:50:17,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:50:17,375 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 140 transitions. [2019-11-28 02:50:17,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 02:50:17,376 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:17,376 INFO L410 BasicCegarLoop]: trace histogram [6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:17,376 INFO L410 AbstractCegarLoop]: === Iteration 17 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:17,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:17,377 INFO L82 PathProgramCache]: Analyzing trace with hash -732976513, now seen corresponding path program 2 times [2019-11-28 02:50:17,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:17,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163725582] [2019-11-28 02:50:17,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:17,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:17,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:17,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:17,442 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 34 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-28 02:50:17,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163725582] [2019-11-28 02:50:17,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032941918] [2019-11-28 02:50:17,442 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 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 02:50:17,475 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:50:17,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:50:17,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 02:50:17,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:17,485 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 34 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-28 02:50:17,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:17,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-11-28 02:50:17,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076762938] [2019-11-28 02:50:17,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 02:50:17,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:17,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:50:17,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:50:17,487 INFO L87 Difference]: Start difference. First operand 121 states and 140 transitions. Second operand 9 states. [2019-11-28 02:50:17,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:17,701 INFO L93 Difference]: Finished difference Result 140 states and 162 transitions. [2019-11-28 02:50:17,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-28 02:50:17,702 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2019-11-28 02:50:17,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:17,703 INFO L225 Difference]: With dead ends: 140 [2019-11-28 02:50:17,703 INFO L226 Difference]: Without dead ends: 139 [2019-11-28 02:50:17,704 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2019-11-28 02:50:17,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-11-28 02:50:17,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-11-28 02:50:17,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-11-28 02:50:17,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 161 transitions. [2019-11-28 02:50:17,713 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 161 transitions. Word has length 41 [2019-11-28 02:50:17,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:17,713 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 161 transitions. [2019-11-28 02:50:17,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 02:50:17,714 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 161 transitions. [2019-11-28 02:50:17,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-28 02:50:17,714 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:17,715 INFO L410 BasicCegarLoop]: trace histogram [7, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:17,917 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:17,918 INFO L410 AbstractCegarLoop]: === Iteration 18 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:17,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:17,919 INFO L82 PathProgramCache]: Analyzing trace with hash 2029893219, now seen corresponding path program 3 times [2019-11-28 02:50:17,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:17,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939812890] [2019-11-28 02:50:17,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:18,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:18,013 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 48 proven. 13 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-28 02:50:18,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939812890] [2019-11-28 02:50:18,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782899878] [2019-11-28 02:50:18,014 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 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 02:50:18,048 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-28 02:50:18,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:50:18,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 02:50:18,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:18,059 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 48 proven. 13 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-28 02:50:18,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:18,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-11-28 02:50:18,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279681483] [2019-11-28 02:50:18,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 02:50:18,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:18,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 02:50:18,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:50:18,061 INFO L87 Difference]: Start difference. First operand 139 states and 161 transitions. Second operand 11 states. [2019-11-28 02:50:18,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:18,428 INFO L93 Difference]: Finished difference Result 158 states and 183 transitions. [2019-11-28 02:50:18,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-28 02:50:18,428 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2019-11-28 02:50:18,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:18,430 INFO L225 Difference]: With dead ends: 158 [2019-11-28 02:50:18,430 INFO L226 Difference]: Without dead ends: 157 [2019-11-28 02:50:18,431 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=517, Unknown=0, NotChecked=0, Total=702 [2019-11-28 02:50:18,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-28 02:50:18,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-11-28 02:50:18,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-28 02:50:18,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 182 transitions. [2019-11-28 02:50:18,441 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 182 transitions. Word has length 46 [2019-11-28 02:50:18,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:18,442 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 182 transitions. [2019-11-28 02:50:18,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 02:50:18,442 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 182 transitions. [2019-11-28 02:50:18,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 02:50:18,443 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:18,444 INFO L410 BasicCegarLoop]: trace histogram [8, 6, 6, 5, 5, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:18,647 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:18,647 INFO L410 AbstractCegarLoop]: === Iteration 19 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:18,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:18,648 INFO L82 PathProgramCache]: Analyzing trace with hash -613451521, now seen corresponding path program 4 times [2019-11-28 02:50:18,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:18,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139514599] [2019-11-28 02:50:18,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:18,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:18,779 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 62 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-28 02:50:18,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139514599] [2019-11-28 02:50:18,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151577331] [2019-11-28 02:50:18,780 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 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 02:50:18,815 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 02:50:18,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:50:18,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-28 02:50:18,818 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:18,828 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 62 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-28 02:50:18,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:18,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-11-28 02:50:18,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843369914] [2019-11-28 02:50:18,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 02:50:18,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:18,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 02:50:18,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:50:18,830 INFO L87 Difference]: Start difference. First operand 157 states and 182 transitions. Second operand 13 states. [2019-11-28 02:50:19,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:19,284 INFO L93 Difference]: Finished difference Result 176 states and 204 transitions. [2019-11-28 02:50:19,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-28 02:50:19,285 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 51 [2019-11-28 02:50:19,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:19,287 INFO L225 Difference]: With dead ends: 176 [2019-11-28 02:50:19,287 INFO L226 Difference]: Without dead ends: 175 [2019-11-28 02:50:19,288 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=291, Invalid=831, Unknown=0, NotChecked=0, Total=1122 [2019-11-28 02:50:19,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-11-28 02:50:19,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-11-28 02:50:19,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-11-28 02:50:19,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 203 transitions. [2019-11-28 02:50:19,299 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 203 transitions. Word has length 51 [2019-11-28 02:50:19,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:19,299 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 203 transitions. [2019-11-28 02:50:19,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 02:50:19,299 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 203 transitions. [2019-11-28 02:50:19,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-28 02:50:19,301 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:19,301 INFO L410 BasicCegarLoop]: trace histogram [9, 7, 7, 6, 6, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:19,512 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:19,513 INFO L410 AbstractCegarLoop]: === Iteration 20 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:19,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:19,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1845164003, now seen corresponding path program 5 times [2019-11-28 02:50:19,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:19,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592333401] [2019-11-28 02:50:19,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:19,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:19,635 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 76 proven. 46 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-28 02:50:19,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592333401] [2019-11-28 02:50:19,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436497019] [2019-11-28 02:50:19,636 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 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 02:50:19,663 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-11-28 02:50:19,663 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:50:19,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-28 02:50:19,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:19,742 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-11-28 02:50:19,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:50:19,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 20 [2019-11-28 02:50:19,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881731158] [2019-11-28 02:50:19,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:50:19,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:19,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:50:19,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-11-28 02:50:19,744 INFO L87 Difference]: Start difference. First operand 175 states and 203 transitions. Second operand 7 states. [2019-11-28 02:50:19,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:19,817 INFO L93 Difference]: Finished difference Result 215 states and 251 transitions. [2019-11-28 02:50:19,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:50:19,818 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-11-28 02:50:19,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:19,818 INFO L225 Difference]: With dead ends: 215 [2019-11-28 02:50:19,818 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 02:50:19,820 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2019-11-28 02:50:19,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 02:50:19,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 02:50:19,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 02:50:19,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 02:50:19,821 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2019-11-28 02:50:19,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:19,821 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 02:50:19,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:50:19,822 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 02:50:19,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 02:50:20,030 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:20,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 02:50:20,303 INFO L246 CegarLoopResult]: For program point gFINAL(lines 10 16) no Hoare annotation was computed. [2019-11-28 02:50:20,303 INFO L246 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2019-11-28 02:50:20,303 INFO L246 CegarLoopResult]: For program point L15-1(line 15) no Hoare annotation was computed. [2019-11-28 02:50:20,304 INFO L242 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: (and (not (= |g_#in~x| 0)) (or (and (<= 0 g_~x) (<= g_~x 2147483647) (not (= 0 g_~x))) (not (<= 0 |g_#in~x|)) (not (<= |g_#in~x| 2147483647)))) [2019-11-28 02:50:20,304 INFO L246 CegarLoopResult]: For program point L12(lines 12 15) no Hoare annotation was computed. [2019-11-28 02:50:20,304 INFO L246 CegarLoopResult]: For program point L15-3(line 15) no Hoare annotation was computed. [2019-11-28 02:50:20,304 INFO L246 CegarLoopResult]: For program point L15-4(line 15) no Hoare annotation was computed. [2019-11-28 02:50:20,304 INFO L246 CegarLoopResult]: For program point L15-5(line 15) no Hoare annotation was computed. [2019-11-28 02:50:20,305 INFO L246 CegarLoopResult]: For program point gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2019-11-28 02:50:20,305 INFO L242 CegarLoopResult]: At program point L15-6(line 15) the Hoare annotation is: (and (not (= |g_#in~x| 0)) (or (not (<= 0 |g_#in~x|)) (and (<= 0 g_~x) (<= g_~x 2147483647) (<= |g_#t~ret0| 1) (<= 1 |g_#t~ret0|) (not (= 0 g_~x))) (not (<= |g_#in~x| 2147483647)))) [2019-11-28 02:50:20,305 INFO L246 CegarLoopResult]: For program point gEXIT(lines 10 16) no Hoare annotation was computed. [2019-11-28 02:50:20,305 INFO L246 CegarLoopResult]: For program point L15-7(line 15) no Hoare annotation was computed. [2019-11-28 02:50:20,305 INFO L249 CegarLoopResult]: At program point gENTRY(lines 10 16) the Hoare annotation is: true [2019-11-28 02:50:20,306 INFO L246 CegarLoopResult]: For program point gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2019-11-28 02:50:20,306 INFO L246 CegarLoopResult]: For program point gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2019-11-28 02:50:20,306 INFO L246 CegarLoopResult]: For program point gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2019-11-28 02:50:20,306 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 02:50:20,306 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 02:50:20,307 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 02:50:20,307 INFO L242 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (<= ULTIMATE.start_main_~x~0 2147483647) (<= 0 ULTIMATE.start_main_~x~0)) [2019-11-28 02:50:20,307 INFO L246 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2019-11-28 02:50:20,307 INFO L246 CegarLoopResult]: For program point L21-1(line 21) no Hoare annotation was computed. [2019-11-28 02:50:20,307 INFO L242 CegarLoopResult]: At program point L18(lines 18 22) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 2147483647) [2019-11-28 02:50:20,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:50:20 BoogieIcfgContainer [2019-11-28 02:50:20,324 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:50:20,325 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:50:20,325 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:50:20,325 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:50:20,326 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:50:11" (3/4) ... [2019-11-28 02:50:20,329 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 02:50:20,336 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-11-28 02:50:20,341 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 02:50:20,342 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 02:50:20,391 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:50:20,391 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:50:20,393 INFO L168 Benchmark]: Toolchain (without parser) took 9931.26 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 269.0 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -96.2 MB). Peak memory consumption was 172.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:20,394 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:50:20,394 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.18 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:20,395 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -176.1 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:20,395 INFO L168 Benchmark]: Boogie Preprocessor took 15.47 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:50:20,395 INFO L168 Benchmark]: RCFGBuilder took 232.93 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: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:20,396 INFO L168 Benchmark]: TraceAbstraction took 9270.92 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 138.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.7 MB). Peak memory consumption was 189.1 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:20,397 INFO L168 Benchmark]: Witness Printer took 66.25 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-11-28 02:50:20,399 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 243.18 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 88.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -176.1 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.47 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 232.93 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: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9270.92 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 138.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.7 MB). Peak memory consumption was 189.1 MB. Max. memory is 11.5 GB. * Witness Printer took 66.25 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 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: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: x <= 2147483647 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 4 error locations. Result: SAFE, OverallTime: 8.8s, OverallIterations: 20, TraceHistogramMax: 9, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 371 SDtfs, 640 SDslu, 1406 SDs, 0 SdLazy, 1497 SolverSat, 344 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 690 GetRequests, 438 SyntacticMatches, 4 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=179occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 89 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 170 PreInvPairs, 182 NumberOfFragments, 67 HoareAnnotationTreeSize, 170 FomulaSimplifications, 260 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 5 FomulaSimplificationsInter, 410 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 907 NumberOfCodeBlocks, 866 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 876 ConstructedInterpolants, 0 QuantifiedInterpolants, 77162 SizeOfPredicates, 30 NumberOfNonLiveVariables, 656 ConjunctsInSsa, 111 ConjunctsInUnsatCore, 31 InterpolantComputations, 11 PerfectInterpolantSequences, 934/1271 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...