./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-crafted/NestedRecursion_1b.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 cb528549fa76ae8087cf7043645dfa20323a0116 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:22:35,151 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:22:35,153 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:22:35,166 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:22:35,167 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:22:35,168 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:22:35,170 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:22:35,172 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:22:35,174 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:22:35,175 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:22:35,177 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:22:35,178 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:22:35,178 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:22:35,180 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:22:35,181 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:22:35,182 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:22:35,185 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:22:35,186 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:22:35,189 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:22:35,194 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:22:35,195 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:22:35,197 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:22:35,198 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:22:35,199 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:22:35,201 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:22:35,202 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:22:35,202 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:22:35,203 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:22:35,204 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:22:35,205 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:22:35,205 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:22:35,206 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:22:35,207 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:22:35,208 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:22:35,209 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:22:35,209 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:22:35,210 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:22:35,210 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:22:35,211 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:22:35,212 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:22:35,213 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:22:35,214 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-11-28 20:22:35,228 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:22:35,229 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:22:35,230 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:22:35,231 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:22:35,231 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:22:35,231 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:22:35,232 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:22:35,232 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:22:35,232 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:22:35,232 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 20:22:35,233 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 20:22:35,233 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 20:22:35,233 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-28 20:22:35,234 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:22:35,234 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:22:35,234 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 20:22:35,234 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:22:35,235 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:22:35,235 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 20:22:35,235 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 20:22:35,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:22:35,236 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:22:35,236 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 20:22:35,236 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 20:22:35,237 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:22:35,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 20:22:35,237 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 20:22:35,238 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:22:35,238 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 -> cb528549fa76ae8087cf7043645dfa20323a0116 [2019-11-28 20:22:35,552 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:22:35,565 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:22:35,569 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:22:35,570 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:22:35,570 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:22:35,571 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c [2019-11-28 20:22:35,629 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbafd46b0/492b7b2b0857425cb8b043e8f241290f/FLAG40b6ee8be [2019-11-28 20:22:36,073 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:22:36,075 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c [2019-11-28 20:22:36,083 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbafd46b0/492b7b2b0857425cb8b043e8f241290f/FLAG40b6ee8be [2019-11-28 20:22:36,460 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbafd46b0/492b7b2b0857425cb8b043e8f241290f [2019-11-28 20:22:36,464 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:22:36,466 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:22:36,467 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:22:36,467 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:22:36,470 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:22:36,471 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:22:36" (1/1) ... [2019-11-28 20:22:36,474 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dc447bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:36, skipping insertion in model container [2019-11-28 20:22:36,474 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:22:36" (1/1) ... [2019-11-28 20:22:36,482 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:22:36,499 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:22:36,695 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:22:36,700 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:22:36,727 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:22:36,743 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:22:36,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:36 WrapperNode [2019-11-28 20:22:36,744 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:22:36,745 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:22:36,746 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:22:36,746 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:22:36,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:36" (1/1) ... [2019-11-28 20:22:36,761 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:36" (1/1) ... [2019-11-28 20:22:36,832 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:22:36,835 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:22:36,835 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:22:36,835 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:22:36,845 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:36" (1/1) ... [2019-11-28 20:22:36,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:36" (1/1) ... [2019-11-28 20:22:36,846 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:36" (1/1) ... [2019-11-28 20:22:36,847 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:36" (1/1) ... [2019-11-28 20:22:36,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:36" (1/1) ... [2019-11-28 20:22:36,851 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:36" (1/1) ... [2019-11-28 20:22:36,852 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:36" (1/1) ... [2019-11-28 20:22:36,853 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:22:36,854 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:22:36,854 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:22:36,854 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:22:36,855 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:22:36,910 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2019-11-28 20:22:36,910 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2019-11-28 20:22:36,911 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2019-11-28 20:22:36,911 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2019-11-28 20:22:36,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:22:36,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:22:37,185 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:22:37,186 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 20:22:37,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:22:37 BoogieIcfgContainer [2019-11-28 20:22:37,187 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:22:37,188 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 20:22:37,188 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 20:22:37,200 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 20:22:37,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:22:36" (1/3) ... [2019-11-28 20:22:37,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a7870d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:22:37, skipping insertion in model container [2019-11-28 20:22:37,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:36" (2/3) ... [2019-11-28 20:22:37,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a7870d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:22:37, skipping insertion in model container [2019-11-28 20:22:37,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:22:37" (3/3) ... [2019-11-28 20:22:37,203 INFO L109 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1b.c [2019-11-28 20:22:37,211 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 20:22:37,219 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2019-11-28 20:22:37,231 INFO L249 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-11-28 20:22:37,262 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 20:22:37,262 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 20:22:37,262 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 20:22:37,263 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:22:37,263 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:22:37,263 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 20:22:37,263 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:22:37,264 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 20:22:37,284 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-11-28 20:22:37,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 20:22:37,288 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:37,289 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 20:22:37,289 INFO L410 AbstractCegarLoop]: === Iteration 1 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:37,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:37,295 INFO L82 PathProgramCache]: Analyzing trace with hash 70122184, now seen corresponding path program 1 times [2019-11-28 20:22:37,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:37,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174091188] [2019-11-28 20:22:37,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:37,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:37,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:37,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174091188] [2019-11-28 20:22:37,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:37,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:22:37,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706798090] [2019-11-28 20:22:37,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:22:37,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:37,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:22:37,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:22:37,543 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 5 states. [2019-11-28 20:22:37,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:37,711 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2019-11-28 20:22:37,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:22:37,715 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-11-28 20:22:37,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:37,729 INFO L225 Difference]: With dead ends: 62 [2019-11-28 20:22:37,730 INFO L226 Difference]: Without dead ends: 55 [2019-11-28 20:22:37,735 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:22:37,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-28 20:22:37,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2019-11-28 20:22:37,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-28 20:22:37,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2019-11-28 20:22:37,793 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 5 [2019-11-28 20:22:37,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:37,794 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2019-11-28 20:22:37,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:22:37,795 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2019-11-28 20:22:37,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-28 20:22:37,795 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:37,795 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-28 20:22:37,796 INFO L410 AbstractCegarLoop]: === Iteration 2 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:37,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:37,797 INFO L82 PathProgramCache]: Analyzing trace with hash -2121179530, now seen corresponding path program 1 times [2019-11-28 20:22:37,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:37,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752654228] [2019-11-28 20:22:37,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:37,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:37,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:37,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752654228] [2019-11-28 20:22:37,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:37,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:22:37,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598231274] [2019-11-28 20:22:37,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:22:37,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:37,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:22:37,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:22:37,824 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 3 states. [2019-11-28 20:22:37,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:37,852 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2019-11-28 20:22:37,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:22:37,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-11-28 20:22:37,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:37,854 INFO L225 Difference]: With dead ends: 52 [2019-11-28 20:22:37,854 INFO L226 Difference]: Without dead ends: 51 [2019-11-28 20:22:37,855 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 20:22:37,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-28 20:22:37,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2019-11-28 20:22:37,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-28 20:22:37,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2019-11-28 20:22:37,868 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 6 [2019-11-28 20:22:37,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:37,868 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2019-11-28 20:22:37,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:22:37,869 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2019-11-28 20:22:37,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 20:22:37,869 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:37,869 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:37,870 INFO L410 AbstractCegarLoop]: === Iteration 3 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:37,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:37,870 INFO L82 PathProgramCache]: Analyzing trace with hash -2074588191, now seen corresponding path program 1 times [2019-11-28 20:22:37,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:37,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411719004] [2019-11-28 20:22:37,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:37,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:37,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:37,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411719004] [2019-11-28 20:22:37,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:37,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:22:37,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873871889] [2019-11-28 20:22:37,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:22:37,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:37,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:22:37,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:22:37,953 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 7 states. [2019-11-28 20:22:38,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:38,179 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2019-11-28 20:22:38,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:22:38,180 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-11-28 20:22:38,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:38,183 INFO L225 Difference]: With dead ends: 77 [2019-11-28 20:22:38,183 INFO L226 Difference]: Without dead ends: 76 [2019-11-28 20:22:38,183 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:22:38,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-28 20:22:38,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2019-11-28 20:22:38,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-28 20:22:38,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 81 transitions. [2019-11-28 20:22:38,203 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 81 transitions. Word has length 10 [2019-11-28 20:22:38,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:38,204 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 81 transitions. [2019-11-28 20:22:38,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:22:38,204 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 81 transitions. [2019-11-28 20:22:38,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 20:22:38,205 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:38,205 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:38,206 INFO L410 AbstractCegarLoop]: === Iteration 4 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:38,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:38,208 INFO L82 PathProgramCache]: Analyzing trace with hash 112275557, now seen corresponding path program 1 times [2019-11-28 20:22:38,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:38,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595888479] [2019-11-28 20:22:38,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:38,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:38,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595888479] [2019-11-28 20:22:38,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:38,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:22:38,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88897807] [2019-11-28 20:22:38,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:22:38,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:38,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:22:38,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:22:38,246 INFO L87 Difference]: Start difference. First operand 65 states and 81 transitions. Second operand 3 states. [2019-11-28 20:22:38,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:38,272 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2019-11-28 20:22:38,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:22:38,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-28 20:22:38,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:38,274 INFO L225 Difference]: With dead ends: 69 [2019-11-28 20:22:38,275 INFO L226 Difference]: Without dead ends: 68 [2019-11-28 20:22:38,276 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 20:22:38,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-28 20:22:38,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2019-11-28 20:22:38,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-28 20:22:38,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2019-11-28 20:22:38,292 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 11 [2019-11-28 20:22:38,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:38,293 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2019-11-28 20:22:38,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:22:38,293 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2019-11-28 20:22:38,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 20:22:38,294 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:38,294 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:38,295 INFO L410 AbstractCegarLoop]: === Iteration 5 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:38,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:38,295 INFO L82 PathProgramCache]: Analyzing trace with hash -2048531074, now seen corresponding path program 1 times [2019-11-28 20:22:38,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:38,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009516102] [2019-11-28 20:22:38,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:38,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:38,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:38,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:38,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009516102] [2019-11-28 20:22:38,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:38,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:22:38,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170743413] [2019-11-28 20:22:38,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:22:38,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:38,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:22:38,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:22:38,379 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 6 states. [2019-11-28 20:22:38,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:38,439 INFO L93 Difference]: Finished difference Result 125 states and 160 transitions. [2019-11-28 20:22:38,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:22:38,442 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-28 20:22:38,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:38,444 INFO L225 Difference]: With dead ends: 125 [2019-11-28 20:22:38,444 INFO L226 Difference]: Without dead ends: 86 [2019-11-28 20:22:38,446 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:22:38,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-28 20:22:38,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2019-11-28 20:22:38,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-28 20:22:38,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2019-11-28 20:22:38,461 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 16 [2019-11-28 20:22:38,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:38,462 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2019-11-28 20:22:38,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:22:38,462 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2019-11-28 20:22:38,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 20:22:38,463 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:38,464 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:38,464 INFO L410 AbstractCegarLoop]: === Iteration 6 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:38,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:38,465 INFO L82 PathProgramCache]: Analyzing trace with hash -57180086, now seen corresponding path program 1 times [2019-11-28 20:22:38,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:38,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575371549] [2019-11-28 20:22:38,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:38,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:38,493 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 20:22:38,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575371549] [2019-11-28 20:22:38,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:38,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:22:38,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458436015] [2019-11-28 20:22:38,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:22:38,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:38,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:22:38,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:22:38,496 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand 3 states. [2019-11-28 20:22:38,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:38,512 INFO L93 Difference]: Finished difference Result 76 states and 98 transitions. [2019-11-28 20:22:38,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:22:38,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 20:22:38,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:38,514 INFO L225 Difference]: With dead ends: 76 [2019-11-28 20:22:38,514 INFO L226 Difference]: Without dead ends: 75 [2019-11-28 20:22:38,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:22:38,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-28 20:22:38,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-11-28 20:22:38,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-28 20:22:38,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 96 transitions. [2019-11-28 20:22:38,529 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 96 transitions. Word has length 18 [2019-11-28 20:22:38,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:38,529 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 96 transitions. [2019-11-28 20:22:38,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:22:38,530 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 96 transitions. [2019-11-28 20:22:38,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 20:22:38,531 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:38,531 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:38,531 INFO L410 AbstractCegarLoop]: === Iteration 7 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:38,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:38,532 INFO L82 PathProgramCache]: Analyzing trace with hash -599425808, now seen corresponding path program 1 times [2019-11-28 20:22:38,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:38,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866526992] [2019-11-28 20:22:38,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:38,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:38,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:38,582 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 20:22:38,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866526992] [2019-11-28 20:22:38,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:38,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:22:38,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043372917] [2019-11-28 20:22:38,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:22:38,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:38,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:22:38,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:22:38,586 INFO L87 Difference]: Start difference. First operand 75 states and 96 transitions. Second operand 3 states. [2019-11-28 20:22:38,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:38,602 INFO L93 Difference]: Finished difference Result 75 states and 96 transitions. [2019-11-28 20:22:38,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:22:38,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 20:22:38,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:38,607 INFO L225 Difference]: With dead ends: 75 [2019-11-28 20:22:38,607 INFO L226 Difference]: Without dead ends: 74 [2019-11-28 20:22:38,607 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 20:22:38,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-28 20:22:38,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-28 20:22:38,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-28 20:22:38,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2019-11-28 20:22:38,629 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 19 [2019-11-28 20:22:38,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:38,629 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2019-11-28 20:22:38,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:22:38,629 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2019-11-28 20:22:38,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 20:22:38,632 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:38,633 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:38,633 INFO L410 AbstractCegarLoop]: === Iteration 8 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:38,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:38,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1772582622, now seen corresponding path program 1 times [2019-11-28 20:22:38,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:38,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422149584] [2019-11-28 20:22:38,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:38,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:38,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:38,689 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 20:22:38,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422149584] [2019-11-28 20:22:38,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:38,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:22:38,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329109793] [2019-11-28 20:22:38,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:22:38,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:38,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:22:38,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:22:38,692 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand 4 states. [2019-11-28 20:22:38,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:38,716 INFO L93 Difference]: Finished difference Result 95 states and 126 transitions. [2019-11-28 20:22:38,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:22:38,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-11-28 20:22:38,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:38,718 INFO L225 Difference]: With dead ends: 95 [2019-11-28 20:22:38,718 INFO L226 Difference]: Without dead ends: 94 [2019-11-28 20:22:38,719 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:22:38,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-28 20:22:38,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 80. [2019-11-28 20:22:38,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-28 20:22:38,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 100 transitions. [2019-11-28 20:22:38,730 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 100 transitions. Word has length 19 [2019-11-28 20:22:38,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:38,731 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 100 transitions. [2019-11-28 20:22:38,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:22:38,731 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 100 transitions. [2019-11-28 20:22:38,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 20:22:38,732 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:38,732 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:38,733 INFO L410 AbstractCegarLoop]: === Iteration 9 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:38,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:38,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1402330794, now seen corresponding path program 1 times [2019-11-28 20:22:38,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:38,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020000494] [2019-11-28 20:22:38,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:38,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:38,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:38,808 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 20:22:38,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020000494] [2019-11-28 20:22:38,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:38,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:22:38,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049895433] [2019-11-28 20:22:38,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:22:38,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:38,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:22:38,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:22:38,812 INFO L87 Difference]: Start difference. First operand 80 states and 100 transitions. Second operand 4 states. [2019-11-28 20:22:38,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:38,837 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2019-11-28 20:22:38,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:22:38,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-11-28 20:22:38,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:38,840 INFO L225 Difference]: With dead ends: 89 [2019-11-28 20:22:38,841 INFO L226 Difference]: Without dead ends: 83 [2019-11-28 20:22:38,842 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:22:38,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-28 20:22:38,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-11-28 20:22:38,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-28 20:22:38,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2019-11-28 20:22:38,856 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 20 [2019-11-28 20:22:38,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:38,857 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2019-11-28 20:22:38,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:22:38,857 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2019-11-28 20:22:38,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 20:22:38,858 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:38,858 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:38,858 INFO L410 AbstractCegarLoop]: === Iteration 10 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:38,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:38,859 INFO L82 PathProgramCache]: Analyzing trace with hash 921726737, now seen corresponding path program 1 times [2019-11-28 20:22:38,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:38,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49406084] [2019-11-28 20:22:38,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:38,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:38,930 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 20:22:38,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49406084] [2019-11-28 20:22:38,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:38,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:22:38,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325671141] [2019-11-28 20:22:38,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:22:38,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:38,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:22:38,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:22:38,932 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand 6 states. [2019-11-28 20:22:39,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:39,033 INFO L93 Difference]: Finished difference Result 167 states and 222 transitions. [2019-11-28 20:22:39,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:22:39,037 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-11-28 20:22:39,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:39,041 INFO L225 Difference]: With dead ends: 167 [2019-11-28 20:22:39,042 INFO L226 Difference]: Without dead ends: 101 [2019-11-28 20:22:39,045 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:22:39,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-28 20:22:39,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 89. [2019-11-28 20:22:39,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-28 20:22:39,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2019-11-28 20:22:39,070 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 23 [2019-11-28 20:22:39,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:39,071 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2019-11-28 20:22:39,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:22:39,073 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2019-11-28 20:22:39,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 20:22:39,075 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:39,076 INFO L410 BasicCegarLoop]: trace histogram [5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:39,076 INFO L410 AbstractCegarLoop]: === Iteration 11 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:39,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:39,077 INFO L82 PathProgramCache]: Analyzing trace with hash 970950199, now seen corresponding path program 1 times [2019-11-28 20:22:39,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:39,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678805481] [2019-11-28 20:22:39,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:39,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,180 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-28 20:22:39,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678805481] [2019-11-28 20:22:39,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:39,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:22:39,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062263291] [2019-11-28 20:22:39,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:22:39,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:39,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:22:39,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:22:39,184 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand 6 states. [2019-11-28 20:22:39,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:39,262 INFO L93 Difference]: Finished difference Result 176 states and 226 transitions. [2019-11-28 20:22:39,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:22:39,263 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-11-28 20:22:39,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:39,264 INFO L225 Difference]: With dead ends: 176 [2019-11-28 20:22:39,264 INFO L226 Difference]: Without dead ends: 105 [2019-11-28 20:22:39,267 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:22:39,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-28 20:22:39,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 97. [2019-11-28 20:22:39,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-28 20:22:39,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 117 transitions. [2019-11-28 20:22:39,277 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 117 transitions. Word has length 34 [2019-11-28 20:22:39,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:39,277 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 117 transitions. [2019-11-28 20:22:39,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:22:39,278 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2019-11-28 20:22:39,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-28 20:22:39,279 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:39,279 INFO L410 BasicCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:39,279 INFO L410 AbstractCegarLoop]: === Iteration 12 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:39,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:39,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1027694963, now seen corresponding path program 1 times [2019-11-28 20:22:39,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:39,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810687216] [2019-11-28 20:22:39,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,316 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-28 20:22:39,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810687216] [2019-11-28 20:22:39,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:39,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:22:39,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198235148] [2019-11-28 20:22:39,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:22:39,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:39,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:22:39,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:22:39,319 INFO L87 Difference]: Start difference. First operand 97 states and 117 transitions. Second operand 4 states. [2019-11-28 20:22:39,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:39,341 INFO L93 Difference]: Finished difference Result 104 states and 127 transitions. [2019-11-28 20:22:39,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:22:39,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-11-28 20:22:39,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:39,344 INFO L225 Difference]: With dead ends: 104 [2019-11-28 20:22:39,344 INFO L226 Difference]: Without dead ends: 103 [2019-11-28 20:22:39,345 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:22:39,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-28 20:22:39,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2019-11-28 20:22:39,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-28 20:22:39,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 121 transitions. [2019-11-28 20:22:39,356 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 121 transitions. Word has length 37 [2019-11-28 20:22:39,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:39,357 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 121 transitions. [2019-11-28 20:22:39,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:22:39,357 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 121 transitions. [2019-11-28 20:22:39,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-28 20:22:39,358 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:39,358 INFO L410 BasicCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:39,359 INFO L410 AbstractCegarLoop]: === Iteration 13 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:39,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:39,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1793772729, now seen corresponding path program 1 times [2019-11-28 20:22:39,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:39,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671193413] [2019-11-28 20:22:39,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:39,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,392 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-28 20:22:39,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671193413] [2019-11-28 20:22:39,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:39,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:22:39,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417781873] [2019-11-28 20:22:39,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:22:39,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:39,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:22:39,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:22:39,395 INFO L87 Difference]: Start difference. First operand 101 states and 121 transitions. Second operand 3 states. [2019-11-28 20:22:39,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:39,407 INFO L93 Difference]: Finished difference Result 101 states and 121 transitions. [2019-11-28 20:22:39,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:22:39,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-28 20:22:39,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:39,410 INFO L225 Difference]: With dead ends: 101 [2019-11-28 20:22:39,410 INFO L226 Difference]: Without dead ends: 100 [2019-11-28 20:22:39,410 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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 20:22:39,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-28 20:22:39,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-11-28 20:22:39,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-28 20:22:39,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 119 transitions. [2019-11-28 20:22:39,419 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 119 transitions. Word has length 38 [2019-11-28 20:22:39,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:39,420 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 119 transitions. [2019-11-28 20:22:39,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:22:39,420 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 119 transitions. [2019-11-28 20:22:39,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-28 20:22:39,421 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:39,422 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:39,422 INFO L410 AbstractCegarLoop]: === Iteration 14 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:39,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:39,422 INFO L82 PathProgramCache]: Analyzing trace with hash -747989016, now seen corresponding path program 1 times [2019-11-28 20:22:39,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:39,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469189005] [2019-11-28 20:22:39,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:39,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,495 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-28 20:22:39,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469189005] [2019-11-28 20:22:39,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:39,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:22:39,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712012880] [2019-11-28 20:22:39,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:22:39,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:39,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:22:39,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:22:39,497 INFO L87 Difference]: Start difference. First operand 100 states and 119 transitions. Second operand 6 states. [2019-11-28 20:22:39,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:39,551 INFO L93 Difference]: Finished difference Result 110 states and 131 transitions. [2019-11-28 20:22:39,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:22:39,552 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-11-28 20:22:39,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:39,554 INFO L225 Difference]: With dead ends: 110 [2019-11-28 20:22:39,554 INFO L226 Difference]: Without dead ends: 109 [2019-11-28 20:22:39,554 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:22:39,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-28 20:22:39,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2019-11-28 20:22:39,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-28 20:22:39,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 117 transitions. [2019-11-28 20:22:39,564 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 117 transitions. Word has length 43 [2019-11-28 20:22:39,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:39,564 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 117 transitions. [2019-11-28 20:22:39,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:22:39,565 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 117 transitions. [2019-11-28 20:22:39,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-28 20:22:39,566 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:39,566 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:39,566 INFO L410 AbstractCegarLoop]: === Iteration 15 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:39,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:39,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1488967228, now seen corresponding path program 1 times [2019-11-28 20:22:39,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:39,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662891171] [2019-11-28 20:22:39,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,667 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-28 20:22:39,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662891171] [2019-11-28 20:22:39,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803365984] [2019-11-28 20:22:39,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,713 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:22:39,721 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:22:39,840 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-28 20:22:39,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:22:39,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2019-11-28 20:22:39,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297883535] [2019-11-28 20:22:39,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:22:39,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:39,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:22:39,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:22:39,846 INFO L87 Difference]: Start difference. First operand 99 states and 117 transitions. Second operand 7 states. [2019-11-28 20:22:39,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:39,952 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2019-11-28 20:22:39,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 20:22:39,953 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-11-28 20:22:39,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:39,954 INFO L225 Difference]: With dead ends: 100 [2019-11-28 20:22:39,955 INFO L226 Difference]: Without dead ends: 99 [2019-11-28 20:22:39,955 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-11-28 20:22:39,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-28 20:22:39,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-11-28 20:22:39,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-28 20:22:39,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 116 transitions. [2019-11-28 20:22:39,972 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 116 transitions. Word has length 40 [2019-11-28 20:22:39,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:39,973 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 116 transitions. [2019-11-28 20:22:39,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:22:39,973 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 116 transitions. [2019-11-28 20:22:39,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 20:22:39,978 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:39,978 INFO L410 BasicCegarLoop]: trace histogram [7, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:40,181 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:40,182 INFO L410 AbstractCegarLoop]: === Iteration 16 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:40,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:40,182 INFO L82 PathProgramCache]: Analyzing trace with hash 822906818, now seen corresponding path program 1 times [2019-11-28 20:22:40,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:40,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543513573] [2019-11-28 20:22:40,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:40,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:40,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:40,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:40,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:40,282 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-28 20:22:40,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543513573] [2019-11-28 20:22:40,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289328114] [2019-11-28 20:22:40,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:40,328 INFO L264 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:22:40,337 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:22:40,408 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-28 20:22:40,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:22:40,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2019-11-28 20:22:40,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642467650] [2019-11-28 20:22:40,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:22:40,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:40,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:22:40,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:22:40,411 INFO L87 Difference]: Start difference. First operand 98 states and 116 transitions. Second operand 7 states. [2019-11-28 20:22:40,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:40,608 INFO L93 Difference]: Finished difference Result 126 states and 151 transitions. [2019-11-28 20:22:40,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:22:40,609 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-28 20:22:40,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:40,610 INFO L225 Difference]: With dead ends: 126 [2019-11-28 20:22:40,610 INFO L226 Difference]: Without dead ends: 125 [2019-11-28 20:22:40,611 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-11-28 20:22:40,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-28 20:22:40,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-11-28 20:22:40,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-28 20:22:40,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 150 transitions. [2019-11-28 20:22:40,627 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 150 transitions. Word has length 52 [2019-11-28 20:22:40,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:40,628 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 150 transitions. [2019-11-28 20:22:40,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:22:40,629 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 150 transitions. [2019-11-28 20:22:40,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 20:22:40,630 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:40,630 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:40,838 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:40,839 INFO L410 AbstractCegarLoop]: === Iteration 17 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:40,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:40,840 INFO L82 PathProgramCache]: Analyzing trace with hash 695736933, now seen corresponding path program 1 times [2019-11-28 20:22:40,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:40,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078249194] [2019-11-28 20:22:40,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:40,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:40,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:40,972 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-28 20:22:40,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078249194] [2019-11-28 20:22:40,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486812480] [2019-11-28 20:22:40,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:41,010 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:22:41,013 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:22:41,061 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-28 20:22:41,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:22:41,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2019-11-28 20:22:41,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299242157] [2019-11-28 20:22:41,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:22:41,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:41,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:22:41,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:22:41,064 INFO L87 Difference]: Start difference. First operand 124 states and 150 transitions. Second operand 5 states. [2019-11-28 20:22:41,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:41,139 INFO L93 Difference]: Finished difference Result 152 states and 185 transitions. [2019-11-28 20:22:41,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:22:41,139 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-28 20:22:41,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:41,141 INFO L225 Difference]: With dead ends: 152 [2019-11-28 20:22:41,141 INFO L226 Difference]: Without dead ends: 151 [2019-11-28 20:22:41,142 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:22:41,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-11-28 20:22:41,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2019-11-28 20:22:41,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-28 20:22:41,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 184 transitions. [2019-11-28 20:22:41,153 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 184 transitions. Word has length 45 [2019-11-28 20:22:41,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:41,154 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 184 transitions. [2019-11-28 20:22:41,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:22:41,154 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 184 transitions. [2019-11-28 20:22:41,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-28 20:22:41,155 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:41,155 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:41,359 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:41,360 INFO L410 AbstractCegarLoop]: === Iteration 18 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:41,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:41,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1252678887, now seen corresponding path program 1 times [2019-11-28 20:22:41,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:41,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616601803] [2019-11-28 20:22:41,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:41,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:41,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:41,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:41,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:41,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:41,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:41,447 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-28 20:22:41,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616601803] [2019-11-28 20:22:41,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484025014] [2019-11-28 20:22:41,448 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 20:22:41,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:41,498 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:22:41,503 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:22:41,516 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-28 20:22:41,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:22:41,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-11-28 20:22:41,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607021733] [2019-11-28 20:22:41,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:22:41,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:41,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:22:41,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:22:41,518 INFO L87 Difference]: Start difference. First operand 150 states and 184 transitions. Second operand 6 states. [2019-11-28 20:22:41,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:41,547 INFO L93 Difference]: Finished difference Result 159 states and 194 transitions. [2019-11-28 20:22:41,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:22:41,550 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-11-28 20:22:41,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:41,551 INFO L225 Difference]: With dead ends: 159 [2019-11-28 20:22:41,551 INFO L226 Difference]: Without dead ends: 155 [2019-11-28 20:22:41,552 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:22:41,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-28 20:22:41,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-11-28 20:22:41,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-28 20:22:41,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 189 transitions. [2019-11-28 20:22:41,564 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 189 transitions. Word has length 60 [2019-11-28 20:22:41,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:41,564 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 189 transitions. [2019-11-28 20:22:41,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:22:41,564 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 189 transitions. [2019-11-28 20:22:41,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-28 20:22:41,565 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:41,566 INFO L410 BasicCegarLoop]: trace histogram [10, 8, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:41,768 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:41,769 INFO L410 AbstractCegarLoop]: === Iteration 19 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:41,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:41,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1438531096, now seen corresponding path program 2 times [2019-11-28 20:22:41,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:41,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001067975] [2019-11-28 20:22:41,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:41,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:41,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:41,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:41,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:41,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:41,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:41,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:41,937 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 60 proven. 32 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-11-28 20:22:41,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001067975] [2019-11-28 20:22:41,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682437423] [2019-11-28 20:22:41,938 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:41,984 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:22:41,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:22:41,985 INFO L264 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:22:41,988 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:22:42,035 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 64 proven. 28 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-11-28 20:22:42,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:22:42,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 13 [2019-11-28 20:22:42,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130212408] [2019-11-28 20:22:42,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 20:22:42,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:42,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 20:22:42,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:22:42,039 INFO L87 Difference]: Start difference. First operand 155 states and 189 transitions. Second operand 13 states. [2019-11-28 20:22:42,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:42,266 INFO L93 Difference]: Finished difference Result 234 states and 284 transitions. [2019-11-28 20:22:42,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:22:42,267 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 77 [2019-11-28 20:22:42,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:42,268 INFO L225 Difference]: With dead ends: 234 [2019-11-28 20:22:42,268 INFO L226 Difference]: Without dead ends: 97 [2019-11-28 20:22:42,270 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2019-11-28 20:22:42,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-28 20:22:42,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 85. [2019-11-28 20:22:42,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-28 20:22:42,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2019-11-28 20:22:42,275 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 77 [2019-11-28 20:22:42,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:42,275 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2019-11-28 20:22:42,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 20:22:42,276 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2019-11-28 20:22:42,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-28 20:22:42,277 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:42,277 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 9, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2019-11-28 20:22:42,480 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:42,481 INFO L410 AbstractCegarLoop]: === Iteration 20 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:42,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:42,481 INFO L82 PathProgramCache]: Analyzing trace with hash -151262980, now seen corresponding path program 2 times [2019-11-28 20:22:42,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:42,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521160880] [2019-11-28 20:22:42,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:42,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:42,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:42,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:42,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:42,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:42,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:42,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:42,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:42,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:42,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:42,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:42,914 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 73 proven. 96 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2019-11-28 20:22:42,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521160880] [2019-11-28 20:22:42,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936110187] [2019-11-28 20:22:42,915 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 20:22:42,987 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:22:42,988 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:22:42,989 INFO L264 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 20:22:43,006 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:22:43,119 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 48 proven. 78 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2019-11-28 20:22:43,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:22:43,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10] total 23 [2019-11-28 20:22:43,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494003678] [2019-11-28 20:22:43,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-28 20:22:43,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:43,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-28 20:22:43,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2019-11-28 20:22:43,123 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 23 states. [2019-11-28 20:22:43,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:43,561 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2019-11-28 20:22:43,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 20:22:43,561 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 124 [2019-11-28 20:22:43,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:43,562 INFO L225 Difference]: With dead ends: 95 [2019-11-28 20:22:43,562 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 20:22:43,563 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870 [2019-11-28 20:22:43,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 20:22:43,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 20:22:43,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 20:22:43,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 20:22:43,564 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 124 [2019-11-28 20:22:43,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:43,564 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:22:43,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-28 20:22:43,565 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:22:43,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 20:22:43,770 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:43,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 20:22:44,088 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 18 [2019-11-28 20:22:44,240 INFO L246 CegarLoopResult]: For program point rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-28 20:22:44,240 INFO L246 CegarLoopResult]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. [2019-11-28 20:22:44,240 INFO L246 CegarLoopResult]: For program point rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-28 20:22:44,241 INFO L246 CegarLoopResult]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. [2019-11-28 20:22:44,241 INFO L246 CegarLoopResult]: For program point L14(line 14) no Hoare annotation was computed. [2019-11-28 20:22:44,241 INFO L249 CegarLoopResult]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true [2019-11-28 20:22:44,241 INFO L246 CegarLoopResult]: For program point L14-1(line 14) no Hoare annotation was computed. [2019-11-28 20:22:44,241 INFO L246 CegarLoopResult]: For program point L12(lines 12 13) no Hoare annotation was computed. [2019-11-28 20:22:44,241 INFO L242 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: (and (or (= |rec1_#in~i| rec1_~i) (not (<= |rec1_#in~i| 2147483647))) (not (<= |rec1_#in~i| 0))) [2019-11-28 20:22:44,241 INFO L246 CegarLoopResult]: For program point L14-3(line 14) no Hoare annotation was computed. [2019-11-28 20:22:44,241 INFO L246 CegarLoopResult]: For program point L14-4(line 14) no Hoare annotation was computed. [2019-11-28 20:22:44,242 INFO L246 CegarLoopResult]: For program point rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-28 20:22:44,242 INFO L246 CegarLoopResult]: For program point L14-5(line 14) no Hoare annotation was computed. [2019-11-28 20:22:44,242 INFO L242 CegarLoopResult]: At program point L14-6(line 14) the Hoare annotation is: (and (not (<= |rec1_#in~i| 0)) (or (and (= |rec1_#in~i| rec1_~i) (<= |rec1_#t~ret0| 1)) (not (<= |rec1_#in~i| 2147483647)))) [2019-11-28 20:22:44,242 INFO L246 CegarLoopResult]: For program point rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-28 20:22:44,242 INFO L246 CegarLoopResult]: For program point rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-28 20:22:44,242 INFO L246 CegarLoopResult]: For program point L14-7(line 14) no Hoare annotation was computed. [2019-11-28 20:22:44,242 INFO L246 CegarLoopResult]: For program point rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-28 20:22:44,243 INFO L242 CegarLoopResult]: At program point L14-8(line 14) the Hoare annotation is: (and (or (not (<= |rec1_#in~i| 2147483647)) (and (<= |rec1_#t~ret1| 0) (= |rec1_#in~i| rec1_~i) (<= |rec1_#t~ret0| 1))) (or (<= 1 rec1_~i) (not (<= |rec1_#in~i| 2147483646)))) [2019-11-28 20:22:44,243 INFO L246 CegarLoopResult]: For program point L14-9(line 14) no Hoare annotation was computed. [2019-11-28 20:22:44,243 INFO L246 CegarLoopResult]: For program point L14-10(line 14) no Hoare annotation was computed. [2019-11-28 20:22:44,243 INFO L246 CegarLoopResult]: For program point L14-11(line 14) no Hoare annotation was computed. [2019-11-28 20:22:44,243 INFO L246 CegarLoopResult]: For program point rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 20:22:44,243 INFO L246 CegarLoopResult]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. [2019-11-28 20:22:44,243 INFO L246 CegarLoopResult]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. [2019-11-28 20:22:44,243 INFO L246 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2019-11-28 20:22:44,243 INFO L246 CegarLoopResult]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-11-28 20:22:44,243 INFO L246 CegarLoopResult]: For program point L18(lines 18 19) no Hoare annotation was computed. [2019-11-28 20:22:44,244 INFO L242 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: (and (or (= rec2_~j |rec2_#in~j|) (not (<= |rec2_#in~j| 2147483647))) (not (<= |rec2_#in~j| 0))) [2019-11-28 20:22:44,244 INFO L246 CegarLoopResult]: For program point L20-3(line 20) no Hoare annotation was computed. [2019-11-28 20:22:44,244 INFO L242 CegarLoopResult]: At program point L20-4(line 20) the Hoare annotation is: (let ((.cse0 (not (<= |rec2_#in~j| 2147483647)))) (and (or (= rec2_~j |rec2_#in~j|) .cse0) (or (and (<= |rec2_#t~ret3| 1) (<= (+ |rec2_#t~ret3| 1) |rec2_#in~j|)) .cse0) (not (<= |rec2_#in~j| 0)))) [2019-11-28 20:22:44,244 INFO L246 CegarLoopResult]: For program point L20-5(line 20) no Hoare annotation was computed. [2019-11-28 20:22:44,244 INFO L246 CegarLoopResult]: For program point L20-6(line 20) no Hoare annotation was computed. [2019-11-28 20:22:44,244 INFO L246 CegarLoopResult]: For program point L20-7(line 20) no Hoare annotation was computed. [2019-11-28 20:22:44,244 INFO L249 CegarLoopResult]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true [2019-11-28 20:22:44,245 INFO L246 CegarLoopResult]: For program point rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 20:22:44,245 INFO L246 CegarLoopResult]: For program point rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 20:22:44,245 INFO L246 CegarLoopResult]: For program point rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 20:22:44,245 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 20:22:44,245 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 20:22:44,245 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 20:22:44,245 INFO L242 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 2147483647) [2019-11-28 20:22:44,245 INFO L246 CegarLoopResult]: For program point L25-1(line 25) no Hoare annotation was computed. [2019-11-28 20:22:44,245 INFO L246 CegarLoopResult]: For program point L23(lines 23 26) no Hoare annotation was computed. [2019-11-28 20:22:44,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:22:44 BoogieIcfgContainer [2019-11-28 20:22:44,252 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 20:22:44,252 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:22:44,252 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:22:44,252 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:22:44,253 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:22:37" (3/4) ... [2019-11-28 20:22:44,256 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 20:22:44,264 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec1 [2019-11-28 20:22:44,264 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec2 [2019-11-28 20:22:44,270 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 20:22:44,271 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 20:22:44,333 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:22:44,335 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:22:44,339 INFO L168 Benchmark]: Toolchain (without parser) took 7871.43 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 292.6 MB). Free memory was 957.7 MB in the beginning and 1.2 GB in the end (delta: -263.6 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. [2019-11-28 20:22:44,342 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:22:44,342 INFO L168 Benchmark]: CACSL2BoogieTranslator took 278.39 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:22:44,343 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.12 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 20:22:44,343 INFO L168 Benchmark]: Boogie Preprocessor took 18.82 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:22:44,343 INFO L168 Benchmark]: RCFGBuilder took 333.48 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: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:22:44,344 INFO L168 Benchmark]: TraceAbstraction took 7063.55 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 174.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -147.5 MB). Peak memory consumption was 371.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:22:44,344 INFO L168 Benchmark]: Witness Printer took 82.90 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. [2019-11-28 20:22:44,350 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 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 278.39 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 89.12 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.82 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 333.48 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: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7063.55 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 174.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -147.5 MB). Peak memory consumption was 371.7 MB. Max. memory is 11.5 GB. * Witness Printer took 82.90 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 44 locations, 10 error locations. Result: SAFE, OverallTime: 6.5s, OverallIterations: 20, TraceHistogramMax: 12, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 761 SDtfs, 331 SDslu, 2113 SDs, 0 SdLazy, 1002 SolverSat, 117 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 658 GetRequests, 522 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155occurred in iteration=18, 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, 20 MinimizatonAttempts, 93 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 222 PreInvPairs, 238 NumberOfFragments, 99 HoareAnnotationTreeSize, 222 FomulaSimplifications, 713 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 455 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1095 NumberOfCodeBlocks, 1095 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1069 ConstructedInterpolants, 0 QuantifiedInterpolants, 115121 SizeOfPredicates, 8 NumberOfNonLiveVariables, 820 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 26 InterpolantComputations, 17 PerfectInterpolantSequences, 1315/1565 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...