./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/Arrays01-EquivalentConstantIndices-1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-crafted/Arrays01-EquivalentConstantIndices-1.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.25-f470102 [2019-11-28 20:22:20,195 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:22:20,198 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:22:20,217 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:22:20,218 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:22:20,220 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:22:20,222 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:22:20,232 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:22:20,235 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:22:20,237 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:22:20,237 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:22:20,239 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:22:20,239 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:22:20,240 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:22:20,241 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:22:20,243 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:22:20,244 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:22:20,245 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:22:20,246 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:22:20,248 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:22:20,250 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:22:20,251 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:22:20,253 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:22:20,253 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:22:20,256 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:22:20,256 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:22:20,257 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:22:20,258 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:22:20,258 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:22:20,259 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:22:20,260 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:22:20,261 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:22:20,262 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:22:20,263 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:22:20,264 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:22:20,264 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:22:20,265 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:22:20,265 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:22:20,265 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:22:20,267 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:22:20,267 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:22:20,268 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-11-28 20:22:20,283 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:22:20,284 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:22:20,285 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:22:20,285 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:22:20,286 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:22:20,286 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:22:20,286 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:22:20,287 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:22:20,287 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:22:20,287 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 20:22:20,288 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 20:22:20,288 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 20:22:20,288 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-28 20:22:20,288 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:22:20,289 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:22:20,289 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 20:22:20,289 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:22:20,290 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:22:20,290 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 20:22:20,290 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 20:22:20,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:22:20,291 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:22:20,291 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 20:22:20,291 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 20:22:20,292 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:22:20,292 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 20:22:20,292 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 20:22:20,293 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:22:20,293 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cf39454d83b4ec00341bd0b620b0fa6b2321ce21 [2019-11-28 20:22:20,630 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:22:20,651 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:22:20,657 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:22:20,659 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:22:20,660 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:22:20,662 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/Arrays01-EquivalentConstantIndices-1.c [2019-11-28 20:22:20,736 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/511023f4f/362d82ed92114b9c81e19b6aee0562dd/FLAGeacc699b7 [2019-11-28 20:22:21,190 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:22:21,191 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/Arrays01-EquivalentConstantIndices-1.c [2019-11-28 20:22:21,198 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/511023f4f/362d82ed92114b9c81e19b6aee0562dd/FLAGeacc699b7 [2019-11-28 20:22:21,605 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/511023f4f/362d82ed92114b9c81e19b6aee0562dd [2019-11-28 20:22:21,608 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:22:21,610 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:22:21,611 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:22:21,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:22:21,615 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:22:21,616 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:22:21" (1/1) ... [2019-11-28 20:22:21,619 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bceba86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:21, skipping insertion in model container [2019-11-28 20:22:21,619 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:22:21" (1/1) ... [2019-11-28 20:22:21,627 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:22:21,644 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:22:21,818 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:22:21,822 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:22:21,838 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:22:21,854 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:22:21,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:21 WrapperNode [2019-11-28 20:22:21,855 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:22:21,856 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:22:21,856 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:22:21,856 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:22:21,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:21" (1/1) ... [2019-11-28 20:22:21,925 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:21" (1/1) ... [2019-11-28 20:22:21,946 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:22:21,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:22:21,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:22:21,948 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:22:21,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:21" (1/1) ... [2019-11-28 20:22:21,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:21" (1/1) ... [2019-11-28 20:22:21,964 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:21" (1/1) ... [2019-11-28 20:22:21,965 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:21" (1/1) ... [2019-11-28 20:22:21,970 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:21" (1/1) ... [2019-11-28 20:22:21,974 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:21" (1/1) ... [2019-11-28 20:22:21,975 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:21" (1/1) ... [2019-11-28 20:22:21,977 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:22:21,978 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:22:21,978 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:22:21,978 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:22:21,979 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:22:22,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:22:22,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:22:22,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:22:22,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:22:22,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 20:22:22,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:22:22,248 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:22:22,248 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-28 20:22:22,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:22:22 BoogieIcfgContainer [2019-11-28 20:22:22,250 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:22:22,251 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 20:22:22,251 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 20:22:22,254 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 20:22:22,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:22:21" (1/3) ... [2019-11-28 20:22:22,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2986c79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:22:22, skipping insertion in model container [2019-11-28 20:22:22,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:21" (2/3) ... [2019-11-28 20:22:22,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2986c79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:22:22, skipping insertion in model container [2019-11-28 20:22:22,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:22:22" (3/3) ... [2019-11-28 20:22:22,257 INFO L109 eAbstractionObserver]: Analyzing ICFG Arrays01-EquivalentConstantIndices-1.c [2019-11-28 20:22:22,265 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 20:22:22,272 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-28 20:22:22,283 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-28 20:22:22,305 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 20:22:22,305 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 20:22:22,305 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 20:22:22,305 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:22:22,306 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:22:22,306 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 20:22:22,306 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:22:22,306 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 20:22:22,319 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-11-28 20:22:22,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 20:22:22,325 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:22,327 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 20:22:22,327 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:22,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:22,332 INFO L82 PathProgramCache]: Analyzing trace with hash 28698728, now seen corresponding path program 1 times [2019-11-28 20:22:22,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:22,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994610891] [2019-11-28 20:22:22,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:22,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:22,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:22,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994610891] [2019-11-28 20:22:22,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:22,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:22:22,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109520150] [2019-11-28 20:22:22,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:22:22,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:22,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:22:22,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:22:22,588 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 4 states. [2019-11-28 20:22:22,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:22,812 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2019-11-28 20:22:22,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:22:22,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-11-28 20:22:22,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:22,831 INFO L225 Difference]: With dead ends: 34 [2019-11-28 20:22:22,832 INFO L226 Difference]: Without dead ends: 18 [2019-11-28 20:22:22,839 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:22:22,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-11-28 20:22:22,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-28 20:22:22,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-28 20:22:22,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-11-28 20:22:22,894 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 5 [2019-11-28 20:22:22,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:22,895 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-11-28 20:22:22,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:22:22,896 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-11-28 20:22:22,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 20:22:22,897 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:22,898 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2019-11-28 20:22:22,898 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:22,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:22,899 INFO L82 PathProgramCache]: Analyzing trace with hash -363792156, now seen corresponding path program 1 times [2019-11-28 20:22:22,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:22,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37861953] [2019-11-28 20:22:22,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:22,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:22:22,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37861953] [2019-11-28 20:22:22,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:22,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:22:22,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363347889] [2019-11-28 20:22:22,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:22:22,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:22,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:22:22,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:22:22,985 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 4 states. [2019-11-28 20:22:23,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:23,017 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2019-11-28 20:22:23,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:22:23,018 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-28 20:22:23,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:23,019 INFO L225 Difference]: With dead ends: 18 [2019-11-28 20:22:23,019 INFO L226 Difference]: Without dead ends: 17 [2019-11-28 20:22:23,020 INFO L630 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-11-28 20:22:23,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-28 20:22:23,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-28 20:22:23,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 20:22:23,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-11-28 20:22:23,026 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 9 [2019-11-28 20:22:23,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:23,026 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-28 20:22:23,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:22:23,027 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-11-28 20:22:23,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 20:22:23,027 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:23,028 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:23,028 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:23,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:23,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1607296535, now seen corresponding path program 1 times [2019-11-28 20:22:23,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:23,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566459582] [2019-11-28 20:22:23,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:23,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:23,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:23,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566459582] [2019-11-28 20:22:23,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870315365] [2019-11-28 20:22:23,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:23,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:23,171 INFO L264 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:22:23,179 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:22:23,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:23,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:22:23,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-11-28 20:22:23,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601113284] [2019-11-28 20:22:23,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:22:23,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:23,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:22:23,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:22:23,228 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 7 states. [2019-11-28 20:22:23,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:23,310 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2019-11-28 20:22:23,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:22:23,311 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-11-28 20:22:23,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:23,312 INFO L225 Difference]: With dead ends: 28 [2019-11-28 20:22:23,312 INFO L226 Difference]: Without dead ends: 22 [2019-11-28 20:22:23,313 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:22:23,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-11-28 20:22:23,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2019-11-28 20:22:23,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-28 20:22:23,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-11-28 20:22:23,321 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 10 [2019-11-28 20:22:23,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:23,322 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-11-28 20:22:23,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:22:23,322 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-11-28 20:22:23,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 20:22:23,323 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:23,323 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2019-11-28 20:22:23,528 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:23,529 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:23,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:23,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1607345098, now seen corresponding path program 1 times [2019-11-28 20:22:23,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:23,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023584732] [2019-11-28 20:22:23,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:23,596 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:23,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023584732] [2019-11-28 20:22:23,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865837192] [2019-11-28 20:22:23,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:23,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:23,642 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:22:23,643 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:22:23,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:23,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:22:23,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2019-11-28 20:22:23,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070262359] [2019-11-28 20:22:23,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:22:23,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:23,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:22:23,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:22:23,674 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2019-11-28 20:22:23,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:23,742 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2019-11-28 20:22:23,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:22:23,743 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-11-28 20:22:23,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:23,744 INFO L225 Difference]: With dead ends: 18 [2019-11-28 20:22:23,744 INFO L226 Difference]: Without dead ends: 17 [2019-11-28 20:22:23,745 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:22:23,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-28 20:22:23,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-28 20:22:23,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 20:22:23,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-11-28 20:22:23,751 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 10 [2019-11-28 20:22:23,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:23,751 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-28 20:22:23,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:22:23,752 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-11-28 20:22:23,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 20:22:23,752 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:23,753 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:23,957 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:23,958 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:23,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:23,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1053474021, now seen corresponding path program 2 times [2019-11-28 20:22:23,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:23,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201664783] [2019-11-28 20:22:23,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:23,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:24,065 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:24,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201664783] [2019-11-28 20:22:24,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172308759] [2019-11-28 20:22:24,066 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:24,117 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:22:24,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:22:24,119 INFO L264 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:22:24,123 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:22:24,147 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:24,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:22:24,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-11-28 20:22:24,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729392298] [2019-11-28 20:22:24,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 20:22:24,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:24,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:22:24,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:22:24,154 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2019-11-28 20:22:24,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:24,216 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-11-28 20:22:24,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:22:24,217 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2019-11-28 20:22:24,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:24,218 INFO L225 Difference]: With dead ends: 30 [2019-11-28 20:22:24,218 INFO L226 Difference]: Without dead ends: 24 [2019-11-28 20:22:24,219 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:22:24,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-28 20:22:24,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-11-28 20:22:24,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-28 20:22:24,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-11-28 20:22:24,227 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2019-11-28 20:22:24,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:24,228 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-11-28 20:22:24,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 20:22:24,228 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-11-28 20:22:24,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 20:22:24,229 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:24,230 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:24,439 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:24,440 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:24,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:24,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1100938783, now seen corresponding path program 3 times [2019-11-28 20:22:24,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:24,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63425944] [2019-11-28 20:22:24,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:24,559 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:24,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63425944] [2019-11-28 20:22:24,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872505183] [2019-11-28 20:22:24,560 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:24,607 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-28 20:22:24,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:22:24,609 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:22:24,610 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:22:24,635 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:24,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:22:24,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2019-11-28 20:22:24,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677579222] [2019-11-28 20:22:24,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 20:22:24,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:24,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 20:22:24,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:22:24,638 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2019-11-28 20:22:24,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:24,725 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-11-28 20:22:24,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:22:24,729 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2019-11-28 20:22:24,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:24,730 INFO L225 Difference]: With dead ends: 34 [2019-11-28 20:22:24,730 INFO L226 Difference]: Without dead ends: 28 [2019-11-28 20:22:24,731 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:22:24,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-28 20:22:24,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-11-28 20:22:24,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-28 20:22:24,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-11-28 20:22:24,737 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 18 [2019-11-28 20:22:24,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:24,737 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-11-28 20:22:24,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 20:22:24,737 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-11-28 20:22:24,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 20:22:24,738 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:24,738 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:24,939 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:24,940 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:24,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:24,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1326737629, now seen corresponding path program 4 times [2019-11-28 20:22:24,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:24,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831645618] [2019-11-28 20:22:24,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:25,083 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:25,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831645618] [2019-11-28 20:22:25,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281602052] [2019-11-28 20:22:25,084 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:25,119 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 20:22:25,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:22:25,121 INFO L264 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 20:22:25,122 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:22:25,152 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:25,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:22:25,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2019-11-28 20:22:25,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203380169] [2019-11-28 20:22:25,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 20:22:25,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:25,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 20:22:25,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:22:25,155 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2019-11-28 20:22:25,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:25,269 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-11-28 20:22:25,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:22:25,270 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2019-11-28 20:22:25,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:25,271 INFO L225 Difference]: With dead ends: 38 [2019-11-28 20:22:25,271 INFO L226 Difference]: Without dead ends: 32 [2019-11-28 20:22:25,272 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-11-28 20:22:25,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-28 20:22:25,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2019-11-28 20:22:25,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-28 20:22:25,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-11-28 20:22:25,278 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 22 [2019-11-28 20:22:25,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:25,279 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-11-28 20:22:25,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 20:22:25,279 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-11-28 20:22:25,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 20:22:25,280 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:25,280 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:25,484 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:25,485 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:25,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:25,486 INFO L82 PathProgramCache]: Analyzing trace with hash 108793383, now seen corresponding path program 5 times [2019-11-28 20:22:25,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:25,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999814895] [2019-11-28 20:22:25,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:25,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:25,651 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:25,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999814895] [2019-11-28 20:22:25,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150097139] [2019-11-28 20:22:25,652 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:25,695 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-28 20:22:25,695 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:22:25,696 INFO L264 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 20:22:25,698 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:22:25,730 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:25,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:22:25,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2019-11-28 20:22:25,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963307191] [2019-11-28 20:22:25,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 20:22:25,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:25,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 20:22:25,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-11-28 20:22:25,733 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2019-11-28 20:22:25,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:25,852 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-11-28 20:22:25,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 20:22:25,855 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2019-11-28 20:22:25,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:25,856 INFO L225 Difference]: With dead ends: 42 [2019-11-28 20:22:25,856 INFO L226 Difference]: Without dead ends: 36 [2019-11-28 20:22:25,857 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2019-11-28 20:22:25,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-28 20:22:25,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2019-11-28 20:22:25,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-28 20:22:25,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-11-28 20:22:25,863 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 26 [2019-11-28 20:22:25,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:25,864 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-11-28 20:22:25,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 20:22:25,864 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-11-28 20:22:25,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 20:22:25,865 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:25,866 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:26,069 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:26,070 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:26,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:26,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1590598869, now seen corresponding path program 6 times [2019-11-28 20:22:26,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:26,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776974731] [2019-11-28 20:22:26,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:26,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:26,257 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:26,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776974731] [2019-11-28 20:22:26,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198730019] [2019-11-28 20:22:26,258 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:26,310 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-28 20:22:26,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:22:26,311 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 20:22:26,313 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:22:26,347 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:26,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:22:26,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2019-11-28 20:22:26,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455664396] [2019-11-28 20:22:26,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-28 20:22:26,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:26,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-28 20:22:26,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-11-28 20:22:26,350 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2019-11-28 20:22:26,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:26,485 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2019-11-28 20:22:26,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 20:22:26,486 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-11-28 20:22:26,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:26,487 INFO L225 Difference]: With dead ends: 46 [2019-11-28 20:22:26,487 INFO L226 Difference]: Without dead ends: 40 [2019-11-28 20:22:26,489 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2019-11-28 20:22:26,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-28 20:22:26,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2019-11-28 20:22:26,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-28 20:22:26,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-11-28 20:22:26,495 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 30 [2019-11-28 20:22:26,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:26,496 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-11-28 20:22:26,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-28 20:22:26,496 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-11-28 20:22:26,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 20:22:26,497 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:26,498 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:26,706 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:26,706 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:26,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:26,708 INFO L82 PathProgramCache]: Analyzing trace with hash -2022926801, now seen corresponding path program 7 times [2019-11-28 20:22:26,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:26,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756040672] [2019-11-28 20:22:26,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:26,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:26,936 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:26,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756040672] [2019-11-28 20:22:26,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969887708] [2019-11-28 20:22:26,937 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:26,977 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 20:22:26,979 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:22:27,016 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:27,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:22:27,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2019-11-28 20:22:27,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871085565] [2019-11-28 20:22:27,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-28 20:22:27,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:27,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-28 20:22:27,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-11-28 20:22:27,019 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2019-11-28 20:22:27,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:27,155 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2019-11-28 20:22:27,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-28 20:22:27,155 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 34 [2019-11-28 20:22:27,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:27,156 INFO L225 Difference]: With dead ends: 50 [2019-11-28 20:22:27,157 INFO L226 Difference]: Without dead ends: 44 [2019-11-28 20:22:27,157 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=199, Invalid=451, Unknown=0, NotChecked=0, Total=650 [2019-11-28 20:22:27,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-28 20:22:27,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2019-11-28 20:22:27,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-28 20:22:27,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-11-28 20:22:27,163 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 34 [2019-11-28 20:22:27,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:27,163 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-11-28 20:22:27,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-28 20:22:27,164 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-11-28 20:22:27,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-28 20:22:27,165 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:27,165 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:27,374 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:27,375 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:27,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:27,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1492211917, now seen corresponding path program 8 times [2019-11-28 20:22:27,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:27,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979274288] [2019-11-28 20:22:27,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:27,558 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:27,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979274288] [2019-11-28 20:22:27,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454098888] [2019-11-28 20:22:27,559 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:27,597 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:22:27,598 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:22:27,599 INFO L264 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-28 20:22:27,601 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:22:27,639 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:27,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:22:27,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 21 [2019-11-28 20:22:27,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659538721] [2019-11-28 20:22:27,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-28 20:22:27,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:27,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-28 20:22:27,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-11-28 20:22:27,642 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2019-11-28 20:22:27,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:27,827 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2019-11-28 20:22:27,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 20:22:27,827 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2019-11-28 20:22:27,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:27,828 INFO L225 Difference]: With dead ends: 54 [2019-11-28 20:22:27,828 INFO L226 Difference]: Without dead ends: 48 [2019-11-28 20:22:27,829 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=246, Invalid=566, Unknown=0, NotChecked=0, Total=812 [2019-11-28 20:22:27,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-28 20:22:27,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2019-11-28 20:22:27,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 20:22:27,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-11-28 20:22:27,835 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 38 [2019-11-28 20:22:27,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:27,835 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-11-28 20:22:27,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-28 20:22:27,836 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-11-28 20:22:27,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 20:22:27,837 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:27,837 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:28,047 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:28,047 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:28,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:28,048 INFO L82 PathProgramCache]: Analyzing trace with hash 360224311, now seen corresponding path program 9 times [2019-11-28 20:22:28,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:28,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916604179] [2019-11-28 20:22:28,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:28,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:28,300 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:28,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916604179] [2019-11-28 20:22:28,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006278454] [2019-11-28 20:22:28,301 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:28,383 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-28 20:22:28,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:22:28,384 INFO L264 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-28 20:22:28,386 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:22:28,423 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:28,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:22:28,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2019-11-28 20:22:28,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169888554] [2019-11-28 20:22:28,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-28 20:22:28,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:28,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-28 20:22:28,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2019-11-28 20:22:28,426 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2019-11-28 20:22:28,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:28,633 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2019-11-28 20:22:28,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-28 20:22:28,633 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 42 [2019-11-28 20:22:28,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:28,634 INFO L225 Difference]: With dead ends: 58 [2019-11-28 20:22:28,635 INFO L226 Difference]: Without dead ends: 52 [2019-11-28 20:22:28,636 INFO L630 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-11-28 20:22:28,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-28 20:22:28,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2019-11-28 20:22:28,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-28 20:22:28,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-11-28 20:22:28,642 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 42 [2019-11-28 20:22:28,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:28,642 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-11-28 20:22:28,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-28 20:22:28,643 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-11-28 20:22:28,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-28 20:22:28,644 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:28,644 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:28,848 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:28,849 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:28,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:28,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1334534971, now seen corresponding path program 10 times [2019-11-28 20:22:28,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:28,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554378311] [2019-11-28 20:22:28,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:28,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:29,134 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:29,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554378311] [2019-11-28 20:22:29,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715553288] [2019-11-28 20:22:29,135 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:29,171 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 20:22:29,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:22:29,172 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-28 20:22:29,174 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:22:29,205 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:29,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:22:29,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 25 [2019-11-28 20:22:29,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403664677] [2019-11-28 20:22:29,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-28 20:22:29,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:29,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-28 20:22:29,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-11-28 20:22:29,208 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2019-11-28 20:22:29,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:29,453 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2019-11-28 20:22:29,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-28 20:22:29,454 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2019-11-28 20:22:29,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:29,455 INFO L225 Difference]: With dead ends: 62 [2019-11-28 20:22:29,455 INFO L226 Difference]: Without dead ends: 56 [2019-11-28 20:22:29,456 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2019-11-28 20:22:29,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-28 20:22:29,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2019-11-28 20:22:29,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-28 20:22:29,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-11-28 20:22:29,463 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 46 [2019-11-28 20:22:29,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:29,463 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-11-28 20:22:29,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-28 20:22:29,464 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-11-28 20:22:29,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 20:22:29,465 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:29,465 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:29,676 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:29,677 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:29,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:29,677 INFO L82 PathProgramCache]: Analyzing trace with hash 2041056831, now seen corresponding path program 11 times [2019-11-28 20:22:29,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:29,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704027114] [2019-11-28 20:22:29,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:29,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:30,011 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:30,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704027114] [2019-11-28 20:22:30,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523035048] [2019-11-28 20:22:30,012 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:30,095 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-11-28 20:22:30,095 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:22:30,097 INFO L264 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-28 20:22:30,098 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:22:30,132 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:30,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:22:30,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 27 [2019-11-28 20:22:30,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776837508] [2019-11-28 20:22:30,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-28 20:22:30,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:30,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-28 20:22:30,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2019-11-28 20:22:30,135 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2019-11-28 20:22:30,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:30,380 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2019-11-28 20:22:30,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-28 20:22:30,381 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 50 [2019-11-28 20:22:30,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:30,382 INFO L225 Difference]: With dead ends: 66 [2019-11-28 20:22:30,382 INFO L226 Difference]: Without dead ends: 60 [2019-11-28 20:22:30,383 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=417, Invalid=989, Unknown=0, NotChecked=0, Total=1406 [2019-11-28 20:22:30,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-28 20:22:30,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2019-11-28 20:22:30,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-28 20:22:30,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-11-28 20:22:30,388 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 50 [2019-11-28 20:22:30,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:30,388 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-11-28 20:22:30,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-28 20:22:30,389 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-11-28 20:22:30,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-28 20:22:30,390 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:30,390 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:30,594 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:30,594 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:30,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:30,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1615882429, now seen corresponding path program 12 times [2019-11-28 20:22:30,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:30,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360012200] [2019-11-28 20:22:30,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:30,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:30,919 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:30,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360012200] [2019-11-28 20:22:30,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289406743] [2019-11-28 20:22:30,920 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:31,140 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-11-28 20:22:31,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:22:31,142 INFO L264 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-28 20:22:31,144 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:22:31,191 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:31,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:22:31,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 29 [2019-11-28 20:22:31,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91867966] [2019-11-28 20:22:31,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-28 20:22:31,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:31,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-28 20:22:31,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2019-11-28 20:22:31,193 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2019-11-28 20:22:31,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:31,498 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2019-11-28 20:22:31,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-28 20:22:31,498 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 54 [2019-11-28 20:22:31,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:31,499 INFO L225 Difference]: With dead ends: 70 [2019-11-28 20:22:31,499 INFO L226 Difference]: Without dead ends: 64 [2019-11-28 20:22:31,500 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=484, Invalid=1156, Unknown=0, NotChecked=0, Total=1640 [2019-11-28 20:22:31,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-28 20:22:31,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2019-11-28 20:22:31,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-28 20:22:31,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-11-28 20:22:31,506 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 54 [2019-11-28 20:22:31,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:31,507 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-11-28 20:22:31,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-28 20:22:31,507 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-11-28 20:22:31,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-28 20:22:31,508 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:31,508 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:31,712 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:31,713 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:31,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:31,713 INFO L82 PathProgramCache]: Analyzing trace with hash -184353209, now seen corresponding path program 13 times [2019-11-28 20:22:31,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:31,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495600050] [2019-11-28 20:22:31,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:32,019 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:32,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495600050] [2019-11-28 20:22:32,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821311410] [2019-11-28 20:22:32,020 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:32,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:32,061 INFO L264 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-28 20:22:32,063 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:22:32,100 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:32,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:22:32,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 31 [2019-11-28 20:22:32,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057280447] [2019-11-28 20:22:32,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-28 20:22:32,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:32,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-28 20:22:32,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2019-11-28 20:22:32,103 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2019-11-28 20:22:32,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:32,405 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2019-11-28 20:22:32,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-28 20:22:32,406 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 58 [2019-11-28 20:22:32,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:32,407 INFO L225 Difference]: With dead ends: 74 [2019-11-28 20:22:32,407 INFO L226 Difference]: Without dead ends: 68 [2019-11-28 20:22:32,409 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=556, Invalid=1336, Unknown=0, NotChecked=0, Total=1892 [2019-11-28 20:22:32,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-28 20:22:32,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2019-11-28 20:22:32,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-28 20:22:32,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-11-28 20:22:32,414 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 58 [2019-11-28 20:22:32,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:32,415 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-11-28 20:22:32,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-28 20:22:32,415 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-11-28 20:22:32,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-28 20:22:32,416 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:32,416 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:32,620 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:32,620 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:32,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:32,621 INFO L82 PathProgramCache]: Analyzing trace with hash 344146763, now seen corresponding path program 14 times [2019-11-28 20:22:32,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:32,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502712203] [2019-11-28 20:22:32,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:33,138 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:33,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502712203] [2019-11-28 20:22:33,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42273277] [2019-11-28 20:22:33,140 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:33,209 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:22:33,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:22:33,211 INFO L264 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-28 20:22:33,217 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:22:33,265 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:33,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:22:33,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 33 [2019-11-28 20:22:33,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647281944] [2019-11-28 20:22:33,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-28 20:22:33,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:33,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-28 20:22:33,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2019-11-28 20:22:33,274 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2019-11-28 20:22:33,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:33,628 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2019-11-28 20:22:33,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-28 20:22:33,629 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 62 [2019-11-28 20:22:33,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:33,629 INFO L225 Difference]: With dead ends: 78 [2019-11-28 20:22:33,630 INFO L226 Difference]: Without dead ends: 72 [2019-11-28 20:22:33,631 INFO L630 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-11-28 20:22:33,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-28 20:22:33,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2019-11-28 20:22:33,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-28 20:22:33,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-11-28 20:22:33,645 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 62 [2019-11-28 20:22:33,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:33,646 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-11-28 20:22:33,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-28 20:22:33,646 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-11-28 20:22:33,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-28 20:22:33,649 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:33,650 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:33,853 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:33,854 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:33,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:33,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1083270735, now seen corresponding path program 15 times [2019-11-28 20:22:33,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:33,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167739311] [2019-11-28 20:22:33,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:33,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:34,381 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:34,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167739311] [2019-11-28 20:22:34,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874460722] [2019-11-28 20:22:34,381 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:34,711 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-11-28 20:22:34,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:22:34,713 INFO L264 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-28 20:22:34,715 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:22:34,747 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:34,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:22:34,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 35 [2019-11-28 20:22:34,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714290800] [2019-11-28 20:22:34,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-11-28 20:22:34,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:34,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-11-28 20:22:34,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2019-11-28 20:22:34,750 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2019-11-28 20:22:35,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:35,108 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2019-11-28 20:22:35,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-28 20:22:35,109 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 66 [2019-11-28 20:22:35,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:35,110 INFO L225 Difference]: With dead ends: 82 [2019-11-28 20:22:35,110 INFO L226 Difference]: Without dead ends: 76 [2019-11-28 20:22:35,111 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=715, Invalid=1735, Unknown=0, NotChecked=0, Total=2450 [2019-11-28 20:22:35,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-28 20:22:35,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2019-11-28 20:22:35,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-28 20:22:35,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-11-28 20:22:35,116 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 66 [2019-11-28 20:22:35,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:35,116 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-11-28 20:22:35,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-11-28 20:22:35,117 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-11-28 20:22:35,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-28 20:22:35,117 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:35,118 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:35,318 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:35,318 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:35,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:35,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1559337133, now seen corresponding path program 16 times [2019-11-28 20:22:35,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:35,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467161649] [2019-11-28 20:22:35,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:35,742 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:35,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467161649] [2019-11-28 20:22:35,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745837086] [2019-11-28 20:22:35,744 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:35,787 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 20:22:35,788 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:22:35,789 INFO L264 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-28 20:22:35,791 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:22:35,842 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:35,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:22:35,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 37 [2019-11-28 20:22:35,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159887592] [2019-11-28 20:22:35,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-28 20:22:35,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:35,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-28 20:22:35,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2019-11-28 20:22:35,846 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2019-11-28 20:22:36,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:36,254 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2019-11-28 20:22:36,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-28 20:22:36,254 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 70 [2019-11-28 20:22:36,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:36,255 INFO L225 Difference]: With dead ends: 86 [2019-11-28 20:22:36,255 INFO L226 Difference]: Without dead ends: 80 [2019-11-28 20:22:36,256 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=802, Invalid=1954, Unknown=0, NotChecked=0, Total=2756 [2019-11-28 20:22:36,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-28 20:22:36,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2019-11-28 20:22:36,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-28 20:22:36,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-11-28 20:22:36,260 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 70 [2019-11-28 20:22:36,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:36,260 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-11-28 20:22:36,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-28 20:22:36,261 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-11-28 20:22:36,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-28 20:22:36,261 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:36,262 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:36,462 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:36,462 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:36,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:36,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1923398057, now seen corresponding path program 17 times [2019-11-28 20:22:36,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:36,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84631171] [2019-11-28 20:22:36,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:36,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:36,898 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:36,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84631171] [2019-11-28 20:22:36,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722382480] [2019-11-28 20:22:36,899 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:37,057 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-11-28 20:22:37,057 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:22:37,059 INFO L264 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-28 20:22:37,061 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:22:37,124 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:37,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:22:37,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 39 [2019-11-28 20:22:37,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496201431] [2019-11-28 20:22:37,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-11-28 20:22:37,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:37,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-11-28 20:22:37,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2019-11-28 20:22:37,127 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2019-11-28 20:22:37,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:37,547 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2019-11-28 20:22:37,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-28 20:22:37,548 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 74 [2019-11-28 20:22:37,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:37,549 INFO L225 Difference]: With dead ends: 90 [2019-11-28 20:22:37,549 INFO L226 Difference]: Without dead ends: 84 [2019-11-28 20:22:37,552 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=894, Invalid=2186, Unknown=0, NotChecked=0, Total=3080 [2019-11-28 20:22:37,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-28 20:22:37,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2019-11-28 20:22:37,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-28 20:22:37,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-11-28 20:22:37,556 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 74 [2019-11-28 20:22:37,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:37,556 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-11-28 20:22:37,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-11-28 20:22:37,557 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-11-28 20:22:37,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-28 20:22:37,557 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:37,558 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:37,762 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:37,762 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:37,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:37,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1202125989, now seen corresponding path program 18 times [2019-11-28 20:22:37,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:37,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224915992] [2019-11-28 20:22:37,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:37,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:38,243 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:38,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224915992] [2019-11-28 20:22:38,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535154311] [2019-11-28 20:22:38,244 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:38,658 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2019-11-28 20:22:38,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:22:38,661 INFO L264 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 63 conjunts are in the unsatisfiable core [2019-11-28 20:22:38,663 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:22:38,828 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2019-11-28 20:22:38,829 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:22:38,840 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:22:38,842 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:22:38,842 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2019-11-28 20:22:38,967 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:22:38,969 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-11-28 20:22:38,971 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:22:38,996 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:22:38,996 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:22:38,997 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-11-28 20:22:39,088 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:22:39,089 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-11-28 20:22:39,090 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:22:39,098 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:22:39,099 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:22:39,099 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-11-28 20:22:39,203 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:22:39,205 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-11-28 20:22:39,206 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:22:39,215 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:22:39,216 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:22:39,216 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-11-28 20:22:39,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:22:39,455 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-11-28 20:22:39,456 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:22:39,465 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:22:39,465 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:22:39,465 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-11-28 20:22:39,560 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:22:39,561 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-11-28 20:22:39,561 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:22:39,570 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:22:39,571 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:22:39,571 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-11-28 20:22:39,706 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:22:39,708 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-11-28 20:22:39,708 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:22:39,716 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:22:39,716 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:22:39,716 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-11-28 20:22:39,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:22:39,824 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-11-28 20:22:39,825 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:22:39,832 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:22:39,833 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:22:39,833 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-11-28 20:22:39,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:22:39,920 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-11-28 20:22:39,921 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:22:39,930 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:22:39,931 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:22:39,931 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:13 [2019-11-28 20:22:39,992 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:22:39,992 INFO L377 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 1 case distinctions, treesize of input 25 treesize of output 54 [2019-11-28 20:22:39,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:22:39,996 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:22:40,018 INFO L614 ElimStorePlain]: treesize reduction 20, result has 63.0 percent of original size [2019-11-28 20:22:40,019 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:22:40,019 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:23 [2019-11-28 20:22:40,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:22:40,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:22:40,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:22:40,236 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:22:40,237 INFO L377 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 1 case distinctions, treesize of input 25 treesize of output 54 [2019-11-28 20:22:40,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:22:40,239 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:22:40,248 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2019-11-28 20:22:40,249 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:22:40,302 INFO L614 ElimStorePlain]: treesize reduction 30, result has 58.9 percent of original size [2019-11-28 20:22:40,302 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-28 20:22:40,303 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:21 [2019-11-28 20:22:40,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:22:40,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:22:40,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:22:40,490 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2019-11-28 20:22:40,491 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:22:40,510 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:22:40,511 INFO L377 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 1 case distinctions, treesize of input 25 treesize of output 54 [2019-11-28 20:22:40,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:22:40,515 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:22:40,551 INFO L614 ElimStorePlain]: treesize reduction 30, result has 58.9 percent of original size [2019-11-28 20:22:40,552 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-28 20:22:40,552 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:21 [2019-11-28 20:22:40,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:22:40,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:22:40,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:22:40,729 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:22:40,729 INFO L377 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 1 case distinctions, treesize of input 25 treesize of output 54 [2019-11-28 20:22:40,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:22:40,731 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:22:40,737 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2019-11-28 20:22:40,737 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:22:40,773 INFO L614 ElimStorePlain]: treesize reduction 30, result has 58.9 percent of original size [2019-11-28 20:22:40,774 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-28 20:22:40,774 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:21 [2019-11-28 20:22:40,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:22:40,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:22:40,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:22:40,908 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2019-11-28 20:22:40,909 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:22:40,929 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:22:40,930 INFO L377 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 1 case distinctions, treesize of input 25 treesize of output 54 [2019-11-28 20:22:40,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:22:40,931 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:22:40,968 INFO L614 ElimStorePlain]: treesize reduction 30, result has 58.9 percent of original size [2019-11-28 20:22:40,969 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-28 20:22:40,969 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:21 [2019-11-28 20:22:41,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:22:41,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:22:41,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:22:41,142 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2019-11-28 20:22:41,142 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:22:41,162 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:22:41,162 INFO L377 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 1 case distinctions, treesize of input 25 treesize of output 54 [2019-11-28 20:22:41,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:22:41,163 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:22:41,201 INFO L614 ElimStorePlain]: treesize reduction 30, result has 58.9 percent of original size [2019-11-28 20:22:41,202 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-28 20:22:41,202 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:21 [2019-11-28 20:22:41,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:22:41,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:22:41,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:22:41,344 INFO L377 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 7 [2019-11-28 20:22:41,344 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:22:41,345 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:22:41,346 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:22:41,346 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-28 20:22:41,405 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 105 proven. 525 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:41,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:22:41,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 40] total 78 [2019-11-28 20:22:41,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185909221] [2019-11-28 20:22:41,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-11-28 20:22:41,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:41,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-11-28 20:22:41,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1001, Invalid=5005, Unknown=0, NotChecked=0, Total=6006 [2019-11-28 20:22:41,408 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 78 states. [2019-11-28 20:22:43,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:43,603 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2019-11-28 20:22:43,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-11-28 20:22:43,604 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-11-28 20:22:43,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:43,605 INFO L225 Difference]: With dead ends: 93 [2019-11-28 20:22:43,605 INFO L226 Difference]: Without dead ends: 87 [2019-11-28 20:22:43,609 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4106 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2476, Invalid=10406, Unknown=0, NotChecked=0, Total=12882 [2019-11-28 20:22:43,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-28 20:22:43,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2019-11-28 20:22:43,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-28 20:22:43,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2019-11-28 20:22:43,613 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 78 [2019-11-28 20:22:43,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:43,613 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2019-11-28 20:22:43,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-11-28 20:22:43,613 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2019-11-28 20:22:43,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-28 20:22:43,614 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:43,614 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:43,819 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:43,820 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:43,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:43,821 INFO L82 PathProgramCache]: Analyzing trace with hash 145436095, now seen corresponding path program 1 times [2019-11-28 20:22:43,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:43,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314800715] [2019-11-28 20:22:43,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:43,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:43,867 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-11-28 20:22:43,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314800715] [2019-11-28 20:22:43,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:43,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:22:43,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707828033] [2019-11-28 20:22:43,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:22:43,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:43,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:22:43,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:22:43,869 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 4 states. [2019-11-28 20:22:43,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:43,889 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2019-11-28 20:22:43,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:22:43,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-11-28 20:22:43,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:43,892 INFO L225 Difference]: With dead ends: 84 [2019-11-28 20:22:43,893 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 20:22:43,893 INFO L630 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-11-28 20:22:43,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 20:22:43,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 20:22:43,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 20:22:43,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 20:22:43,894 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2019-11-28 20:22:43,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:43,894 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:22:43,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:22:43,895 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:22:43,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 20:22:43,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 20:22:44,027 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 27 [2019-11-28 20:22:44,031 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 13) no Hoare annotation was computed. [2019-11-28 20:22:44,032 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 20:22:44,032 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2019-11-28 20:22:44,032 INFO L246 CegarLoopResult]: For program point L17(lines 17 19) no Hoare annotation was computed. [2019-11-28 20:22:44,032 INFO L246 CegarLoopResult]: For program point L17-2(lines 10 21) no Hoare annotation was computed. [2019-11-28 20:22:44,032 INFO L246 CegarLoopResult]: For program point L17-3(lines 17 19) no Hoare annotation was computed. [2019-11-28 20:22:44,032 INFO L246 CegarLoopResult]: For program point L13-2(lines 13 15) no Hoare annotation was computed. [2019-11-28 20:22:44,033 INFO L246 CegarLoopResult]: For program point L13-3(line 13) no Hoare annotation was computed. [2019-11-28 20:22:44,033 INFO L246 CegarLoopResult]: For program point L13-4(line 13) no Hoare annotation was computed. [2019-11-28 20:22:44,033 INFO L242 CegarLoopResult]: At program point L13-5(lines 13 15) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~#a~0.offset| 0))) (or (and .cse0 (= ULTIMATE.start_main_~i~0 3)) (and .cse0 (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0.base|) (+ |ULTIMATE.start_main_~#a~0.offset| 12)) 2147483647) (<= 4 ULTIMATE.start_main_~i~0)) (and .cse0 (= ULTIMATE.start_main_~i~0 0)) (and .cse0 (= ULTIMATE.start_main_~i~0 1)) (and .cse0 (= ULTIMATE.start_main_~i~0 2)))) [2019-11-28 20:22:44,033 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 20:22:44,033 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 13) no Hoare annotation was computed. [2019-11-28 20:22:44,033 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2019-11-28 20:22:44,034 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 20:22:44,034 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 20:22:44,034 INFO L249 CegarLoopResult]: At program point L20(lines 10 21) the Hoare annotation is: true [2019-11-28 20:22:44,035 INFO L246 CegarLoopResult]: For program point L18(line 18) no Hoare annotation was computed. [2019-11-28 20:22:44,035 INFO L246 CegarLoopResult]: For program point L18-1(line 18) no Hoare annotation was computed. [2019-11-28 20:22:44,047 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 20:22:44,053 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 20:22:44,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:22:44 BoogieIcfgContainer [2019-11-28 20:22:44,056 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 20:22:44,057 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:22:44,057 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:22:44,057 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:22:44,058 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:22:22" (3/4) ... [2019-11-28 20:22:44,062 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 20:22:44,073 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 20:22:44,074 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 20:22:44,074 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 20:22:44,118 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:22:44,118 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:22:44,120 INFO L168 Benchmark]: Toolchain (without parser) took 22510.12 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 399.5 MB). Free memory was 961.7 MB in the beginning and 1.3 GB in the end (delta: -294.4 MB). Peak memory consumption was 105.1 MB. Max. memory is 11.5 GB. [2019-11-28 20:22:44,120 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:22:44,121 INFO L168 Benchmark]: CACSL2BoogieTranslator took 244.05 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:22:44,121 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -179.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:22:44,122 INFO L168 Benchmark]: Boogie Preprocessor took 29.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2019-11-28 20:22:44,123 INFO L168 Benchmark]: RCFGBuilder took 272.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-28 20:22:44,123 INFO L168 Benchmark]: TraceAbstraction took 21805.98 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 265.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -151.9 MB). Peak memory consumption was 113.4 MB. Max. memory is 11.5 GB. [2019-11-28 20:22:44,124 INFO L168 Benchmark]: Witness Printer took 61.47 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:22:44,126 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 244.05 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 91.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -179.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 272.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21805.98 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 265.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -151.9 MB). Peak memory consumption was 113.4 MB. Max. memory is 11.5 GB. * Witness Printer took 61.47 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. 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 * 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: 13]: 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 - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant [2019-11-28 20:22:44,135 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 20:22:44,137 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((a == 0 && i == 3) || ((a == 0 && unknown-#memory_int-unknown[a][a + 12] <= 2147483647) && 4 <= i)) || (a == 0 && i == 0)) || (a == 0 && i == 1)) || (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. Result: SAFE, OverallTime: 21.5s, OverallIterations: 22, TraceHistogramMax: 19, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 196 SDtfs, 727 SDslu, 2464 SDs, 0 SdLazy, 3478 SolverSat, 114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1388 GetRequests, 744 SyntacticMatches, 5 SemanticMatches, 639 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7631 ImplicationChecksByTransitivity, 9.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 DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 55 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 22 NumberOfFragments, 46 HoareAnnotationTreeSize, 2 FomulaSimplifications, 176 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 181 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 1701 NumberOfCodeBlocks, 1697 NumberOfCodeBlocksAsserted, 142 NumberOfCheckSat, 1660 ConstructedInterpolants, 0 QuantifiedInterpolants, 309412 SizeOfPredicates, 194 NumberOfNonLiveVariables, 2186 ConjunctsInSsa, 408 ConjunctsInUnsatCore, 41 InterpolantComputations, 4 PerfectInterpolantSequences, 815/8808 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...