./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-crafted/Benghazi_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/Benghazi_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 2b89ce5b96ce55081609675201b2a9a116c2941a .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:05,879 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 20:34:05,881 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 20:34:05,894 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 20:34:05,895 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 20:34:05,896 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 20:34:05,897 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 20:34:05,899 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 20:34:05,900 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 20:34:05,901 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 20:34:05,902 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 20:34:05,902 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 20:34:05,903 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 20:34:05,904 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 20:34:05,905 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 20:34:05,906 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 20:34:05,907 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 20:34:05,909 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 20:34:05,911 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 20:34:05,913 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 20:34:05,914 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 20:34:05,915 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 20:34:05,917 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 20:34:05,918 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 20:34:05,918 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 20:34:05,919 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 20:34:05,920 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 20:34:05,920 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 20:34:05,921 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 20:34:05,922 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 20:34:05,923 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 20:34:05,923 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 20:34:05,924 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 20:34:05,924 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 20:34:05,925 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 20:34:05,926 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 20:34:05,926 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:05,943 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 20:34:05,943 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 20:34:05,944 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 20:34:05,944 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 20:34:05,945 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 20:34:05,945 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 20:34:05,945 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 20:34:05,945 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 20:34:05,945 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 20:34:05,946 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 20:34:05,946 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 20:34:05,946 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 20:34:05,946 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-01 20:34:05,946 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 20:34:05,946 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 20:34:05,947 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 20:34:05,947 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 20:34:05,947 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 20:34:05,947 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 20:34:05,947 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 20:34:05,948 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 20:34:05,948 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 20:34:05,948 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 20:34:05,948 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 20:34:05,948 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 20:34:05,948 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 20:34:05,949 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 20:34:05,949 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 -> 2b89ce5b96ce55081609675201b2a9a116c2941a [2019-01-01 20:34:06,010 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 20:34:06,026 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 20:34:06,032 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 20:34:06,033 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 20:34:06,034 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 20:34:06,035 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted/Benghazi_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-01 20:34:06,104 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71f473f3e/f53c98f0921f47d7aeef64efdcaea7fa/FLAG6b8ca16ea [2019-01-01 20:34:06,603 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 20:34:06,603 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted/Benghazi_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-01 20:34:06,609 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71f473f3e/f53c98f0921f47d7aeef64efdcaea7fa/FLAG6b8ca16ea [2019-01-01 20:34:06,951 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71f473f3e/f53c98f0921f47d7aeef64efdcaea7fa [2019-01-01 20:34:06,954 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 20:34:06,956 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 20:34:06,957 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 20:34:06,957 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 20:34:06,961 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 20:34:06,962 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:34:06" (1/1) ... [2019-01-01 20:34:06,966 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a02a51d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:06, skipping insertion in model container [2019-01-01 20:34:06,967 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:34:06" (1/1) ... [2019-01-01 20:34:06,977 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 20:34:06,996 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 20:34:07,156 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:34:07,160 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 20:34:07,177 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:34:07,191 INFO L195 MainTranslator]: Completed translation [2019-01-01 20:34:07,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:07 WrapperNode [2019-01-01 20:34:07,192 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 20:34:07,193 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 20:34:07,193 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 20:34:07,193 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 20:34:07,203 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:07" (1/1) ... [2019-01-01 20:34:07,209 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:07" (1/1) ... [2019-01-01 20:34:07,230 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 20:34:07,231 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 20:34:07,231 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 20:34:07,231 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 20:34:07,242 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:07" (1/1) ... [2019-01-01 20:34:07,243 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:07" (1/1) ... [2019-01-01 20:34:07,243 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:07" (1/1) ... [2019-01-01 20:34:07,243 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:07" (1/1) ... [2019-01-01 20:34:07,246 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:07" (1/1) ... [2019-01-01 20:34:07,251 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:07" (1/1) ... [2019-01-01 20:34:07,252 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:07" (1/1) ... [2019-01-01 20:34:07,253 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 20:34:07,254 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 20:34:07,254 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 20:34:07,254 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 20:34:07,255 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:07" (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:07,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 20:34:07,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 20:34:07,636 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 20:34:07,637 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 20:34:07,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:34:07 BoogieIcfgContainer [2019-01-01 20:34:07,638 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 20:34:07,639 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 20:34:07,639 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 20:34:07,655 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 20:34:07,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 08:34:06" (1/3) ... [2019-01-01 20:34:07,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24aa4694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:34:07, skipping insertion in model container [2019-01-01 20:34:07,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:07" (2/3) ... [2019-01-01 20:34:07,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24aa4694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:34:07, skipping insertion in model container [2019-01-01 20:34:07,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:34:07" (3/3) ... [2019-01-01 20:34:07,664 INFO L112 eAbstractionObserver]: Analyzing ICFG Benghazi_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-01 20:34:07,679 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 20:34:07,691 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-01-01 20:34:07,713 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-01-01 20:34:07,756 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 20:34:07,757 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 20:34:07,757 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 20:34:07,757 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 20:34:07,757 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 20:34:07,757 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 20:34:07,758 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 20:34:07,758 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 20:34:07,758 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 20:34:07,782 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-01-01 20:34:07,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-01 20:34:07,789 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:07,790 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-01 20:34:07,792 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:07,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:07,800 INFO L82 PathProgramCache]: Analyzing trace with hash 31073, now seen corresponding path program 1 times [2019-01-01 20:34:07,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:07,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:07,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:07,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:07,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:07,980 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:07,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:07,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-01 20:34:07,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:34:07,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:34:07,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:34:08,001 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2019-01-01 20:34:08,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:08,100 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-01-01 20:34:08,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:34:08,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-01 20:34:08,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:08,111 INFO L225 Difference]: With dead ends: 30 [2019-01-01 20:34:08,112 INFO L226 Difference]: Without dead ends: 17 [2019-01-01 20:34:08,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:34:08,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-01 20:34:08,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-01-01 20:34:08,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-01 20:34:08,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-01-01 20:34:08,153 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 3 [2019-01-01 20:34:08,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:08,153 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-01-01 20:34:08,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:34:08,154 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-01-01 20:34:08,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-01 20:34:08,154 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:08,154 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-01 20:34:08,155 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:08,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:08,155 INFO L82 PathProgramCache]: Analyzing trace with hash 963307, now seen corresponding path program 1 times [2019-01-01 20:34:08,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:08,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:08,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:08,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:08,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:08,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:08,215 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:08,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:08,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 20:34:08,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 20:34:08,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 20:34:08,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 20:34:08,218 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 4 states. [2019-01-01 20:34:08,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:08,293 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-01-01 20:34:08,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 20:34:08,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-01 20:34:08,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:08,295 INFO L225 Difference]: With dead ends: 22 [2019-01-01 20:34:08,295 INFO L226 Difference]: Without dead ends: 21 [2019-01-01 20:34:08,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:08,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-01 20:34:08,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2019-01-01 20:34:08,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-01 20:34:08,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-01-01 20:34:08,300 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 4 [2019-01-01 20:34:08,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:08,300 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-01-01 20:34:08,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 20:34:08,301 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-01-01 20:34:08,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-01 20:34:08,301 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:08,301 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-01 20:34:08,302 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:08,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:08,302 INFO L82 PathProgramCache]: Analyzing trace with hash 29862563, now seen corresponding path program 1 times [2019-01-01 20:34:08,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:08,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:08,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:08,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:08,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:08,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:08,353 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:08,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:08,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-01 20:34:08,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:34:08,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:34:08,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:34:08,354 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 3 states. [2019-01-01 20:34:08,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:08,380 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-01-01 20:34:08,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:34:08,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-01-01 20:34:08,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:08,382 INFO L225 Difference]: With dead ends: 24 [2019-01-01 20:34:08,383 INFO L226 Difference]: Without dead ends: 23 [2019-01-01 20:34:08,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:34:08,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-01 20:34:08,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2019-01-01 20:34:08,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-01 20:34:08,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-01-01 20:34:08,387 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 5 [2019-01-01 20:34:08,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:08,387 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-01-01 20:34:08,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:34:08,387 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-01-01 20:34:08,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-01 20:34:08,388 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:08,388 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-01 20:34:08,388 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:08,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:08,389 INFO L82 PathProgramCache]: Analyzing trace with hash 925739501, now seen corresponding path program 1 times [2019-01-01 20:34:08,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:08,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:08,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:08,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:08,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:08,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:08,447 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:08,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:08,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-01 20:34:08,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:34:08,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:34:08,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:34:08,449 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 3 states. [2019-01-01 20:34:08,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:08,500 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-01-01 20:34:08,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:34:08,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-01-01 20:34:08,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:08,502 INFO L225 Difference]: With dead ends: 24 [2019-01-01 20:34:08,502 INFO L226 Difference]: Without dead ends: 23 [2019-01-01 20:34:08,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:34:08,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-01 20:34:08,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2019-01-01 20:34:08,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-01 20:34:08,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-01-01 20:34:08,508 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 6 [2019-01-01 20:34:08,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:08,508 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-01-01 20:34:08,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:34:08,509 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-01-01 20:34:08,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-01 20:34:08,510 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:08,510 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:08,511 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:08,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:08,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1366846491, now seen corresponding path program 1 times [2019-01-01 20:34:08,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:08,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:08,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:08,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:08,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:08,596 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:08,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:08,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 20:34:08,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 20:34:08,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 20:34:08,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 20:34:08,598 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 4 states. [2019-01-01 20:34:08,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:08,780 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-01-01 20:34:08,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 20:34:08,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-01-01 20:34:08,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:08,782 INFO L225 Difference]: With dead ends: 27 [2019-01-01 20:34:08,782 INFO L226 Difference]: Without dead ends: 26 [2019-01-01 20:34:08,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:08,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-01 20:34:08,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2019-01-01 20:34:08,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-01 20:34:08,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-01-01 20:34:08,789 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 7 [2019-01-01 20:34:08,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:08,790 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-01-01 20:34:08,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 20:34:08,790 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-01-01 20:34:08,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-01 20:34:08,790 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:08,792 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:08,792 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:08,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:08,794 INFO L82 PathProgramCache]: Analyzing trace with hash 577431791, now seen corresponding path program 1 times [2019-01-01 20:34:08,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:08,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:08,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:08,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:08,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:08,866 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:08,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:08,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 20:34:08,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 20:34:08,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 20:34:08,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 20:34:08,868 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 4 states. [2019-01-01 20:34:08,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:08,987 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-01-01 20:34:08,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 20:34:08,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-01-01 20:34:08,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:08,989 INFO L225 Difference]: With dead ends: 27 [2019-01-01 20:34:08,989 INFO L226 Difference]: Without dead ends: 26 [2019-01-01 20:34:08,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:08,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-01 20:34:08,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2019-01-01 20:34:08,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-01 20:34:08,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-01-01 20:34:08,995 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 8 [2019-01-01 20:34:08,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:08,995 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-01-01 20:34:08,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 20:34:08,995 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-01-01 20:34:08,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 20:34:08,996 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:08,996 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:08,996 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:08,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:08,997 INFO L82 PathProgramCache]: Analyzing trace with hash 861171249, now seen corresponding path program 1 times [2019-01-01 20:34:08,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:08,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:08,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:08,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:08,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:09,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:09,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:09,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:09,072 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:09,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:09,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:09,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:09,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:09,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:09,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 7 [2019-01-01 20:34:09,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 20:34:09,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 20:34:09,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-01 20:34:09,356 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 9 states. [2019-01-01 20:34:09,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:09,557 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-01-01 20:34:09,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 20:34:09,558 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2019-01-01 20:34:09,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:09,559 INFO L225 Difference]: With dead ends: 30 [2019-01-01 20:34:09,559 INFO L226 Difference]: Without dead ends: 29 [2019-01-01 20:34:09,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-01-01 20:34:09,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-01 20:34:09,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2019-01-01 20:34:09,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-01 20:34:09,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-01-01 20:34:09,564 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 10 [2019-01-01 20:34:09,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:09,564 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-01-01 20:34:09,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 20:34:09,565 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-01-01 20:34:09,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-01 20:34:09,565 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:09,565 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:09,566 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:09,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:09,566 INFO L82 PathProgramCache]: Analyzing trace with hash 926504987, now seen corresponding path program 1 times [2019-01-01 20:34:09,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:09,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:09,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:09,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:09,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:09,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:09,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:09,655 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:09,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:09,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:09,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:10,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:10,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 20:34:10,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 7 [2019-01-01 20:34:10,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 20:34:10,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 20:34:10,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-01-01 20:34:10,059 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 8 states. [2019-01-01 20:34:10,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:10,328 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-01-01 20:34:10,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 20:34:10,328 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-01-01 20:34:10,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:10,329 INFO L225 Difference]: With dead ends: 28 [2019-01-01 20:34:10,330 INFO L226 Difference]: Without dead ends: 27 [2019-01-01 20:34:10,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-01-01 20:34:10,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-01 20:34:10,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2019-01-01 20:34:10,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-01 20:34:10,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-01-01 20:34:10,335 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 11 [2019-01-01 20:34:10,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:10,336 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-01-01 20:34:10,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 20:34:10,336 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-01-01 20:34:10,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-01 20:34:10,337 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:10,337 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:10,337 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:10,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:10,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1343116429, now seen corresponding path program 1 times [2019-01-01 20:34:10,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:10,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:10,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:10,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:10,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:10,383 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:10,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:10,384 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:10,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:10,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:10,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:10,407 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:10,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:10,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-01-01 20:34:10,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:34:10,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:34:10,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:34:10,427 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 5 states. [2019-01-01 20:34:10,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:10,577 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-01-01 20:34:10,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 20:34:10,578 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-01-01 20:34:10,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:10,579 INFO L225 Difference]: With dead ends: 30 [2019-01-01 20:34:10,579 INFO L226 Difference]: Without dead ends: 29 [2019-01-01 20:34:10,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-01 20:34:10,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-01 20:34:10,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2019-01-01 20:34:10,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-01 20:34:10,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-01-01 20:34:10,584 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 12 [2019-01-01 20:34:10,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:10,584 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-01-01 20:34:10,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:34:10,585 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-01-01 20:34:10,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-01 20:34:10,585 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:10,585 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-01 20:34:10,586 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:10,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:10,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1313063709, now seen corresponding path program 1 times [2019-01-01 20:34:10,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:10,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:10,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:10,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:10,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:10,636 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:10,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:10,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 20:34:10,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:34:10,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:34:10,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:34:10,637 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 3 states. [2019-01-01 20:34:10,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:10,676 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-01-01 20:34:10,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:34:10,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-01-01 20:34:10,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:10,677 INFO L225 Difference]: With dead ends: 24 [2019-01-01 20:34:10,678 INFO L226 Difference]: Without dead ends: 23 [2019-01-01 20:34:10,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:34:10,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-01 20:34:10,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-01 20:34:10,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-01 20:34:10,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-01-01 20:34:10,683 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 13 [2019-01-01 20:34:10,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:10,683 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-01-01 20:34:10,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:34:10,683 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-01-01 20:34:10,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-01 20:34:10,684 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:10,684 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-01-01 20:34:10,685 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:10,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:10,685 INFO L82 PathProgramCache]: Analyzing trace with hash 2050269365, now seen corresponding path program 1 times [2019-01-01 20:34:10,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:10,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:10,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:10,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:10,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:10,747 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:10,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:10,748 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:10,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:10,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:10,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:10,775 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:10,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:10,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-01-01 20:34:10,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:34:10,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:34:10,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:34:10,797 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 5 states. [2019-01-01 20:34:10,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:10,935 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-01-01 20:34:10,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 20:34:10,938 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-01-01 20:34:10,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:10,939 INFO L225 Difference]: With dead ends: 31 [2019-01-01 20:34:10,939 INFO L226 Difference]: Without dead ends: 30 [2019-01-01 20:34:10,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-01 20:34:10,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-01 20:34:10,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2019-01-01 20:34:10,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-01 20:34:10,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-01-01 20:34:10,955 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 14 [2019-01-01 20:34:10,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:10,955 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-01-01 20:34:10,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:34:10,955 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-01-01 20:34:10,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-01 20:34:10,956 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:10,956 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1] [2019-01-01 20:34:10,959 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:10,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:10,960 INFO L82 PathProgramCache]: Analyzing trace with hash -866159073, now seen corresponding path program 1 times [2019-01-01 20:34:10,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:10,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:10,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:10,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:10,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:11,200 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:11,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:11,201 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:11,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:11,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:11,271 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:11,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:11,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-01-01 20:34:11,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 20:34:11,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 20:34:11,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:34:11,294 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 7 states. [2019-01-01 20:34:11,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:11,509 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2019-01-01 20:34:11,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 20:34:11,510 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-01-01 20:34:11,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:11,512 INFO L225 Difference]: With dead ends: 35 [2019-01-01 20:34:11,512 INFO L226 Difference]: Without dead ends: 34 [2019-01-01 20:34:11,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-01-01 20:34:11,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-01 20:34:11,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 24. [2019-01-01 20:34:11,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-01 20:34:11,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-01-01 20:34:11,517 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 15 [2019-01-01 20:34:11,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:11,517 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-01-01 20:34:11,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 20:34:11,518 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-01-01 20:34:11,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-01 20:34:11,518 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:11,518 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1] [2019-01-01 20:34:11,519 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:11,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:11,519 INFO L82 PathProgramCache]: Analyzing trace with hash 844787553, now seen corresponding path program 2 times [2019-01-01 20:34:11,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:11,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:11,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:11,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:11,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:11,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:11,659 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:11,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:11,660 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:11,680 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:34:11,716 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:34:11,716 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:11,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:11,946 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:11,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:11,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 13 [2019-01-01 20:34:11,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-01 20:34:11,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-01 20:34:11,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-01-01 20:34:11,969 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 15 states. [2019-01-01 20:34:12,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:12,144 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-01-01 20:34:12,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 20:34:12,145 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2019-01-01 20:34:12,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:12,146 INFO L225 Difference]: With dead ends: 24 [2019-01-01 20:34:12,146 INFO L226 Difference]: Without dead ends: 23 [2019-01-01 20:34:12,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2019-01-01 20:34:12,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-01 20:34:12,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-01 20:34:12,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-01 20:34:12,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-01-01 20:34:12,150 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 17 [2019-01-01 20:34:12,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:12,151 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-01-01 20:34:12,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-01 20:34:12,151 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-01-01 20:34:12,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-01 20:34:12,152 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:12,152 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1] [2019-01-01 20:34:12,153 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:12,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:12,153 INFO L82 PathProgramCache]: Analyzing trace with hash 92020899, now seen corresponding path program 2 times [2019-01-01 20:34:12,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:12,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:12,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:12,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:12,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:12,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:12,224 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:12,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:12,224 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:12,234 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:34:12,251 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:34:12,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:12,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:12,256 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:12,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:12,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-01 20:34:12,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 20:34:12,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 20:34:12,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:34:12,278 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 6 states. [2019-01-01 20:34:12,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:12,389 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-01-01 20:34:12,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 20:34:12,390 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-01-01 20:34:12,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:12,391 INFO L225 Difference]: With dead ends: 33 [2019-01-01 20:34:12,391 INFO L226 Difference]: Without dead ends: 32 [2019-01-01 20:34:12,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-01-01 20:34:12,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-01 20:34:12,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2019-01-01 20:34:12,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-01 20:34:12,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-01-01 20:34:12,396 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 19 [2019-01-01 20:34:12,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:12,396 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-01-01 20:34:12,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 20:34:12,396 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-01-01 20:34:12,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-01 20:34:12,397 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:12,397 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1] [2019-01-01 20:34:12,398 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:12,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:12,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1762227739, now seen corresponding path program 2 times [2019-01-01 20:34:12,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:12,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:12,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:12,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:12,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:12,504 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:12,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:12,504 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:12,515 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:34:12,524 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:34:12,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:12,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:12,530 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:12,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:12,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-01 20:34:12,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 20:34:12,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 20:34:12,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:34:12,551 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 7 states. [2019-01-01 20:34:12,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:12,699 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-01-01 20:34:12,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 20:34:12,700 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-01-01 20:34:12,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:12,701 INFO L225 Difference]: With dead ends: 35 [2019-01-01 20:34:12,701 INFO L226 Difference]: Without dead ends: 34 [2019-01-01 20:34:12,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-01-01 20:34:12,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-01 20:34:12,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2019-01-01 20:34:12,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-01 20:34:12,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-01-01 20:34:12,706 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 21 [2019-01-01 20:34:12,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:12,706 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-01-01 20:34:12,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 20:34:12,706 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-01-01 20:34:12,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-01 20:34:12,707 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:12,707 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1] [2019-01-01 20:34:12,708 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:12,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:12,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1536395917, now seen corresponding path program 3 times [2019-01-01 20:34:12,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:12,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:12,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:12,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:12,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:12,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:12,832 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:12,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:12,833 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:12,844 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:34:12,877 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-01 20:34:12,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:12,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:13,001 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:13,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:13,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 13 [2019-01-01 20:34:13,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-01 20:34:13,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-01 20:34:13,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-01-01 20:34:13,022 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 15 states. [2019-01-01 20:34:13,897 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-01 20:34:14,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:14,104 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-01-01 20:34:14,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 20:34:14,105 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2019-01-01 20:34:14,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:14,106 INFO L225 Difference]: With dead ends: 40 [2019-01-01 20:34:14,106 INFO L226 Difference]: Without dead ends: 39 [2019-01-01 20:34:14,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-01-01 20:34:14,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-01 20:34:14,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2019-01-01 20:34:14,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-01 20:34:14,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-01-01 20:34:14,113 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 26 [2019-01-01 20:34:14,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:14,114 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-01-01 20:34:14,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-01 20:34:14,114 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-01-01 20:34:14,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-01 20:34:14,115 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:14,115 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 1, 1] [2019-01-01 20:34:14,115 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:14,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:14,116 INFO L82 PathProgramCache]: Analyzing trace with hash 992275125, now seen corresponding path program 3 times [2019-01-01 20:34:14,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:14,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:14,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:14,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:14,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:14,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:14,208 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:14,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:14,209 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:14,229 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:34:14,299 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-01 20:34:14,300 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:14,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:14,452 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:14,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:14,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 13 [2019-01-01 20:34:14,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-01 20:34:14,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-01 20:34:14,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-01-01 20:34:14,475 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 15 states. [2019-01-01 20:34:14,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:14,946 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2019-01-01 20:34:14,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 20:34:14,947 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2019-01-01 20:34:14,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:14,949 INFO L225 Difference]: With dead ends: 58 [2019-01-01 20:34:14,949 INFO L226 Difference]: Without dead ends: 56 [2019-01-01 20:34:14,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=189, Invalid=513, Unknown=0, NotChecked=0, Total=702 [2019-01-01 20:34:14,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-01 20:34:14,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2019-01-01 20:34:14,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-01 20:34:14,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-01-01 20:34:14,956 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 28 [2019-01-01 20:34:14,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:14,957 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-01-01 20:34:14,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-01 20:34:14,957 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-01-01 20:34:14,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-01 20:34:14,958 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:14,958 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 1, 1] [2019-01-01 20:34:14,958 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:14,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:14,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1564327795, now seen corresponding path program 4 times [2019-01-01 20:34:14,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:14,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:14,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:14,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:14,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:14,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:15,132 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:15,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:15,132 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:15,154 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 20:34:15,171 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 20:34:15,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:15,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:15,180 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:15,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:15,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-01 20:34:15,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 20:34:15,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 20:34:15,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-01-01 20:34:15,202 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 11 states. [2019-01-01 20:34:15,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:15,544 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-01-01 20:34:15,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 20:34:15,545 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40 [2019-01-01 20:34:15,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:15,545 INFO L225 Difference]: With dead ends: 53 [2019-01-01 20:34:15,546 INFO L226 Difference]: Without dead ends: 52 [2019-01-01 20:34:15,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2019-01-01 20:34:15,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-01 20:34:15,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-01-01 20:34:15,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-01 20:34:15,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-01-01 20:34:15,552 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 40 [2019-01-01 20:34:15,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:15,553 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-01-01 20:34:15,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 20:34:15,553 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-01-01 20:34:15,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-01 20:34:15,554 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:15,555 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 1, 1] [2019-01-01 20:34:15,555 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:15,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:15,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1573811037, now seen corresponding path program 5 times [2019-01-01 20:34:15,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:15,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:15,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:15,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:15,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:15,712 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:15,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:15,713 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:15,723 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 20:34:15,787 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-01-01 20:34:15,787 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:15,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:15,801 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:15,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:15,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-01 20:34:15,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 20:34:15,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 20:34:15,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-01-01 20:34:15,824 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 12 states. [2019-01-01 20:34:16,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:16,326 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-01-01 20:34:16,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 20:34:16,327 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2019-01-01 20:34:16,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:16,328 INFO L225 Difference]: With dead ends: 61 [2019-01-01 20:34:16,328 INFO L226 Difference]: Without dead ends: 60 [2019-01-01 20:34:16,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2019-01-01 20:34:16,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-01 20:34:16,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2019-01-01 20:34:16,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-01 20:34:16,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-01-01 20:34:16,337 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 47 [2019-01-01 20:34:16,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:16,337 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-01-01 20:34:16,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 20:34:16,337 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-01-01 20:34:16,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-01 20:34:16,338 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:16,338 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 1, 1] [2019-01-01 20:34:16,339 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:16,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:16,339 INFO L82 PathProgramCache]: Analyzing trace with hash -603916827, now seen corresponding path program 4 times [2019-01-01 20:34:16,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:16,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:16,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:16,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:16,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:16,488 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:16,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:16,489 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:16,499 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 20:34:16,520 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 20:34:16,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:16,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:16,532 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:16,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:16,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-01-01 20:34:16,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-01 20:34:16,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 20:34:16,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-01-01 20:34:16,553 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 13 states. [2019-01-01 20:34:16,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:16,882 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-01-01 20:34:16,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 20:34:16,883 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 49 [2019-01-01 20:34:16,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:16,884 INFO L225 Difference]: With dead ends: 63 [2019-01-01 20:34:16,884 INFO L226 Difference]: Without dead ends: 62 [2019-01-01 20:34:16,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=374, Unknown=0, NotChecked=0, Total=552 [2019-01-01 20:34:16,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-01 20:34:16,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2019-01-01 20:34:16,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-01 20:34:16,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-01-01 20:34:16,893 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 49 [2019-01-01 20:34:16,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:16,893 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-01-01 20:34:16,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-01 20:34:16,894 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-01-01 20:34:16,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-01 20:34:16,896 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:16,896 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 1, 1] [2019-01-01 20:34:16,896 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:16,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:16,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1090881907, now seen corresponding path program 6 times [2019-01-01 20:34:16,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:16,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:16,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:16,901 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:16,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:16,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:17,270 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:17,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:17,270 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:17,281 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 20:34:17,332 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-01-01 20:34:17,332 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:17,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:18,083 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 54 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:18,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:18,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 31 [2019-01-01 20:34:18,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-01 20:34:18,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-01 20:34:18,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=949, Unknown=0, NotChecked=0, Total=1056 [2019-01-01 20:34:18,107 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 33 states. [2019-01-01 20:34:19,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:19,776 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2019-01-01 20:34:19,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-01 20:34:19,777 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 54 [2019-01-01 20:34:19,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:19,778 INFO L225 Difference]: With dead ends: 67 [2019-01-01 20:34:19,779 INFO L226 Difference]: Without dead ends: 66 [2019-01-01 20:34:19,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=493, Invalid=2057, Unknown=0, NotChecked=0, Total=2550 [2019-01-01 20:34:19,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-01 20:34:19,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2019-01-01 20:34:19,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-01 20:34:19,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-01-01 20:34:19,786 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2019-01-01 20:34:19,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:19,786 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-01-01 20:34:19,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-01 20:34:19,786 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-01-01 20:34:19,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-01 20:34:19,787 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:19,787 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 1, 1] [2019-01-01 20:34:19,788 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:19,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:19,788 INFO L82 PathProgramCache]: Analyzing trace with hash 365493941, now seen corresponding path program 5 times [2019-01-01 20:34:19,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:19,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:19,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:19,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:19,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:19,966 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:19,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:19,966 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:19,978 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 20:34:20,003 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-01-01 20:34:20,003 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:20,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:20,023 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:20,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:20,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-01-01 20:34:20,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-01 20:34:20,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-01 20:34:20,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-01-01 20:34:20,047 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 14 states. [2019-01-01 20:34:20,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:20,285 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-01-01 20:34:20,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 20:34:20,289 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2019-01-01 20:34:20,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:20,290 INFO L225 Difference]: With dead ends: 69 [2019-01-01 20:34:20,290 INFO L226 Difference]: Without dead ends: 68 [2019-01-01 20:34:20,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=208, Invalid=442, Unknown=0, NotChecked=0, Total=650 [2019-01-01 20:34:20,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-01 20:34:20,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2019-01-01 20:34:20,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-01 20:34:20,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-01-01 20:34:20,300 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 56 [2019-01-01 20:34:20,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:20,300 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-01-01 20:34:20,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-01 20:34:20,300 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-01-01 20:34:20,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-01 20:34:20,301 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:20,301 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 1, 1] [2019-01-01 20:34:20,302 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:20,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:20,302 INFO L82 PathProgramCache]: Analyzing trace with hash 995912677, now seen corresponding path program 6 times [2019-01-01 20:34:20,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:20,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:20,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:20,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:20,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:20,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:20,647 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 244 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:20,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:20,648 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:20,666 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 20:34:20,693 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-01-01 20:34:20,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:20,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:20,708 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 244 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:20,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:20,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-01-01 20:34:20,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-01 20:34:20,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-01 20:34:20,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-01-01 20:34:20,738 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 16 states. [2019-01-01 20:34:21,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:21,312 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-01-01 20:34:21,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-01 20:34:21,314 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 63 [2019-01-01 20:34:21,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:21,315 INFO L225 Difference]: With dead ends: 76 [2019-01-01 20:34:21,315 INFO L226 Difference]: Without dead ends: 75 [2019-01-01 20:34:21,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=275, Invalid=595, Unknown=0, NotChecked=0, Total=870 [2019-01-01 20:34:21,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-01 20:34:21,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2019-01-01 20:34:21,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-01 20:34:21,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-01-01 20:34:21,325 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 63 [2019-01-01 20:34:21,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:21,327 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-01-01 20:34:21,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-01 20:34:21,327 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-01-01 20:34:21,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-01 20:34:21,328 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:21,328 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 1, 1] [2019-01-01 20:34:21,330 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:21,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:21,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1799567179, now seen corresponding path program 7 times [2019-01-01 20:34:21,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:21,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:21,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:21,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:21,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:21,605 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:21,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:21,606 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,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:21,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:21,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:21,665 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:21,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:21,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2019-01-01 20:34:21,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-01 20:34:21,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-01 20:34:21,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-01-01 20:34:21,688 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 17 states. [2019-01-01 20:34:22,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:22,050 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-01-01 20:34:22,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-01 20:34:22,051 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 70 [2019-01-01 20:34:22,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:22,053 INFO L225 Difference]: With dead ends: 83 [2019-01-01 20:34:22,053 INFO L226 Difference]: Without dead ends: 82 [2019-01-01 20:34:22,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=312, Invalid=680, Unknown=0, NotChecked=0, Total=992 [2019-01-01 20:34:22,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-01 20:34:22,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2019-01-01 20:34:22,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-01 20:34:22,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-01-01 20:34:22,063 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 70 [2019-01-01 20:34:22,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:22,063 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-01-01 20:34:22,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-01 20:34:22,065 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-01-01 20:34:22,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-01 20:34:22,065 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:22,065 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 1, 1] [2019-01-01 20:34:22,066 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:22,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:22,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1114726885, now seen corresponding path program 8 times [2019-01-01 20:34:22,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:22,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:22,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:22,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:22,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:22,291 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 0 proven. 375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:22,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:22,292 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,308 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:34:22,331 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:34:22,332 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:22,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:22,343 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 0 proven. 375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:22,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:22,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2019-01-01 20:34:22,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-01 20:34:22,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-01 20:34:22,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-01-01 20:34:22,363 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 19 states. [2019-01-01 20:34:22,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:22,753 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-01-01 20:34:22,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-01 20:34:22,755 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 77 [2019-01-01 20:34:22,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:22,756 INFO L225 Difference]: With dead ends: 90 [2019-01-01 20:34:22,756 INFO L226 Difference]: Without dead ends: 89 [2019-01-01 20:34:22,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=393, Invalid=867, Unknown=0, NotChecked=0, Total=1260 [2019-01-01 20:34:22,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-01 20:34:22,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2019-01-01 20:34:22,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-01 20:34:22,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-01-01 20:34:22,763 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 77 [2019-01-01 20:34:22,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:22,764 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-01-01 20:34:22,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-01 20:34:22,764 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-01-01 20:34:22,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-01 20:34:22,764 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:22,765 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 11, 1, 1] [2019-01-01 20:34:22,765 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:22,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:22,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1874390347, now seen corresponding path program 9 times [2019-01-01 20:34:22,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:22,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:22,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:22,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:22,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:23,446 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:23,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:23,446 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:23,456 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:34:23,486 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-01-01 20:34:23,486 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:23,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:40,472 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~d1old~0 Int) (v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse0 (* 2 ULTIMATE.start_main_~d1old~0)) (.cse1 (* 2 v_prenex_1))) (and (<= (+ .cse0 v_prenex_1) 2147483645) (<= (+ ULTIMATE.start_main_~d1old~0 v_prenex_2 v_prenex_1) 2147483641) (<= ULTIMATE.start_main_~d1old~0 (+ v_prenex_2 .cse1 4294967286)) (<= .cse0 (+ (* 2 v_prenex_2) .cse1 4294967290)) (<= c_ULTIMATE.start_main_~d2~0 (+ ULTIMATE.start_main_~d1old~0 1))))) is different from true [2019-01-01 20:34:41,042 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 145 proven. 288 refuted. 0 times theorem prover too weak. 9 trivial. 9 not checked. [2019-01-01 20:34:41,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:41,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 28] total 46 [2019-01-01 20:34:41,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-01 20:34:41,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-01 20:34:41,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1911, Unknown=8, NotChecked=88, Total=2162 [2019-01-01 20:34:41,078 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 47 states. [2019-01-01 20:34:41,579 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 30 [2019-01-01 20:34:41,884 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 31 [2019-01-01 20:34:54,400 WARN L181 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-01-01 20:34:58,680 WARN L181 SmtUtils]: Spent 3.81 s on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-01-01 20:35:04,175 WARN L181 SmtUtils]: Spent 5.36 s on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-01-01 20:35:07,477 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-01-01 20:35:09,707 WARN L181 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 65 [2019-01-01 20:35:12,951 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-01-01 20:35:13,998 WARN L181 SmtUtils]: Spent 814.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-01-01 20:35:16,839 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-01-01 20:35:17,264 WARN L181 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-01-01 20:35:20,729 WARN L181 SmtUtils]: Spent 3.06 s on a formula simplification. DAG size of input: 87 DAG size of output: 45 [2019-01-01 20:35:24,030 WARN L181 SmtUtils]: Spent 3.13 s on a formula simplification. DAG size of input: 87 DAG size of output: 51 [2019-01-01 20:35:27,788 WARN L181 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 97 DAG size of output: 65 [2019-01-01 20:35:35,700 WARN L181 SmtUtils]: Spent 7.34 s on a formula simplification. DAG size of input: 104 DAG size of output: 71 [2019-01-01 20:35:42,715 WARN L181 SmtUtils]: Spent 6.90 s on a formula simplification. DAG size of input: 113 DAG size of output: 68 [2019-01-01 20:35:50,361 WARN L181 SmtUtils]: Spent 7.54 s on a formula simplification. DAG size of input: 107 DAG size of output: 70 [2019-01-01 20:36:04,472 WARN L181 SmtUtils]: Spent 13.08 s on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2019-01-01 20:36:14,037 WARN L181 SmtUtils]: Spent 8.54 s on a formula simplification that was a NOOP. DAG size: 127 [2019-01-01 20:36:31,183 WARN L181 SmtUtils]: Spent 12.68 s on a formula simplification. DAG size of input: 119 DAG size of output: 104 [2019-01-01 20:36:49,329 WARN L181 SmtUtils]: Spent 17.01 s on a formula simplification. DAG size of input: 134 DAG size of output: 117 [2019-01-01 20:37:02,360 WARN L181 SmtUtils]: Spent 12.73 s on a formula simplification. DAG size of input: 128 DAG size of output: 89 [2019-01-01 20:37:11,405 WARN L181 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 73 [2019-01-01 20:37:22,514 WARN L181 SmtUtils]: Spent 9.13 s on a formula simplification. DAG size of input: 126 DAG size of output: 108 [2019-01-01 20:37:40,138 WARN L181 SmtUtils]: Spent 12.51 s on a formula simplification. DAG size of input: 118 DAG size of output: 113 [2019-01-01 20:37:58,590 WARN L181 SmtUtils]: Spent 17.46 s on a formula simplification. DAG size of input: 133 DAG size of output: 100 [2019-01-01 20:38:13,819 WARN L181 SmtUtils]: Spent 13.04 s on a formula simplification. DAG size of input: 127 DAG size of output: 88 [2019-01-01 20:38:23,870 WARN L181 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 73 [2019-01-01 20:38:38,164 WARN L181 SmtUtils]: Spent 8.48 s on a formula simplification that was a NOOP. DAG size: 127 [2019-01-01 20:38:54,521 WARN L181 SmtUtils]: Spent 12.74 s on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2019-01-01 20:39:15,482 WARN L181 SmtUtils]: Spent 16.62 s on a formula simplification. DAG size of input: 134 DAG size of output: 117 [2019-01-01 20:39:39,125 WARN L181 SmtUtils]: Spent 19.48 s on a formula simplification. DAG size of input: 128 DAG size of output: 89 [2019-01-01 20:39:48,807 WARN L181 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 103 DAG size of output: 73 [2019-01-01 20:40:01,218 WARN L181 SmtUtils]: Spent 8.50 s on a formula simplification that was a NOOP. DAG size: 126 [2019-01-01 20:40:18,760 WARN L181 SmtUtils]: Spent 13.34 s on a formula simplification. DAG size of input: 118 DAG size of output: 103 [2019-01-01 20:40:36,618 WARN L181 SmtUtils]: Spent 12.69 s on a formula simplification. DAG size of input: 133 DAG size of output: 100 [2019-01-01 20:40:57,420 WARN L181 SmtUtils]: Spent 14.58 s on a formula simplification. DAG size of input: 127 DAG size of output: 88 [2019-01-01 20:41:05,588 WARN L181 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 73 [2019-01-01 20:41:21,776 WARN L181 SmtUtils]: Spent 8.57 s on a formula simplification that was a NOOP. DAG size: 127 [2019-01-01 20:41:44,041 WARN L181 SmtUtils]: Spent 12.72 s on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2019-01-01 20:42:03,561 WARN L181 SmtUtils]: Spent 7.90 s on a formula simplification. DAG size of input: 128 DAG size of output: 101 [2019-01-01 20:42:28,587 WARN L181 SmtUtils]: Spent 16.55 s on a formula simplification. DAG size of input: 128 DAG size of output: 107 [2019-01-01 20:42:37,331 WARN L181 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 73 [2019-01-01 20:42:54,220 WARN L181 SmtUtils]: Spent 8.62 s on a formula simplification that was a NOOP. DAG size: 126 [2019-01-01 20:43:11,145 WARN L181 SmtUtils]: Spent 6.65 s on a formula simplification. DAG size of input: 117 DAG size of output: 102 [2019-01-01 20:43:41,871 WARN L181 SmtUtils]: Spent 18.65 s on a formula simplification. DAG size of input: 126 DAG size of output: 98 [2019-01-01 20:44:06,820 WARN L181 SmtUtils]: Spent 16.54 s on a formula simplification. DAG size of input: 126 DAG size of output: 104 [2019-01-01 20:44:13,297 WARN L181 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 96 DAG size of output: 85 [2019-01-01 20:44:34,289 WARN L181 SmtUtils]: Spent 6.36 s on a formula simplification. DAG size of input: 121 DAG size of output: 112 [2019-01-01 20:45:26,285 WARN L181 SmtUtils]: Spent 22.92 s on a formula simplification. DAG size of input: 123 DAG size of output: 110 [2019-01-01 20:46:06,707 WARN L181 SmtUtils]: Spent 27.26 s on a formula simplification. DAG size of input: 132 DAG size of output: 106 [2019-01-01 20:46:30,217 WARN L181 SmtUtils]: Spent 14.64 s on a formula simplification. DAG size of input: 126 DAG size of output: 104 [2019-01-01 20:46:40,430 WARN L181 SmtUtils]: Spent 709.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-01-01 20:46:52,793 WARN L181 SmtUtils]: Spent 3.90 s on a formula simplification that was a NOOP. DAG size: 120 [2019-01-01 20:47:19,369 WARN L181 SmtUtils]: Spent 8.17 s on a formula simplification. DAG size of input: 115 DAG size of output: 110 [2019-01-01 20:47:52,593 WARN L181 SmtUtils]: Spent 15.92 s on a formula simplification. DAG size of input: 125 DAG size of output: 114 [2019-01-01 20:48:17,969 WARN L181 SmtUtils]: Spent 11.04 s on a formula simplification. DAG size of input: 119 DAG size of output: 108 [2019-01-01 20:48:21,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:21,995 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2019-01-01 20:48:22,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-01 20:48:22,027 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 84 [2019-01-01 20:48:22,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:22,027 INFO L225 Difference]: With dead ends: 96 [2019-01-01 20:48:22,028 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 20:48:22,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 56 SyntacticMatches, 8 SemanticMatches, 112 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3021 ImplicationChecksByTransitivity, 760.8s TimeCoverageRelationStatistics Valid=2079, Invalid=10477, Unknown=104, NotChecked=222, Total=12882 [2019-01-01 20:48:22,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 20:48:22,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 20:48:22,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 20:48:22,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 20:48:22,032 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 84 [2019-01-01 20:48:22,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:22,033 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 20:48:22,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-01 20:48:22,033 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 20:48:22,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 20:48:22,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-01 20:48:22,229 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 224 [2019-01-01 20:48:33,091 WARN L181 SmtUtils]: Spent 10.84 s on a formula simplification. DAG size of input: 223 DAG size of output: 93 [2019-01-01 20:48:33,095 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-01 20:48:33,095 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-01-01 20:48:33,095 INFO L448 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2019-01-01 20:48:33,095 INFO L448 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2019-01-01 20:48:33,095 INFO L448 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2019-01-01 20:48:33,095 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 23) no Hoare annotation was computed. [2019-01-01 20:48:33,095 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2019-01-01 20:48:33,096 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 25) no Hoare annotation was computed. [2019-01-01 20:48:33,096 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-01 20:48:33,096 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-01 20:48:33,096 INFO L451 ceAbstractionStarter]: At program point L28(lines 16 29) the Hoare annotation is: true [2019-01-01 20:48:33,096 INFO L448 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2019-01-01 20:48:33,096 INFO L448 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2019-01-01 20:48:33,096 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 23) no Hoare annotation was computed. [2019-01-01 20:48:33,102 INFO L444 ceAbstractionStarter]: At program point L22-2(lines 22 27) the Hoare annotation is: (let ((.cse1 (+ ULTIMATE.start_main_~d2~0 ULTIMATE.start_main_~x~0)) (.cse2 (+ ULTIMATE.start_main_~d1old~0 ULTIMATE.start_main_~x~0))) (let ((.cse7 (<= 0 .cse2)) (.cse12 (<= ULTIMATE.start_main_~d1~0 75)) (.cse13 (<= 75 ULTIMATE.start_main_~d1~0)) (.cse20 (<= 74 ULTIMATE.start_main_~d2~0)) (.cse21 (<= ULTIMATE.start_main_~d2~0 74)) (.cse0 (<= 78 ULTIMATE.start_main_~d2~0)) (.cse17 (<= ULTIMATE.start_main_~d2~0 78)) (.cse3 (<= 77 ULTIMATE.start_main_~d1old~0)) (.cse4 (<= 79 ULTIMATE.start_main_~d1~0)) (.cse9 (<= ULTIMATE.start_main_~d1~0 79)) (.cse19 (<= ULTIMATE.start_main_~d1old~0 77)) (.cse10 (<= 75 ULTIMATE.start_main_~d1old~0)) (.cse16 (<= 77 ULTIMATE.start_main_~d1~0)) (.cse11 (<= 76 ULTIMATE.start_main_~d2~0)) (.cse18 (<= ULTIMATE.start_main_~d1~0 77)) (.cse14 (<= ULTIMATE.start_main_~d1old~0 75)) (.cse8 (<= 1 .cse1)) (.cse15 (<= ULTIMATE.start_main_~d2~0 76))) (or (and (and .cse0 (<= .cse1 2147483192) (<= .cse2 2147483191) .cse3 .cse4) (exists ((ULTIMATE.start_main_~d1old~0 Int) (v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse5 (* 2 v_prenex_1)) (.cse6 (* 2 ULTIMATE.start_main_~d1old~0))) (and (<= (+ ULTIMATE.start_main_~d1old~0 ULTIMATE.start_main_~x~0) (+ v_prenex_2 .cse5 4294967286)) (<= (+ ULTIMATE.start_main_~d1old~0 v_prenex_2 v_prenex_1 ULTIMATE.start_main_~x~0) 2147483641) (<= (+ .cse6 ULTIMATE.start_main_~x~0) (+ (* 2 v_prenex_2) .cse5 4294967290)) (<= (+ .cse6 v_prenex_1 ULTIMATE.start_main_~x~0) 2147483645) (<= ULTIMATE.start_main_~d2~0 (+ ULTIMATE.start_main_~d1old~0 1))))) .cse7 (<= ULTIMATE.start_main_~d1old~0 2147483645) .cse8 (<= ULTIMATE.start_main_~d1~0 2147483645)) (and .cse0 (<= ULTIMATE.start_main_~d1old~0 79) .cse3 .cse4 .cse9 (<= ULTIMATE.start_main_~d2~0 80) (<= ULTIMATE.start_main_~x~0 2147483191) .cse7 .cse8) (and .cse10 .cse11 (<= .cse1 2147483575) .cse12 .cse13 .cse14 .cse8 .cse15) (and .cse0 .cse16 .cse17 .cse3 (<= ULTIMATE.start_main_~x~0 2147483347) .cse18 .cse19 .cse8) (and .cse20 (<= 73 ULTIMATE.start_main_~d1old~0) .cse12 .cse21 .cse13 (<= ULTIMATE.start_main_~d1old~0 73) .cse8 (<= .cse2 2147483647)) (and .cse20 (<= 73 ULTIMATE.start_main_~d1~0) (<= ULTIMATE.start_main_~d1~0 73) (<= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~d1~0 2147483574)) .cse21) (and .cse0 (<= ULTIMATE.start_main_~x~0 2147483270) .cse17 .cse3 .cse4 .cse9 .cse19 .cse8) (and .cse10 .cse16 .cse11 .cse18 .cse14 .cse8 .cse15 (<= .cse2 2147483499))))) [2019-01-01 20:48:33,102 INFO L448 ceAbstractionStarter]: For program point L22-3(lines 22 27) no Hoare annotation was computed. [2019-01-01 20:48:33,102 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2019-01-01 20:48:33,105 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 25) no Hoare annotation was computed. [2019-01-01 20:48:33,115 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~d1old~0,QUANTIFIED] [2019-01-01 20:48:33,116 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-01 20:48:33,116 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-01 20:48:33,117 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~d1old~0,QUANTIFIED] [2019-01-01 20:48:33,117 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-01 20:48:33,117 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-01 20:48:33,117 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~d1old~0,QUANTIFIED] [2019-01-01 20:48:33,119 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-01 20:48:33,120 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-01 20:48:33,120 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~d1old~0,QUANTIFIED] [2019-01-01 20:48:33,120 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-01 20:48:33,120 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~d1old~0,QUANTIFIED] [2019-01-01 20:48:33,135 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~d1old~0,QUANTIFIED] [2019-01-01 20:48:33,143 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-01 20:48:33,146 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-01 20:48:33,146 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~d1old~0,QUANTIFIED] [2019-01-01 20:48:33,146 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-01 20:48:33,147 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-01 20:48:33,147 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~d1old~0,QUANTIFIED] [2019-01-01 20:48:33,147 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-01 20:48:33,147 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-01 20:48:33,152 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~d1old~0,QUANTIFIED] [2019-01-01 20:48:33,152 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-01 20:48:33,152 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~d1old~0,QUANTIFIED] [2019-01-01 20:48:33,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 08:48:33 BoogieIcfgContainer [2019-01-01 20:48:33,164 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 20:48:33,164 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 20:48:33,164 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 20:48:33,164 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 20:48:33,165 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:07" (3/4) ... [2019-01-01 20:48:33,171 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 20:48:33,182 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-01 20:48:33,182 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-01 20:48:33,215 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((78 <= d2 && d2 + x <= 2147483192) && d1\old + x <= 2147483191) && 77 <= d1\old) && 79 <= d1) && (\exists ULTIMATE.start_main_~d1\old~0 : int, v_prenex_2 : int, v_prenex_1 : int :: (((ULTIMATE.start_main_~d1\old~0 + x <= v_prenex_2 + 2 * v_prenex_1 + 4294967286 && ULTIMATE.start_main_~d1\old~0 + v_prenex_2 + v_prenex_1 + x <= 2147483641) && 2 * ULTIMATE.start_main_~d1\old~0 + x <= 2 * v_prenex_2 + 2 * v_prenex_1 + 4294967290) && 2 * ULTIMATE.start_main_~d1\old~0 + v_prenex_1 + x <= 2147483645) && d2 <= ULTIMATE.start_main_~d1\old~0 + 1)) && 0 <= d1\old + x) && d1\old <= 2147483645) && 1 <= d2 + x) && d1 <= 2147483645) || ((((((((78 <= d2 && d1\old <= 79) && 77 <= d1\old) && 79 <= d1) && d1 <= 79) && d2 <= 80) && x <= 2147483191) && 0 <= d1\old + x) && 1 <= d2 + x)) || (((((((75 <= d1\old && 76 <= d2) && d2 + x <= 2147483575) && d1 <= 75) && 75 <= d1) && d1\old <= 75) && 1 <= d2 + x) && d2 <= 76)) || (((((((78 <= d2 && 77 <= d1) && d2 <= 78) && 77 <= d1\old) && x <= 2147483347) && d1 <= 77) && d1\old <= 77) && 1 <= d2 + x)) || (((((((74 <= d2 && 73 <= d1\old) && d1 <= 75) && d2 <= 74) && 75 <= d1) && d1\old <= 73) && 1 <= d2 + x) && d1\old + x <= 2147483647)) || ((((74 <= d2 && 73 <= d1) && d1 <= 73) && x <= d1 + 2147483574) && d2 <= 74)) || (((((((78 <= d2 && x <= 2147483270) && d2 <= 78) && 77 <= d1\old) && 79 <= d1) && d1 <= 79) && d1\old <= 77) && 1 <= d2 + x)) || (((((((75 <= d1\old && 77 <= d1) && 76 <= d2) && d1 <= 77) && d1\old <= 75) && 1 <= d2 + x) && d2 <= 76) && d1\old + x <= 2147483499) [2019-01-01 20:48:33,238 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 20:48:33,238 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 20:48:33,239 INFO L168 Benchmark]: Toolchain (without parser) took 866284.27 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 277.3 MB). Free memory was 951.4 MB in the beginning and 1.0 GB in the end (delta: -52.0 MB). Peak memory consumption was 225.3 MB. Max. memory is 11.5 GB. [2019-01-01 20:48:33,240 INFO L168 Benchmark]: CDTParser took 1.08 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:48:33,240 INFO L168 Benchmark]: CACSL2BoogieTranslator took 235.32 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 20:48:33,241 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.66 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:48:33,241 INFO L168 Benchmark]: Boogie Preprocessor took 22.50 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:48:33,241 INFO L168 Benchmark]: RCFGBuilder took 383.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -162.5 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-01-01 20:48:33,243 INFO L168 Benchmark]: TraceAbstraction took 865525.06 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 144.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 90.2 MB). Peak memory consumption was 234.4 MB. Max. memory is 11.5 GB. [2019-01-01 20:48:33,243 INFO L168 Benchmark]: Witness Printer took 74.39 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. [2019-01-01 20:48:33,248 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.08 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 235.32 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.66 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.50 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 383.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -162.5 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 865525.06 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 144.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 90.2 MB). Peak memory consumption was 234.4 MB. Max. memory is 11.5 GB. * Witness Printer took 74.39 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~d1old~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~d1old~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~d1old~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~d1old~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~d1old~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~d1old~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~d1old~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~d1old~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~d1old~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~d1old~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22]: Loop Invariant [2019-01-01 20:48:33,263 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~d1old~0,QUANTIFIED] [2019-01-01 20:48:33,263 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-01 20:48:33,263 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-01 20:48:33,263 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~d1old~0,QUANTIFIED] [2019-01-01 20:48:33,264 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-01 20:48:33,264 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-01 20:48:33,264 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~d1old~0,QUANTIFIED] [2019-01-01 20:48:33,264 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-01 20:48:33,264 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-01 20:48:33,265 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~d1old~0,QUANTIFIED] [2019-01-01 20:48:33,265 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-01 20:48:33,265 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~d1old~0,QUANTIFIED] [2019-01-01 20:48:33,270 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~d1old~0,QUANTIFIED] [2019-01-01 20:48:33,270 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-01 20:48:33,270 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-01 20:48:33,273 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~d1old~0,QUANTIFIED] [2019-01-01 20:48:33,273 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-01 20:48:33,273 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-01 20:48:33,273 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~d1old~0,QUANTIFIED] [2019-01-01 20:48:33,274 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-01 20:48:33,274 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-01 20:48:33,274 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~d1old~0,QUANTIFIED] [2019-01-01 20:48:33,274 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-01 20:48:33,274 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~d1old~0,QUANTIFIED] Derived loop invariant: (((((((((((((((78 <= d2 && d2 + x <= 2147483192) && d1\old + x <= 2147483191) && 77 <= d1\old) && 79 <= d1) && (\exists ULTIMATE.start_main_~d1\old~0 : int, v_prenex_2 : int, v_prenex_1 : int :: (((ULTIMATE.start_main_~d1\old~0 + x <= v_prenex_2 + 2 * v_prenex_1 + 4294967286 && ULTIMATE.start_main_~d1\old~0 + v_prenex_2 + v_prenex_1 + x <= 2147483641) && 2 * ULTIMATE.start_main_~d1\old~0 + x <= 2 * v_prenex_2 + 2 * v_prenex_1 + 4294967290) && 2 * ULTIMATE.start_main_~d1\old~0 + v_prenex_1 + x <= 2147483645) && d2 <= ULTIMATE.start_main_~d1\old~0 + 1)) && 0 <= d1\old + x) && d1\old <= 2147483645) && 1 <= d2 + x) && d1 <= 2147483645) || ((((((((78 <= d2 && d1\old <= 79) && 77 <= d1\old) && 79 <= d1) && d1 <= 79) && d2 <= 80) && x <= 2147483191) && 0 <= d1\old + x) && 1 <= d2 + x)) || (((((((75 <= d1\old && 76 <= d2) && d2 + x <= 2147483575) && d1 <= 75) && 75 <= d1) && d1\old <= 75) && 1 <= d2 + x) && d2 <= 76)) || (((((((78 <= d2 && 77 <= d1) && d2 <= 78) && 77 <= d1\old) && x <= 2147483347) && d1 <= 77) && d1\old <= 77) && 1 <= d2 + x)) || (((((((74 <= d2 && 73 <= d1\old) && d1 <= 75) && d2 <= 74) && 75 <= d1) && d1\old <= 73) && 1 <= d2 + x) && d1\old + x <= 2147483647)) || ((((74 <= d2 && 73 <= d1) && d1 <= 73) && x <= d1 + 2147483574) && d2 <= 74)) || (((((((78 <= d2 && x <= 2147483270) && d2 <= 78) && 77 <= d1\old) && 79 <= d1) && d1 <= 79) && d1\old <= 77) && 1 <= d2 + x)) || (((((((75 <= d1\old && 77 <= d1) && 76 <= d2) && d1 <= 77) && d1\old <= 75) && 1 <= d2 + x) && d2 <= 76) && d1\old + x <= 2147483499) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 6 error locations. SAFE Result, 865.3s OverallTime, 26 OverallIterations, 12 TraceHistogramMax, 829.0s AutomataDifference, 0.0s DeadEndRemovalTime, 11.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 171 SDtfs, 1294 SDslu, 392 SDs, 0 SdLazy, 3020 SolverSat, 790 SolverUnsat, 33 SolverUnknown, 0 SolverNotchecked, 81.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1112 GetRequests, 625 SyntacticMatches, 8 SemanticMatches, 479 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4486 ImplicationChecksByTransitivity, 768.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=25, 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, 26 MinimizatonAttempts, 107 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 17 NumberOfFragments, 276 HoareAnnotationTreeSize, 2 FomulaSimplifications, 26494 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 2 FomulaSimplificationsInter, 61801 FormulaSimplificationTreeSizeReductionInter, 10.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 23.2s InterpolantComputationTime, 1472 NumberOfCodeBlocks, 1472 NumberOfCodeBlocksAsserted, 96 NumberOfCheckSat, 1427 ConstructedInterpolants, 41 QuantifiedInterpolants, 331829 SizeOfPredicates, 156 NumberOfNonLiveVariables, 1656 ConjunctsInSsa, 225 ConjunctsInUnsatCore, 45 InterpolantComputations, 8 PerfectInterpolantSequences, 224/4483 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...