./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-crafted-lit/LeeJonesBen-Amram-POPL2001-Ex5_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/termination-crafted-lit/LeeJonesBen-Amram-POPL2001-Ex5_true-termination_true-no-overflow.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 457415f9b28998cf0ba7f80d69eaf14873f5a98f .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 21:40:37,136 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 21:40:37,138 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 21:40:37,150 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 21:40:37,150 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 21:40:37,151 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 21:40:37,153 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 21:40:37,155 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 21:40:37,160 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 21:40:37,161 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 21:40:37,162 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 21:40:37,162 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 21:40:37,168 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 21:40:37,169 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 21:40:37,170 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 21:40:37,174 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 21:40:37,175 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 21:40:37,177 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 21:40:37,180 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 21:40:37,183 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 21:40:37,184 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 21:40:37,186 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 21:40:37,188 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 21:40:37,188 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 21:40:37,188 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 21:40:37,190 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 21:40:37,191 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 21:40:37,191 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 21:40:37,193 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 21:40:37,193 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 21:40:37,194 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 21:40:37,195 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 21:40:37,195 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 21:40:37,195 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 21:40:37,197 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 21:40:37,197 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 21:40:37,198 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-01-14 21:40:37,212 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 21:40:37,212 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 21:40:37,213 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 21:40:37,214 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 21:40:37,214 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 21:40:37,214 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 21:40:37,215 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 21:40:37,215 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 21:40:37,215 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 21:40:37,215 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 21:40:37,215 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 21:40:37,216 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 21:40:37,216 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-14 21:40:37,216 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 21:40:37,216 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 21:40:37,216 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 21:40:37,216 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 21:40:37,217 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 21:40:37,218 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 21:40:37,219 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 21:40:37,219 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 21:40:37,219 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 21:40:37,219 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 21:40:37,219 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 21:40:37,219 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 21:40:37,220 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 21:40:37,221 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 457415f9b28998cf0ba7f80d69eaf14873f5a98f [2019-01-14 21:40:37,258 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 21:40:37,271 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 21:40:37,277 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 21:40:37,279 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 21:40:37,280 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 21:40:37,280 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/LeeJonesBen-Amram-POPL2001-Ex5_true-termination_true-no-overflow.c [2019-01-14 21:40:37,340 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a31ba5c6/7a783deb53134b2aba06f719e20729a9/FLAGf5121caf7 [2019-01-14 21:40:37,781 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 21:40:37,781 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/LeeJonesBen-Amram-POPL2001-Ex5_true-termination_true-no-overflow.c [2019-01-14 21:40:37,787 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a31ba5c6/7a783deb53134b2aba06f719e20729a9/FLAGf5121caf7 [2019-01-14 21:40:38,159 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a31ba5c6/7a783deb53134b2aba06f719e20729a9 [2019-01-14 21:40:38,163 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 21:40:38,164 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 21:40:38,166 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 21:40:38,166 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 21:40:38,170 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 21:40:38,171 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 09:40:38" (1/1) ... [2019-01-14 21:40:38,174 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6339f23e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:40:38, skipping insertion in model container [2019-01-14 21:40:38,174 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 09:40:38" (1/1) ... [2019-01-14 21:40:38,182 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 21:40:38,200 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 21:40:38,420 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 21:40:38,427 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 21:40:38,448 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 21:40:38,465 INFO L195 MainTranslator]: Completed translation [2019-01-14 21:40:38,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:40:38 WrapperNode [2019-01-14 21:40:38,467 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 21:40:38,468 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 21:40:38,469 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 21:40:38,469 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 21:40:38,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:40:38" (1/1) ... [2019-01-14 21:40:38,484 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:40:38" (1/1) ... [2019-01-14 21:40:38,511 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 21:40:38,513 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 21:40:38,513 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 21:40:38,513 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 21:40:38,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:40:38" (1/1) ... [2019-01-14 21:40:38,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:40:38" (1/1) ... [2019-01-14 21:40:38,526 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:40:38" (1/1) ... [2019-01-14 21:40:38,527 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:40:38" (1/1) ... [2019-01-14 21:40:38,532 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:40:38" (1/1) ... [2019-01-14 21:40:38,540 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:40:38" (1/1) ... [2019-01-14 21:40:38,542 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:40:38" (1/1) ... [2019-01-14 21:40:38,543 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 21:40:38,543 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 21:40:38,544 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 21:40:38,544 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 21:40:38,545 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:40:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 21:40:38,652 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-01-14 21:40:38,652 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-01-14 21:40:38,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 21:40:38,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 21:40:38,965 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 21:40:38,966 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-14 21:40:38,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 09:40:38 BoogieIcfgContainer [2019-01-14 21:40:38,967 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 21:40:38,968 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 21:40:38,968 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 21:40:38,971 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 21:40:38,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 09:40:38" (1/3) ... [2019-01-14 21:40:38,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1db889f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 09:40:38, skipping insertion in model container [2019-01-14 21:40:38,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:40:38" (2/3) ... [2019-01-14 21:40:38,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1db889f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 09:40:38, skipping insertion in model container [2019-01-14 21:40:38,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 09:40:38" (3/3) ... [2019-01-14 21:40:38,974 INFO L112 eAbstractionObserver]: Analyzing ICFG LeeJonesBen-Amram-POPL2001-Ex5_true-termination_true-no-overflow.c [2019-01-14 21:40:38,983 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 21:40:38,990 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-01-14 21:40:39,006 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-01-14 21:40:39,036 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 21:40:39,036 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 21:40:39,036 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 21:40:39,037 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 21:40:39,037 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 21:40:39,037 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 21:40:39,037 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 21:40:39,037 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 21:40:39,037 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 21:40:39,055 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-01-14 21:40:39,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-14 21:40:39,061 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:40:39,062 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:40:39,065 INFO L423 AbstractCegarLoop]: === Iteration 1 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:40:39,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:40:39,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1461861353, now seen corresponding path program 1 times [2019-01-14 21:40:39,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:40:39,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:40:39,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:39,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:40:39,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:40:39,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:40:39,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:40:39,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 21:40:39,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 21:40:39,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 21:40:39,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 21:40:39,311 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 5 states. [2019-01-14 21:40:39,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:40:39,536 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2019-01-14 21:40:39,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 21:40:39,538 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-14 21:40:39,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:40:39,548 INFO L225 Difference]: With dead ends: 44 [2019-01-14 21:40:39,548 INFO L226 Difference]: Without dead ends: 28 [2019-01-14 21:40:39,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 21:40:39,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-14 21:40:39,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2019-01-14 21:40:39,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-14 21:40:39,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-01-14 21:40:39,587 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 7 [2019-01-14 21:40:39,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:40:39,588 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-01-14 21:40:39,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 21:40:39,588 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-01-14 21:40:39,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-14 21:40:39,589 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:40:39,589 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:40:39,589 INFO L423 AbstractCegarLoop]: === Iteration 2 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:40:39,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:40:39,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1461861577, now seen corresponding path program 1 times [2019-01-14 21:40:39,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:40:39,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:40:39,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:39,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:40:39,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:39,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:40:39,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:40:39,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:40:39,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 21:40:39,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 21:40:39,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 21:40:39,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 21:40:39,713 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 5 states. [2019-01-14 21:40:39,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:40:39,963 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2019-01-14 21:40:39,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 21:40:39,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-14 21:40:39,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:40:39,968 INFO L225 Difference]: With dead ends: 34 [2019-01-14 21:40:39,968 INFO L226 Difference]: Without dead ends: 33 [2019-01-14 21:40:39,969 INFO L631 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-01-14 21:40:39,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-14 21:40:39,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2019-01-14 21:40:39,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-14 21:40:39,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-01-14 21:40:39,977 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 7 [2019-01-14 21:40:39,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:40:39,977 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-01-14 21:40:39,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 21:40:39,977 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-01-14 21:40:39,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 21:40:39,979 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:40:39,979 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:40:39,980 INFO L423 AbstractCegarLoop]: === Iteration 3 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:40:39,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:40:39,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1926938272, now seen corresponding path program 1 times [2019-01-14 21:40:39,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:40:39,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:40:39,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:39,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:40:39,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:40:40,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:40:40,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:40:40,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 21:40:40,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 21:40:40,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 21:40:40,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 21:40:40,112 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 5 states. [2019-01-14 21:40:40,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:40:40,186 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-01-14 21:40:40,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 21:40:40,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-14 21:40:40,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:40:40,189 INFO L225 Difference]: With dead ends: 33 [2019-01-14 21:40:40,189 INFO L226 Difference]: Without dead ends: 32 [2019-01-14 21:40:40,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-01-14 21:40:40,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-14 21:40:40,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2019-01-14 21:40:40,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-14 21:40:40,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-01-14 21:40:40,200 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 8 [2019-01-14 21:40:40,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:40:40,200 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-01-14 21:40:40,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 21:40:40,200 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-01-14 21:40:40,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 21:40:40,203 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:40:40,203 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:40:40,203 INFO L423 AbstractCegarLoop]: === Iteration 4 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:40:40,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:40:40,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1926931321, now seen corresponding path program 1 times [2019-01-14 21:40:40,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:40:40,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:40:40,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:40,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:40:40,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:40:40,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:40:40,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:40:40,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 21:40:40,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 21:40:40,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 21:40:40,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 21:40:40,276 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 5 states. [2019-01-14 21:40:40,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:40:40,448 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2019-01-14 21:40:40,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 21:40:40,449 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-14 21:40:40,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:40:40,451 INFO L225 Difference]: With dead ends: 32 [2019-01-14 21:40:40,451 INFO L226 Difference]: Without dead ends: 31 [2019-01-14 21:40:40,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 21:40:40,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-14 21:40:40,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2019-01-14 21:40:40,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-14 21:40:40,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-01-14 21:40:40,458 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 8 [2019-01-14 21:40:40,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:40:40,459 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-01-14 21:40:40,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 21:40:40,459 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-01-14 21:40:40,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 21:40:40,460 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:40:40,460 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:40:40,461 INFO L423 AbstractCegarLoop]: === Iteration 5 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:40:40,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:40:40,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1954337320, now seen corresponding path program 1 times [2019-01-14 21:40:40,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:40:40,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:40:40,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:40,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:40:40,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:40:40,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:40:40,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:40:40,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 21:40:40,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 21:40:40,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 21:40:40,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 21:40:40,530 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 5 states. [2019-01-14 21:40:40,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:40:40,695 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2019-01-14 21:40:40,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 21:40:40,696 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-01-14 21:40:40,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:40:40,699 INFO L225 Difference]: With dead ends: 43 [2019-01-14 21:40:40,699 INFO L226 Difference]: Without dead ends: 42 [2019-01-14 21:40:40,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-14 21:40:40,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-14 21:40:40,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2019-01-14 21:40:40,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-14 21:40:40,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-01-14 21:40:40,707 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 13 [2019-01-14 21:40:40,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:40:40,707 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-01-14 21:40:40,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 21:40:40,708 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-01-14 21:40:40,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 21:40:40,708 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:40:40,709 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:40:40,709 INFO L423 AbstractCegarLoop]: === Iteration 6 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:40:40,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:40:40,709 INFO L82 PathProgramCache]: Analyzing trace with hash -906050173, now seen corresponding path program 1 times [2019-01-14 21:40:40,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:40:40,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:40:40,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:40,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:40:40,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:40,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:40:40,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:40:40,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:40:40,770 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:40:40,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:40:40,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:40:40,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:40:41,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:40:41,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 21:40:41,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2019-01-14 21:40:41,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 21:40:41,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 21:40:41,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-14 21:40:41,143 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 8 states. [2019-01-14 21:40:41,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:40:41,533 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2019-01-14 21:40:41,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 21:40:41,538 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-01-14 21:40:41,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:40:41,539 INFO L225 Difference]: With dead ends: 50 [2019-01-14 21:40:41,539 INFO L226 Difference]: Without dead ends: 27 [2019-01-14 21:40:41,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-01-14 21:40:41,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-14 21:40:41,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2019-01-14 21:40:41,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-14 21:40:41,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-01-14 21:40:41,545 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 13 [2019-01-14 21:40:41,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:40:41,546 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-01-14 21:40:41,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 21:40:41,546 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-01-14 21:40:41,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 21:40:41,547 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:40:41,547 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:40:41,548 INFO L423 AbstractCegarLoop]: === Iteration 7 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:40:41,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:40:41,548 INFO L82 PathProgramCache]: Analyzing trace with hash -906049949, now seen corresponding path program 1 times [2019-01-14 21:40:41,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:40:41,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:40:41,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:41,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:40:41,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:40:41,629 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:40:41,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:40:41,630 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:40:41,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:40:41,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:40:41,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:40:41,661 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:40:41,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:40:41,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-14 21:40:41,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 21:40:41,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 21:40:41,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-14 21:40:41,682 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 7 states. [2019-01-14 21:40:41,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:40:41,942 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-01-14 21:40:41,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 21:40:41,943 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-01-14 21:40:41,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:40:41,944 INFO L225 Difference]: With dead ends: 38 [2019-01-14 21:40:41,944 INFO L226 Difference]: Without dead ends: 37 [2019-01-14 21:40:41,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-01-14 21:40:41,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-14 21:40:41,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2019-01-14 21:40:41,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-14 21:40:41,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-01-14 21:40:41,951 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 13 [2019-01-14 21:40:41,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:40:41,952 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-01-14 21:40:41,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 21:40:41,952 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-01-14 21:40:41,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-14 21:40:41,953 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:40:41,953 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:40:41,953 INFO L423 AbstractCegarLoop]: === Iteration 8 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:40:41,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:40:41,954 INFO L82 PathProgramCache]: Analyzing trace with hash 454914824, now seen corresponding path program 1 times [2019-01-14 21:40:41,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:40:41,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:40:41,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:41,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:40:41,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:41,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:40:42,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:40:42,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:40:42,102 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:40:42,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:40:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:40:42,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:40:42,228 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:40:42,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 21:40:42,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2019-01-14 21:40:42,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 21:40:42,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 21:40:42,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-01-14 21:40:42,251 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 10 states. [2019-01-14 21:40:42,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:40:42,388 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-01-14 21:40:42,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 21:40:42,388 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2019-01-14 21:40:42,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:40:42,389 INFO L225 Difference]: With dead ends: 45 [2019-01-14 21:40:42,389 INFO L226 Difference]: Without dead ends: 44 [2019-01-14 21:40:42,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-01-14 21:40:42,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-14 21:40:42,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2019-01-14 21:40:42,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-14 21:40:42,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-01-14 21:40:42,397 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 14 [2019-01-14 21:40:42,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:40:42,398 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-01-14 21:40:42,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 21:40:42,398 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-01-14 21:40:42,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 21:40:42,399 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:40:42,399 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1] [2019-01-14 21:40:42,399 INFO L423 AbstractCegarLoop]: === Iteration 9 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:40:42,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:40:42,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1341115267, now seen corresponding path program 2 times [2019-01-14 21:40:42,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:40:42,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:40:42,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:42,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:40:42,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:42,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:40:42,502 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:40:42,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:40:42,502 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:40:42,512 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 21:40:42,541 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 21:40:42,541 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:40:42,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:40:42,549 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:40:42,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:40:42,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 21:40:42,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 21:40:42,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 21:40:42,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 21:40:42,571 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 7 states. [2019-01-14 21:40:42,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:40:42,787 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2019-01-14 21:40:42,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 21:40:42,791 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-01-14 21:40:42,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:40:42,792 INFO L225 Difference]: With dead ends: 51 [2019-01-14 21:40:42,792 INFO L226 Difference]: Without dead ends: 50 [2019-01-14 21:40:42,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-01-14 21:40:42,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-14 21:40:42,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 24. [2019-01-14 21:40:42,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-14 21:40:42,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-01-14 21:40:42,806 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 19 [2019-01-14 21:40:42,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:40:42,806 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-01-14 21:40:42,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 21:40:42,807 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-01-14 21:40:42,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 21:40:42,808 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:40:42,808 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:40:42,808 INFO L423 AbstractCegarLoop]: === Iteration 10 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:40:42,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:40:42,809 INFO L82 PathProgramCache]: Analyzing trace with hash 451770350, now seen corresponding path program 1 times [2019-01-14 21:40:42,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:40:42,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:40:42,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:42,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:40:42,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:40:42,896 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:40:42,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:40:42,897 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:40:42,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:40:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:40:42,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:40:42,933 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:40:42,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:40:42,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-14 21:40:42,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 21:40:42,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 21:40:42,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-14 21:40:42,956 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 9 states. [2019-01-14 21:40:43,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:40:43,098 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2019-01-14 21:40:43,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 21:40:43,100 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-01-14 21:40:43,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:40:43,101 INFO L225 Difference]: With dead ends: 37 [2019-01-14 21:40:43,101 INFO L226 Difference]: Without dead ends: 36 [2019-01-14 21:40:43,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-01-14 21:40:43,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-14 21:40:43,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2019-01-14 21:40:43,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-14 21:40:43,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-01-14 21:40:43,108 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 20 [2019-01-14 21:40:43,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:40:43,108 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-01-14 21:40:43,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 21:40:43,108 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-01-14 21:40:43,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 21:40:43,109 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:40:43,109 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2019-01-14 21:40:43,109 INFO L423 AbstractCegarLoop]: === Iteration 11 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:40:43,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:40:43,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1375099731, now seen corresponding path program 1 times [2019-01-14 21:40:43,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:40:43,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:40:43,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:43,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:40:43,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:40:43,223 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:40:43,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:40:43,223 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:40:43,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:40:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:40:43,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:40:43,249 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:40:43,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:40:43,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-14 21:40:43,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 21:40:43,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 21:40:43,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-14 21:40:43,271 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2019-01-14 21:40:43,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:40:43,564 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-01-14 21:40:43,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 21:40:43,565 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-01-14 21:40:43,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:40:43,565 INFO L225 Difference]: With dead ends: 43 [2019-01-14 21:40:43,566 INFO L226 Difference]: Without dead ends: 42 [2019-01-14 21:40:43,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-01-14 21:40:43,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-14 21:40:43,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2019-01-14 21:40:43,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-14 21:40:43,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-01-14 21:40:43,585 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 20 [2019-01-14 21:40:43,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:40:43,585 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-01-14 21:40:43,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 21:40:43,585 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-01-14 21:40:43,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 21:40:43,586 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:40:43,586 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:40:43,589 INFO L423 AbstractCegarLoop]: === Iteration 12 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:40:43,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:40:43,589 INFO L82 PathProgramCache]: Analyzing trace with hash 511948884, now seen corresponding path program 2 times [2019-01-14 21:40:43,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:40:43,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:40:43,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:43,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:40:43,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:40:43,825 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:40:43,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:40:43,826 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:40:43,852 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 21:40:43,869 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 21:40:43,869 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:40:43,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:40:43,880 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:40:43,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:40:43,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-14 21:40:43,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 21:40:43,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 21:40:43,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-01-14 21:40:43,903 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 11 states. [2019-01-14 21:40:44,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:40:44,126 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2019-01-14 21:40:44,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-14 21:40:44,127 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2019-01-14 21:40:44,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:40:44,127 INFO L225 Difference]: With dead ends: 50 [2019-01-14 21:40:44,128 INFO L226 Difference]: Without dead ends: 49 [2019-01-14 21:40:44,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2019-01-14 21:40:44,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-14 21:40:44,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 36. [2019-01-14 21:40:44,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-14 21:40:44,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-01-14 21:40:44,136 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 26 [2019-01-14 21:40:44,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:40:44,136 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-01-14 21:40:44,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 21:40:44,137 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-01-14 21:40:44,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-14 21:40:44,137 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:40:44,138 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:40:44,138 INFO L423 AbstractCegarLoop]: === Iteration 13 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:40:44,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:40:44,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1009095738, now seen corresponding path program 3 times [2019-01-14 21:40:44,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:40:44,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:40:44,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:44,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:40:44,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:40:44,405 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:40:44,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:40:44,405 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:40:44,425 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 21:40:44,445 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-14 21:40:44,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:40:44,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:40:44,458 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:40:44,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:40:44,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-01-14 21:40:44,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 21:40:44,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 21:40:44,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-01-14 21:40:44,494 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 13 states. [2019-01-14 21:40:44,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:40:44,865 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2019-01-14 21:40:44,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-14 21:40:44,866 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2019-01-14 21:40:44,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:40:44,867 INFO L225 Difference]: With dead ends: 61 [2019-01-14 21:40:44,867 INFO L226 Difference]: Without dead ends: 60 [2019-01-14 21:40:44,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2019-01-14 21:40:44,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-14 21:40:44,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 39. [2019-01-14 21:40:44,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-14 21:40:44,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-01-14 21:40:44,879 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 32 [2019-01-14 21:40:44,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:40:44,879 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-01-14 21:40:44,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 21:40:44,879 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-01-14 21:40:44,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-14 21:40:44,882 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:40:44,882 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1] [2019-01-14 21:40:44,883 INFO L423 AbstractCegarLoop]: === Iteration 14 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:40:44,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:40:44,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1872988191, now seen corresponding path program 2 times [2019-01-14 21:40:44,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:40:44,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:40:44,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:44,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:40:44,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:40:45,005 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:40:45,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:40:45,006 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:40:45,015 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 21:40:45,047 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 21:40:45,047 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:40:45,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:40:45,062 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:40:45,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:40:45,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-01-14 21:40:45,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 21:40:45,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 21:40:45,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-01-14 21:40:45,091 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 13 states. [2019-01-14 21:40:45,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:40:45,557 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2019-01-14 21:40:45,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 21:40:45,558 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2019-01-14 21:40:45,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:40:45,560 INFO L225 Difference]: With dead ends: 67 [2019-01-14 21:40:45,560 INFO L226 Difference]: Without dead ends: 66 [2019-01-14 21:40:45,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2019-01-14 21:40:45,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-14 21:40:45,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 42. [2019-01-14 21:40:45,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-14 21:40:45,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-01-14 21:40:45,572 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 32 [2019-01-14 21:40:45,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:40:45,572 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-01-14 21:40:45,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 21:40:45,574 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-01-14 21:40:45,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-14 21:40:45,576 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:40:45,576 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:40:45,576 INFO L423 AbstractCegarLoop]: === Iteration 15 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:40:45,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:40:45,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1485859744, now seen corresponding path program 4 times [2019-01-14 21:40:45,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:40:45,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:40:45,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:45,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:40:45,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:45,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:40:45,763 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 21:40:45,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:40:45,763 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:40:45,774 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 21:40:45,791 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 21:40:45,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:40:45,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:40:45,975 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-01-14 21:40:45,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:40:45,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2019-01-14 21:40:45,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-14 21:40:45,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-14 21:40:45,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-01-14 21:40:45,997 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 15 states. [2019-01-14 21:40:46,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:40:46,537 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2019-01-14 21:40:46,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-14 21:40:46,538 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2019-01-14 21:40:46,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:40:46,539 INFO L225 Difference]: With dead ends: 85 [2019-01-14 21:40:46,539 INFO L226 Difference]: Without dead ends: 84 [2019-01-14 21:40:46,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702 [2019-01-14 21:40:46,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-14 21:40:46,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 48. [2019-01-14 21:40:46,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-14 21:40:46,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-01-14 21:40:46,553 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 38 [2019-01-14 21:40:46,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:40:46,554 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-01-14 21:40:46,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-14 21:40:46,554 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-01-14 21:40:46,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-14 21:40:46,557 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:40:46,557 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:40:46,558 INFO L423 AbstractCegarLoop]: === Iteration 16 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:40:46,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:40:46,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1828298374, now seen corresponding path program 5 times [2019-01-14 21:40:46,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:40:46,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:40:46,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:46,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:40:46,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:46,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:40:46,941 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 103 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:40:46,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:40:46,941 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:40:46,957 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 21:40:46,974 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-01-14 21:40:46,974 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:40:46,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:40:46,993 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 103 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:40:47,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:40:47,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2019-01-14 21:40:47,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-14 21:40:47,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-14 21:40:47,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-01-14 21:40:47,017 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 17 states. [2019-01-14 21:40:47,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:40:47,678 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2019-01-14 21:40:47,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-14 21:40:47,681 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2019-01-14 21:40:47,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:40:47,682 INFO L225 Difference]: With dead ends: 92 [2019-01-14 21:40:47,682 INFO L226 Difference]: Without dead ends: 91 [2019-01-14 21:40:47,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=243, Invalid=879, Unknown=0, NotChecked=0, Total=1122 [2019-01-14 21:40:47,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-14 21:40:47,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 57. [2019-01-14 21:40:47,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-14 21:40:47,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-01-14 21:40:47,704 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 44 [2019-01-14 21:40:47,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:40:47,704 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-01-14 21:40:47,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-14 21:40:47,704 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-01-14 21:40:47,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-14 21:40:47,707 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:40:47,707 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 1, 1, 1, 1] [2019-01-14 21:40:47,708 INFO L423 AbstractCegarLoop]: === Iteration 17 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:40:47,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:40:47,708 INFO L82 PathProgramCache]: Analyzing trace with hash 123200235, now seen corresponding path program 3 times [2019-01-14 21:40:47,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:40:47,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:40:47,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:47,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:40:47,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:40:47,936 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:40:47,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:40:47,936 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:40:47,966 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 21:40:48,011 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-14 21:40:48,011 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:40:48,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:40:48,030 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:40:48,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:40:48,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2019-01-14 21:40:48,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-14 21:40:48,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-14 21:40:48,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-01-14 21:40:48,049 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 17 states. [2019-01-14 21:40:48,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:40:48,724 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2019-01-14 21:40:48,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-14 21:40:48,725 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2019-01-14 21:40:48,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:40:48,726 INFO L225 Difference]: With dead ends: 97 [2019-01-14 21:40:48,726 INFO L226 Difference]: Without dead ends: 96 [2019-01-14 21:40:48,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2019-01-14 21:40:48,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-14 21:40:48,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 60. [2019-01-14 21:40:48,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-14 21:40:48,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-01-14 21:40:48,745 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 44 [2019-01-14 21:40:48,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:40:48,747 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-01-14 21:40:48,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-14 21:40:48,747 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-01-14 21:40:48,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-14 21:40:48,749 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:40:48,749 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:40:48,750 INFO L423 AbstractCegarLoop]: === Iteration 18 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:40:48,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:40:48,750 INFO L82 PathProgramCache]: Analyzing trace with hash -319514926, now seen corresponding path program 6 times [2019-01-14 21:40:48,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:40:48,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:40:48,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:48,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:40:48,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:40:49,060 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:40:49,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:40:49,060 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:40:49,070 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 21:40:49,099 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-01-14 21:40:49,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:40:49,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:40:49,123 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:40:49,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:40:49,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2019-01-14 21:40:49,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-14 21:40:49,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-14 21:40:49,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2019-01-14 21:40:49,143 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 21 states. [2019-01-14 21:40:50,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:40:50,257 INFO L93 Difference]: Finished difference Result 116 states and 117 transitions. [2019-01-14 21:40:50,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-14 21:40:50,258 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 56 [2019-01-14 21:40:50,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:40:50,259 INFO L225 Difference]: With dead ends: 116 [2019-01-14 21:40:50,260 INFO L226 Difference]: Without dead ends: 115 [2019-01-14 21:40:50,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=398, Invalid=1494, Unknown=0, NotChecked=0, Total=1892 [2019-01-14 21:40:50,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-14 21:40:50,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 69. [2019-01-14 21:40:50,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-14 21:40:50,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-01-14 21:40:50,283 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 56 [2019-01-14 21:40:50,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:40:50,284 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-01-14 21:40:50,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-14 21:40:50,285 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-01-14 21:40:50,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-14 21:40:50,287 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:40:50,287 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 1, 1, 1, 1] [2019-01-14 21:40:50,287 INFO L423 AbstractCegarLoop]: === Iteration 19 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:40:50,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:40:50,289 INFO L82 PathProgramCache]: Analyzing trace with hash -776049737, now seen corresponding path program 4 times [2019-01-14 21:40:50,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:40:50,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:40:50,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:50,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:40:50,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:40:50,532 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:40:50,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:40:50,533 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:40:50,549 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 21:40:50,584 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 21:40:50,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:40:50,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:40:50,736 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 20 proven. 138 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-01-14 21:40:50,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:40:50,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 25 [2019-01-14 21:40:50,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-14 21:40:50,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-14 21:40:50,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=546, Unknown=0, NotChecked=0, Total=650 [2019-01-14 21:40:50,755 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 26 states. [2019-01-14 21:40:51,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:40:51,031 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2019-01-14 21:40:51,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 21:40:51,032 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2019-01-14 21:40:51,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:40:51,033 INFO L225 Difference]: With dead ends: 120 [2019-01-14 21:40:51,033 INFO L226 Difference]: Without dead ends: 69 [2019-01-14 21:40:51,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=758, Unknown=0, NotChecked=0, Total=930 [2019-01-14 21:40:51,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-14 21:40:51,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-14 21:40:51,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-14 21:40:51,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-01-14 21:40:51,054 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 56 [2019-01-14 21:40:51,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:40:51,054 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-01-14 21:40:51,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-14 21:40:51,054 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-01-14 21:40:51,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-14 21:40:51,055 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:40:51,055 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:40:51,055 INFO L423 AbstractCegarLoop]: === Iteration 20 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:40:51,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:40:51,056 INFO L82 PathProgramCache]: Analyzing trace with hash 52526366, now seen corresponding path program 7 times [2019-01-14 21:40:51,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:40:51,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:40:51,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:51,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:40:51,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:40:51,442 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 291 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:40:51,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:40:51,442 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:40:51,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:40:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:40:51,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:40:51,496 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 291 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:40:51,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:40:51,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2019-01-14 21:40:51,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-14 21:40:51,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-14 21:40:51,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2019-01-14 21:40:51,518 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 25 states. [2019-01-14 21:40:52,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:40:52,097 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-01-14 21:40:52,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-14 21:40:52,098 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 68 [2019-01-14 21:40:52,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:40:52,098 INFO L225 Difference]: With dead ends: 83 [2019-01-14 21:40:52,099 INFO L226 Difference]: Without dead ends: 82 [2019-01-14 21:40:52,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=459, Invalid=1611, Unknown=0, NotChecked=0, Total=2070 [2019-01-14 21:40:52,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-14 21:40:52,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-01-14 21:40:52,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-14 21:40:52,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-01-14 21:40:52,118 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 68 [2019-01-14 21:40:52,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:40:52,118 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-01-14 21:40:52,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-14 21:40:52,118 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-01-14 21:40:52,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-14 21:40:52,119 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:40:52,119 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:40:52,119 INFO L423 AbstractCegarLoop]: === Iteration 21 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:40:52,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:40:52,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1106554518, now seen corresponding path program 8 times [2019-01-14 21:40:52,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:40:52,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:40:52,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:52,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:40:52,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:52,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:40:53,084 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 0 proven. 421 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:40:53,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:40:53,084 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:40:53,095 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 21:40:53,144 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 21:40:53,144 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:40:53,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:40:53,167 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 0 proven. 421 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:40:53,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:40:53,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2019-01-14 21:40:53,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-14 21:40:53,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-14 21:40:53,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2019-01-14 21:40:53,187 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 29 states. [2019-01-14 21:40:53,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:40:53,815 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-01-14 21:40:53,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-14 21:40:53,817 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 80 [2019-01-14 21:40:53,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:40:53,818 INFO L225 Difference]: With dead ends: 95 [2019-01-14 21:40:53,818 INFO L226 Difference]: Without dead ends: 94 [2019-01-14 21:40:53,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=632, Invalid=2230, Unknown=0, NotChecked=0, Total=2862 [2019-01-14 21:40:53,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-14 21:40:53,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-01-14 21:40:53,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-14 21:40:53,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-01-14 21:40:53,842 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 80 [2019-01-14 21:40:53,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:40:53,844 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-01-14 21:40:53,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-14 21:40:53,844 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-01-14 21:40:53,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-14 21:40:53,846 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:40:53,846 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:40:53,847 INFO L423 AbstractCegarLoop]: === Iteration 22 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:40:53,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:40:53,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1279454282, now seen corresponding path program 9 times [2019-01-14 21:40:53,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:40:53,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:40:53,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:53,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:40:53,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:40:54,337 INFO L134 CoverageAnalysis]: Checked inductivity of 575 backedges. 0 proven. 575 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:40:54,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:40:54,338 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:40:54,349 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 21:40:54,383 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-01-14 21:40:54,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:40:54,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:40:54,468 INFO L134 CoverageAnalysis]: Checked inductivity of 575 backedges. 0 proven. 573 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 21:40:54,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:40:54,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31] total 35 [2019-01-14 21:40:54,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-14 21:40:54,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-14 21:40:54,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1071, Unknown=0, NotChecked=0, Total=1260 [2019-01-14 21:40:54,501 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 36 states. [2019-01-14 21:40:56,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:40:56,156 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2019-01-14 21:40:56,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-14 21:40:56,159 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 92 [2019-01-14 21:40:56,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:40:56,160 INFO L225 Difference]: With dead ends: 119 [2019-01-14 21:40:56,160 INFO L226 Difference]: Without dead ends: 118 [2019-01-14 21:40:56,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1154 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1140, Invalid=3830, Unknown=0, NotChecked=0, Total=4970 [2019-01-14 21:40:56,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-01-14 21:40:56,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-01-14 21:40:56,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-14 21:40:56,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-01-14 21:40:56,186 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 92 [2019-01-14 21:40:56,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:40:56,186 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-01-14 21:40:56,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-14 21:40:56,186 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-01-14 21:40:56,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-01-14 21:40:56,187 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:40:56,187 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:40:56,188 INFO L423 AbstractCegarLoop]: === Iteration 23 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:40:56,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:40:56,190 INFO L82 PathProgramCache]: Analyzing trace with hash -853253554, now seen corresponding path program 10 times [2019-01-14 21:40:56,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:40:56,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:40:56,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:56,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:40:56,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:40:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:40:57,040 INFO L134 CoverageAnalysis]: Checked inductivity of 955 backedges. 0 proven. 955 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:40:57,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:40:57,040 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:40:57,049 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 21:40:57,082 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 21:40:57,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:40:57,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:40:58,164 INFO L134 CoverageAnalysis]: Checked inductivity of 955 backedges. 10 proven. 682 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2019-01-14 21:40:58,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:40:58,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 15] total 51 [2019-01-14 21:40:58,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-14 21:40:58,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-14 21:40:58,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=431, Invalid=2221, Unknown=0, NotChecked=0, Total=2652 [2019-01-14 21:40:58,186 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 52 states. [2019-01-14 21:40:58,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:40:58,632 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-01-14 21:40:58,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 21:40:58,634 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 116 [2019-01-14 21:40:58,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:40:58,635 INFO L225 Difference]: With dead ends: 117 [2019-01-14 21:40:58,635 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 21:40:58,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1102 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=646, Invalid=2660, Unknown=0, NotChecked=0, Total=3306 [2019-01-14 21:40:58,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 21:40:58,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 21:40:58,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 21:40:58,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 21:40:58,639 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 116 [2019-01-14 21:40:58,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:40:58,639 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 21:40:58,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-14 21:40:58,640 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 21:40:58,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 21:40:58,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 21:40:58,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:40:58,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:40:58,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:40:58,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:40:58,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:40:58,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:40:58,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:40:58,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:40:58,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:40:58,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:40:59,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:40:59,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:40:59,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:40:59,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:40:59,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:40:59,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:40:59,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:40:59,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:40:59,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:40:59,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:40:59,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:40:59,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:40:59,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:40:59,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:40:59,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:40:59,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:40:59,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:40:59,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:40:59,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:40:59,845 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 105 [2019-01-14 21:40:59,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:40:59,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:40:59,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:40:59,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:40:59,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:40:59,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:40:59,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:40:59,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:40:59,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:40:59,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:00,143 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 108 [2019-01-14 21:41:00,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:00,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:00,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:00,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:00,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:00,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:00,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:00,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:00,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:00,311 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 76 [2019-01-14 21:41:00,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:00,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:00,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:00,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:00,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:00,466 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 101 [2019-01-14 21:41:00,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:00,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:00,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:00,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:00,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:00,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:00,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:00,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:00,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:00,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:00,697 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 93 [2019-01-14 21:41:00,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:00,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:00,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:00,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:00,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:00,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:00,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:00,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:00,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:00,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:00,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:00,906 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 105 [2019-01-14 21:41:00,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:00,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:00,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:00,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:00,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,050 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 93 [2019-01-14 21:41:01,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,161 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 104 [2019-01-14 21:41:01,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,277 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 106 [2019-01-14 21:41:01,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,455 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 106 [2019-01-14 21:41:01,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:01,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:02,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:02,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:02,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:02,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:02,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:02,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:02,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:02,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:02,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:02,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:02,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:02,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:02,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:02,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:02,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:02,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:02,344 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 108 [2019-01-14 21:41:02,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:02,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:02,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:02,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:02,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:02,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:02,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:02,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:02,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:02,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:02,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:02,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:02,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:02,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:02,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:02,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:41:03,452 WARN L181 SmtUtils]: Spent 884.00 ms on a formula simplification. DAG size of input: 219 DAG size of output: 26 [2019-01-14 21:41:04,646 WARN L181 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 351 DAG size of output: 1 [2019-01-14 21:41:08,593 WARN L181 SmtUtils]: Spent 3.92 s on a formula simplification. DAG size of input: 575 DAG size of output: 47 [2019-01-14 21:41:08,595 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2019-01-14 21:41:08,595 INFO L448 ceAbstractionStarter]: For program point fFINAL(lines 13 23) no Hoare annotation was computed. [2019-01-14 21:41:08,595 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-01-14 21:41:08,595 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2019-01-14 21:41:08,596 INFO L448 ceAbstractionStarter]: For program point fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-14 21:41:08,597 INFO L448 ceAbstractionStarter]: For program point fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-14 21:41:08,597 INFO L444 ceAbstractionStarter]: At program point L20-2(line 20) the Hoare annotation is: (let ((.cse1 (< 2147483647 |f_#in~y|)) (.cse2 (< 2147483647 |f_#in~x|))) (let ((.cse3 (or (= 0 |f_#in~x|) .cse1 .cse2)) (.cse0 (< |f_#in~y| 0))) (and (or (and (not (= 0 f_~x)) (and (<= 0 f_~x) (and (not (= 0 f_~y)) (<= f_~x 2147483648) (<= f_~y 2147483647)) (<= 0 f_~y))) .cse0 .cse1 (< |f_#in~x| 0) .cse2) (or (<= f_~x 2147483647) (or .cse0 .cse3) (< |f_#in~x| 1)) (or (and (<= f_~y f_~x) (<= f_~x (+ f_~y 1))) (< |f_#in~x| |f_#in~y|) (or .cse3 .cse0) (< (+ |f_#in~y| 1) |f_#in~x|))))) [2019-01-14 21:41:08,597 INFO L448 ceAbstractionStarter]: For program point L17(lines 17 21) no Hoare annotation was computed. [2019-01-14 21:41:08,598 INFO L448 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. [2019-01-14 21:41:08,598 INFO L448 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2019-01-14 21:41:08,598 INFO L444 ceAbstractionStarter]: At program point L18-2(line 18) the Hoare annotation is: (let ((.cse3 (< |f_#in~y| 0)) (.cse0 (< 2147483647 |f_#in~y|)) (.cse2 (< |f_#in~x| 0)) (.cse1 (< 2147483647 |f_#in~x|))) (and (or (or (or (= 0 |f_#in~x|) .cse0 .cse1) .cse2) .cse3) (or (and (<= f_~x f_~y) (<= f_~y 2147483647) (not (= 0 f_~y)) (<= 0 f_~x)) .cse3 .cse0 .cse2 .cse1))) [2019-01-14 21:41:08,598 INFO L448 ceAbstractionStarter]: For program point fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2019-01-14 21:41:08,598 INFO L448 ceAbstractionStarter]: For program point L18-3(line 18) no Hoare annotation was computed. [2019-01-14 21:41:08,598 INFO L448 ceAbstractionStarter]: For program point L14(lines 14 22) no Hoare annotation was computed. [2019-01-14 21:41:08,598 INFO L448 ceAbstractionStarter]: For program point fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2019-01-14 21:41:08,598 INFO L448 ceAbstractionStarter]: For program point fEXIT(lines 13 23) no Hoare annotation was computed. [2019-01-14 21:41:08,598 INFO L451 ceAbstractionStarter]: At program point fENTRY(lines 13 23) the Hoare annotation is: true [2019-01-14 21:41:08,599 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 21:41:08,601 INFO L444 ceAbstractionStarter]: At program point L31(lines 25 32) the Hoare annotation is: (<= ULTIMATE.start_main_~y~0 2147483647) [2019-01-14 21:41:08,601 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 21:41:08,601 INFO L444 ceAbstractionStarter]: At program point L29(line 29) the Hoare annotation is: (and (<= ULTIMATE.start_main_~x~0 2147483647) (<= ULTIMATE.start_main_~y~0 2147483647) (<= 0 ULTIMATE.start_main_~x~0) (<= 0 ULTIMATE.start_main_~y~0)) [2019-01-14 21:41:08,601 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 21:41:08,601 INFO L448 ceAbstractionStarter]: For program point L28(lines 28 30) no Hoare annotation was computed. [2019-01-14 21:41:08,601 INFO L448 ceAbstractionStarter]: For program point L29-1(line 29) no Hoare annotation was computed. [2019-01-14 21:41:08,601 INFO L448 ceAbstractionStarter]: For program point L28-2(lines 28 30) no Hoare annotation was computed. [2019-01-14 21:41:08,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 09:41:08 BoogieIcfgContainer [2019-01-14 21:41:08,614 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 21:41:08,615 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 21:41:08,615 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 21:41:08,615 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 21:41:08,616 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 09:40:38" (3/4) ... [2019-01-14 21:41:08,619 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 21:41:08,625 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2019-01-14 21:41:08,629 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-14 21:41:08,629 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-14 21:41:08,672 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 21:41:08,672 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 21:41:08,673 INFO L168 Benchmark]: Toolchain (without parser) took 30509.92 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 424.1 MB). Free memory was 952.7 MB in the beginning and 993.7 MB in the end (delta: -41.0 MB). Peak memory consumption was 383.2 MB. Max. memory is 11.5 GB. [2019-01-14 21:41:08,675 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 21:41:08,676 INFO L168 Benchmark]: CACSL2BoogieTranslator took 301.82 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 21:41:08,676 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.29 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 21:41:08,677 INFO L168 Benchmark]: Boogie Preprocessor took 30.49 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 21:41:08,678 INFO L168 Benchmark]: RCFGBuilder took 423.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -185.0 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2019-01-14 21:41:08,680 INFO L168 Benchmark]: TraceAbstraction took 29646.61 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 273.2 MB). Free memory was 1.1 GB in the beginning and 994.4 MB in the end (delta: 132.5 MB). Peak memory consumption was 530.1 MB. Max. memory is 11.5 GB. [2019-01-14 21:41:08,682 INFO L168 Benchmark]: Witness Printer took 57.57 ms. Allocated memory is still 1.5 GB. Free memory was 994.4 MB in the beginning and 993.7 MB in the end (delta: 691.8 kB). Peak memory consumption was 691.8 kB. Max. memory is 11.5 GB. [2019-01-14 21:41:08,690 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 301.82 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.29 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.49 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 423.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -185.0 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29646.61 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 273.2 MB). Free memory was 1.1 GB in the beginning and 994.4 MB in the end (delta: 132.5 MB). Peak memory consumption was 530.1 MB. Max. memory is 11.5 GB. * Witness Printer took 57.57 ms. Allocated memory is still 1.5 GB. Free memory was 994.4 MB in the beginning and 993.7 MB in the end (delta: 691.8 kB). Peak memory consumption was 691.8 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: y <= 2147483647 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 4 error locations. SAFE Result, 29.5s OverallTime, 23 OverallIterations, 19 TraceHistogramMax, 10.0s AutomataDifference, 0.0s DeadEndRemovalTime, 9.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 272 SDtfs, 1539 SDslu, 1122 SDs, 0 SdLazy, 2486 SolverSat, 104 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1290 GetRequests, 765 SyntacticMatches, 6 SemanticMatches, 519 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4251 ImplicationChecksByTransitivity, 11.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 300 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 92 PreInvPairs, 92 NumberOfFragments, 174 HoareAnnotationTreeSize, 92 FomulaSimplifications, 42603069 FormulaSimplificationTreeSizeReduction, 3.8s HoareSimplificationTime, 5 FomulaSimplificationsInter, 2255871 FormulaSimplificationTreeSizeReductionInter, 6.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 1609 NumberOfCodeBlocks, 1609 NumberOfCodeBlocksAsserted, 86 NumberOfCheckSat, 1568 ConstructedInterpolants, 0 QuantifiedInterpolants, 450795 SizeOfPredicates, 126 NumberOfNonLiveVariables, 1975 ConjunctsInSsa, 309 ConjunctsInUnsatCore, 41 InterpolantComputations, 7 PerfectInterpolantSequences, 422/6215 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...