./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-crafted/Arrays01-EquivalentConstantIndices_true-no-overflow_true-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0ed9222f Calling Ultimate with: 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 /storage/repos/svcomp/c/termination-crafted/Arrays01-EquivalentConstantIndices_true-no-overflow_true-termination_true-valid-memsafety.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 cf39454d83b4ec00341bd0b620b0fa6b2321ce21 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 01:16:39,143 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 01:16:39,145 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 01:16:39,157 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 01:16:39,158 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 01:16:39,159 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 01:16:39,161 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 01:16:39,163 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 01:16:39,165 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 01:16:39,166 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 01:16:39,167 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 01:16:39,167 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 01:16:39,168 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 01:16:39,169 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 01:16:39,171 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 01:16:39,172 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 01:16:39,173 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 01:16:39,175 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 01:16:39,177 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 01:16:39,179 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 01:16:39,181 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 01:16:39,182 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 01:16:39,185 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 01:16:39,186 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 01:16:39,186 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 01:16:39,188 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 01:16:39,189 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 01:16:39,190 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 01:16:39,191 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 01:16:39,193 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 01:16:39,193 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 01:16:39,194 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 01:16:39,194 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 01:16:39,194 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 01:16:39,196 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 01:16:39,197 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 01:16:39,198 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-01-14 01:16:39,213 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 01:16:39,213 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 01:16:39,215 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 01:16:39,215 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 01:16:39,215 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 01:16:39,216 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 01:16:39,216 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 01:16:39,216 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 01:16:39,216 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 01:16:39,216 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 01:16:39,217 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 01:16:39,217 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 01:16:39,217 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-14 01:16:39,217 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 01:16:39,217 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 01:16:39,217 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 01:16:39,218 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 01:16:39,219 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 01:16:39,220 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 01:16:39,220 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 01:16:39,220 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 01:16:39,220 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 01:16:39,220 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 01:16:39,221 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 01:16:39,221 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 01:16:39,222 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 01:16:39,222 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 01:16:39,222 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> cf39454d83b4ec00341bd0b620b0fa6b2321ce21 [2019-01-14 01:16:39,260 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 01:16:39,273 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 01:16:39,277 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 01:16:39,279 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 01:16:39,279 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 01:16:39,280 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted/Arrays01-EquivalentConstantIndices_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-14 01:16:39,338 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69e0fe43b/5b7a5b83a7b7418c94b1159b8b2669d7/FLAG5c7a20276 [2019-01-14 01:16:39,758 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 01:16:39,758 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted/Arrays01-EquivalentConstantIndices_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-14 01:16:39,764 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69e0fe43b/5b7a5b83a7b7418c94b1159b8b2669d7/FLAG5c7a20276 [2019-01-14 01:16:40,165 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69e0fe43b/5b7a5b83a7b7418c94b1159b8b2669d7 [2019-01-14 01:16:40,169 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 01:16:40,171 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 01:16:40,173 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 01:16:40,173 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 01:16:40,182 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 01:16:40,183 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 01:16:40" (1/1) ... [2019-01-14 01:16:40,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72da797f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:16:40, skipping insertion in model container [2019-01-14 01:16:40,187 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 01:16:40" (1/1) ... [2019-01-14 01:16:40,196 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 01:16:40,214 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 01:16:40,417 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 01:16:40,424 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 01:16:40,453 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 01:16:40,482 INFO L195 MainTranslator]: Completed translation [2019-01-14 01:16:40,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:16:40 WrapperNode [2019-01-14 01:16:40,484 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 01:16:40,485 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 01:16:40,486 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 01:16:40,486 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 01:16:40,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:16:40" (1/1) ... [2019-01-14 01:16:40,517 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:16:40" (1/1) ... [2019-01-14 01:16:40,541 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 01:16:40,542 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 01:16:40,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 01:16:40,542 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 01:16:40,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:16:40" (1/1) ... [2019-01-14 01:16:40,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:16:40" (1/1) ... [2019-01-14 01:16:40,551 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:16:40" (1/1) ... [2019-01-14 01:16:40,551 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:16:40" (1/1) ... [2019-01-14 01:16:40,557 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:16:40" (1/1) ... [2019-01-14 01:16:40,562 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:16:40" (1/1) ... [2019-01-14 01:16:40,563 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:16:40" (1/1) ... [2019-01-14 01:16:40,565 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 01:16:40,565 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 01:16:40,565 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 01:16:40,565 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 01:16:40,566 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:16:40" (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-01-14 01:16:40,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 01:16:40,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 01:16:40,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 01:16:40,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 01:16:40,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 01:16:40,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 01:16:41,027 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 01:16:41,027 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-14 01:16:41,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:16:41 BoogieIcfgContainer [2019-01-14 01:16:41,029 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 01:16:41,030 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 01:16:41,030 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 01:16:41,033 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 01:16:41,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 01:16:40" (1/3) ... [2019-01-14 01:16:41,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f19627a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 01:16:41, skipping insertion in model container [2019-01-14 01:16:41,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:16:40" (2/3) ... [2019-01-14 01:16:41,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f19627a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 01:16:41, skipping insertion in model container [2019-01-14 01:16:41,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:16:41" (3/3) ... [2019-01-14 01:16:41,037 INFO L112 eAbstractionObserver]: Analyzing ICFG Arrays01-EquivalentConstantIndices_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-14 01:16:41,050 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 01:16:41,061 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-01-14 01:16:41,073 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-01-14 01:16:41,102 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 01:16:41,103 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 01:16:41,103 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 01:16:41,103 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 01:16:41,103 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 01:16:41,104 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 01:16:41,104 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 01:16:41,104 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 01:16:41,104 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 01:16:41,121 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-01-14 01:16:41,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-14 01:16:41,133 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:16:41,134 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-14 01:16:41,136 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:16:41,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:16:41,145 INFO L82 PathProgramCache]: Analyzing trace with hash 28698728, now seen corresponding path program 1 times [2019-01-14 01:16:41,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:16:41,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:16:41,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:41,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:16:41,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:16:41,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:16:41,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:16:41,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 01:16:41,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 01:16:41,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 01:16:41,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:16:41,348 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 4 states. [2019-01-14 01:16:41,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:16:41,464 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2019-01-14 01:16:41,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 01:16:41,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-14 01:16:41,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:16:41,476 INFO L225 Difference]: With dead ends: 34 [2019-01-14 01:16:41,476 INFO L226 Difference]: Without dead ends: 18 [2019-01-14 01:16:41,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:16:41,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-01-14 01:16:41,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-14 01:16:41,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-14 01:16:41,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-01-14 01:16:41,512 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 5 [2019-01-14 01:16:41,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:16:41,513 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-01-14 01:16:41,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 01:16:41,513 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-01-14 01:16:41,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 01:16:41,514 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:16:41,514 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2019-01-14 01:16:41,514 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:16:41,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:16:41,515 INFO L82 PathProgramCache]: Analyzing trace with hash -363792156, now seen corresponding path program 1 times [2019-01-14 01:16:41,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:16:41,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:16:41,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:41,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:16:41,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:41,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:16:41,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 01:16:41,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:16:41,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 01:16:41,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 01:16:41,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 01:16:41,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:16:41,580 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 4 states. [2019-01-14 01:16:41,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:16:41,684 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2019-01-14 01:16:41,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 01:16:41,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-01-14 01:16:41,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:16:41,685 INFO L225 Difference]: With dead ends: 18 [2019-01-14 01:16:41,686 INFO L226 Difference]: Without dead ends: 17 [2019-01-14 01:16:41,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:16:41,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-14 01:16:41,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-14 01:16:41,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-14 01:16:41,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-01-14 01:16:41,691 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 9 [2019-01-14 01:16:41,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:16:41,691 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-01-14 01:16:41,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 01:16:41,692 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-01-14 01:16:41,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 01:16:41,692 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:16:41,692 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:16:41,693 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:16:41,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:16:41,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1607296535, now seen corresponding path program 1 times [2019-01-14 01:16:41,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:16:41,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:16:41,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:41,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:16:41,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:16:41,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:16:41,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:16:41,775 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:16:41,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:16:41,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:16:41,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:16:42,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:16:42,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:16:42,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-01-14 01:16:42,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 01:16:42,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 01:16:42,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-14 01:16:42,068 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 7 states. [2019-01-14 01:16:42,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:16:42,240 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2019-01-14 01:16:42,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 01:16:42,241 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-01-14 01:16:42,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:16:42,242 INFO L225 Difference]: With dead ends: 28 [2019-01-14 01:16:42,242 INFO L226 Difference]: Without dead ends: 22 [2019-01-14 01:16:42,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-14 01:16:42,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-14 01:16:42,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2019-01-14 01:16:42,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-14 01:16:42,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-01-14 01:16:42,247 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 10 [2019-01-14 01:16:42,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:16:42,248 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-01-14 01:16:42,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 01:16:42,248 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-01-14 01:16:42,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 01:16:42,249 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:16:42,249 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2019-01-14 01:16:42,249 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:16:42,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:16:42,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1607345098, now seen corresponding path program 1 times [2019-01-14 01:16:42,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:16:42,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:16:42,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:42,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:16:42,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:42,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:16:42,376 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:16:42,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:16:42,377 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:16:42,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:16:42,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:16:42,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:16:42,546 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:16:42,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 01:16:42,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2019-01-14 01:16:42,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 01:16:42,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 01:16:42,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-14 01:16:42,578 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 8 states. [2019-01-14 01:16:42,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:16:42,755 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2019-01-14 01:16:42,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 01:16:42,756 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-01-14 01:16:42,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:16:42,756 INFO L225 Difference]: With dead ends: 18 [2019-01-14 01:16:42,757 INFO L226 Difference]: Without dead ends: 17 [2019-01-14 01:16:42,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-01-14 01:16:42,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-14 01:16:42,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-14 01:16:42,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-14 01:16:42,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-01-14 01:16:42,762 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 10 [2019-01-14 01:16:42,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:16:42,762 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-01-14 01:16:42,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 01:16:42,762 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-01-14 01:16:42,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-14 01:16:42,763 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:16:42,763 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 01:16:42,763 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:16:42,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:16:42,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1053474021, now seen corresponding path program 2 times [2019-01-14 01:16:42,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:16:42,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:16:42,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:42,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:16:42,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:42,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:16:42,856 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:16:42,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:16:42,857 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:16:42,869 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:16:42,887 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:16:42,888 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:16:42,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:16:42,926 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:16:42,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:16:42,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-01-14 01:16:42,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 01:16:42,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 01:16:42,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-14 01:16:42,947 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2019-01-14 01:16:43,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:16:43,192 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-01-14 01:16:43,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 01:16:43,193 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2019-01-14 01:16:43,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:16:43,194 INFO L225 Difference]: With dead ends: 30 [2019-01-14 01:16:43,194 INFO L226 Difference]: Without dead ends: 24 [2019-01-14 01:16:43,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-01-14 01:16:43,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-14 01:16:43,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-01-14 01:16:43,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-14 01:16:43,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-01-14 01:16:43,199 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2019-01-14 01:16:43,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:16:43,199 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-01-14 01:16:43,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 01:16:43,200 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-01-14 01:16:43,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 01:16:43,200 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:16:43,200 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2019-01-14 01:16:43,201 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:16:43,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:16:43,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1100938783, now seen corresponding path program 3 times [2019-01-14 01:16:43,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:16:43,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:16:43,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:43,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:16:43,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:43,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:16:43,459 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:16:43,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:16:43,459 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:16:43,469 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:16:43,500 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-14 01:16:43,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:16:43,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:16:43,539 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:16:43,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:16:43,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2019-01-14 01:16:43,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 01:16:43,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 01:16:43,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-01-14 01:16:43,563 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2019-01-14 01:16:43,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:16:43,712 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-01-14 01:16:43,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 01:16:43,714 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2019-01-14 01:16:43,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:16:43,715 INFO L225 Difference]: With dead ends: 34 [2019-01-14 01:16:43,715 INFO L226 Difference]: Without dead ends: 28 [2019-01-14 01:16:43,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-01-14 01:16:43,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-14 01:16:43,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-01-14 01:16:43,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-14 01:16:43,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-01-14 01:16:43,727 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 18 [2019-01-14 01:16:43,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:16:43,727 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-01-14 01:16:43,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 01:16:43,727 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-01-14 01:16:43,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 01:16:43,728 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:16:43,728 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2019-01-14 01:16:43,729 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:16:43,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:16:43,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1326737629, now seen corresponding path program 4 times [2019-01-14 01:16:43,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:16:43,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:16:43,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:43,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:16:43,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:16:43,942 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:16:43,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:16:43,942 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:16:43,953 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 01:16:43,973 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 01:16:43,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:16:43,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:16:44,195 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:16:44,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:16:44,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2019-01-14 01:16:44,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 01:16:44,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 01:16:44,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-01-14 01:16:44,219 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2019-01-14 01:16:44,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:16:44,398 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-01-14 01:16:44,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 01:16:44,399 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2019-01-14 01:16:44,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:16:44,400 INFO L225 Difference]: With dead ends: 38 [2019-01-14 01:16:44,400 INFO L226 Difference]: Without dead ends: 32 [2019-01-14 01:16:44,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-01-14 01:16:44,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-14 01:16:44,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2019-01-14 01:16:44,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-14 01:16:44,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-01-14 01:16:44,406 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 22 [2019-01-14 01:16:44,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:16:44,408 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-01-14 01:16:44,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 01:16:44,408 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-01-14 01:16:44,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 01:16:44,409 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:16:44,409 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2019-01-14 01:16:44,409 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:16:44,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:16:44,409 INFO L82 PathProgramCache]: Analyzing trace with hash 108793383, now seen corresponding path program 5 times [2019-01-14 01:16:44,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:16:44,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:16:44,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:44,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:16:44,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:44,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:16:44,610 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:16:44,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:16:44,611 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:16:44,627 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 01:16:44,659 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-14 01:16:44,659 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:16:44,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:16:44,703 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:16:44,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:16:44,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2019-01-14 01:16:44,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-14 01:16:44,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-14 01:16:44,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-01-14 01:16:44,729 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2019-01-14 01:16:45,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:16:45,051 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-01-14 01:16:45,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 01:16:45,052 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2019-01-14 01:16:45,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:16:45,053 INFO L225 Difference]: With dead ends: 42 [2019-01-14 01:16:45,054 INFO L226 Difference]: Without dead ends: 36 [2019-01-14 01:16:45,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2019-01-14 01:16:45,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-14 01:16:45,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2019-01-14 01:16:45,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-14 01:16:45,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-01-14 01:16:45,060 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 26 [2019-01-14 01:16:45,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:16:45,062 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-01-14 01:16:45,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-14 01:16:45,062 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-01-14 01:16:45,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 01:16:45,063 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:16:45,065 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2019-01-14 01:16:45,065 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:16:45,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:16:45,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1590598869, now seen corresponding path program 6 times [2019-01-14 01:16:45,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:16:45,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:16:45,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:45,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:16:45,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:45,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:16:45,372 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:16:45,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:16:45,372 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:16:45,382 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 01:16:45,439 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-14 01:16:45,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:16:45,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:16:45,505 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:16:45,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:16:45,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2019-01-14 01:16:45,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-14 01:16:45,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-14 01:16:45,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-01-14 01:16:45,532 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2019-01-14 01:16:46,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:16:46,008 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2019-01-14 01:16:46,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 01:16:46,009 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-01-14 01:16:46,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:16:46,010 INFO L225 Difference]: With dead ends: 46 [2019-01-14 01:16:46,010 INFO L226 Difference]: Without dead ends: 40 [2019-01-14 01:16:46,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2019-01-14 01:16:46,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-14 01:16:46,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2019-01-14 01:16:46,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-14 01:16:46,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-01-14 01:16:46,016 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 30 [2019-01-14 01:16:46,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:16:46,017 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-01-14 01:16:46,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-14 01:16:46,017 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-01-14 01:16:46,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-14 01:16:46,018 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:16:46,018 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2019-01-14 01:16:46,019 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:16:46,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:16:46,019 INFO L82 PathProgramCache]: Analyzing trace with hash -2022926801, now seen corresponding path program 7 times [2019-01-14 01:16:46,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:16:46,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:16:46,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:46,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:16:46,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:46,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:16:46,254 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:16:46,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:16:46,254 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:16:46,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:16:46,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:16:46,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:16:46,761 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:16:46,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:16:46,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2019-01-14 01:16:46,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-14 01:16:46,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-14 01:16:46,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-01-14 01:16:46,796 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2019-01-14 01:16:47,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:16:47,133 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2019-01-14 01:16:47,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-14 01:16:47,134 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 34 [2019-01-14 01:16:47,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:16:47,135 INFO L225 Difference]: With dead ends: 50 [2019-01-14 01:16:47,136 INFO L226 Difference]: Without dead ends: 44 [2019-01-14 01:16:47,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=199, Invalid=451, Unknown=0, NotChecked=0, Total=650 [2019-01-14 01:16:47,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-14 01:16:47,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2019-01-14 01:16:47,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-14 01:16:47,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-01-14 01:16:47,141 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 34 [2019-01-14 01:16:47,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:16:47,142 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-01-14 01:16:47,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-14 01:16:47,142 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-01-14 01:16:47,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-14 01:16:47,143 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:16:47,143 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2019-01-14 01:16:47,143 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:16:47,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:16:47,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1492211917, now seen corresponding path program 8 times [2019-01-14 01:16:47,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:16:47,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:16:47,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:47,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:16:47,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:16:47,632 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:16:47,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:16:47,632 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:16:47,641 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:16:47,661 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:16:47,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:16:47,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:16:47,700 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:16:47,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:16:47,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 21 [2019-01-14 01:16:47,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-14 01:16:47,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-14 01:16:47,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-01-14 01:16:47,721 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2019-01-14 01:16:48,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:16:48,046 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2019-01-14 01:16:48,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-14 01:16:48,047 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2019-01-14 01:16:48,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:16:48,048 INFO L225 Difference]: With dead ends: 54 [2019-01-14 01:16:48,049 INFO L226 Difference]: Without dead ends: 48 [2019-01-14 01:16:48,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=246, Invalid=566, Unknown=0, NotChecked=0, Total=812 [2019-01-14 01:16:48,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-14 01:16:48,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2019-01-14 01:16:48,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-14 01:16:48,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-01-14 01:16:48,055 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 38 [2019-01-14 01:16:48,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:16:48,055 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-01-14 01:16:48,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-14 01:16:48,055 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-01-14 01:16:48,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-14 01:16:48,056 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:16:48,056 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2019-01-14 01:16:48,057 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:16:48,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:16:48,057 INFO L82 PathProgramCache]: Analyzing trace with hash 360224311, now seen corresponding path program 9 times [2019-01-14 01:16:48,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:16:48,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:16:48,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:48,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:16:48,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:16:48,340 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:16:48,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:16:48,340 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:16:48,350 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:16:48,404 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-14 01:16:48,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:16:48,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:16:48,444 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:16:48,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:16:48,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2019-01-14 01:16:48,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-14 01:16:48,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-14 01:16:48,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2019-01-14 01:16:48,467 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2019-01-14 01:16:48,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:16:48,722 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2019-01-14 01:16:48,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-14 01:16:48,723 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 42 [2019-01-14 01:16:48,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:16:48,724 INFO L225 Difference]: With dead ends: 58 [2019-01-14 01:16:48,724 INFO L226 Difference]: Without dead ends: 52 [2019-01-14 01:16:48,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=298, Invalid=694, Unknown=0, NotChecked=0, Total=992 [2019-01-14 01:16:48,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-14 01:16:48,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2019-01-14 01:16:48,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-14 01:16:48,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-01-14 01:16:48,733 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 42 [2019-01-14 01:16:48,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:16:48,733 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-01-14 01:16:48,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-14 01:16:48,733 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-01-14 01:16:48,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-14 01:16:48,734 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:16:48,734 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2019-01-14 01:16:48,735 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:16:48,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:16:48,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1334534971, now seen corresponding path program 10 times [2019-01-14 01:16:48,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:16:48,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:16:48,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:48,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:16:48,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:48,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:16:49,067 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:16:49,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:16:49,067 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:16:49,077 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 01:16:49,110 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 01:16:49,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:16:49,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:16:49,144 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:16:49,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:16:49,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 25 [2019-01-14 01:16:49,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-14 01:16:49,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-14 01:16:49,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-01-14 01:16:49,170 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2019-01-14 01:16:49,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:16:49,634 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2019-01-14 01:16:49,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-14 01:16:49,635 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2019-01-14 01:16:49,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:16:49,636 INFO L225 Difference]: With dead ends: 62 [2019-01-14 01:16:49,636 INFO L226 Difference]: Without dead ends: 56 [2019-01-14 01:16:49,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2019-01-14 01:16:49,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-14 01:16:49,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2019-01-14 01:16:49,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-14 01:16:49,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-01-14 01:16:49,643 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 46 [2019-01-14 01:16:49,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:16:49,644 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-01-14 01:16:49,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-14 01:16:49,644 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-01-14 01:16:49,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-14 01:16:49,645 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:16:49,645 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2019-01-14 01:16:49,645 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:16:49,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:16:49,646 INFO L82 PathProgramCache]: Analyzing trace with hash 2041056831, now seen corresponding path program 11 times [2019-01-14 01:16:49,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:16:49,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:16:49,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:49,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:16:49,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:16:50,014 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:16:50,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:16:50,015 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:16:50,027 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 01:16:50,115 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-01-14 01:16:50,116 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:16:50,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:16:50,168 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:16:50,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:16:50,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 27 [2019-01-14 01:16:50,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-14 01:16:50,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-14 01:16:50,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2019-01-14 01:16:50,198 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2019-01-14 01:16:50,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:16:50,518 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2019-01-14 01:16:50,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-14 01:16:50,519 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 50 [2019-01-14 01:16:50,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:16:50,520 INFO L225 Difference]: With dead ends: 66 [2019-01-14 01:16:50,520 INFO L226 Difference]: Without dead ends: 60 [2019-01-14 01:16:50,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=417, Invalid=989, Unknown=0, NotChecked=0, Total=1406 [2019-01-14 01:16:50,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-14 01:16:50,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2019-01-14 01:16:50,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-14 01:16:50,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-01-14 01:16:50,527 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 50 [2019-01-14 01:16:50,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:16:50,527 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-01-14 01:16:50,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-14 01:16:50,528 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-01-14 01:16:50,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-14 01:16:50,530 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:16:50,530 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2019-01-14 01:16:50,531 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:16:50,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:16:50,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1615882429, now seen corresponding path program 12 times [2019-01-14 01:16:50,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:16:50,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:16:50,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:50,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:16:50,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:50,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:16:51,716 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:16:51,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:16:51,717 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:16:51,730 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 01:16:51,833 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-01-14 01:16:51,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:16:51,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:16:51,944 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:16:51,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:16:51,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 29 [2019-01-14 01:16:51,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-14 01:16:51,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-14 01:16:51,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2019-01-14 01:16:51,966 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2019-01-14 01:16:52,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:16:52,580 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2019-01-14 01:16:52,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-14 01:16:52,581 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 54 [2019-01-14 01:16:52,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:16:52,582 INFO L225 Difference]: With dead ends: 70 [2019-01-14 01:16:52,582 INFO L226 Difference]: Without dead ends: 64 [2019-01-14 01:16:52,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=484, Invalid=1156, Unknown=0, NotChecked=0, Total=1640 [2019-01-14 01:16:52,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-14 01:16:52,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2019-01-14 01:16:52,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-14 01:16:52,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-01-14 01:16:52,589 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 54 [2019-01-14 01:16:52,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:16:52,589 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-01-14 01:16:52,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-14 01:16:52,590 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-01-14 01:16:52,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-14 01:16:52,590 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:16:52,591 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2019-01-14 01:16:52,591 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:16:52,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:16:52,591 INFO L82 PathProgramCache]: Analyzing trace with hash -184353209, now seen corresponding path program 13 times [2019-01-14 01:16:52,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:16:52,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:16:52,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:52,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:16:52,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:52,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:16:52,965 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:16:52,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:16:52,965 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:16:52,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:16:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:16:53,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:16:53,082 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:16:53,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:16:53,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 31 [2019-01-14 01:16:53,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-14 01:16:53,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-14 01:16:53,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2019-01-14 01:16:53,112 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2019-01-14 01:16:53,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:16:53,588 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2019-01-14 01:16:53,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-14 01:16:53,589 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 58 [2019-01-14 01:16:53,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:16:53,590 INFO L225 Difference]: With dead ends: 74 [2019-01-14 01:16:53,590 INFO L226 Difference]: Without dead ends: 68 [2019-01-14 01:16:53,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=556, Invalid=1336, Unknown=0, NotChecked=0, Total=1892 [2019-01-14 01:16:53,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-14 01:16:53,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2019-01-14 01:16:53,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-14 01:16:53,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-01-14 01:16:53,596 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 58 [2019-01-14 01:16:53,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:16:53,596 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-01-14 01:16:53,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-14 01:16:53,597 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-01-14 01:16:53,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-14 01:16:53,601 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:16:53,601 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2019-01-14 01:16:53,601 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:16:53,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:16:53,602 INFO L82 PathProgramCache]: Analyzing trace with hash 344146763, now seen corresponding path program 14 times [2019-01-14 01:16:53,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:16:53,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:16:53,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:53,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:16:53,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:53,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:16:54,077 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:16:54,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:16:54,077 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:16:54,092 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:16:54,121 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:16:54,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:16:54,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:16:54,171 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:16:54,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:16:54,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 33 [2019-01-14 01:16:54,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-14 01:16:54,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-14 01:16:54,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2019-01-14 01:16:54,203 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2019-01-14 01:16:54,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:16:54,586 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2019-01-14 01:16:54,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-14 01:16:54,587 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 62 [2019-01-14 01:16:54,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:16:54,588 INFO L225 Difference]: With dead ends: 78 [2019-01-14 01:16:54,588 INFO L226 Difference]: Without dead ends: 72 [2019-01-14 01:16:54,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=633, Invalid=1529, Unknown=0, NotChecked=0, Total=2162 [2019-01-14 01:16:54,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-14 01:16:54,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2019-01-14 01:16:54,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-14 01:16:54,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-01-14 01:16:54,596 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 62 [2019-01-14 01:16:54,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:16:54,596 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-01-14 01:16:54,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-14 01:16:54,597 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-01-14 01:16:54,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-14 01:16:54,597 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:16:54,598 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 1, 1, 1, 1, 1, 1] [2019-01-14 01:16:54,598 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:16:54,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:16:54,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1083270735, now seen corresponding path program 15 times [2019-01-14 01:16:54,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:16:54,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:16:54,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:54,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:16:54,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:54,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:16:56,247 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:16:56,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:16:56,247 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:16:56,257 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:16:56,487 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-14 01:16:56,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:16:56,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:16:56,550 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:16:56,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:16:56,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 35 [2019-01-14 01:16:56,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-14 01:16:56,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-14 01:16:56,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2019-01-14 01:16:56,581 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2019-01-14 01:16:57,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:16:57,674 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2019-01-14 01:16:57,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-14 01:16:57,675 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 66 [2019-01-14 01:16:57,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:16:57,676 INFO L225 Difference]: With dead ends: 82 [2019-01-14 01:16:57,676 INFO L226 Difference]: Without dead ends: 76 [2019-01-14 01:16:57,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=715, Invalid=1735, Unknown=0, NotChecked=0, Total=2450 [2019-01-14 01:16:57,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-14 01:16:57,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2019-01-14 01:16:57,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-14 01:16:57,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-01-14 01:16:57,682 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 66 [2019-01-14 01:16:57,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:16:57,682 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-01-14 01:16:57,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-14 01:16:57,683 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-01-14 01:16:57,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-14 01:16:57,683 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:16:57,684 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 1, 1, 1, 1, 1, 1] [2019-01-14 01:16:57,684 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:16:57,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:16:57,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1559337133, now seen corresponding path program 16 times [2019-01-14 01:16:57,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:16:57,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:16:57,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:57,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:16:57,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:16:58,192 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:16:58,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:16:58,192 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:16:58,204 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 01:16:58,232 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 01:16:58,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:16:58,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:16:58,275 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:16:58,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:16:58,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 37 [2019-01-14 01:16:58,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-14 01:16:58,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-14 01:16:58,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2019-01-14 01:16:58,297 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2019-01-14 01:16:58,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:16:58,798 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2019-01-14 01:16:58,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-14 01:16:58,799 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 70 [2019-01-14 01:16:58,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:16:58,799 INFO L225 Difference]: With dead ends: 86 [2019-01-14 01:16:58,799 INFO L226 Difference]: Without dead ends: 80 [2019-01-14 01:16:58,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=802, Invalid=1954, Unknown=0, NotChecked=0, Total=2756 [2019-01-14 01:16:58,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-14 01:16:58,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2019-01-14 01:16:58,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-14 01:16:58,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-01-14 01:16:58,805 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 70 [2019-01-14 01:16:58,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:16:58,806 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-01-14 01:16:58,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-14 01:16:58,806 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-01-14 01:16:58,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-14 01:16:58,807 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:16:58,807 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 1, 1, 1, 1, 1, 1] [2019-01-14 01:16:58,807 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:16:58,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:16:58,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1923398057, now seen corresponding path program 17 times [2019-01-14 01:16:58,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:16:58,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:16:58,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:58,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:16:58,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:58,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:16:59,320 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:16:59,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:16:59,320 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:16:59,331 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 01:16:59,479 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-01-14 01:16:59,479 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:16:59,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:16:59,533 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:16:59,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:16:59,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 39 [2019-01-14 01:16:59,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-14 01:16:59,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-14 01:16:59,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2019-01-14 01:16:59,554 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2019-01-14 01:16:59,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:16:59,963 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2019-01-14 01:16:59,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-14 01:16:59,965 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 74 [2019-01-14 01:16:59,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:16:59,966 INFO L225 Difference]: With dead ends: 90 [2019-01-14 01:16:59,966 INFO L226 Difference]: Without dead ends: 84 [2019-01-14 01:16:59,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=894, Invalid=2186, Unknown=0, NotChecked=0, Total=3080 [2019-01-14 01:16:59,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-14 01:16:59,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2019-01-14 01:16:59,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-14 01:16:59,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-01-14 01:16:59,972 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 74 [2019-01-14 01:16:59,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:16:59,972 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-01-14 01:16:59,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-14 01:16:59,972 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-01-14 01:16:59,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-14 01:16:59,973 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:16:59,973 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 1, 1, 1, 1, 1, 1] [2019-01-14 01:16:59,973 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:16:59,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:16:59,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1202125989, now seen corresponding path program 18 times [2019-01-14 01:16:59,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:16:59,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:16:59,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:59,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:16:59,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:59,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:00,789 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:17:00,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:17:00,790 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:17:00,801 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 01:17:01,242 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2019-01-14 01:17:01,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:17:01,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:17:01,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2019-01-14 01:17:01,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-14 01:17:01,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 01:17:01,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 01:17:01,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 01:17:01,494 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2019-01-14 01:17:01,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2019-01-14 01:17:01,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 01:17:01,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2019-01-14 01:17:01,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 01:17:01,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 01:17:01,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 01:17:01,793 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-01-14 01:17:01,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2019-01-14 01:17:01,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 01:17:01,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2019-01-14 01:17:01,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 01:17:02,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 01:17:02,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 01:17:02,011 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-01-14 01:17:02,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2019-01-14 01:17:02,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 01:17:02,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2019-01-14 01:17:02,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 01:17:02,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 01:17:02,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 01:17:02,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-01-14 01:17:02,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2019-01-14 01:17:02,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 01:17:02,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2019-01-14 01:17:02,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 01:17:02,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 01:17:02,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 01:17:02,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-01-14 01:17:02,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2019-01-14 01:17:02,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 01:17:02,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2019-01-14 01:17:02,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 01:17:02,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 01:17:02,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 01:17:02,562 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-01-14 01:17:02,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2019-01-14 01:17:02,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 01:17:02,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2019-01-14 01:17:02,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 01:17:02,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 01:17:02,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 01:17:02,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-01-14 01:17:02,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2019-01-14 01:17:02,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 01:17:02,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2019-01-14 01:17:02,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 01:17:02,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 01:17:02,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 01:17:02,831 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-01-14 01:17:02,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2019-01-14 01:17:02,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 01:17:02,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2019-01-14 01:17:02,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 01:17:02,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 01:17:02,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 01:17:02,942 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:13 [2019-01-14 01:17:03,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2019-01-14 01:17:03,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 34 [2019-01-14 01:17:03,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 01:17:03,471 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 01:17:03,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 01:17:03,713 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2019-01-14 01:17:04,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-01-14 01:17:04,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 34 [2019-01-14 01:17:04,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 01:17:04,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 01:17:04,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2019-01-14 01:17:04,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-14 01:17:04,548 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 01:17:04,559 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 01:17:04,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 01:17:04,584 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:34 [2019-01-14 01:17:04,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2019-01-14 01:17:04,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-14 01:17:04,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 01:17:04,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 01:17:05,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-01-14 01:17:05,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 34 [2019-01-14 01:17:05,259 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-14 01:17:05,273 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 01:17:05,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 01:17:05,303 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:34 [2019-01-14 01:17:05,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2019-01-14 01:17:05,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-14 01:17:05,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 01:17:05,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 01:17:05,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-01-14 01:17:05,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 34 [2019-01-14 01:17:05,547 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-14 01:17:05,564 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 01:17:05,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 01:17:05,590 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:34 [2019-01-14 01:17:05,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2019-01-14 01:17:05,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-14 01:17:05,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 01:17:05,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 01:17:05,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-01-14 01:17:05,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 34 [2019-01-14 01:17:05,804 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-14 01:17:05,824 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 01:17:05,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 01:17:05,852 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:34 [2019-01-14 01:17:05,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2019-01-14 01:17:05,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-14 01:17:05,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 01:17:06,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 01:17:06,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-01-14 01:17:06,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 34 [2019-01-14 01:17:06,045 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-14 01:17:06,060 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 01:17:06,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 01:17:06,087 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:34 [2019-01-14 01:17:06,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-14 01:17:06,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-01-14 01:17:06,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 01:17:06,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 01:17:06,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 01:17:06,249 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-01-14 01:17:06,312 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 78 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:17:06,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:17:06,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 40] total 78 [2019-01-14 01:17:06,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-14 01:17:06,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-14 01:17:06,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1017, Invalid=4989, Unknown=0, NotChecked=0, Total=6006 [2019-01-14 01:17:06,334 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 78 states. [2019-01-14 01:17:09,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:09,093 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2019-01-14 01:17:09,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-14 01:17:09,095 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-01-14 01:17:09,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:09,096 INFO L225 Difference]: With dead ends: 93 [2019-01-14 01:17:09,096 INFO L226 Difference]: Without dead ends: 87 [2019-01-14 01:17:09,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4096 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=2413, Invalid=10243, Unknown=0, NotChecked=0, Total=12656 [2019-01-14 01:17:09,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-14 01:17:09,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2019-01-14 01:17:09,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-14 01:17:09,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2019-01-14 01:17:09,104 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 78 [2019-01-14 01:17:09,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:09,104 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2019-01-14 01:17:09,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-14 01:17:09,104 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2019-01-14 01:17:09,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-14 01:17:09,105 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:09,105 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:17:09,110 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:09,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:09,110 INFO L82 PathProgramCache]: Analyzing trace with hash 145436095, now seen corresponding path program 1 times [2019-01-14 01:17:09,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:09,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:09,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:09,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:17:09,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:09,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:09,170 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-01-14 01:17:09,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:17:09,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 01:17:09,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 01:17:09,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 01:17:09,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:17:09,172 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 4 states. [2019-01-14 01:17:09,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:09,192 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2019-01-14 01:17:09,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 01:17:09,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-01-14 01:17:09,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:09,195 INFO L225 Difference]: With dead ends: 84 [2019-01-14 01:17:09,195 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 01:17:09,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-01-14 01:17:09,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 01:17:09,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 01:17:09,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 01:17:09,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 01:17:09,196 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2019-01-14 01:17:09,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:09,196 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 01:17:09,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 01:17:09,196 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 01:17:09,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 01:17:09,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 01:17:09,358 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 30 [2019-01-14 01:17:09,375 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 01:17:09,375 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2019-01-14 01:17:09,375 INFO L448 ceAbstractionStarter]: For program point L17(lines 17 19) no Hoare annotation was computed. [2019-01-14 01:17:09,375 INFO L448 ceAbstractionStarter]: For program point L17-2(lines 10 21) no Hoare annotation was computed. [2019-01-14 01:17:09,375 INFO L448 ceAbstractionStarter]: For program point L17-3(lines 17 19) no Hoare annotation was computed. [2019-01-14 01:17:09,375 INFO L448 ceAbstractionStarter]: For program point L13-2(lines 13 15) no Hoare annotation was computed. [2019-01-14 01:17:09,376 INFO L448 ceAbstractionStarter]: For program point L13-3(line 13) no Hoare annotation was computed. [2019-01-14 01:17:09,376 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 13) no Hoare annotation was computed. [2019-01-14 01:17:09,376 INFO L448 ceAbstractionStarter]: For program point L13-4(line 13) no Hoare annotation was computed. [2019-01-14 01:17:09,376 INFO L444 ceAbstractionStarter]: At program point L13-5(lines 13 15) the Hoare annotation is: (let ((.cse1 (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0.base|) (+ |ULTIMATE.start_main_~#a~0.offset| 12)) 2147483647)) (.cse0 (= |ULTIMATE.start_main_~#a~0.offset| 0))) (or (and .cse0 (<= 5 ULTIMATE.start_main_~i~0) .cse1) (and .cse0 (= ULTIMATE.start_main_~i~0 1)) (and .cse0 (= ULTIMATE.start_main_~i~0 0)) (and .cse0 (= ULTIMATE.start_main_~i~0 4) .cse1) (and .cse0 (= ULTIMATE.start_main_~i~0 3)) (and .cse0 (= ULTIMATE.start_main_~i~0 2)))) [2019-01-14 01:17:09,376 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-14 01:17:09,376 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 01:17:09,376 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 01:17:09,377 INFO L451 ceAbstractionStarter]: At program point L20(lines 10 21) the Hoare annotation is: true [2019-01-14 01:17:09,377 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2019-01-14 01:17:09,377 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2019-01-14 01:17:09,377 INFO L448 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. [2019-01-14 01:17:09,377 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 13) no Hoare annotation was computed. [2019-01-14 01:17:09,385 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 01:17:09,386 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 01:17:09,397 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 01:17:09,397 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 01:17:09,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 01:17:09 BoogieIcfgContainer [2019-01-14 01:17:09,400 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 01:17:09,401 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 01:17:09,401 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 01:17:09,401 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 01:17:09,402 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:16:41" (3/4) ... [2019-01-14 01:17:09,406 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 01:17:09,417 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-14 01:17:09,417 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 01:17:09,417 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-14 01:17:09,456 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 01:17:09,456 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 01:17:09,457 INFO L168 Benchmark]: Toolchain (without parser) took 29287.30 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 353.4 MB). Free memory was 948.7 MB in the beginning and 857.2 MB in the end (delta: 91.4 MB). Peak memory consumption was 444.8 MB. Max. memory is 11.5 GB. [2019-01-14 01:17:09,458 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:17:09,458 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.66 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 01:17:09,459 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.96 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:17:09,459 INFO L168 Benchmark]: Boogie Preprocessor took 23.25 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 01:17:09,459 INFO L168 Benchmark]: RCFGBuilder took 463.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -176.2 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-14 01:17:09,462 INFO L168 Benchmark]: TraceAbstraction took 28370.01 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 220.2 MB). Free memory was 1.1 GB in the beginning and 867.5 MB in the end (delta: 241.3 MB). Peak memory consumption was 461.5 MB. Max. memory is 11.5 GB. [2019-01-14 01:17:09,463 INFO L168 Benchmark]: Witness Printer took 55.49 ms. Allocated memory is still 1.4 GB. Free memory was 867.5 MB in the beginning and 857.2 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 11.5 GB. [2019-01-14 01:17:09,468 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 311.66 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 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 55.96 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.25 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 463.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -176.2 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28370.01 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 220.2 MB). Free memory was 1.1 GB in the beginning and 867.5 MB in the end (delta: 241.3 MB). Peak memory consumption was 461.5 MB. Max. memory is 11.5 GB. * Witness Printer took 55.49 ms. Allocated memory is still 1.4 GB. Free memory was 867.5 MB in the beginning and 857.2 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: 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: 13]: Loop Invariant [2019-01-14 01:17:09,483 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 01:17:09,483 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 01:17:09,484 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 01:17:09,485 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((a == 0 && 5 <= i) && unknown-#memory_int-unknown[a][a + 12] <= 2147483647) || (a == 0 && i == 1)) || (a == 0 && i == 0)) || ((a == 0 && i == 4) && unknown-#memory_int-unknown[a][a + 12] <= 2147483647)) || (a == 0 && i == 3)) || (a == 0 && i == 2) - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 4 error locations. SAFE Result, 28.2s OverallTime, 22 OverallIterations, 19 TraceHistogramMax, 10.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 196 SDtfs, 717 SDslu, 2470 SDs, 0 SdLazy, 3564 SolverSat, 114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1387 GetRequests, 744 SyntacticMatches, 5 SemanticMatches, 638 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7622 ImplicationChecksByTransitivity, 16.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 55 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 22 NumberOfFragments, 62 HoareAnnotationTreeSize, 2 FomulaSimplifications, 176 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 165 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 15.1s InterpolantComputationTime, 1701 NumberOfCodeBlocks, 1697 NumberOfCodeBlocksAsserted, 142 NumberOfCheckSat, 1660 ConstructedInterpolants, 0 QuantifiedInterpolants, 316804 SizeOfPredicates, 194 NumberOfNonLiveVariables, 2167 ConjunctsInSsa, 410 ConjunctsInUnsatCore, 41 InterpolantComputations, 4 PerfectInterpolantSequences, 788/8808 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...