./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 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-crafted/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.24-30f4e4a [2019-11-28 02:49:47,989 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:49:47,992 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:49:48,009 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:49:48,010 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:49:48,012 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:49:48,015 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:49:48,025 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:49:48,031 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:49:48,034 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:49:48,037 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:49:48,039 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:49:48,039 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:49:48,043 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:49:48,044 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:49:48,046 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:49:48,048 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:49:48,050 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:49:48,053 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:49:48,057 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:49:48,062 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:49:48,067 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:49:48,068 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:49:48,070 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:49:48,074 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:49:48,074 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:49:48,075 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:49:48,076 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:49:48,077 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:49:48,078 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:49:48,079 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:49:48,080 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:49:48,081 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:49:48,083 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:49:48,084 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:49:48,085 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:49:48,086 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:49:48,086 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:49:48,087 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:49:48,088 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:49:48,089 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:49:48,090 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-11-28 02:49:48,127 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:49:48,130 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:49:48,131 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:49:48,135 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:49:48,135 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:49:48,136 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:49:48,136 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:49:48,136 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:49:48,137 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:49:48,137 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 02:49:48,137 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:49:48,137 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 02:49:48,140 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-28 02:49:48,140 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 02:49:48,140 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:49:48,141 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 02:49:48,141 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:49:48,141 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:49:48,142 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:49:48,142 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:49:48,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:49:48,143 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:49:48,144 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:49:48,144 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 02:49:48,145 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:49:48,145 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:49:48,145 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 02:49:48,145 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 02:49:48,497 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:49:48,518 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:49:48,522 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:49:48,523 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:49:48,524 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:49:48,525 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 02:49:48,604 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfb5e0c85/161ea1954d5d49b28fdf3810671a5988/FLAGc3117eeb2 [2019-11-28 02:49:49,057 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:49:49,058 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/Arrays01-EquivalentConstantIndices-1.c [2019-11-28 02:49:49,062 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfb5e0c85/161ea1954d5d49b28fdf3810671a5988/FLAGc3117eeb2 [2019-11-28 02:49:49,509 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfb5e0c85/161ea1954d5d49b28fdf3810671a5988 [2019-11-28 02:49:49,513 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:49:49,514 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 02:49:49,515 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:49:49,516 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:49:49,519 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:49:49,521 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:49:49" (1/1) ... [2019-11-28 02:49:49,524 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4667024d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:49:49, skipping insertion in model container [2019-11-28 02:49:49,524 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:49:49" (1/1) ... [2019-11-28 02:49:49,532 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:49:49,551 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:49:49,723 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:49:49,728 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:49:49,753 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:49:49,774 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:49:49,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:49:49 WrapperNode [2019-11-28 02:49:49,775 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:49:49,775 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 02:49:49,776 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 02:49:49,776 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 02:49:49,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:49:49" (1/1) ... [2019-11-28 02:49:49,859 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:49:49" (1/1) ... [2019-11-28 02:49:49,882 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 02:49:49,883 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:49:49,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:49:49,883 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:49:49,891 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:49:49" (1/1) ... [2019-11-28 02:49:49,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:49:49" (1/1) ... [2019-11-28 02:49:49,892 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:49:49" (1/1) ... [2019-11-28 02:49:49,893 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:49:49" (1/1) ... [2019-11-28 02:49:49,898 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:49:49" (1/1) ... [2019-11-28 02:49:49,903 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:49:49" (1/1) ... [2019-11-28 02:49:49,905 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:49:49" (1/1) ... [2019-11-28 02:49:49,907 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:49:49,907 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:49:49,907 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:49:49,908 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:49:49,909 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:49:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:49:49,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 02:49:49,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:49:49,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:49:49,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 02:49:49,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 02:49:49,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 02:49:50,199 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:49:50,200 INFO L297 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-28 02:49:50,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:49:50 BoogieIcfgContainer [2019-11-28 02:49:50,202 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:49:50,204 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:49:50,205 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:49:50,208 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:49:50,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:49:49" (1/3) ... [2019-11-28 02:49:50,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6341eb6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:49:50, skipping insertion in model container [2019-11-28 02:49:50,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:49:49" (2/3) ... [2019-11-28 02:49:50,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6341eb6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:49:50, skipping insertion in model container [2019-11-28 02:49:50,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:49:50" (3/3) ... [2019-11-28 02:49:50,213 INFO L109 eAbstractionObserver]: Analyzing ICFG Arrays01-EquivalentConstantIndices-1.c [2019-11-28 02:49:50,225 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:49:50,242 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-28 02:49:50,258 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-28 02:49:50,289 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:49:50,289 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 02:49:50,290 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:49:50,290 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:49:50,290 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:49:50,291 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:49:50,291 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:49:50,291 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:49:50,311 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-11-28 02:49:50,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 02:49:50,318 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:49:50,319 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 02:49:50,320 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:49:50,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:49:50,327 INFO L82 PathProgramCache]: Analyzing trace with hash 28698728, now seen corresponding path program 1 times [2019-11-28 02:49:50,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:49:50,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369034071] [2019-11-28 02:49:50,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:49:50,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:49:50,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:49:50,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369034071] [2019-11-28 02:49:50,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:49:50,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:49:50,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483600000] [2019-11-28 02:49:50,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:49:50,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:49:50,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:49:50,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:49:50,547 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 4 states. [2019-11-28 02:49:50,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:49:50,638 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2019-11-28 02:49:50,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:49:50,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-11-28 02:49:50,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:49:50,649 INFO L225 Difference]: With dead ends: 34 [2019-11-28 02:49:50,649 INFO L226 Difference]: Without dead ends: 18 [2019-11-28 02:49:50,652 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:49:50,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-11-28 02:49:50,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-28 02:49:50,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-28 02:49:50,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-11-28 02:49:50,684 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 5 [2019-11-28 02:49:50,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:49:50,685 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-11-28 02:49:50,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:49:50,685 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-11-28 02:49:50,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 02:49:50,686 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:49:50,686 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2019-11-28 02:49:50,687 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:49:50,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:49:50,687 INFO L82 PathProgramCache]: Analyzing trace with hash -363792156, now seen corresponding path program 1 times [2019-11-28 02:49:50,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:49:50,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433311061] [2019-11-28 02:49:50,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:49:50,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:49:50,741 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 02:49:50,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433311061] [2019-11-28 02:49:50,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:49:50,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:49:50,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894046236] [2019-11-28 02:49:50,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:49:50,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:49:50,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:49:50,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:49:50,745 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 4 states. [2019-11-28 02:49:50,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:49:50,785 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2019-11-28 02:49:50,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:49:50,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-28 02:49:50,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:49:50,786 INFO L225 Difference]: With dead ends: 18 [2019-11-28 02:49:50,786 INFO L226 Difference]: Without dead ends: 17 [2019-11-28 02:49:50,787 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 02:49:50,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-28 02:49:50,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-28 02:49:50,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 02:49:50,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-11-28 02:49:50,792 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 9 [2019-11-28 02:49:50,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:49:50,792 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-28 02:49:50,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:49:50,793 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-11-28 02:49:50,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 02:49:50,793 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:49:50,794 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:49:50,794 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:49:50,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:49:50,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1607296535, now seen corresponding path program 1 times [2019-11-28 02:49:50,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:49:50,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448077346] [2019-11-28 02:49:50,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:49:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:49:50,846 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 02:49:50,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448077346] [2019-11-28 02:49:50,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632197899] [2019-11-28 02:49:50,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:49:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:49:50,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:49:50,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:49:50,946 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 02:49:50,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:49:50,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-11-28 02:49:50,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151730928] [2019-11-28 02:49:50,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:49:50,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:49:50,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:49:50,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:49:50,950 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 7 states. [2019-11-28 02:49:51,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:49:51,026 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2019-11-28 02:49:51,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:49:51,026 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-11-28 02:49:51,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:49:51,027 INFO L225 Difference]: With dead ends: 28 [2019-11-28 02:49:51,027 INFO L226 Difference]: Without dead ends: 22 [2019-11-28 02:49:51,028 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 02:49:51,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-11-28 02:49:51,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2019-11-28 02:49:51,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-28 02:49:51,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-11-28 02:49:51,033 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 10 [2019-11-28 02:49:51,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:49:51,034 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-11-28 02:49:51,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:49:51,034 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-11-28 02:49:51,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 02:49:51,035 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:49:51,035 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2019-11-28 02:49:51,240 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:49:51,241 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:49:51,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:49:51,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1607345098, now seen corresponding path program 1 times [2019-11-28 02:49:51,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:49:51,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189358613] [2019-11-28 02:49:51,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:49:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:49:51,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:49:51,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189358613] [2019-11-28 02:49:51,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146415755] [2019-11-28 02:49:51,329 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) [2019-11-28 02:49:51,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:49:51,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:49:51,362 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:49:51,386 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 02:49:51,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:49:51,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2019-11-28 02:49:51,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64498622] [2019-11-28 02:49:51,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:49:51,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:49:51,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:49:51,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:49:51,390 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2019-11-28 02:49:51,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:49:51,455 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2019-11-28 02:49:51,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:49:51,456 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-11-28 02:49:51,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:49:51,457 INFO L225 Difference]: With dead ends: 18 [2019-11-28 02:49:51,457 INFO L226 Difference]: Without dead ends: 17 [2019-11-28 02:49:51,458 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 02:49:51,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-28 02:49:51,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-28 02:49:51,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 02:49:51,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-11-28 02:49:51,462 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 10 [2019-11-28 02:49:51,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:49:51,463 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-28 02:49:51,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:49:51,463 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-11-28 02:49:51,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 02:49:51,464 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:49:51,464 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 02:49:51,669 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:49:51,670 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:49:51,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:49:51,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1053474021, now seen corresponding path program 2 times [2019-11-28 02:49:51,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:49:51,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315132619] [2019-11-28 02:49:51,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:49:51,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:49:51,767 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 02:49:51,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315132619] [2019-11-28 02:49:51,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856690978] [2019-11-28 02:49:51,768 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 02:49:51,812 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:49:51,813 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:49:51,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:49:51,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:49:51,850 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 02:49:51,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:49:51,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-11-28 02:49:51,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798401861] [2019-11-28 02:49:51,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 02:49:51,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:49:51,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:49:51,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:49:51,858 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2019-11-28 02:49:51,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:49:51,922 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-11-28 02:49:51,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:49:51,923 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2019-11-28 02:49:51,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:49:51,924 INFO L225 Difference]: With dead ends: 30 [2019-11-28 02:49:51,924 INFO L226 Difference]: Without dead ends: 24 [2019-11-28 02:49:51,925 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 02:49:51,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-28 02:49:51,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-11-28 02:49:51,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-28 02:49:51,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-11-28 02:49:51,930 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2019-11-28 02:49:51,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:49:51,931 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-11-28 02:49:51,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 02:49:51,931 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-11-28 02:49:51,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 02:49:51,932 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:49:51,933 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2019-11-28 02:49:52,136 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:49:52,137 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:49:52,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:49:52,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1100938783, now seen corresponding path program 3 times [2019-11-28 02:49:52,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:49:52,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422119094] [2019-11-28 02:49:52,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:49:52,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:49:52,235 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 02:49:52,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422119094] [2019-11-28 02:49:52,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299610372] [2019-11-28 02:49:52,237 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 02:49:52,269 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-28 02:49:52,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:49:52,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:49:52,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:49:52,322 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 02:49:52,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:49:52,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2019-11-28 02:49:52,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273785292] [2019-11-28 02:49:52,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 02:49:52,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:49:52,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 02:49:52,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:49:52,328 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2019-11-28 02:49:52,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:49:52,426 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-11-28 02:49:52,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:49:52,429 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2019-11-28 02:49:52,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:49:52,430 INFO L225 Difference]: With dead ends: 34 [2019-11-28 02:49:52,431 INFO L226 Difference]: Without dead ends: 28 [2019-11-28 02:49:52,434 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 02:49:52,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-28 02:49:52,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-11-28 02:49:52,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-28 02:49:52,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-11-28 02:49:52,446 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 18 [2019-11-28 02:49:52,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:49:52,447 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-11-28 02:49:52,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 02:49:52,448 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-11-28 02:49:52,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 02:49:52,452 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:49:52,453 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2019-11-28 02:49:52,664 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:49:52,665 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:49:52,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:49:52,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1326737629, now seen corresponding path program 4 times [2019-11-28 02:49:52,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:49:52,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286617733] [2019-11-28 02:49:52,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:49:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:49:52,801 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 02:49:52,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286617733] [2019-11-28 02:49:52,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630558648] [2019-11-28 02:49:52,802 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:49:52,852 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 02:49:52,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:49:52,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 02:49:52,855 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:49:52,884 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 02:49:52,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:49:52,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2019-11-28 02:49:52,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022344703] [2019-11-28 02:49:52,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 02:49:52,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:49:52,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 02:49:52,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:49:52,888 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2019-11-28 02:49:53,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:49:53,011 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-11-28 02:49:53,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:49:53,013 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2019-11-28 02:49:53,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:49:53,014 INFO L225 Difference]: With dead ends: 38 [2019-11-28 02:49:53,014 INFO L226 Difference]: Without dead ends: 32 [2019-11-28 02:49:53,015 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 02:49:53,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-28 02:49:53,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2019-11-28 02:49:53,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-28 02:49:53,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-11-28 02:49:53,022 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 22 [2019-11-28 02:49:53,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:49:53,022 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-11-28 02:49:53,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 02:49:53,023 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-11-28 02:49:53,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 02:49:53,024 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:49:53,024 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2019-11-28 02:49:53,227 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:49:53,230 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:49:53,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:49:53,231 INFO L82 PathProgramCache]: Analyzing trace with hash 108793383, now seen corresponding path program 5 times [2019-11-28 02:49:53,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:49:53,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031409680] [2019-11-28 02:49:53,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:49:53,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:49:53,382 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 02:49:53,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031409680] [2019-11-28 02:49:53,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72408777] [2019-11-28 02:49:53,383 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 02:49:53,430 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-28 02:49:53,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:49:53,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 02:49:53,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:49:53,479 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 02:49:53,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:49:53,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2019-11-28 02:49:53,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696146371] [2019-11-28 02:49:53,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 02:49:53,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:49:53,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 02:49:53,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-11-28 02:49:53,482 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2019-11-28 02:49:53,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:49:53,633 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-11-28 02:49:53,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 02:49:53,635 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2019-11-28 02:49:53,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:49:53,636 INFO L225 Difference]: With dead ends: 42 [2019-11-28 02:49:53,637 INFO L226 Difference]: Without dead ends: 36 [2019-11-28 02:49:53,638 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 02:49:53,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-28 02:49:53,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2019-11-28 02:49:53,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-28 02:49:53,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-11-28 02:49:53,644 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 26 [2019-11-28 02:49:53,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:49:53,644 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-11-28 02:49:53,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 02:49:53,645 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-11-28 02:49:53,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 02:49:53,646 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:49:53,646 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2019-11-28 02:49:53,850 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:49:53,851 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:49:53,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:49:53,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1590598869, now seen corresponding path program 6 times [2019-11-28 02:49:53,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:49:53,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742189363] [2019-11-28 02:49:53,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:49:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:49:54,035 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 02:49:54,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742189363] [2019-11-28 02:49:54,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439909894] [2019-11-28 02:49:54,038 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 02:49:54,080 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-28 02:49:54,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:49:54,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 02:49:54,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:49:54,124 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 02:49:54,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:49:54,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2019-11-28 02:49:54,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357800061] [2019-11-28 02:49:54,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-28 02:49:54,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:49:54,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-28 02:49:54,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-11-28 02:49:54,127 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2019-11-28 02:49:54,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:49:54,258 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2019-11-28 02:49:54,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 02:49:54,258 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-11-28 02:49:54,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:49:54,259 INFO L225 Difference]: With dead ends: 46 [2019-11-28 02:49:54,260 INFO L226 Difference]: Without dead ends: 40 [2019-11-28 02:49:54,260 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 02:49:54,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-28 02:49:54,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2019-11-28 02:49:54,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-28 02:49:54,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-11-28 02:49:54,266 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 30 [2019-11-28 02:49:54,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:49:54,266 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-11-28 02:49:54,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-28 02:49:54,267 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-11-28 02:49:54,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 02:49:54,268 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:49:54,268 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2019-11-28 02:49:54,472 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:49:54,472 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:49:54,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:49:54,473 INFO L82 PathProgramCache]: Analyzing trace with hash -2022926801, now seen corresponding path program 7 times [2019-11-28 02:49:54,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:49:54,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169174475] [2019-11-28 02:49:54,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:49:54,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:49:54,701 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 02:49:54,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169174475] [2019-11-28 02:49:54,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250902430] [2019-11-28 02:49:54,702 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 02:49:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:49:54,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 02:49:54,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:49:54,793 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 02:49:54,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:49:54,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2019-11-28 02:49:54,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779208800] [2019-11-28 02:49:54,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-28 02:49:54,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:49:54,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-28 02:49:54,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-11-28 02:49:54,797 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2019-11-28 02:49:54,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:49:54,972 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2019-11-28 02:49:54,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-28 02:49:54,973 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 34 [2019-11-28 02:49:54,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:49:54,974 INFO L225 Difference]: With dead ends: 50 [2019-11-28 02:49:54,974 INFO L226 Difference]: Without dead ends: 44 [2019-11-28 02:49:54,975 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 02:49:54,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-28 02:49:54,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2019-11-28 02:49:54,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-28 02:49:54,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-11-28 02:49:54,981 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 34 [2019-11-28 02:49:54,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:49:54,981 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-11-28 02:49:54,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-28 02:49:54,981 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-11-28 02:49:54,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-28 02:49:54,983 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:49:54,983 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2019-11-28 02:49:55,192 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:49:55,193 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:49:55,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:49:55,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1492211917, now seen corresponding path program 8 times [2019-11-28 02:49:55,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:49:55,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291969771] [2019-11-28 02:49:55,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:49:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:49:55,427 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 02:49:55,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291969771] [2019-11-28 02:49:55,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648358673] [2019-11-28 02:49:55,428 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 02:49:55,465 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:49:55,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:49:55,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-28 02:49:55,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:49:55,506 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 02:49:55,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:49:55,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 21 [2019-11-28 02:49:55,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364428988] [2019-11-28 02:49:55,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-28 02:49:55,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:49:55,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-28 02:49:55,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-11-28 02:49:55,509 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2019-11-28 02:49:55,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:49:55,706 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2019-11-28 02:49:55,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 02:49:55,706 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2019-11-28 02:49:55,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:49:55,707 INFO L225 Difference]: With dead ends: 54 [2019-11-28 02:49:55,707 INFO L226 Difference]: Without dead ends: 48 [2019-11-28 02:49:55,708 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 02:49:55,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-28 02:49:55,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2019-11-28 02:49:55,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 02:49:55,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-11-28 02:49:55,714 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 38 [2019-11-28 02:49:55,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:49:55,715 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-11-28 02:49:55,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-28 02:49:55,715 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-11-28 02:49:55,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 02:49:55,716 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:49:55,717 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2019-11-28 02:49:55,929 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:49:55,930 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:49:55,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:49:55,931 INFO L82 PathProgramCache]: Analyzing trace with hash 360224311, now seen corresponding path program 9 times [2019-11-28 02:49:55,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:49:55,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509244455] [2019-11-28 02:49:55,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:49:55,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:49:56,136 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 02:49:56,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509244455] [2019-11-28 02:49:56,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820936073] [2019-11-28 02:49:56,137 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 02:49:56,203 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-28 02:49:56,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:49:56,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-28 02:49:56,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:49:56,242 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 02:49:56,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:49:56,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2019-11-28 02:49:56,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171366454] [2019-11-28 02:49:56,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-28 02:49:56,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:49:56,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-28 02:49:56,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2019-11-28 02:49:56,245 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2019-11-28 02:49:56,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:49:56,453 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2019-11-28 02:49:56,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-28 02:49:56,454 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 42 [2019-11-28 02:49:56,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:49:56,455 INFO L225 Difference]: With dead ends: 58 [2019-11-28 02:49:56,455 INFO L226 Difference]: Without dead ends: 52 [2019-11-28 02:49:56,456 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=298, Invalid=694, Unknown=0, NotChecked=0, Total=992 [2019-11-28 02:49:56,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-28 02:49:56,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2019-11-28 02:49:56,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-28 02:49:56,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-11-28 02:49:56,466 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 42 [2019-11-28 02:49:56,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:49:56,466 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-11-28 02:49:56,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-28 02:49:56,467 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-11-28 02:49:56,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-28 02:49:56,468 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:49:56,468 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2019-11-28 02:49:56,670 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:49:56,673 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:49:56,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:49:56,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1334534971, now seen corresponding path program 10 times [2019-11-28 02:49:56,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:49:56,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386812620] [2019-11-28 02:49:56,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:49:56,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:49:56,932 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 02:49:56,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386812620] [2019-11-28 02:49:56,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304053707] [2019-11-28 02:49:56,933 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 02:49:56,971 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 02:49:56,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:49:56,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-28 02:49:56,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:49:57,036 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 02:49:57,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:49:57,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 25 [2019-11-28 02:49:57,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676252255] [2019-11-28 02:49:57,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-28 02:49:57,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:49:57,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-28 02:49:57,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-11-28 02:49:57,039 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2019-11-28 02:49:57,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:49:57,279 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2019-11-28 02:49:57,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-28 02:49:57,279 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2019-11-28 02:49:57,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:49:57,280 INFO L225 Difference]: With dead ends: 62 [2019-11-28 02:49:57,280 INFO L226 Difference]: Without dead ends: 56 [2019-11-28 02:49:57,282 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 02:49:57,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-28 02:49:57,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2019-11-28 02:49:57,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-28 02:49:57,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-11-28 02:49:57,287 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 46 [2019-11-28 02:49:57,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:49:57,288 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-11-28 02:49:57,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-28 02:49:57,288 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-11-28 02:49:57,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 02:49:57,289 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:49:57,289 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2019-11-28 02:49:57,493 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:49:57,493 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:49:57,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:49:57,494 INFO L82 PathProgramCache]: Analyzing trace with hash 2041056831, now seen corresponding path program 11 times [2019-11-28 02:49:57,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:49:57,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595117500] [2019-11-28 02:49:57,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:49:57,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:49:57,806 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 02:49:57,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595117500] [2019-11-28 02:49:57,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787146677] [2019-11-28 02:49:57,808 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 02:49:57,946 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-11-28 02:49:57,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:49:57,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-28 02:49:57,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:49:57,989 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 02:49:57,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:49:57,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 27 [2019-11-28 02:49:57,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512734881] [2019-11-28 02:49:57,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-28 02:49:57,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:49:57,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-28 02:49:57,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2019-11-28 02:49:57,993 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2019-11-28 02:49:58,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:49:58,279 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2019-11-28 02:49:58,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-28 02:49:58,280 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 50 [2019-11-28 02:49:58,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:49:58,281 INFO L225 Difference]: With dead ends: 66 [2019-11-28 02:49:58,281 INFO L226 Difference]: Without dead ends: 60 [2019-11-28 02:49:58,282 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 02:49:58,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-28 02:49:58,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2019-11-28 02:49:58,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-28 02:49:58,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-11-28 02:49:58,289 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 50 [2019-11-28 02:49:58,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:49:58,289 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-11-28 02:49:58,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-28 02:49:58,290 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-11-28 02:49:58,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-28 02:49:58,291 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:49:58,291 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2019-11-28 02:49:58,496 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:49:58,497 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:49:58,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:49:58,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1615882429, now seen corresponding path program 12 times [2019-11-28 02:49:58,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:49:58,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42664992] [2019-11-28 02:49:58,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:49:58,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:49:58,800 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 02:49:58,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42664992] [2019-11-28 02:49:58,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628631199] [2019-11-28 02:49:58,801 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 02:49:58,944 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-11-28 02:49:58,944 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:49:58,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-28 02:49:58,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:49:58,995 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 02:49:58,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:49:58,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 29 [2019-11-28 02:49:58,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117364273] [2019-11-28 02:49:58,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-28 02:49:58,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:49:58,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-28 02:49:58,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2019-11-28 02:49:58,999 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2019-11-28 02:49:59,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:49:59,303 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2019-11-28 02:49:59,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-28 02:49:59,304 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 54 [2019-11-28 02:49:59,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:49:59,305 INFO L225 Difference]: With dead ends: 70 [2019-11-28 02:49:59,305 INFO L226 Difference]: Without dead ends: 64 [2019-11-28 02:49:59,306 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 02:49:59,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-28 02:49:59,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2019-11-28 02:49:59,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-28 02:49:59,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-11-28 02:49:59,312 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 54 [2019-11-28 02:49:59,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:49:59,312 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-11-28 02:49:59,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-28 02:49:59,313 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-11-28 02:49:59,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-28 02:49:59,313 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:49:59,314 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2019-11-28 02:49:59,517 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:49:59,518 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:49:59,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:49:59,519 INFO L82 PathProgramCache]: Analyzing trace with hash -184353209, now seen corresponding path program 13 times [2019-11-28 02:49:59,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:49:59,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749591422] [2019-11-28 02:49:59,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:49:59,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:49:59,912 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 02:49:59,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749591422] [2019-11-28 02:49:59,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705973421] [2019-11-28 02:49:59,913 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 02:49:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:49:59,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-28 02:49:59,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:00,045 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 02:50:00,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:00,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 31 [2019-11-28 02:50:00,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133931366] [2019-11-28 02:50:00,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-28 02:50:00,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:00,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-28 02:50:00,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2019-11-28 02:50:00,049 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2019-11-28 02:50:00,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:00,373 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2019-11-28 02:50:00,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-28 02:50:00,373 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 58 [2019-11-28 02:50:00,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:00,374 INFO L225 Difference]: With dead ends: 74 [2019-11-28 02:50:00,374 INFO L226 Difference]: Without dead ends: 68 [2019-11-28 02:50:00,375 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=556, Invalid=1336, Unknown=0, NotChecked=0, Total=1892 [2019-11-28 02:50:00,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-28 02:50:00,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2019-11-28 02:50:00,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-28 02:50:00,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-11-28 02:50:00,379 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 58 [2019-11-28 02:50:00,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:00,380 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-11-28 02:50:00,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-28 02:50:00,380 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-11-28 02:50:00,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-28 02:50:00,381 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:00,381 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:00,590 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:00,590 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:00,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:00,591 INFO L82 PathProgramCache]: Analyzing trace with hash 344146763, now seen corresponding path program 14 times [2019-11-28 02:50:00,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:00,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298344044] [2019-11-28 02:50:00,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:00,964 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 02:50:00,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298344044] [2019-11-28 02:50:00,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378374428] [2019-11-28 02:50:00,965 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 02:50:01,009 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:50:01,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:50:01,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-28 02:50:01,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:01,047 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 02:50:01,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:01,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 33 [2019-11-28 02:50:01,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477843097] [2019-11-28 02:50:01,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-28 02:50:01,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:01,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-28 02:50:01,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2019-11-28 02:50:01,051 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2019-11-28 02:50:01,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:01,397 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2019-11-28 02:50:01,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-28 02:50:01,397 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 62 [2019-11-28 02:50:01,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:01,398 INFO L225 Difference]: With dead ends: 78 [2019-11-28 02:50:01,398 INFO L226 Difference]: Without dead ends: 72 [2019-11-28 02:50:01,399 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=633, Invalid=1529, Unknown=0, NotChecked=0, Total=2162 [2019-11-28 02:50:01,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-28 02:50:01,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2019-11-28 02:50:01,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-28 02:50:01,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-11-28 02:50:01,409 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 62 [2019-11-28 02:50:01,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:01,410 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-11-28 02:50:01,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-28 02:50:01,410 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-11-28 02:50:01,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-28 02:50:01,411 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:01,411 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:01,611 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:01,612 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:01,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:01,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1083270735, now seen corresponding path program 15 times [2019-11-28 02:50:01,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:01,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596478904] [2019-11-28 02:50:01,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:01,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:02,039 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 02:50:02,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596478904] [2019-11-28 02:50:02,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994622090] [2019-11-28 02:50:02,040 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 02:50:02,308 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-11-28 02:50:02,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:50:02,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-28 02:50:02,313 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:02,350 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 02:50:02,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:02,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 35 [2019-11-28 02:50:02,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021655595] [2019-11-28 02:50:02,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-11-28 02:50:02,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:02,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-11-28 02:50:02,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2019-11-28 02:50:02,353 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2019-11-28 02:50:02,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:02,720 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2019-11-28 02:50:02,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-28 02:50:02,721 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 66 [2019-11-28 02:50:02,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:02,721 INFO L225 Difference]: With dead ends: 82 [2019-11-28 02:50:02,721 INFO L226 Difference]: Without dead ends: 76 [2019-11-28 02:50:02,723 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=715, Invalid=1735, Unknown=0, NotChecked=0, Total=2450 [2019-11-28 02:50:02,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-28 02:50:02,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2019-11-28 02:50:02,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-28 02:50:02,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-11-28 02:50:02,728 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 66 [2019-11-28 02:50:02,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:02,729 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-11-28 02:50:02,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-11-28 02:50:02,729 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-11-28 02:50:02,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-28 02:50:02,730 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:02,731 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:02,936 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:02,937 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:02,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:02,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1559337133, now seen corresponding path program 16 times [2019-11-28 02:50:02,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:02,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457263565] [2019-11-28 02:50:02,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:02,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:03,353 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 02:50:03,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457263565] [2019-11-28 02:50:03,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208404666] [2019-11-28 02:50:03,354 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 02:50:03,399 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 02:50:03,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:50:03,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-28 02:50:03,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:03,449 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 02:50:03,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:03,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 37 [2019-11-28 02:50:03,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122156828] [2019-11-28 02:50:03,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-28 02:50:03,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:03,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-28 02:50:03,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2019-11-28 02:50:03,452 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2019-11-28 02:50:03,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:03,878 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2019-11-28 02:50:03,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-28 02:50:03,879 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 70 [2019-11-28 02:50:03,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:03,880 INFO L225 Difference]: With dead ends: 86 [2019-11-28 02:50:03,880 INFO L226 Difference]: Without dead ends: 80 [2019-11-28 02:50:03,881 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 02:50:03,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-28 02:50:03,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2019-11-28 02:50:03,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-28 02:50:03,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-11-28 02:50:03,885 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 70 [2019-11-28 02:50:03,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:03,885 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-11-28 02:50:03,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-28 02:50:03,886 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-11-28 02:50:03,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-28 02:50:03,886 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:03,887 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:04,097 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:04,097 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:04,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:04,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1923398057, now seen corresponding path program 17 times [2019-11-28 02:50:04,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:04,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863887823] [2019-11-28 02:50:04,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:04,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:04,590 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 02:50:04,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863887823] [2019-11-28 02:50:04,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120697412] [2019-11-28 02:50:04,591 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 02:50:04,741 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-11-28 02:50:04,741 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:50:04,744 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-28 02:50:04,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:04,782 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 02:50:04,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:04,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 39 [2019-11-28 02:50:04,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611987776] [2019-11-28 02:50:04,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-11-28 02:50:04,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:04,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-11-28 02:50:04,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2019-11-28 02:50:04,784 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2019-11-28 02:50:05,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:05,208 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2019-11-28 02:50:05,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-28 02:50:05,208 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 74 [2019-11-28 02:50:05,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:05,209 INFO L225 Difference]: With dead ends: 90 [2019-11-28 02:50:05,209 INFO L226 Difference]: Without dead ends: 84 [2019-11-28 02:50:05,211 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=894, Invalid=2186, Unknown=0, NotChecked=0, Total=3080 [2019-11-28 02:50:05,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-28 02:50:05,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2019-11-28 02:50:05,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-28 02:50:05,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-11-28 02:50:05,215 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 74 [2019-11-28 02:50:05,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:05,215 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-11-28 02:50:05,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-11-28 02:50:05,215 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-11-28 02:50:05,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-28 02:50:05,216 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:05,216 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:05,420 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:05,421 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:05,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:05,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1202125989, now seen corresponding path program 18 times [2019-11-28 02:50:05,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:05,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297550514] [2019-11-28 02:50:05,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:05,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:05,919 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 02:50:05,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297550514] [2019-11-28 02:50:05,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536857122] [2019-11-28 02:50:05,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 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 02:50:06,338 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2019-11-28 02:50:06,338 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:50:06,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 63 conjunts are in the unsatisfiable core [2019-11-28 02:50:06,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:06,519 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 02:50:06,520 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:50:06,529 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:50:06,530 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:50:06,530 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2019-11-28 02:50:06,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:50:06,649 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 02:50:06,650 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:50:06,666 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:50:06,667 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:50:06,667 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-11-28 02:50:06,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:50:06,741 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 02:50:06,742 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:50:06,749 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:50:06,750 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:50:06,750 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-11-28 02:50:06,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:50:06,847 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 02:50:06,847 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:50:06,856 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:50:06,857 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:50:06,857 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-11-28 02:50:06,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:50:06,941 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 02:50:06,942 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:50:06,952 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:50:06,953 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:50:06,953 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-11-28 02:50:07,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:50:07,065 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 02:50:07,065 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:50:07,071 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:50:07,072 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:50:07,072 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-11-28 02:50:07,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:50:07,160 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 02:50:07,160 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:50:07,170 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:50:07,171 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:50:07,171 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-11-28 02:50:07,289 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:50:07,290 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 02:50:07,291 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:50:07,308 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:50:07,309 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:50:07,309 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-11-28 02:50:07,407 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:50:07,408 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 02:50:07,409 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:50:07,416 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:50:07,417 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:50:07,417 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:13 [2019-11-28 02:50:07,474 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:50:07,474 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 02:50:07,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:50:07,478 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:50:07,506 INFO L588 ElimStorePlain]: treesize reduction 20, result has 63.0 percent of original size [2019-11-28 02:50:07,507 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:50:07,507 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:23 [2019-11-28 02:50:07,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:50:07,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:50:07,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:50:07,688 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:50:07,688 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 02:50:07,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:50:07,691 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:50:07,698 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 02:50:07,699 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:50:07,738 INFO L588 ElimStorePlain]: treesize reduction 30, result has 58.9 percent of original size [2019-11-28 02:50:07,739 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-28 02:50:07,739 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:21 [2019-11-28 02:50:07,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:50:07,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:50:07,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:50:07,921 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 02:50:07,921 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:50:07,943 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:50:07,944 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 02:50:07,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:50:07,945 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:50:07,986 INFO L588 ElimStorePlain]: treesize reduction 30, result has 58.9 percent of original size [2019-11-28 02:50:07,987 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-28 02:50:07,987 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:21 [2019-11-28 02:50:08,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:50:08,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:50:08,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:50:08,156 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:50:08,157 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 02:50:08,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:50:08,159 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:50:08,163 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 02:50:08,163 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:50:08,222 INFO L588 ElimStorePlain]: treesize reduction 30, result has 58.9 percent of original size [2019-11-28 02:50:08,223 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-28 02:50:08,223 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:21 [2019-11-28 02:50:08,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:50:08,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:50:08,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:50:08,374 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 02:50:08,374 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:50:08,399 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:50:08,400 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 02:50:08,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:50:08,401 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:50:08,439 INFO L588 ElimStorePlain]: treesize reduction 30, result has 58.9 percent of original size [2019-11-28 02:50:08,440 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-28 02:50:08,440 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:21 [2019-11-28 02:50:08,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:50:08,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:50:08,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:50:08,590 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 02:50:08,590 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:50:08,615 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:50:08,616 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 02:50:08,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:50:08,617 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:50:08,667 INFO L588 ElimStorePlain]: treesize reduction 30, result has 58.9 percent of original size [2019-11-28 02:50:08,668 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-28 02:50:08,669 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:21 [2019-11-28 02:50:08,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:50:08,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:50:08,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:50:08,835 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 02:50:08,836 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:50:08,837 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:50:08,837 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:50:08,837 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-28 02:50:08,898 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 02:50:08,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:08,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 40] total 78 [2019-11-28 02:50:08,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433710926] [2019-11-28 02:50:08,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-11-28 02:50:08,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:08,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-11-28 02:50:08,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1001, Invalid=5005, Unknown=0, NotChecked=0, Total=6006 [2019-11-28 02:50:08,901 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 78 states. [2019-11-28 02:50:11,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:11,110 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2019-11-28 02:50:11,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-11-28 02:50:11,111 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-11-28 02:50:11,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:11,112 INFO L225 Difference]: With dead ends: 93 [2019-11-28 02:50:11,112 INFO L226 Difference]: Without dead ends: 87 [2019-11-28 02:50:11,116 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4106 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2476, Invalid=10406, Unknown=0, NotChecked=0, Total=12882 [2019-11-28 02:50:11,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-28 02:50:11,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2019-11-28 02:50:11,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-28 02:50:11,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2019-11-28 02:50:11,120 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 78 [2019-11-28 02:50:11,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:11,121 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2019-11-28 02:50:11,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-11-28 02:50:11,121 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2019-11-28 02:50:11,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-28 02:50:11,122 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:11,122 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:11,322 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:11,323 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:11,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:11,323 INFO L82 PathProgramCache]: Analyzing trace with hash 145436095, now seen corresponding path program 1 times [2019-11-28 02:50:11,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:11,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177639178] [2019-11-28 02:50:11,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:11,370 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 02:50:11,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177639178] [2019-11-28 02:50:11,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:11,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:50:11,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000425947] [2019-11-28 02:50:11,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:50:11,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:11,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:50:11,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:50:11,373 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 4 states. [2019-11-28 02:50:11,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:11,400 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2019-11-28 02:50:11,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:50:11,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-11-28 02:50:11,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:11,402 INFO L225 Difference]: With dead ends: 84 [2019-11-28 02:50:11,402 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 02:50:11,403 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 02:50:11,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 02:50:11,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 02:50:11,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 02:50:11,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 02:50:11,403 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2019-11-28 02:50:11,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:11,404 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 02:50:11,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:50:11,404 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 02:50:11,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 02:50:11,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 02:50:11,545 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 27 [2019-11-28 02:50:11,552 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 13) no Hoare annotation was computed. [2019-11-28 02:50:11,552 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 02:50:11,552 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2019-11-28 02:50:11,553 INFO L246 CegarLoopResult]: For program point L17(lines 17 19) no Hoare annotation was computed. [2019-11-28 02:50:11,553 INFO L246 CegarLoopResult]: For program point L17-2(lines 10 21) no Hoare annotation was computed. [2019-11-28 02:50:11,553 INFO L246 CegarLoopResult]: For program point L17-3(lines 17 19) no Hoare annotation was computed. [2019-11-28 02:50:11,553 INFO L246 CegarLoopResult]: For program point L13-2(lines 13 15) no Hoare annotation was computed. [2019-11-28 02:50:11,553 INFO L246 CegarLoopResult]: For program point L13-3(line 13) no Hoare annotation was computed. [2019-11-28 02:50:11,553 INFO L246 CegarLoopResult]: For program point L13-4(line 13) no Hoare annotation was computed. [2019-11-28 02:50:11,554 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 02:50:11,554 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 02:50:11,554 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 13) no Hoare annotation was computed. [2019-11-28 02:50:11,554 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2019-11-28 02:50:11,554 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 02:50:11,554 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 02:50:11,554 INFO L249 CegarLoopResult]: At program point L20(lines 10 21) the Hoare annotation is: true [2019-11-28 02:50:11,554 INFO L246 CegarLoopResult]: For program point L18(line 18) no Hoare annotation was computed. [2019-11-28 02:50:11,554 INFO L246 CegarLoopResult]: For program point L18-1(line 18) no Hoare annotation was computed. [2019-11-28 02:50:11,588 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 02:50:11,599 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 02:50:11,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:50:11 BoogieIcfgContainer [2019-11-28 02:50:11,607 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:50:11,608 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:50:11,608 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:50:11,608 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:50:11,609 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:49:50" (3/4) ... [2019-11-28 02:50:11,614 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 02:50:11,631 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 02:50:11,632 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 02:50:11,632 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 02:50:11,683 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:50:11,683 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:50:11,684 INFO L168 Benchmark]: Toolchain (without parser) took 22170.10 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 346.0 MB). Free memory was 956.3 MB in the beginning and 836.9 MB in the end (delta: 119.4 MB). Peak memory consumption was 465.5 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:11,685 INFO L168 Benchmark]: CDTParser took 1.44 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:50:11,689 INFO L168 Benchmark]: CACSL2BoogieTranslator took 259.49 ms. Allocated memory is still 1.0 GB. Free memory was 956.3 MB in the beginning and 945.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:11,689 INFO L168 Benchmark]: Boogie Procedure Inliner took 106.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -154.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:11,690 INFO L168 Benchmark]: Boogie Preprocessor took 24.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:11,690 INFO L168 Benchmark]: RCFGBuilder took 295.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:11,691 INFO L168 Benchmark]: TraceAbstraction took 21403.24 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 242.2 MB). Free memory was 1.1 GB in the beginning and 836.9 MB in the end (delta: 237.8 MB). Peak memory consumption was 480.1 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:11,691 INFO L168 Benchmark]: Witness Printer took 75.18 ms. Allocated memory is still 1.4 GB. Free memory is still 836.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:50:11,697 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.44 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 259.49 ms. Allocated memory is still 1.0 GB. Free memory was 956.3 MB in the beginning and 945.6 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 106.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -154.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 295.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21403.24 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 242.2 MB). Free memory was 1.1 GB in the beginning and 836.9 MB in the end (delta: 237.8 MB). Peak memory consumption was 480.1 MB. Max. memory is 11.5 GB. * Witness Printer took 75.18 ms. Allocated memory is still 1.4 GB. Free memory is still 836.9 MB. 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 02:50:11,706 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 02:50:11,707 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.1s, 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.2s 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.6s SatisfiabilityAnalysisTime, 8.0s 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...