./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-crafted/Arrays01-EquivalentConstantIndices_true-no-overflow_true-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2e94e6aa 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/Arrays01-EquivalentConstantIndices_true-no-overflow_true-termination_true-valid-memsafety.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash cf39454d83b4ec00341bd0b620b0fa6b2321ce21 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 20:34:01,338 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 20:34:01,340 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 20:34:01,352 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 20:34:01,352 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 20:34:01,353 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 20:34:01,355 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 20:34:01,357 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 20:34:01,359 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 20:34:01,360 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 20:34:01,361 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 20:34:01,361 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 20:34:01,362 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 20:34:01,363 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 20:34:01,365 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 20:34:01,366 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 20:34:01,367 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 20:34:01,369 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 20:34:01,371 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 20:34:01,373 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 20:34:01,374 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 20:34:01,375 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 20:34:01,378 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 20:34:01,379 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 20:34:01,379 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 20:34:01,380 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 20:34:01,381 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 20:34:01,382 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 20:34:01,383 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 20:34:01,384 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 20:34:01,384 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 20:34:01,386 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 20:34:01,386 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 20:34:01,386 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 20:34:01,387 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 20:34:01,388 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 20:34:01,388 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-01-01 20:34:01,404 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 20:34:01,404 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 20:34:01,405 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 20:34:01,405 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 20:34:01,406 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 20:34:01,406 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 20:34:01,406 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 20:34:01,407 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 20:34:01,407 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 20:34:01,407 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 20:34:01,407 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 20:34:01,407 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 20:34:01,407 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-01 20:34:01,408 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 20:34:01,408 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 20:34:01,408 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 20:34:01,408 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 20:34:01,408 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 20:34:01,408 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 20:34:01,410 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 20:34:01,410 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 20:34:01,411 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 20:34:01,411 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 20:34:01,411 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 20:34:01,411 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 20:34:01,412 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 20:34:01,412 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 20:34:01,412 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 -> cf39454d83b4ec00341bd0b620b0fa6b2321ce21 [2019-01-01 20:34:01,449 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 20:34:01,462 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 20:34:01,466 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 20:34:01,468 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 20:34:01,468 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 20:34:01,470 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted/Arrays01-EquivalentConstantIndices_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-01 20:34:01,529 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/728496ee0/8d19d94dede448cf94e493ee0939dc22/FLAGb39dec02d [2019-01-01 20:34:01,972 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 20:34:01,973 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted/Arrays01-EquivalentConstantIndices_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-01 20:34:01,983 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/728496ee0/8d19d94dede448cf94e493ee0939dc22/FLAGb39dec02d [2019-01-01 20:34:02,359 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/728496ee0/8d19d94dede448cf94e493ee0939dc22 [2019-01-01 20:34:02,363 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 20:34:02,365 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 20:34:02,367 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 20:34:02,367 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 20:34:02,371 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 20:34:02,372 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:34:02" (1/1) ... [2019-01-01 20:34:02,376 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5118fd0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:02, skipping insertion in model container [2019-01-01 20:34:02,377 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:34:02" (1/1) ... [2019-01-01 20:34:02,386 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 20:34:02,404 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 20:34:02,635 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:34:02,641 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 20:34:02,671 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:34:02,702 INFO L195 MainTranslator]: Completed translation [2019-01-01 20:34:02,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:02 WrapperNode [2019-01-01 20:34:02,702 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 20:34:02,705 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 20:34:02,705 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 20:34:02,705 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 20:34:02,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:02" (1/1) ... [2019-01-01 20:34:02,724 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:02" (1/1) ... [2019-01-01 20:34:02,747 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 20:34:02,748 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 20:34:02,748 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 20:34:02,748 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 20:34:02,759 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:02" (1/1) ... [2019-01-01 20:34:02,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:02" (1/1) ... [2019-01-01 20:34:02,761 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:02" (1/1) ... [2019-01-01 20:34:02,762 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:02" (1/1) ... [2019-01-01 20:34:02,767 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:02" (1/1) ... [2019-01-01 20:34:02,775 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:02" (1/1) ... [2019-01-01 20:34:02,776 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:02" (1/1) ... [2019-01-01 20:34:02,784 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 20:34:02,785 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 20:34:02,785 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 20:34:02,785 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 20:34:02,786 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:02" (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-01 20:34:02,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 20:34:02,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 20:34:02,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 20:34:02,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 20:34:02,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 20:34:02,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 20:34:03,288 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 20:34:03,288 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-01 20:34:03,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:34:03 BoogieIcfgContainer [2019-01-01 20:34:03,289 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 20:34:03,290 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 20:34:03,290 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 20:34:03,293 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 20:34:03,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 08:34:02" (1/3) ... [2019-01-01 20:34:03,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1361332c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:34:03, skipping insertion in model container [2019-01-01 20:34:03,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:02" (2/3) ... [2019-01-01 20:34:03,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1361332c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:34:03, skipping insertion in model container [2019-01-01 20:34:03,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:34:03" (3/3) ... [2019-01-01 20:34:03,297 INFO L112 eAbstractionObserver]: Analyzing ICFG Arrays01-EquivalentConstantIndices_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-01 20:34:03,321 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 20:34:03,331 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-01-01 20:34:03,350 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-01-01 20:34:03,383 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 20:34:03,384 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 20:34:03,384 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 20:34:03,384 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 20:34:03,384 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 20:34:03,384 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 20:34:03,385 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 20:34:03,385 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 20:34:03,385 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 20:34:03,401 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-01-01 20:34:03,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-01 20:34:03,408 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:03,409 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-01 20:34:03,412 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:03,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:03,418 INFO L82 PathProgramCache]: Analyzing trace with hash 28698728, now seen corresponding path program 1 times [2019-01-01 20:34:03,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:03,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:03,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:03,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:03,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:03,626 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-01 20:34:03,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:03,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 20:34:03,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 20:34:03,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 20:34:03,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 20:34:03,652 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 4 states. [2019-01-01 20:34:03,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:03,783 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2019-01-01 20:34:03,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 20:34:03,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-01 20:34:03,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:03,796 INFO L225 Difference]: With dead ends: 34 [2019-01-01 20:34:03,796 INFO L226 Difference]: Without dead ends: 18 [2019-01-01 20:34:03,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:34:03,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-01-01 20:34:03,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-01 20:34:03,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-01 20:34:03,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-01-01 20:34:03,837 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 5 [2019-01-01 20:34:03,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:03,837 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-01-01 20:34:03,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 20:34:03,838 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-01-01 20:34:03,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-01 20:34:03,838 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:03,838 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2019-01-01 20:34:03,839 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:03,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:03,839 INFO L82 PathProgramCache]: Analyzing trace with hash -363792156, now seen corresponding path program 1 times [2019-01-01 20:34:03,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:03,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:03,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:03,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:03,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:03,894 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 20:34:03,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:03,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 20:34:03,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 20:34:03,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 20:34:03,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 20:34:03,897 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 4 states. [2019-01-01 20:34:03,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:03,984 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2019-01-01 20:34:03,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 20:34:03,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-01-01 20:34:03,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:03,985 INFO L225 Difference]: With dead ends: 18 [2019-01-01 20:34:03,985 INFO L226 Difference]: Without dead ends: 17 [2019-01-01 20:34:03,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:34:03,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-01 20:34:03,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-01 20:34:03,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-01 20:34:03,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-01-01 20:34:03,990 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 9 [2019-01-01 20:34:03,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:03,990 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-01-01 20:34:03,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 20:34:03,991 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-01-01 20:34:03,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 20:34:03,992 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:03,992 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:03,992 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:03,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:03,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1607296535, now seen corresponding path program 1 times [2019-01-01 20:34:03,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:03,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:03,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:03,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:03,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:04,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:04,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:04,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:04,110 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-01 20:34:04,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:04,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:04,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:04,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:04,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-01-01 20:34:04,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 20:34:04,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 20:34:04,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:34:04,401 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 7 states. [2019-01-01 20:34:04,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:04,541 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2019-01-01 20:34:04,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 20:34:04,542 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-01-01 20:34:04,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:04,543 INFO L225 Difference]: With dead ends: 28 [2019-01-01 20:34:04,544 INFO L226 Difference]: Without dead ends: 22 [2019-01-01 20:34:04,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-01 20:34:04,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-01 20:34:04,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2019-01-01 20:34:04,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-01 20:34:04,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-01-01 20:34:04,549 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 10 [2019-01-01 20:34:04,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:04,549 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-01-01 20:34:04,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 20:34:04,550 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-01-01 20:34:04,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 20:34:04,550 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:04,550 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2019-01-01 20:34:04,551 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:04,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:04,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1607345098, now seen corresponding path program 1 times [2019-01-01 20:34:04,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:04,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:04,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:04,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:04,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:04,704 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-01 20:34:04,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:04,705 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-01 20:34:04,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:04,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:04,917 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:04,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 20:34:04,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2019-01-01 20:34:04,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 20:34:04,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 20:34:04,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-01 20:34:04,950 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 8 states. [2019-01-01 20:34:05,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:05,121 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2019-01-01 20:34:05,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 20:34:05,122 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-01-01 20:34:05,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:05,123 INFO L225 Difference]: With dead ends: 18 [2019-01-01 20:34:05,123 INFO L226 Difference]: Without dead ends: 17 [2019-01-01 20:34:05,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-01-01 20:34:05,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-01 20:34:05,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-01 20:34:05,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-01 20:34:05,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-01-01 20:34:05,132 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 10 [2019-01-01 20:34:05,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:05,133 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-01-01 20:34:05,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 20:34:05,133 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-01-01 20:34:05,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-01 20:34:05,136 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:05,137 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:05,137 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:05,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:05,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1053474021, now seen corresponding path program 2 times [2019-01-01 20:34:05,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:05,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:05,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:05,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:05,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:05,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:05,261 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:05,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:05,262 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-01 20:34:05,273 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:34:05,289 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:34:05,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:05,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:05,329 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:05,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:05,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-01-01 20:34:05,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 20:34:05,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 20:34:05,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-01 20:34:05,351 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2019-01-01 20:34:05,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:05,613 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-01-01 20:34:05,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 20:34:05,614 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2019-01-01 20:34:05,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:05,615 INFO L225 Difference]: With dead ends: 30 [2019-01-01 20:34:05,616 INFO L226 Difference]: Without dead ends: 24 [2019-01-01 20:34:05,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-01-01 20:34:05,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-01 20:34:05,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-01-01 20:34:05,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-01 20:34:05,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-01-01 20:34:05,622 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2019-01-01 20:34:05,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:05,622 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-01-01 20:34:05,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 20:34:05,622 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-01-01 20:34:05,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-01 20:34:05,624 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:05,624 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:05,625 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:05,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:05,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1100938783, now seen corresponding path program 3 times [2019-01-01 20:34:05,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:05,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:05,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:05,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:05,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:05,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:05,875 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:05,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:05,875 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-01 20:34:05,884 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:34:05,918 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-01 20:34:05,918 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:05,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:05,969 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:05,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:05,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2019-01-01 20:34:05,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 20:34:05,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 20:34:05,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-01-01 20:34:05,992 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2019-01-01 20:34:06,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:06,169 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-01-01 20:34:06,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 20:34:06,172 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2019-01-01 20:34:06,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:06,172 INFO L225 Difference]: With dead ends: 34 [2019-01-01 20:34:06,173 INFO L226 Difference]: Without dead ends: 28 [2019-01-01 20:34:06,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-01-01 20:34:06,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-01 20:34:06,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-01-01 20:34:06,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-01 20:34:06,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-01-01 20:34:06,178 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 18 [2019-01-01 20:34:06,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:06,178 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-01-01 20:34:06,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 20:34:06,179 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-01-01 20:34:06,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-01 20:34:06,179 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:06,180 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:06,180 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:06,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:06,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1326737629, now seen corresponding path program 4 times [2019-01-01 20:34:06,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:06,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:06,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:06,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:06,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:06,351 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:06,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:06,352 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-01 20:34:06,363 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 20:34:06,381 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 20:34:06,381 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:06,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:06,448 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:06,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:06,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2019-01-01 20:34:06,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-01 20:34:06,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 20:34:06,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-01-01 20:34:06,477 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2019-01-01 20:34:06,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:06,685 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-01-01 20:34:06,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 20:34:06,686 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2019-01-01 20:34:06,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:06,687 INFO L225 Difference]: With dead ends: 38 [2019-01-01 20:34:06,687 INFO L226 Difference]: Without dead ends: 32 [2019-01-01 20:34:06,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-01-01 20:34:06,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-01 20:34:06,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2019-01-01 20:34:06,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-01 20:34:06,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-01-01 20:34:06,694 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 22 [2019-01-01 20:34:06,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:06,694 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-01-01 20:34:06,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-01 20:34:06,694 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-01-01 20:34:06,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-01 20:34:06,696 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:06,696 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:06,697 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:06,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:06,697 INFO L82 PathProgramCache]: Analyzing trace with hash 108793383, now seen corresponding path program 5 times [2019-01-01 20:34:06,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:06,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:06,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:06,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:06,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:06,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:06,910 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-01 20:34:06,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:06,911 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-01 20:34:06,928 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 20:34:06,960 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-01 20:34:06,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:06,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:07,000 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-01 20:34:07,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:07,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2019-01-01 20:34:07,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-01 20:34:07,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-01 20:34:07,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-01-01 20:34:07,029 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2019-01-01 20:34:07,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:07,593 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-01-01 20:34:07,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 20:34:07,598 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2019-01-01 20:34:07,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:07,599 INFO L225 Difference]: With dead ends: 42 [2019-01-01 20:34:07,599 INFO L226 Difference]: Without dead ends: 36 [2019-01-01 20:34:07,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2019-01-01 20:34:07,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-01 20:34:07,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2019-01-01 20:34:07,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-01 20:34:07,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-01-01 20:34:07,611 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 26 [2019-01-01 20:34:07,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:07,612 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-01-01 20:34:07,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-01 20:34:07,615 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-01-01 20:34:07,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-01 20:34:07,615 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:07,616 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:07,616 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:07,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:07,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1590598869, now seen corresponding path program 6 times [2019-01-01 20:34:07,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:07,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:07,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:07,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:07,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:07,973 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:07,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:07,974 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-01 20:34:07,983 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 20:34:08,059 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-01 20:34:08,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:08,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:08,252 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:08,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:08,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2019-01-01 20:34:08,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-01 20:34:08,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-01 20:34:08,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-01-01 20:34:08,276 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2019-01-01 20:34:08,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:08,497 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2019-01-01 20:34:08,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 20:34:08,498 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-01-01 20:34:08,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:08,499 INFO L225 Difference]: With dead ends: 46 [2019-01-01 20:34:08,499 INFO L226 Difference]: Without dead ends: 40 [2019-01-01 20:34:08,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2019-01-01 20:34:08,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-01 20:34:08,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2019-01-01 20:34:08,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-01 20:34:08,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-01-01 20:34:08,506 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 30 [2019-01-01 20:34:08,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:08,506 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-01-01 20:34:08,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-01 20:34:08,506 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-01-01 20:34:08,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-01 20:34:08,507 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:08,508 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:08,508 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:08,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:08,508 INFO L82 PathProgramCache]: Analyzing trace with hash -2022926801, now seen corresponding path program 7 times [2019-01-01 20:34:08,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:08,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:08,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:08,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:08,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:08,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:08,783 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:08,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:08,783 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-01 20:34:08,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:08,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:08,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:08,909 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:08,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:08,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2019-01-01 20:34:08,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-01 20:34:08,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-01 20:34:08,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-01-01 20:34:08,937 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2019-01-01 20:34:09,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:09,137 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2019-01-01 20:34:09,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-01 20:34:09,138 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 34 [2019-01-01 20:34:09,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:09,139 INFO L225 Difference]: With dead ends: 50 [2019-01-01 20:34:09,140 INFO L226 Difference]: Without dead ends: 44 [2019-01-01 20:34:09,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=199, Invalid=451, Unknown=0, NotChecked=0, Total=650 [2019-01-01 20:34:09,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-01 20:34:09,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2019-01-01 20:34:09,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-01 20:34:09,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-01-01 20:34:09,146 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 34 [2019-01-01 20:34:09,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:09,147 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-01-01 20:34:09,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-01 20:34:09,147 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-01-01 20:34:09,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-01 20:34:09,148 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:09,148 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:09,149 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:09,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:09,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1492211917, now seen corresponding path program 8 times [2019-01-01 20:34:09,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:09,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:09,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:09,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:09,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:09,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:09,406 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-01 20:34:09,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:09,407 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-01 20:34:09,416 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:34:09,463 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:34:09,463 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:09,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:09,890 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-01 20:34:09,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:09,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 21 [2019-01-01 20:34:09,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-01 20:34:09,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-01 20:34:09,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-01-01 20:34:09,925 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2019-01-01 20:34:10,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:10,469 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2019-01-01 20:34:10,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-01 20:34:10,470 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2019-01-01 20:34:10,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:10,471 INFO L225 Difference]: With dead ends: 54 [2019-01-01 20:34:10,471 INFO L226 Difference]: Without dead ends: 48 [2019-01-01 20:34:10,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=246, Invalid=566, Unknown=0, NotChecked=0, Total=812 [2019-01-01 20:34:10,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-01 20:34:10,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2019-01-01 20:34:10,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-01 20:34:10,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-01-01 20:34:10,477 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 38 [2019-01-01 20:34:10,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:10,478 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-01-01 20:34:10,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-01 20:34:10,478 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-01-01 20:34:10,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-01 20:34:10,479 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:10,479 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:10,480 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:10,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:10,480 INFO L82 PathProgramCache]: Analyzing trace with hash 360224311, now seen corresponding path program 9 times [2019-01-01 20:34:10,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:10,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:10,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:10,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:10,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:10,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:10,857 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:10,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:10,858 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-01 20:34:10,867 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:34:10,927 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-01 20:34:10,927 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:10,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:10,979 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:11,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:11,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2019-01-01 20:34:11,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-01 20:34:11,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-01 20:34:11,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2019-01-01 20:34:11,008 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2019-01-01 20:34:11,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:11,273 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2019-01-01 20:34:11,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-01 20:34:11,274 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 42 [2019-01-01 20:34:11,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:11,275 INFO L225 Difference]: With dead ends: 58 [2019-01-01 20:34:11,275 INFO L226 Difference]: Without dead ends: 52 [2019-01-01 20:34:11,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=298, Invalid=694, Unknown=0, NotChecked=0, Total=992 [2019-01-01 20:34:11,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-01 20:34:11,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2019-01-01 20:34:11,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-01 20:34:11,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-01-01 20:34:11,284 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 42 [2019-01-01 20:34:11,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:11,284 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-01-01 20:34:11,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-01 20:34:11,284 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-01-01 20:34:11,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-01 20:34:11,286 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:11,286 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:11,286 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:11,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:11,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1334534971, now seen corresponding path program 10 times [2019-01-01 20:34:11,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:11,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:11,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:11,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:11,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:12,273 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:12,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:12,273 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-01 20:34:12,283 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 20:34:12,306 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 20:34:12,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:12,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:12,345 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:12,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:12,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 25 [2019-01-01 20:34:12,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-01 20:34:12,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-01 20:34:12,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-01-01 20:34:12,369 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2019-01-01 20:34:12,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:12,743 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2019-01-01 20:34:12,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-01 20:34:12,744 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2019-01-01 20:34:12,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:12,745 INFO L225 Difference]: With dead ends: 62 [2019-01-01 20:34:12,745 INFO L226 Difference]: Without dead ends: 56 [2019-01-01 20:34:12,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2019-01-01 20:34:12,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-01 20:34:12,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2019-01-01 20:34:12,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-01 20:34:12,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-01-01 20:34:12,753 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 46 [2019-01-01 20:34:12,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:12,753 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-01-01 20:34:12,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-01 20:34:12,753 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-01-01 20:34:12,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-01 20:34:12,756 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:12,756 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:12,757 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:12,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:12,757 INFO L82 PathProgramCache]: Analyzing trace with hash 2041056831, now seen corresponding path program 11 times [2019-01-01 20:34:12,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:12,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:12,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:12,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:12,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:12,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:13,231 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:13,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:13,232 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-01 20:34:13,242 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 20:34:13,298 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-01-01 20:34:13,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:13,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:13,367 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:13,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:13,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 27 [2019-01-01 20:34:13,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-01 20:34:13,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-01 20:34:13,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2019-01-01 20:34:13,398 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2019-01-01 20:34:13,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:13,687 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2019-01-01 20:34:13,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-01 20:34:13,688 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 50 [2019-01-01 20:34:13,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:13,689 INFO L225 Difference]: With dead ends: 66 [2019-01-01 20:34:13,689 INFO L226 Difference]: Without dead ends: 60 [2019-01-01 20:34:13,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=417, Invalid=989, Unknown=0, NotChecked=0, Total=1406 [2019-01-01 20:34:13,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-01 20:34:13,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2019-01-01 20:34:13,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-01 20:34:13,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-01-01 20:34:13,695 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 50 [2019-01-01 20:34:13,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:13,695 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-01-01 20:34:13,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-01 20:34:13,695 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-01-01 20:34:13,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-01 20:34:13,698 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:13,698 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:13,699 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:13,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:13,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1615882429, now seen corresponding path program 12 times [2019-01-01 20:34:13,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:13,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:13,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:13,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:13,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:13,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:14,140 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:14,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:14,141 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-01 20:34:14,154 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 20:34:14,256 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-01-01 20:34:14,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:14,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:14,312 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:14,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:14,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 29 [2019-01-01 20:34:14,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-01 20:34:14,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-01 20:34:14,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2019-01-01 20:34:14,334 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2019-01-01 20:34:15,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:15,094 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2019-01-01 20:34:15,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-01 20:34:15,095 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 54 [2019-01-01 20:34:15,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:15,096 INFO L225 Difference]: With dead ends: 70 [2019-01-01 20:34:15,096 INFO L226 Difference]: Without dead ends: 64 [2019-01-01 20:34:15,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=484, Invalid=1156, Unknown=0, NotChecked=0, Total=1640 [2019-01-01 20:34:15,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-01 20:34:15,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2019-01-01 20:34:15,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-01 20:34:15,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-01-01 20:34:15,107 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 54 [2019-01-01 20:34:15,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:15,108 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-01-01 20:34:15,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-01 20:34:15,108 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-01-01 20:34:15,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-01 20:34:15,109 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:15,113 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:15,114 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:15,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:15,114 INFO L82 PathProgramCache]: Analyzing trace with hash -184353209, now seen corresponding path program 13 times [2019-01-01 20:34:15,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:15,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:15,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:15,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:15,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:15,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:15,895 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:15,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:15,895 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-01 20:34:15,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:15,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:16,030 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:16,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:16,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 31 [2019-01-01 20:34:16,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-01 20:34:16,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-01 20:34:16,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2019-01-01 20:34:16,061 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2019-01-01 20:34:16,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:16,492 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2019-01-01 20:34:16,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-01 20:34:16,493 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 58 [2019-01-01 20:34:16,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:16,494 INFO L225 Difference]: With dead ends: 74 [2019-01-01 20:34:16,494 INFO L226 Difference]: Without dead ends: 68 [2019-01-01 20:34:16,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=556, Invalid=1336, Unknown=0, NotChecked=0, Total=1892 [2019-01-01 20:34:16,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-01 20:34:16,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2019-01-01 20:34:16,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-01 20:34:16,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-01-01 20:34:16,506 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 58 [2019-01-01 20:34:16,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:16,508 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-01-01 20:34:16,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-01 20:34:16,509 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-01-01 20:34:16,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-01 20:34:16,509 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:16,509 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:16,510 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:16,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:16,510 INFO L82 PathProgramCache]: Analyzing trace with hash 344146763, now seen corresponding path program 14 times [2019-01-01 20:34:16,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:16,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:16,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:16,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:16,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:16,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:17,031 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:17,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:17,032 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-01 20:34:17,047 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:34:17,073 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:34:17,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:17,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:17,128 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:17,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:17,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 33 [2019-01-01 20:34:17,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-01 20:34:17,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-01 20:34:17,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2019-01-01 20:34:17,149 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2019-01-01 20:34:17,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:17,569 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2019-01-01 20:34:17,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-01 20:34:17,569 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 62 [2019-01-01 20:34:17,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:17,571 INFO L225 Difference]: With dead ends: 78 [2019-01-01 20:34:17,571 INFO L226 Difference]: Without dead ends: 72 [2019-01-01 20:34:17,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=633, Invalid=1529, Unknown=0, NotChecked=0, Total=2162 [2019-01-01 20:34:17,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-01 20:34:17,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2019-01-01 20:34:17,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-01 20:34:17,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-01-01 20:34:17,578 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 62 [2019-01-01 20:34:17,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:17,578 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-01-01 20:34:17,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-01 20:34:17,578 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-01-01 20:34:17,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-01 20:34:17,581 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:17,582 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:17,582 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:17,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:17,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1083270735, now seen corresponding path program 15 times [2019-01-01 20:34:17,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:17,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:17,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:17,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:17,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:17,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:19,111 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:19,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:19,111 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-01 20:34:19,121 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:34:19,380 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-01 20:34:19,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:19,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:19,419 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:19,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:19,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 35 [2019-01-01 20:34:19,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-01 20:34:19,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-01 20:34:19,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2019-01-01 20:34:19,450 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2019-01-01 20:34:20,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:20,265 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2019-01-01 20:34:20,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-01 20:34:20,267 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 66 [2019-01-01 20:34:20,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:20,267 INFO L225 Difference]: With dead ends: 82 [2019-01-01 20:34:20,267 INFO L226 Difference]: Without dead ends: 76 [2019-01-01 20:34:20,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=715, Invalid=1735, Unknown=0, NotChecked=0, Total=2450 [2019-01-01 20:34:20,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-01 20:34:20,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2019-01-01 20:34:20,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-01 20:34:20,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-01-01 20:34:20,274 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 66 [2019-01-01 20:34:20,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:20,274 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-01-01 20:34:20,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-01 20:34:20,280 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-01-01 20:34:20,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-01 20:34:20,280 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:20,280 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:20,281 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:20,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:20,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1559337133, now seen corresponding path program 16 times [2019-01-01 20:34:20,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:20,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:20,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:20,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:20,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:20,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:21,110 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:21,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:21,110 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-01 20:34:21,122 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 20:34:21,149 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 20:34:21,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:21,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:21,199 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:21,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:21,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 37 [2019-01-01 20:34:21,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-01 20:34:21,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-01 20:34:21,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2019-01-01 20:34:21,220 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2019-01-01 20:34:21,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:21,699 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2019-01-01 20:34:21,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-01 20:34:21,699 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 70 [2019-01-01 20:34:21,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:21,700 INFO L225 Difference]: With dead ends: 86 [2019-01-01 20:34:21,700 INFO L226 Difference]: Without dead ends: 80 [2019-01-01 20:34:21,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=802, Invalid=1954, Unknown=0, NotChecked=0, Total=2756 [2019-01-01 20:34:21,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-01 20:34:21,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2019-01-01 20:34:21,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-01 20:34:21,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-01-01 20:34:21,706 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 70 [2019-01-01 20:34:21,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:21,706 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-01-01 20:34:21,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-01 20:34:21,706 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-01-01 20:34:21,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-01 20:34:21,710 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:21,710 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:21,710 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:21,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:21,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1923398057, now seen corresponding path program 17 times [2019-01-01 20:34:21,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:21,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:21,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:21,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:21,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:22,197 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:22,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:22,197 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-01 20:34:22,209 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 20:34:22,367 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-01-01 20:34:22,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:22,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:22,429 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:22,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:22,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 39 [2019-01-01 20:34:22,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-01 20:34:22,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-01 20:34:22,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2019-01-01 20:34:22,460 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2019-01-01 20:34:22,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:22,935 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2019-01-01 20:34:22,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-01 20:34:22,937 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 74 [2019-01-01 20:34:22,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:22,938 INFO L225 Difference]: With dead ends: 90 [2019-01-01 20:34:22,938 INFO L226 Difference]: Without dead ends: 84 [2019-01-01 20:34:22,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=894, Invalid=2186, Unknown=0, NotChecked=0, Total=3080 [2019-01-01 20:34:22,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-01 20:34:22,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2019-01-01 20:34:22,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-01 20:34:22,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-01-01 20:34:22,945 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 74 [2019-01-01 20:34:22,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:22,945 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-01-01 20:34:22,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-01 20:34:22,945 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-01-01 20:34:22,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-01 20:34:22,946 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:22,946 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:22,946 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:22,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:22,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1202125989, now seen corresponding path program 18 times [2019-01-01 20:34:22,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:22,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:22,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:22,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:22,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:22,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:24,276 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:24,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:24,277 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:34:24,291 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 20:34:24,749 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2019-01-01 20:34:24,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:24,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:24,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2019-01-01 20:34:24,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-01 20:34:24,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:34:24,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:34:24,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:34:24,980 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2019-01-01 20:34:25,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2019-01-01 20:34:25,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:34:25,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2019-01-01 20:34:25,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:34:25,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:34:25,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:34:25,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-01-01 20:34:25,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2019-01-01 20:34:25,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:34:25,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2019-01-01 20:34:25,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:34:25,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:34:25,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:34:25,399 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-01-01 20:34:25,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2019-01-01 20:34:25,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:34:25,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2019-01-01 20:34:25,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:34:25,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:34:25,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:34:25,706 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-01-01 20:34:25,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2019-01-01 20:34:25,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:34:25,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2019-01-01 20:34:25,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:34:25,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:34:25,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:34:25,939 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-01-01 20:34:26,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2019-01-01 20:34:26,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:34:26,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2019-01-01 20:34:26,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:34:26,127 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:34:26,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:34:26,137 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-01-01 20:34:26,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2019-01-01 20:34:26,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:34:26,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2019-01-01 20:34:26,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:34:26,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:34:26,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:34:26,263 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-01-01 20:34:26,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2019-01-01 20:34:26,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:34:26,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2019-01-01 20:34:26,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:34:26,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:34:26,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:34:26,429 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-01-01 20:34:26,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2019-01-01 20:34:26,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:34:26,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2019-01-01 20:34:26,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:34:26,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:34:26,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:34:26,610 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:13 [2019-01-01 20:34:26,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2019-01-01 20:34:26,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 34 [2019-01-01 20:34:26,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 20:34:27,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 20:34:27,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 20:34:27,433 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2019-01-01 20:34:28,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-01-01 20:34:28,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 34 [2019-01-01 20:34:28,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 20:34:28,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 20:34:28,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2019-01-01 20:34:28,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-01 20:34:28,252 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 20:34:28,263 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:34:28,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-01 20:34:28,289 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:34 [2019-01-01 20:34:29,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2019-01-01 20:34:29,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-01 20:34:29,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:34:29,157 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:34:29,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-01-01 20:34:29,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 34 [2019-01-01 20:34:29,253 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-01 20:34:29,268 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 20:34:29,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-01 20:34:29,295 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:34 [2019-01-01 20:34:29,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2019-01-01 20:34:29,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-01 20:34:29,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:34:29,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:34:29,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-01-01 20:34:29,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 34 [2019-01-01 20:34:29,485 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-01 20:34:29,501 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 20:34:29,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-01 20:34:29,524 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:34 [2019-01-01 20:34:29,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2019-01-01 20:34:29,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-01 20:34:29,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:34:29,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:34:29,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-01-01 20:34:29,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 34 [2019-01-01 20:34:29,747 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-01 20:34:29,763 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 20:34:29,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-01 20:34:29,788 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:34 [2019-01-01 20:34:29,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2019-01-01 20:34:29,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-01 20:34:29,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:34:29,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:34:29,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-01-01 20:34:29,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 34 [2019-01-01 20:34:30,000 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-01 20:34:30,016 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 20:34:30,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-01 20:34:30,042 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:34 [2019-01-01 20:34:30,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-01 20:34:30,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-01-01 20:34:30,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:34:30,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:34:30,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:34:30,226 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-01-01 20:34:30,289 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 78 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:30,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:30,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 40] total 78 [2019-01-01 20:34:30,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-01 20:34:30,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-01 20:34:30,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1017, Invalid=4989, Unknown=0, NotChecked=0, Total=6006 [2019-01-01 20:34:30,312 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 78 states. [2019-01-01 20:34:33,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:33,463 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2019-01-01 20:34:33,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-01 20:34:33,464 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-01-01 20:34:33,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:33,466 INFO L225 Difference]: With dead ends: 93 [2019-01-01 20:34:33,466 INFO L226 Difference]: Without dead ends: 87 [2019-01-01 20:34:33,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4096 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=2413, Invalid=10243, Unknown=0, NotChecked=0, Total=12656 [2019-01-01 20:34:33,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-01 20:34:33,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2019-01-01 20:34:33,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-01 20:34:33,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2019-01-01 20:34:33,474 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 78 [2019-01-01 20:34:33,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:33,474 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2019-01-01 20:34:33,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-01 20:34:33,474 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2019-01-01 20:34:33,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-01 20:34:33,475 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:33,475 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:33,475 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:33,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:33,476 INFO L82 PathProgramCache]: Analyzing trace with hash 145436095, now seen corresponding path program 1 times [2019-01-01 20:34:33,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:33,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:33,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:33,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:33,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:33,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:33,591 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-01-01 20:34:33,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:33,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 20:34:33,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 20:34:33,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 20:34:33,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 20:34:33,593 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 4 states. [2019-01-01 20:34:33,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:33,649 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2019-01-01 20:34:33,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 20:34:33,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-01-01 20:34:33,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:33,651 INFO L225 Difference]: With dead ends: 84 [2019-01-01 20:34:33,651 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 20:34:33,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 20:34:33,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 20:34:33,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 20:34:33,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 20:34:33,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 20:34:33,653 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2019-01-01 20:34:33,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:33,653 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 20:34:33,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 20:34:33,653 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 20:34:33,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 20:34:33,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-01 20:34:33,799 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 30 [2019-01-01 20:34:33,803 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-01 20:34:33,804 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2019-01-01 20:34:33,804 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 13) no Hoare annotation was computed. [2019-01-01 20:34:33,804 INFO L448 ceAbstractionStarter]: For program point L17(lines 17 19) no Hoare annotation was computed. [2019-01-01 20:34:33,804 INFO L448 ceAbstractionStarter]: For program point L17-2(lines 10 21) no Hoare annotation was computed. [2019-01-01 20:34:33,804 INFO L448 ceAbstractionStarter]: For program point L17-3(lines 17 19) no Hoare annotation was computed. [2019-01-01 20:34:33,804 INFO L448 ceAbstractionStarter]: For program point L13-2(lines 13 15) no Hoare annotation was computed. [2019-01-01 20:34:33,804 INFO L448 ceAbstractionStarter]: For program point L13-3(line 13) no Hoare annotation was computed. [2019-01-01 20:34:33,804 INFO L448 ceAbstractionStarter]: For program point L13-4(line 13) no Hoare annotation was computed. [2019-01-01 20:34:33,805 INFO L444 ceAbstractionStarter]: At program point L13-5(lines 13 15) the Hoare annotation is: (let ((.cse1 (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0.base|) (+ |ULTIMATE.start_main_~#a~0.offset| 12)) 2147483647)) (.cse0 (= |ULTIMATE.start_main_~#a~0.offset| 0))) (or (and .cse0 (<= 5 ULTIMATE.start_main_~i~0) .cse1) (and .cse0 (= ULTIMATE.start_main_~i~0 1)) (and .cse0 (= ULTIMATE.start_main_~i~0 0)) (and .cse0 (= ULTIMATE.start_main_~i~0 4) .cse1) (and .cse0 (= ULTIMATE.start_main_~i~0 3)) (and .cse0 (= ULTIMATE.start_main_~i~0 2)))) [2019-01-01 20:34:33,805 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-01 20:34:33,805 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2019-01-01 20:34:33,805 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-01 20:34:33,805 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-01 20:34:33,805 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 13) no Hoare annotation was computed. [2019-01-01 20:34:33,806 INFO L451 ceAbstractionStarter]: At program point L20(lines 10 21) the Hoare annotation is: true [2019-01-01 20:34:33,810 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2019-01-01 20:34:33,811 INFO L448 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. [2019-01-01 20:34:33,819 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 20:34:33,820 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 20:34:33,825 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 20:34:33,825 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 20:34:33,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 08:34:33 BoogieIcfgContainer [2019-01-01 20:34:33,828 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 20:34:33,828 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 20:34:33,828 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 20:34:33,828 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 20:34:33,829 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:34:03" (3/4) ... [2019-01-01 20:34:33,833 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 20:34:33,843 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-01 20:34:33,844 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-01 20:34:33,844 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-01 20:34:33,885 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 20:34:33,885 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 20:34:33,886 INFO L168 Benchmark]: Toolchain (without parser) took 31521.57 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 386.4 MB). Free memory was 944.6 MB in the beginning and 1.3 GB in the end (delta: -348.8 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2019-01-01 20:34:33,887 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:34:33,888 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.05 ms. Allocated memory is still 1.0 GB. Free memory was 944.6 MB in the beginning and 932.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-01-01 20:34:33,888 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.89 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:34:33,888 INFO L168 Benchmark]: Boogie Preprocessor took 36.47 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-01 20:34:33,890 INFO L168 Benchmark]: RCFGBuilder took 504.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -205.3 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-01 20:34:33,891 INFO L168 Benchmark]: TraceAbstraction took 30538.08 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 230.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -161.6 MB). Peak memory consumption was 68.5 MB. Max. memory is 11.5 GB. [2019-01-01 20:34:33,892 INFO L168 Benchmark]: Witness Printer took 56.77 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 646.1 kB). Peak memory consumption was 646.1 kB. Max. memory is 11.5 GB. [2019-01-01 20:34:33,897 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 337.05 ms. Allocated memory is still 1.0 GB. Free memory was 944.6 MB in the beginning and 932.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.89 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.47 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 504.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -205.3 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30538.08 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 230.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -161.6 MB). Peak memory consumption was 68.5 MB. Max. memory is 11.5 GB. * Witness Printer took 56.77 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 646.1 kB). Peak memory consumption was 646.1 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant [2019-01-01 20:34:33,904 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 20:34:33,911 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 20:34:33,912 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 20:34:33,912 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((a == 0 && 5 <= i) && unknown-#memory_int-unknown[a][a + 12] <= 2147483647) || (a == 0 && i == 1)) || (a == 0 && i == 0)) || ((a == 0 && i == 4) && unknown-#memory_int-unknown[a][a + 12] <= 2147483647)) || (a == 0 && i == 3)) || (a == 0 && i == 2) - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 4 error locations. SAFE Result, 30.4s OverallTime, 22 OverallIterations, 19 TraceHistogramMax, 10.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 196 SDtfs, 717 SDslu, 2470 SDs, 0 SdLazy, 3564 SolverSat, 114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1387 GetRequests, 744 SyntacticMatches, 5 SemanticMatches, 638 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7622 ImplicationChecksByTransitivity, 18.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 55 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 22 NumberOfFragments, 62 HoareAnnotationTreeSize, 2 FomulaSimplifications, 176 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 165 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 16.7s InterpolantComputationTime, 1701 NumberOfCodeBlocks, 1697 NumberOfCodeBlocksAsserted, 142 NumberOfCheckSat, 1660 ConstructedInterpolants, 0 QuantifiedInterpolants, 316804 SizeOfPredicates, 194 NumberOfNonLiveVariables, 2167 ConjunctsInSsa, 410 ConjunctsInUnsatCore, 41 InterpolantComputations, 4 PerfectInterpolantSequences, 788/8808 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...