./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-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-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-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 ac99a20a7aff68d4303ed37ca9ad8305a1f8cf0d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 02:50:45,099 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:50:45,102 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:50:45,119 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:50:45,120 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:50:45,122 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:50:45,124 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:50:45,133 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:50:45,138 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:50:45,142 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:50:45,143 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:50:45,145 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:50:45,145 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:50:45,148 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:50:45,149 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:50:45,152 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:50:45,153 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:50:45,154 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:50:45,155 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:50:45,157 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:50:45,161 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:50:45,164 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:50:45,166 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:50:45,167 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:50:45,173 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:50:45,174 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:50:45,174 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:50:45,176 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:50:45,177 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:50:45,179 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:50:45,179 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:50:45,180 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:50:45,180 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:50:45,181 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:50:45,183 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:50:45,183 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:50:45,185 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:50:45,185 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:50:45,185 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:50:45,187 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:50:45,189 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:50:45,190 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-11-28 02:50:45,207 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:50:45,208 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:50:45,209 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:50:45,210 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:50:45,210 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:50:45,210 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:50:45,210 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:50:45,211 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:50:45,211 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:50:45,211 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 02:50:45,212 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:50:45,212 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 02:50:45,212 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-28 02:50:45,212 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 02:50:45,213 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:50:45,213 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 02:50:45,213 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:50:45,213 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:50:45,214 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:50:45,214 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:50:45,214 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:50:45,215 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:50:45,215 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:50:45,215 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 02:50:45,215 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:50:45,216 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:50:45,216 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 02:50:45,216 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 -> ac99a20a7aff68d4303ed37ca9ad8305a1f8cf0d [2019-11-28 02:50:45,514 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:50:45,527 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:50:45,531 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:50:45,532 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:50:45,533 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:50:45,534 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2019-11-28 02:50:45,595 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33f4af353/8207ad09faab40ee8f4fd8eba11a0eb8/FLAGf4d703c83 [2019-11-28 02:50:46,072 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:50:46,073 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2019-11-28 02:50:46,079 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33f4af353/8207ad09faab40ee8f4fd8eba11a0eb8/FLAGf4d703c83 [2019-11-28 02:50:46,444 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33f4af353/8207ad09faab40ee8f4fd8eba11a0eb8 [2019-11-28 02:50:46,447 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:50:46,448 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 02:50:46,449 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:50:46,449 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:50:46,453 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:50:46,454 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:50:46" (1/1) ... [2019-11-28 02:50:46,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f61f9f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:46, skipping insertion in model container [2019-11-28 02:50:46,457 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:50:46" (1/1) ... [2019-11-28 02:50:46,464 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:50:46,484 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:50:46,682 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:50:46,686 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:50:46,706 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:50:46,720 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:50:46,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:46 WrapperNode [2019-11-28 02:50:46,721 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:50:46,722 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 02:50:46,722 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 02:50:46,722 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 02:50:46,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:46" (1/1) ... [2019-11-28 02:50:46,736 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:46" (1/1) ... [2019-11-28 02:50:46,824 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 02:50:46,825 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:50:46,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:50:46,827 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:50:46,837 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:46" (1/1) ... [2019-11-28 02:50:46,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:46" (1/1) ... [2019-11-28 02:50:46,843 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:46" (1/1) ... [2019-11-28 02:50:46,843 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:46" (1/1) ... [2019-11-28 02:50:46,846 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:46" (1/1) ... [2019-11-28 02:50:46,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:46" (1/1) ... [2019-11-28 02:50:46,853 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:46" (1/1) ... [2019-11-28 02:50:46,855 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:50:46,856 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:50:46,856 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:50:46,856 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:50:46,857 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:50:46,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:50:46,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:50:47,170 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:50:47,171 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 02:50:47,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:50:47 BoogieIcfgContainer [2019-11-28 02:50:47,173 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:50:47,176 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:50:47,176 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:50:47,181 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:50:47,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:50:46" (1/3) ... [2019-11-28 02:50:47,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46ce3711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:50:47, skipping insertion in model container [2019-11-28 02:50:47,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:46" (2/3) ... [2019-11-28 02:50:47,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46ce3711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:50:47, skipping insertion in model container [2019-11-28 02:50:47,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:50:47" (3/3) ... [2019-11-28 02:50:47,188 INFO L109 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2019-11-28 02:50:47,203 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:50:47,212 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-11-28 02:50:47,238 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-11-28 02:50:47,275 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:50:47,275 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 02:50:47,276 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:50:47,276 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:50:47,276 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:50:47,276 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:50:47,276 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:50:47,277 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:50:47,301 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2019-11-28 02:50:47,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 02:50:47,306 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:47,307 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 02:50:47,308 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:47,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:47,313 INFO L82 PathProgramCache]: Analyzing trace with hash 29685899, now seen corresponding path program 1 times [2019-11-28 02:50:47,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:47,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892307475] [2019-11-28 02:50:47,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:47,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:47,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892307475] [2019-11-28 02:50:47,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:47,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:50:47,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473898199] [2019-11-28 02:50:47,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 02:50:47,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:47,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 02:50:47,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 02:50:47,482 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2019-11-28 02:50:47,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:47,508 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2019-11-28 02:50:47,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 02:50:47,510 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2019-11-28 02:50:47,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:47,522 INFO L225 Difference]: With dead ends: 50 [2019-11-28 02:50:47,523 INFO L226 Difference]: Without dead ends: 22 [2019-11-28 02:50:47,529 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 02:50:47,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-11-28 02:50:47,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-11-28 02:50:47,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-28 02:50:47,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-11-28 02:50:47,587 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 5 [2019-11-28 02:50:47,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:47,588 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-11-28 02:50:47,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 02:50:47,589 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-11-28 02:50:47,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 02:50:47,589 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:47,590 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 02:50:47,592 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:47,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:47,594 INFO L82 PathProgramCache]: Analyzing trace with hash 29685000, now seen corresponding path program 1 times [2019-11-28 02:50:47,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:47,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959597483] [2019-11-28 02:50:47,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:47,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:47,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959597483] [2019-11-28 02:50:47,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:47,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:50:47,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473006878] [2019-11-28 02:50:47,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:50:47,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:47,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:50:47,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:50:47,709 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2019-11-28 02:50:47,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:47,796 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2019-11-28 02:50:47,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:50:47,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-28 02:50:47,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:47,798 INFO L225 Difference]: With dead ends: 41 [2019-11-28 02:50:47,798 INFO L226 Difference]: Without dead ends: 40 [2019-11-28 02:50:47,802 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:50:47,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-28 02:50:47,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 25. [2019-11-28 02:50:47,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-28 02:50:47,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-11-28 02:50:47,812 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 5 [2019-11-28 02:50:47,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:47,813 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-11-28 02:50:47,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:50:47,813 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-11-28 02:50:47,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 02:50:47,814 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:47,814 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 02:50:47,815 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:47,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:47,817 INFO L82 PathProgramCache]: Analyzing trace with hash 29685034, now seen corresponding path program 1 times [2019-11-28 02:50:47,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:47,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700106912] [2019-11-28 02:50:47,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:47,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:47,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:47,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700106912] [2019-11-28 02:50:47,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:47,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:50:47,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72461277] [2019-11-28 02:50:47,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:50:47,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:47,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:50:47,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:50:47,882 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 3 states. [2019-11-28 02:50:47,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:47,939 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2019-11-28 02:50:47,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:50:47,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-28 02:50:47,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:47,944 INFO L225 Difference]: With dead ends: 34 [2019-11-28 02:50:47,944 INFO L226 Difference]: Without dead ends: 33 [2019-11-28 02:50:47,944 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:50:47,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-28 02:50:47,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2019-11-28 02:50:47,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 02:50:47,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-11-28 02:50:47,960 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 5 [2019-11-28 02:50:47,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:47,961 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-11-28 02:50:47,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:50:47,961 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-11-28 02:50:47,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-28 02:50:47,963 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:47,963 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-28 02:50:47,964 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:47,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:47,968 INFO L82 PathProgramCache]: Analyzing trace with hash 920235084, now seen corresponding path program 1 times [2019-11-28 02:50:47,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:47,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094948827] [2019-11-28 02:50:47,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:47,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:47,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:47,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094948827] [2019-11-28 02:50:47,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:47,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:50:47,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138870705] [2019-11-28 02:50:47,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:50:47,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:47,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:50:48,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:50:48,000 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 3 states. [2019-11-28 02:50:48,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:48,063 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2019-11-28 02:50:48,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:50:48,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-11-28 02:50:48,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:48,065 INFO L225 Difference]: With dead ends: 45 [2019-11-28 02:50:48,065 INFO L226 Difference]: Without dead ends: 44 [2019-11-28 02:50:48,066 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:50:48,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-28 02:50:48,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2019-11-28 02:50:48,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-28 02:50:48,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2019-11-28 02:50:48,074 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 6 [2019-11-28 02:50:48,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:48,074 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2019-11-28 02:50:48,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:50:48,075 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2019-11-28 02:50:48,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-28 02:50:48,075 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:48,076 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-28 02:50:48,076 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:48,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:48,077 INFO L82 PathProgramCache]: Analyzing trace with hash 920236110, now seen corresponding path program 1 times [2019-11-28 02:50:48,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:48,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716358103] [2019-11-28 02:50:48,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:48,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:48,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716358103] [2019-11-28 02:50:48,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:48,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:50:48,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891358682] [2019-11-28 02:50:48,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:50:48,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:48,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:50:48,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:50:48,106 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand 3 states. [2019-11-28 02:50:48,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:48,127 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2019-11-28 02:50:48,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:50:48,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-11-28 02:50:48,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:48,129 INFO L225 Difference]: With dead ends: 31 [2019-11-28 02:50:48,129 INFO L226 Difference]: Without dead ends: 30 [2019-11-28 02:50:48,130 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:50:48,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-28 02:50:48,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-11-28 02:50:48,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 02:50:48,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-11-28 02:50:48,137 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 6 [2019-11-28 02:50:48,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:48,137 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-11-28 02:50:48,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:50:48,137 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2019-11-28 02:50:48,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 02:50:48,138 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:48,138 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:48,139 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:48,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:48,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1537451600, now seen corresponding path program 1 times [2019-11-28 02:50:48,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:48,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748686784] [2019-11-28 02:50:48,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:48,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:48,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:48,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748686784] [2019-11-28 02:50:48,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:48,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 02:50:48,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665181912] [2019-11-28 02:50:48,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:50:48,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:48,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:50:48,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:50:48,177 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 3 states. [2019-11-28 02:50:48,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:48,198 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-11-28 02:50:48,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:50:48,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-28 02:50:48,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:48,203 INFO L225 Difference]: With dead ends: 30 [2019-11-28 02:50:48,203 INFO L226 Difference]: Without dead ends: 29 [2019-11-28 02:50:48,204 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:50:48,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-28 02:50:48,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-28 02:50:48,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-28 02:50:48,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2019-11-28 02:50:48,218 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 7 [2019-11-28 02:50:48,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:48,219 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-11-28 02:50:48,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:50:48,219 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2019-11-28 02:50:48,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 02:50:48,219 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:48,220 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:48,220 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:48,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:48,220 INFO L82 PathProgramCache]: Analyzing trace with hash -416359280, now seen corresponding path program 1 times [2019-11-28 02:50:48,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:48,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849187551] [2019-11-28 02:50:48,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:48,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:48,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:48,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849187551] [2019-11-28 02:50:48,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:48,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:50:48,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020155637] [2019-11-28 02:50:48,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:50:48,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:48,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:50:48,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:50:48,262 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand 3 states. [2019-11-28 02:50:48,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:48,281 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2019-11-28 02:50:48,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:50:48,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-28 02:50:48,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:48,284 INFO L225 Difference]: With dead ends: 29 [2019-11-28 02:50:48,284 INFO L226 Difference]: Without dead ends: 28 [2019-11-28 02:50:48,284 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:50:48,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-28 02:50:48,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-28 02:50:48,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 02:50:48,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2019-11-28 02:50:48,298 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 8 [2019-11-28 02:50:48,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:48,299 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-11-28 02:50:48,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:50:48,300 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2019-11-28 02:50:48,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 02:50:48,300 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:48,301 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2019-11-28 02:50:48,301 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:48,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:48,302 INFO L82 PathProgramCache]: Analyzing trace with hash -52819969, now seen corresponding path program 1 times [2019-11-28 02:50:48,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:48,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431947601] [2019-11-28 02:50:48,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:48,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:48,341 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:48,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431947601] [2019-11-28 02:50:48,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361698930] [2019-11-28 02:50:48,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:48,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 02:50:48,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:48,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:48,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:48,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-11-28 02:50:48,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696417225] [2019-11-28 02:50:48,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:50:48,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:48,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:50:48,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:50:48,438 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 4 states. [2019-11-28 02:50:48,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:48,515 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2019-11-28 02:50:48,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:50:48,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-28 02:50:48,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:48,520 INFO L225 Difference]: With dead ends: 54 [2019-11-28 02:50:48,520 INFO L226 Difference]: Without dead ends: 53 [2019-11-28 02:50:48,521 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:50:48,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-28 02:50:48,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 32. [2019-11-28 02:50:48,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-28 02:50:48,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2019-11-28 02:50:48,534 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 9 [2019-11-28 02:50:48,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:48,536 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-11-28 02:50:48,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:50:48,536 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2019-11-28 02:50:48,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 02:50:48,537 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:48,537 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:48,738 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:48,739 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:48,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:48,739 INFO L82 PathProgramCache]: Analyzing trace with hash -689307342, now seen corresponding path program 1 times [2019-11-28 02:50:48,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:48,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048601129] [2019-11-28 02:50:48,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:48,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:48,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:48,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048601129] [2019-11-28 02:50:48,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:48,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:50:48,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822828492] [2019-11-28 02:50:48,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:50:48,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:48,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:50:48,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:50:48,789 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 4 states. [2019-11-28 02:50:48,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:48,876 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2019-11-28 02:50:48,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:50:48,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-28 02:50:48,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:48,878 INFO L225 Difference]: With dead ends: 64 [2019-11-28 02:50:48,878 INFO L226 Difference]: Without dead ends: 62 [2019-11-28 02:50:48,878 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:50:48,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-28 02:50:48,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 42. [2019-11-28 02:50:48,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-28 02:50:48,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2019-11-28 02:50:48,886 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 10 [2019-11-28 02:50:48,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:48,887 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2019-11-28 02:50:48,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:50:48,887 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2019-11-28 02:50:48,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 02:50:48,888 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:48,888 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:48,888 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:48,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:48,889 INFO L82 PathProgramCache]: Analyzing trace with hash 106308951, now seen corresponding path program 1 times [2019-11-28 02:50:48,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:48,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228784645] [2019-11-28 02:50:48,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:48,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:48,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:48,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228784645] [2019-11-28 02:50:48,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:48,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:50:48,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346452333] [2019-11-28 02:50:48,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:50:48,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:48,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:50:48,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:50:48,931 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand 4 states. [2019-11-28 02:50:49,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:49,002 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2019-11-28 02:50:49,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:50:49,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 02:50:49,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:49,004 INFO L225 Difference]: With dead ends: 46 [2019-11-28 02:50:49,004 INFO L226 Difference]: Without dead ends: 44 [2019-11-28 02:50:49,005 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:50:49,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-28 02:50:49,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 35. [2019-11-28 02:50:49,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-28 02:50:49,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2019-11-28 02:50:49,011 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 11 [2019-11-28 02:50:49,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:49,011 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2019-11-28 02:50:49,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:50:49,012 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2019-11-28 02:50:49,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 02:50:49,012 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:49,013 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:49,013 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:49,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:49,013 INFO L82 PathProgramCache]: Analyzing trace with hash -999444228, now seen corresponding path program 1 times [2019-11-28 02:50:49,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:49,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424501011] [2019-11-28 02:50:49,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:49,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:49,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:49,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424501011] [2019-11-28 02:50:49,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965348103] [2019-11-28 02:50:49,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:49,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:49,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 02:50:49,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:49,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:49,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:49,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-11-28 02:50:49,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810415555] [2019-11-28 02:50:49,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:50:49,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:49,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:50:49,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:50:49,102 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand 4 states. [2019-11-28 02:50:49,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:49,146 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2019-11-28 02:50:49,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:50:49,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-28 02:50:49,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:49,150 INFO L225 Difference]: With dead ends: 66 [2019-11-28 02:50:49,150 INFO L226 Difference]: Without dead ends: 65 [2019-11-28 02:50:49,151 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:50:49,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-28 02:50:49,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 52. [2019-11-28 02:50:49,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-28 02:50:49,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2019-11-28 02:50:49,168 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 12 [2019-11-28 02:50:49,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:49,169 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2019-11-28 02:50:49,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:50:49,170 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2019-11-28 02:50:49,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 02:50:49,171 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:49,172 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1] [2019-11-28 02:50:49,376 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:49,377 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:49,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:49,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1890502518, now seen corresponding path program 2 times [2019-11-28 02:50:49,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:49,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767988386] [2019-11-28 02:50:49,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:49,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:49,460 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:49,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767988386] [2019-11-28 02:50:49,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399035279] [2019-11-28 02:50:49,461 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:50:49,497 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 02:50:49,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:50:49,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:50:49,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:49,513 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 02:50:49,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:49,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 2] total 6 [2019-11-28 02:50:49,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442778525] [2019-11-28 02:50:49,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 02:50:49,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:49,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:50:49,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:50:49,516 INFO L87 Difference]: Start difference. First operand 52 states and 65 transitions. Second operand 8 states. [2019-11-28 02:50:49,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:49,672 INFO L93 Difference]: Finished difference Result 87 states and 104 transitions. [2019-11-28 02:50:49,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:50:49,673 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-11-28 02:50:49,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:49,676 INFO L225 Difference]: With dead ends: 87 [2019-11-28 02:50:49,676 INFO L226 Difference]: Without dead ends: 86 [2019-11-28 02:50:49,678 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-11-28 02:50:49,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-28 02:50:49,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 48. [2019-11-28 02:50:49,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-28 02:50:49,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2019-11-28 02:50:49,698 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 13 [2019-11-28 02:50:49,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:49,699 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2019-11-28 02:50:49,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 02:50:49,699 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2019-11-28 02:50:49,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 02:50:49,702 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:49,702 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:49,907 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:49,907 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:49,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:49,908 INFO L82 PathProgramCache]: Analyzing trace with hash -575852389, now seen corresponding path program 1 times [2019-11-28 02:50:49,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:49,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028948066] [2019-11-28 02:50:49,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:49,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:49,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:50:49,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028948066] [2019-11-28 02:50:49,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:49,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:50:49,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83440429] [2019-11-28 02:50:49,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:50:49,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:49,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:50:49,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:50:49,943 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand 4 states. [2019-11-28 02:50:49,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:49,972 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2019-11-28 02:50:49,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:50:49,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 02:50:49,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:49,974 INFO L225 Difference]: With dead ends: 48 [2019-11-28 02:50:49,974 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 02:50:49,975 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:50:49,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 02:50:49,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2019-11-28 02:50:49,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 02:50:49,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2019-11-28 02:50:49,982 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 14 [2019-11-28 02:50:49,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:49,982 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2019-11-28 02:50:49,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:50:49,982 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2019-11-28 02:50:49,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 02:50:49,983 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:49,983 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:49,984 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:49,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:49,984 INFO L82 PathProgramCache]: Analyzing trace with hash 656583171, now seen corresponding path program 1 times [2019-11-28 02:50:49,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:49,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206668302] [2019-11-28 02:50:49,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:50,055 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:50,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206668302] [2019-11-28 02:50:50,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493547448] [2019-11-28 02:50:50,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:50,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:50,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:50:50,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:50,143 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:50,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:50,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2019-11-28 02:50:50,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42901625] [2019-11-28 02:50:50,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 02:50:50,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:50,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 02:50:50,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:50:50,146 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand 11 states. [2019-11-28 02:50:50,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:50,549 INFO L93 Difference]: Finished difference Result 113 states and 134 transitions. [2019-11-28 02:50:50,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 02:50:50,550 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-11-28 02:50:50,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:50,551 INFO L225 Difference]: With dead ends: 113 [2019-11-28 02:50:50,551 INFO L226 Difference]: Without dead ends: 67 [2019-11-28 02:50:50,552 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-11-28 02:50:50,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-28 02:50:50,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 45. [2019-11-28 02:50:50,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 02:50:50,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2019-11-28 02:50:50,565 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 16 [2019-11-28 02:50:50,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:50,565 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-11-28 02:50:50,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 02:50:50,566 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2019-11-28 02:50:50,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 02:50:50,566 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:50,566 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:50,767 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:50,768 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:50,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:50,769 INFO L82 PathProgramCache]: Analyzing trace with hash 471235363, now seen corresponding path program 1 times [2019-11-28 02:50:50,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:50,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147153942] [2019-11-28 02:50:50,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:50,819 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:50,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147153942] [2019-11-28 02:50:50,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365767074] [2019-11-28 02:50:50,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:50,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:50,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:50:50,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:50,863 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:50,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:50,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-11-28 02:50:50,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386935447] [2019-11-28 02:50:50,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:50:50,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:50,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:50:50,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:50:50,866 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand 6 states. [2019-11-28 02:50:50,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:50,977 INFO L93 Difference]: Finished difference Result 116 states and 134 transitions. [2019-11-28 02:50:50,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:50:50,977 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-11-28 02:50:50,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:50,978 INFO L225 Difference]: With dead ends: 116 [2019-11-28 02:50:50,978 INFO L226 Difference]: Without dead ends: 115 [2019-11-28 02:50:50,979 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:50:50,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-28 02:50:50,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 68. [2019-11-28 02:50:50,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-28 02:50:50,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2019-11-28 02:50:50,996 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 17 [2019-11-28 02:50:50,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:50,999 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2019-11-28 02:50:50,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:50:50,999 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2019-11-28 02:50:51,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 02:50:51,001 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:51,001 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-11-28 02:50:51,204 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:51,205 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:51,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:51,205 INFO L82 PathProgramCache]: Analyzing trace with hash -415013654, now seen corresponding path program 2 times [2019-11-28 02:50:51,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:51,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680827245] [2019-11-28 02:50:51,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:51,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:51,285 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:51,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680827245] [2019-11-28 02:50:51,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046599360] [2019-11-28 02:50:51,286 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:51,308 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 02:50:51,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:50:51,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:50:51,310 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:51,337 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-28 02:50:51,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:51,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 2] total 6 [2019-11-28 02:50:51,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403461699] [2019-11-28 02:50:51,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:50:51,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:51,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:50:51,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:50:51,340 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. Second operand 7 states. [2019-11-28 02:50:51,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:51,412 INFO L93 Difference]: Finished difference Result 139 states and 168 transitions. [2019-11-28 02:50:51,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:50:51,413 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-28 02:50:51,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:51,415 INFO L225 Difference]: With dead ends: 139 [2019-11-28 02:50:51,415 INFO L226 Difference]: Without dead ends: 138 [2019-11-28 02:50:51,415 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:50:51,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-11-28 02:50:51,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 39. [2019-11-28 02:50:51,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 02:50:51,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2019-11-28 02:50:51,424 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 19 [2019-11-28 02:50:51,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:51,424 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-11-28 02:50:51,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:50:51,425 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2019-11-28 02:50:51,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 02:50:51,426 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:51,426 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:51,629 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:51,629 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:51,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:51,629 INFO L82 PathProgramCache]: Analyzing trace with hash 2095953530, now seen corresponding path program 2 times [2019-11-28 02:50:51,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:51,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432273096] [2019-11-28 02:50:51,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:51,682 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:51,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432273096] [2019-11-28 02:50:51,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449771912] [2019-11-28 02:50:51,683 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:51,747 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:50:51,748 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:50:51,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:50:51,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:51,760 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:51,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:51,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-11-28 02:50:51,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534282895] [2019-11-28 02:50:51,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:50:51,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:51,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:50:51,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:50:51,767 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 7 states. [2019-11-28 02:50:51,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:51,899 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2019-11-28 02:50:51,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 02:50:51,899 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-11-28 02:50:51,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:51,900 INFO L225 Difference]: With dead ends: 92 [2019-11-28 02:50:51,900 INFO L226 Difference]: Without dead ends: 91 [2019-11-28 02:50:51,901 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:50:51,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-28 02:50:51,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 44. [2019-11-28 02:50:51,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-28 02:50:51,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2019-11-28 02:50:51,908 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 22 [2019-11-28 02:50:51,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:51,908 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2019-11-28 02:50:51,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:50:51,908 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2019-11-28 02:50:51,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 02:50:51,909 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:51,909 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:52,112 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:52,113 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:52,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:52,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1289288067, now seen corresponding path program 3 times [2019-11-28 02:50:52,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:52,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580312125] [2019-11-28 02:50:52,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:52,167 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:52,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580312125] [2019-11-28 02:50:52,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126231113] [2019-11-28 02:50:52,168 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:52,192 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-28 02:50:52,192 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:50:52,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:50:52,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:52,238 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-28 02:50:52,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:52,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 11 [2019-11-28 02:50:52,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59778040] [2019-11-28 02:50:52,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 02:50:52,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:52,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 02:50:52,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:50:52,240 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 12 states. [2019-11-28 02:50:52,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:52,703 INFO L93 Difference]: Finished difference Result 143 states and 166 transitions. [2019-11-28 02:50:52,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-28 02:50:52,704 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-11-28 02:50:52,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:52,705 INFO L225 Difference]: With dead ends: 143 [2019-11-28 02:50:52,705 INFO L226 Difference]: Without dead ends: 142 [2019-11-28 02:50:52,706 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=358, Invalid=698, Unknown=0, NotChecked=0, Total=1056 [2019-11-28 02:50:52,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-28 02:50:52,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 60. [2019-11-28 02:50:52,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-28 02:50:52,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2019-11-28 02:50:52,714 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 27 [2019-11-28 02:50:52,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:52,714 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2019-11-28 02:50:52,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 02:50:52,715 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2019-11-28 02:50:52,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 02:50:52,715 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:52,716 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:52,918 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:52,919 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:52,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:52,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1685598945, now seen corresponding path program 1 times [2019-11-28 02:50:52,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:52,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390764567] [2019-11-28 02:50:52,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:52,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:53,058 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 13 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 02:50:53,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390764567] [2019-11-28 02:50:53,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253391393] [2019-11-28 02:50:53,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:53,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:53,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:50:53,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:53,152 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-28 02:50:53,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:50:53,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 17 [2019-11-28 02:50:53,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678805481] [2019-11-28 02:50:53,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:50:53,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:53,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:50:53,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-11-28 02:50:53,154 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand 6 states. [2019-11-28 02:50:53,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:53,263 INFO L93 Difference]: Finished difference Result 147 states and 172 transitions. [2019-11-28 02:50:53,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:50:53,263 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-11-28 02:50:53,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:53,264 INFO L225 Difference]: With dead ends: 147 [2019-11-28 02:50:53,264 INFO L226 Difference]: Without dead ends: 102 [2019-11-28 02:50:53,265 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-11-28 02:50:53,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-28 02:50:53,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 71. [2019-11-28 02:50:53,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-28 02:50:53,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2019-11-28 02:50:53,279 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 39 [2019-11-28 02:50:53,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:53,279 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2019-11-28 02:50:53,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:50:53,279 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2019-11-28 02:50:53,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 02:50:53,285 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:53,285 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:53,488 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:53,489 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:53,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:53,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1243466243, now seen corresponding path program 2 times [2019-11-28 02:50:53,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:53,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508309316] [2019-11-28 02:50:53,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:53,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:53,591 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:50:53,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508309316] [2019-11-28 02:50:53,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084282004] [2019-11-28 02:50:53,592 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:53,629 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:50:53,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:50:53,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 02:50:53,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:53,646 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:50:53,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:53,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-11-28 02:50:53,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103895029] [2019-11-28 02:50:53,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 02:50:53,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:53,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 02:50:53,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:50:53,649 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand 10 states. [2019-11-28 02:50:53,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:53,846 INFO L93 Difference]: Finished difference Result 142 states and 156 transitions. [2019-11-28 02:50:53,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 02:50:53,846 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2019-11-28 02:50:53,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:53,847 INFO L225 Difference]: With dead ends: 142 [2019-11-28 02:50:53,847 INFO L226 Difference]: Without dead ends: 141 [2019-11-28 02:50:53,849 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=242, Unknown=0, NotChecked=0, Total=380 [2019-11-28 02:50:53,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-28 02:50:53,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 82. [2019-11-28 02:50:53,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-28 02:50:53,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2019-11-28 02:50:53,859 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 39 [2019-11-28 02:50:53,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:53,861 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2019-11-28 02:50:53,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 02:50:53,861 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2019-11-28 02:50:53,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-28 02:50:53,862 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:53,862 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-28 02:50:54,073 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:54,074 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:54,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:54,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1165798321, now seen corresponding path program 3 times [2019-11-28 02:50:54,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:54,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669087775] [2019-11-28 02:50:54,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:54,194 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 02:50:54,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669087775] [2019-11-28 02:50:54,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291756773] [2019-11-28 02:50:54,194 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:54,223 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-28 02:50:54,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:50:54,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:50:54,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:54,270 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-28 02:50:54,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:54,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 3] total 13 [2019-11-28 02:50:54,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106414681] [2019-11-28 02:50:54,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 02:50:54,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:54,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 02:50:54,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-11-28 02:50:54,272 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 14 states. [2019-11-28 02:50:54,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:54,709 INFO L93 Difference]: Finished difference Result 198 states and 220 transitions. [2019-11-28 02:50:54,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-28 02:50:54,709 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2019-11-28 02:50:54,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:54,710 INFO L225 Difference]: With dead ends: 198 [2019-11-28 02:50:54,710 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 02:50:54,712 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=430, Invalid=830, Unknown=0, NotChecked=0, Total=1260 [2019-11-28 02:50:54,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 02:50:54,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 02:50:54,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 02:50:54,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 02:50:54,712 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2019-11-28 02:50:54,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:54,713 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 02:50:54,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 02:50:54,713 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 02:50:54,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 02:50:54,917 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:54,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 02:50:55,155 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 108 [2019-11-28 02:50:55,436 WARN L192 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 142 [2019-11-28 02:50:55,793 WARN L192 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 140 [2019-11-28 02:50:56,251 WARN L192 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 30 [2019-11-28 02:50:57,056 WARN L192 SmtUtils]: Spent 801.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 38 [2019-11-28 02:50:57,599 WARN L192 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 30 [2019-11-28 02:50:57,604 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2019-11-28 02:50:57,604 INFO L242 CegarLoopResult]: At program point L23-2(lines 23 34) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_main_~n~0 2147483647)) (.cse3 (<= 0 ULTIMATE.start_main_~j~0)) (.cse1 (<= ULTIMATE.start_main_~m~0 2147483647)) (.cse2 (<= 0 ULTIMATE.start_main_~N~0)) (.cse4 (<= ULTIMATE.start_main_~N~0 2147483647)) (.cse5 (<= 0 ULTIMATE.start_main_~i~0))) (or (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_main_~N~0 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~k~0 1)) .cse3 .cse4 .cse5) (and .cse0 (<= ULTIMATE.start_main_~m~0 0) .cse2 (<= ULTIMATE.start_main_~j~0 0) .cse3 .cse4 .cse5) (and (<= ULTIMATE.start_main_~i~0 0) .cse1 .cse2 (<= (+ ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~i~0) 2147483647) .cse4 .cse5))) [2019-11-28 02:50:57,604 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2019-11-28 02:50:57,604 INFO L249 CegarLoopResult]: At program point L36(lines 13 37) the Hoare annotation is: true [2019-11-28 02:50:57,605 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2019-11-28 02:50:57,605 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 02:50:57,605 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2019-11-28 02:50:57,605 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 02:50:57,605 INFO L246 CegarLoopResult]: For program point L28-1(line 28) no Hoare annotation was computed. [2019-11-28 02:50:57,605 INFO L246 CegarLoopResult]: For program point L28-2(lines 28 30) no Hoare annotation was computed. [2019-11-28 02:50:57,605 INFO L242 CegarLoopResult]: At program point L28-4(lines 28 30) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_main_~n~0 2147483647)) (.cse1 (<= ULTIMATE.start_main_~m~0 2147483647)) (.cse2 (<= 0 ULTIMATE.start_main_~k~0)) (.cse3 (<= 0 ULTIMATE.start_main_~N~0)) (.cse4 (<= 0 ULTIMATE.start_main_~j~0)) (.cse5 (<= ULTIMATE.start_main_~k~0 2147483646)) (.cse6 (<= ULTIMATE.start_main_~N~0 2147483647)) (.cse7 (<= 0 ULTIMATE.start_main_~i~0))) (or (and (<= ULTIMATE.start_main_~i~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~i~0 1)) (<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~k~0 1)) .cse4 .cse5 .cse6 .cse7))) [2019-11-28 02:50:57,606 INFO L246 CegarLoopResult]: For program point L28-5(lines 28 30) no Hoare annotation was computed. [2019-11-28 02:50:57,607 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2019-11-28 02:50:57,607 INFO L246 CegarLoopResult]: For program point L33(line 33) no Hoare annotation was computed. [2019-11-28 02:50:57,607 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 02:50:57,607 INFO L246 CegarLoopResult]: For program point L29(line 29) no Hoare annotation was computed. [2019-11-28 02:50:57,607 INFO L246 CegarLoopResult]: For program point L29-1(line 29) no Hoare annotation was computed. [2019-11-28 02:50:57,607 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2019-11-28 02:50:57,608 INFO L242 CegarLoopResult]: At program point L25-2(lines 25 32) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_main_~m~0 2147483647)) (.cse7 (<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~k~0 1))) (.cse6 (<= ULTIMATE.start_main_~n~0 2147483647)) (.cse1 (<= 0 ULTIMATE.start_main_~N~0)) (.cse2 (<= ULTIMATE.start_main_~j~0 0)) (.cse3 (<= 0 ULTIMATE.start_main_~j~0)) (.cse8 (<= ULTIMATE.start_main_~i~0 2147483646)) (.cse4 (<= ULTIMATE.start_main_~N~0 2147483647)) (.cse5 (<= 0 ULTIMATE.start_main_~i~0))) (or (and (<= ULTIMATE.start_main_~i~0 0) .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~i~0) 2147483647) .cse3 .cse4 .cse5) (and .cse6 (<= 0 ULTIMATE.start_main_~k~0) .cse0 .cse1 (<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~i~0 1)) .cse7 .cse3 (<= ULTIMATE.start_main_~k~0 2147483646) .cse8 .cse5) (and .cse6 .cse0 .cse1 .cse2 (<= ULTIMATE.start_main_~N~0 ULTIMATE.start_main_~i~0) .cse7 .cse3 .cse8 .cse4 .cse5) (and .cse6 (<= ULTIMATE.start_main_~m~0 0) .cse1 .cse2 .cse3 .cse8 .cse4 .cse5))) [2019-11-28 02:50:57,609 INFO L246 CegarLoopResult]: For program point L25-3(lines 25 32) no Hoare annotation was computed. [2019-11-28 02:50:57,609 INFO L246 CegarLoopResult]: For program point L21(lines 21 35) no Hoare annotation was computed. [2019-11-28 02:50:57,609 INFO L246 CegarLoopResult]: For program point L21-1(lines 21 35) no Hoare annotation was computed. [2019-11-28 02:50:57,609 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2019-11-28 02:50:57,609 INFO L246 CegarLoopResult]: For program point L26(line 26) no Hoare annotation was computed. [2019-11-28 02:50:57,610 INFO L246 CegarLoopResult]: For program point L26-1(line 26) no Hoare annotation was computed. [2019-11-28 02:50:57,610 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2019-11-28 02:50:57,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:50:57 BoogieIcfgContainer [2019-11-28 02:50:57,657 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:50:57,657 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:50:57,658 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:50:57,658 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:50:57,660 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:50:47" (3/4) ... [2019-11-28 02:50:57,664 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 02:50:57,679 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 02:50:57,679 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 02:50:57,730 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:50:57,730 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:50:57,732 INFO L168 Benchmark]: Toolchain (without parser) took 11284.28 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 303.0 MB). Free memory was 957.7 MB in the beginning and 853.2 MB in the end (delta: 104.5 MB). Peak memory consumption was 407.6 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:57,733 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:50:57,733 INFO L168 Benchmark]: CACSL2BoogieTranslator took 272.33 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 945.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:57,734 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -166.4 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:57,734 INFO L168 Benchmark]: Boogie Preprocessor took 30.39 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:57,735 INFO L168 Benchmark]: RCFGBuilder took 317.95 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: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:57,736 INFO L168 Benchmark]: TraceAbstraction took 10481.31 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 187.2 MB). Free memory was 1.1 GB in the beginning and 862.2 MB in the end (delta: 223.1 MB). Peak memory consumption was 416.8 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:57,736 INFO L168 Benchmark]: Witness Printer took 73.16 ms. Allocated memory is still 1.3 GB. Free memory was 862.2 MB in the beginning and 853.2 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:57,739 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 272.33 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 945.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 103.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -166.4 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.39 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 317.95 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: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10481.31 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 187.2 MB). Free memory was 1.1 GB in the beginning and 862.2 MB in the end (delta: 223.1 MB). Peak memory consumption was 416.8 MB. Max. memory is 11.5 GB. * Witness Printer took 73.16 ms. Allocated memory is still 1.3 GB. Free memory was 862.2 MB in the beginning and 853.2 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((((((((n <= 2147483647 && m <= 2147483647) && 0 <= N) && N <= i) && N <= k + 1) && 0 <= j) && N <= 2147483647) && 0 <= i) || ((((((n <= 2147483647 && m <= 0) && 0 <= N) && j <= 0) && 0 <= j) && N <= 2147483647) && 0 <= i)) || (((((i <= 0 && m <= 2147483647) && 0 <= N) && n + i <= 2147483647) && N <= 2147483647) && 0 <= i) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: (((((((((i <= 0 && m <= 2147483647) && 0 <= N) && j <= 0) && n + i <= 2147483647) && 0 <= j) && N <= 2147483647) && 0 <= i) || (((((((((n <= 2147483647 && 0 <= k) && m <= 2147483647) && 0 <= N) && N <= i + 1) && N <= k + 1) && 0 <= j) && k <= 2147483646) && i <= 2147483646) && 0 <= i)) || (((((((((n <= 2147483647 && m <= 2147483647) && 0 <= N) && j <= 0) && N <= i) && N <= k + 1) && 0 <= j) && i <= 2147483646) && N <= 2147483647) && 0 <= i)) || (((((((n <= 2147483647 && m <= 0) && 0 <= N) && j <= 0) && 0 <= j) && i <= 2147483646) && N <= 2147483647) && 0 <= i) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: ((((((((i <= 0 && n <= 2147483647) && m <= 2147483647) && 0 <= k) && 0 <= N) && 0 <= j) && k <= 2147483646) && N <= 2147483647) && 0 <= i) || (((((((((n <= 2147483647 && m <= 2147483647) && 0 <= k) && 0 <= N) && N <= i + 1) && N <= k + 1) && 0 <= j) && k <= 2147483646) && N <= 2147483647) && 0 <= i) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 26 locations, 8 error locations. Result: SAFE, OverallTime: 7.6s, OverallIterations: 21, TraceHistogramMax: 6, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.6s, HoareTripleCheckerStatistics: 321 SDtfs, 1164 SDslu, 557 SDs, 0 SdLazy, 985 SolverSat, 288 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 437 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 524 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 68 NumberOfFragments, 257 HoareAnnotationTreeSize, 4 FomulaSimplifications, 4319131 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 4 FomulaSimplificationsInter, 1386672 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 589 NumberOfCodeBlocks, 530 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 557 ConstructedInterpolants, 0 QuantifiedInterpolants, 43409 SizeOfPredicates, 24 NumberOfNonLiveVariables, 638 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 32 InterpolantComputations, 11 PerfectInterpolantSequences, 145/478 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...