./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-complex.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-complex.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 b8c16e949b804a2902e47966e35d88e859ba571c4506ac61977253ace96daf78 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:03:35,584 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:03:35,586 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:03:35,613 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:03:35,617 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:03:35,618 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:03:35,620 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:03:35,622 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:03:35,624 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:03:35,625 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:03:35,626 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:03:35,626 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:03:35,628 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:03:35,629 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:03:35,631 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:03:35,632 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:03:35,633 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:03:35,637 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:03:35,638 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:03:35,643 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:03:35,643 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:03:35,647 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:03:35,647 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:03:35,648 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:03:35,649 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:03:35,650 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:03:35,650 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:03:35,650 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:03:35,651 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:03:35,651 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:03:35,651 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:03:35,652 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:03:35,652 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:03:35,653 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:03:35,653 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:03:35,654 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:03:35,654 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:03:35,654 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:03:35,655 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:03:35,655 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:03:35,657 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:03:35,658 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-02-21 03:03:35,671 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:03:35,674 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:03:35,674 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:03:35,675 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:03:35,675 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:03:35,675 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:03:35,676 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:03:35,676 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:03:35,676 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:03:35,676 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:03:35,677 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:03:35,678 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:03:35,678 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:03:35,678 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:03:35,678 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:03:35,678 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:03:35,678 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:03:35,678 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:03:35,679 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:03:35,679 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:03:35,679 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:03:35,679 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:03:35,679 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:03:35,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:03:35,680 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:03:35,680 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:03:35,680 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:03:35,680 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:03:35,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:03:35,680 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:03:35,681 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> b8c16e949b804a2902e47966e35d88e859ba571c4506ac61977253ace96daf78 [2022-02-21 03:03:35,852 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:03:35,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:03:35,883 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:03:35,884 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:03:35,885 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:03:35,885 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-complex.c [2022-02-21 03:03:35,933 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da9c48d0a/a987ebeff4834c05b7f8c4ed54ee12c4/FLAG7b484dbac [2022-02-21 03:03:36,292 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:03:36,292 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-complex.c [2022-02-21 03:03:36,296 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da9c48d0a/a987ebeff4834c05b7f8c4ed54ee12c4/FLAG7b484dbac [2022-02-21 03:03:36,305 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da9c48d0a/a987ebeff4834c05b7f8c4ed54ee12c4 [2022-02-21 03:03:36,307 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:03:36,308 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:03:36,310 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:03:36,310 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:03:36,312 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:03:36,313 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:03:36" (1/1) ... [2022-02-21 03:03:36,313 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10e1250f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:36, skipping insertion in model container [2022-02-21 03:03:36,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:03:36" (1/1) ... [2022-02-21 03:03:36,318 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:03:36,326 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:03:36,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:03:36,436 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:03:36,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:03:36,463 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:03:36,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:36 WrapperNode [2022-02-21 03:03:36,463 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:03:36,464 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:03:36,464 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:03:36,464 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:03:36,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:36" (1/1) ... [2022-02-21 03:03:36,473 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:36" (1/1) ... [2022-02-21 03:03:36,485 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 40 [2022-02-21 03:03:36,486 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:03:36,486 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:03:36,486 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:03:36,487 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:03:36,492 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:36" (1/1) ... [2022-02-21 03:03:36,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:36" (1/1) ... [2022-02-21 03:03:36,493 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:36" (1/1) ... [2022-02-21 03:03:36,493 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:36" (1/1) ... [2022-02-21 03:03:36,497 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:36" (1/1) ... [2022-02-21 03:03:36,500 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:36" (1/1) ... [2022-02-21 03:03:36,500 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:36" (1/1) ... [2022-02-21 03:03:36,501 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:03:36,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:03:36,506 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:03:36,506 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:03:36,506 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:36" (1/1) ... [2022-02-21 03:03:36,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:03:36,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:03:36,525 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-21 03:03:36,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-21 03:03:36,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:03:36,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:03:36,591 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:03:36,592 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:03:36,779 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:03:36,787 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:03:36,787 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:03:36,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:03:36 BoogieIcfgContainer [2022-02-21 03:03:36,788 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:03:36,789 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:03:36,789 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:03:36,793 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:03:36,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:03:36" (1/3) ... [2022-02-21 03:03:36,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@247bbf2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:03:36, skipping insertion in model container [2022-02-21 03:03:36,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:36" (2/3) ... [2022-02-21 03:03:36,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@247bbf2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:03:36, skipping insertion in model container [2022-02-21 03:03:36,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:03:36" (3/3) ... [2022-02-21 03:03:36,795 INFO L111 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-complex.c [2022-02-21 03:03:36,798 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:03:36,798 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-02-21 03:03:36,825 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:03:36,829 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-21 03:03:36,829 INFO L340 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2022-02-21 03:03:36,839 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:36,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-21 03:03:36,842 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:36,842 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-21 03:03:36,847 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-02-21 03:03:36,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:36,855 INFO L85 PathProgramCache]: Analyzing trace with hash 28700906, now seen corresponding path program 1 times [2022-02-21 03:03:36,862 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:36,863 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759324718] [2022-02-21 03:03:36,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:36,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:36,999 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} assume { :begin_inline_ULTIMATE.init } true; {37#true} is VALID [2022-02-21 03:03:36,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~a~0#1, main_~b~0#1;havoc main_~a~0#1;havoc main_~b~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~b~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {37#true} is VALID [2022-02-21 03:03:37,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#true} assume !!(main_~a~0#1 < 30); {37#true} is VALID [2022-02-21 03:03:37,001 INFO L290 TraceCheckUtils]: 3: Hoare triple {37#true} assume !true; {38#false} is VALID [2022-02-21 03:03:37,001 INFO L290 TraceCheckUtils]: 4: Hoare triple {38#false} assume !(2 + main_~a~0#1 <= 2147483647); {38#false} is VALID [2022-02-21 03:03:37,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:03:37,003 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:37,003 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759324718] [2022-02-21 03:03:37,004 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759324718] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:03:37,005 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:03:37,005 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:03:37,006 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141759400] [2022-02-21 03:03:37,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:03:37,010 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 03:03:37,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:37,014 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:37,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:37,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-21 03:03:37,024 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:37,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 03:03:37,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 03:03:37,048 INFO L87 Difference]: Start difference. First operand has 34 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:37,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:37,097 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2022-02-21 03:03:37,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 03:03:37,098 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 03:03:37,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:37,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:37,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2022-02-21 03:03:37,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:37,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2022-02-21 03:03:37,111 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 76 transitions. [2022-02-21 03:03:37,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:37,193 INFO L225 Difference]: With dead ends: 66 [2022-02-21 03:03:37,193 INFO L226 Difference]: Without dead ends: 30 [2022-02-21 03:03:37,195 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 03:03:37,199 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:37,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:03:37,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-21 03:03:37,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-21 03:03:37,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:37,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:37,225 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:37,226 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:37,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:37,228 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-02-21 03:03:37,229 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-02-21 03:03:37,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:37,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:37,230 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 30 states. [2022-02-21 03:03:37,231 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 30 states. [2022-02-21 03:03:37,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:37,234 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-02-21 03:03:37,234 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-02-21 03:03:37,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:37,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:37,235 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:37,235 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:37,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:37,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-02-21 03:03:37,238 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 5 [2022-02-21 03:03:37,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:37,239 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-02-21 03:03:37,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:37,240 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-02-21 03:03:37,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-21 03:03:37,240 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:37,240 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-21 03:03:37,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:03:37,241 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-02-21 03:03:37,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:37,243 INFO L85 PathProgramCache]: Analyzing trace with hash 28699914, now seen corresponding path program 1 times [2022-02-21 03:03:37,244 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:37,244 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703540662] [2022-02-21 03:03:37,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:37,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:37,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:37,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {205#true} assume { :begin_inline_ULTIMATE.init } true; {205#true} is VALID [2022-02-21 03:03:37,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {205#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~a~0#1, main_~b~0#1;havoc main_~a~0#1;havoc main_~b~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~b~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {205#true} is VALID [2022-02-21 03:03:37,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {205#true} assume !!(main_~a~0#1 < 30); {207#(<= |ULTIMATE.start_main_~a~0#1| 29)} is VALID [2022-02-21 03:03:37,283 INFO L290 TraceCheckUtils]: 3: Hoare triple {207#(<= |ULTIMATE.start_main_~a~0#1| 29)} assume !(main_~b~0#1 < main_~a~0#1); {207#(<= |ULTIMATE.start_main_~a~0#1| 29)} is VALID [2022-02-21 03:03:37,283 INFO L290 TraceCheckUtils]: 4: Hoare triple {207#(<= |ULTIMATE.start_main_~a~0#1| 29)} assume !(2 + main_~a~0#1 <= 2147483647); {206#false} is VALID [2022-02-21 03:03:37,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:03:37,284 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:37,284 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703540662] [2022-02-21 03:03:37,285 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703540662] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:03:37,285 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:03:37,287 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:03:37,287 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507485931] [2022-02-21 03:03:37,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:03:37,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 03:03:37,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:37,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:37,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:37,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:03:37,298 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:37,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:03:37,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:03:37,305 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:37,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:37,359 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2022-02-21 03:03:37,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:03:37,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 03:03:37,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:37,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:37,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-02-21 03:03:37,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:37,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-02-21 03:03:37,362 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 59 transitions. [2022-02-21 03:03:37,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:37,400 INFO L225 Difference]: With dead ends: 50 [2022-02-21 03:03:37,400 INFO L226 Difference]: Without dead ends: 47 [2022-02-21 03:03:37,401 INFO L932 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 [2022-02-21 03:03:37,401 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 19 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:37,402 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 39 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:03:37,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-02-21 03:03:37,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2022-02-21 03:03:37,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:37,415 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 40 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 39 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:37,415 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 40 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 39 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:37,416 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 40 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 39 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:37,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:37,417 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2022-02-21 03:03:37,417 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-02-21 03:03:37,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:37,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:37,418 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 39 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 47 states. [2022-02-21 03:03:37,418 INFO L87 Difference]: Start difference. First operand has 40 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 39 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 47 states. [2022-02-21 03:03:37,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:37,420 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2022-02-21 03:03:37,420 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-02-21 03:03:37,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:37,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:37,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:37,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:37,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 39 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:37,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2022-02-21 03:03:37,422 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 5 [2022-02-21 03:03:37,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:37,422 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2022-02-21 03:03:37,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:37,423 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-02-21 03:03:37,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 03:03:37,423 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:37,423 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:03:37,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:03:37,424 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-02-21 03:03:37,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:37,424 INFO L85 PathProgramCache]: Analyzing trace with hash 889697419, now seen corresponding path program 1 times [2022-02-21 03:03:37,424 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:37,425 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319946288] [2022-02-21 03:03:37,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:37,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:37,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:37,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {400#true} assume { :begin_inline_ULTIMATE.init } true; {400#true} is VALID [2022-02-21 03:03:37,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {400#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~a~0#1, main_~b~0#1;havoc main_~a~0#1;havoc main_~b~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~b~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {402#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483648))} is VALID [2022-02-21 03:03:37,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {402#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483648))} assume !!(main_~a~0#1 < 30); {402#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483648))} is VALID [2022-02-21 03:03:37,448 INFO L290 TraceCheckUtils]: 3: Hoare triple {402#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483648))} assume !(main_~b~0#1 < main_~a~0#1); {402#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483648))} is VALID [2022-02-21 03:03:37,448 INFO L290 TraceCheckUtils]: 4: Hoare triple {402#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483648))} assume 2 + main_~a~0#1 <= 2147483647; {402#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483648))} is VALID [2022-02-21 03:03:37,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {402#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483648))} assume !(2 + main_~a~0#1 >= -2147483648); {401#false} is VALID [2022-02-21 03:03:37,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:03:37,450 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:37,450 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319946288] [2022-02-21 03:03:37,450 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319946288] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:03:37,451 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:03:37,451 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:03:37,451 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299430049] [2022-02-21 03:03:37,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:03:37,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-21 03:03:37,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:37,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:37,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:37,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:03:37,457 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:37,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:03:37,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:03:37,458 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:37,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:37,506 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-02-21 03:03:37,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:03:37,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-21 03:03:37,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:37,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:37,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-02-21 03:03:37,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:37,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-02-21 03:03:37,509 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 33 transitions. [2022-02-21 03:03:37,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:37,536 INFO L225 Difference]: With dead ends: 40 [2022-02-21 03:03:37,536 INFO L226 Difference]: Without dead ends: 37 [2022-02-21 03:03:37,536 INFO L932 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 [2022-02-21 03:03:37,542 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 22 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:37,543 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 19 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:03:37,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-21 03:03:37,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-02-21 03:03:37,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:37,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 36 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:37,553 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 36 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:37,553 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 36 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:37,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:37,555 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2022-02-21 03:03:37,555 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-02-21 03:03:37,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:37,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:37,556 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 36 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 37 states. [2022-02-21 03:03:37,556 INFO L87 Difference]: Start difference. First operand has 37 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 36 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 37 states. [2022-02-21 03:03:37,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:37,558 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2022-02-21 03:03:37,558 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-02-21 03:03:37,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:37,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:37,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:37,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:37,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 36 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:37,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2022-02-21 03:03:37,564 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 6 [2022-02-21 03:03:37,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:37,565 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-02-21 03:03:37,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:37,565 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-02-21 03:03:37,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 03:03:37,567 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:37,568 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:03:37,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 03:03:37,569 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-02-21 03:03:37,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:37,569 INFO L85 PathProgramCache]: Analyzing trace with hash 889698381, now seen corresponding path program 1 times [2022-02-21 03:03:37,570 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:37,570 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853579832] [2022-02-21 03:03:37,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:37,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:37,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:37,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {562#true} assume { :begin_inline_ULTIMATE.init } true; {562#true} is VALID [2022-02-21 03:03:37,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {562#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~a~0#1, main_~b~0#1;havoc main_~a~0#1;havoc main_~b~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~b~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {562#true} is VALID [2022-02-21 03:03:37,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {562#true} assume !!(main_~a~0#1 < 30); {564#(<= |ULTIMATE.start_main_~a~0#1| 29)} is VALID [2022-02-21 03:03:37,615 INFO L290 TraceCheckUtils]: 3: Hoare triple {564#(<= |ULTIMATE.start_main_~a~0#1| 29)} assume !!(main_~b~0#1 < main_~a~0#1); {565#(<= |ULTIMATE.start_main_~b~0#1| 28)} is VALID [2022-02-21 03:03:37,615 INFO L290 TraceCheckUtils]: 4: Hoare triple {565#(<= |ULTIMATE.start_main_~b~0#1| 28)} assume main_~b~0#1 > 5; {565#(<= |ULTIMATE.start_main_~b~0#1| 28)} is VALID [2022-02-21 03:03:37,616 INFO L290 TraceCheckUtils]: 5: Hoare triple {565#(<= |ULTIMATE.start_main_~b~0#1| 28)} assume !(7 + main_~b~0#1 <= 2147483647); {563#false} is VALID [2022-02-21 03:03:37,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:03:37,616 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:37,616 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853579832] [2022-02-21 03:03:37,616 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853579832] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:03:37,616 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:03:37,616 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:03:37,617 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192760383] [2022-02-21 03:03:37,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:03:37,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-21 03:03:37,617 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:37,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:37,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:37,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:03:37,621 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:37,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:03:37,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:03:37,623 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:37,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:37,767 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2022-02-21 03:03:37,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:03:37,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-21 03:03:37,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:37,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:37,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-02-21 03:03:37,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:37,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-02-21 03:03:37,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2022-02-21 03:03:37,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:37,818 INFO L225 Difference]: With dead ends: 56 [2022-02-21 03:03:37,818 INFO L226 Difference]: Without dead ends: 52 [2022-02-21 03:03:37,818 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:03:37,819 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 32 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:37,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 26 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:03:37,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-02-21 03:03:37,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2022-02-21 03:03:37,844 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:37,845 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 45 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 44 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:37,845 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 45 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 44 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:37,845 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 45 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 44 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:37,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:37,847 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2022-02-21 03:03:37,847 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2022-02-21 03:03:37,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:37,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:37,847 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 44 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 52 states. [2022-02-21 03:03:37,847 INFO L87 Difference]: Start difference. First operand has 45 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 44 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 52 states. [2022-02-21 03:03:37,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:37,850 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2022-02-21 03:03:37,850 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2022-02-21 03:03:37,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:37,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:37,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:37,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:37,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 44 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:37,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2022-02-21 03:03:37,851 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 6 [2022-02-21 03:03:37,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:37,852 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2022-02-21 03:03:37,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:37,852 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2022-02-21 03:03:37,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-21 03:03:37,852 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:37,852 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:03:37,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 03:03:37,852 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-02-21 03:03:37,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:37,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1810816300, now seen corresponding path program 1 times [2022-02-21 03:03:37,853 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:37,853 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657857185] [2022-02-21 03:03:37,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:37,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:37,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:37,873 INFO L290 TraceCheckUtils]: 0: Hoare triple {787#true} assume { :begin_inline_ULTIMATE.init } true; {787#true} is VALID [2022-02-21 03:03:37,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {787#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~a~0#1, main_~b~0#1;havoc main_~a~0#1;havoc main_~b~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~b~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {789#(<= |ULTIMATE.start_main_~b~0#1| 2147483647)} is VALID [2022-02-21 03:03:37,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {789#(<= |ULTIMATE.start_main_~b~0#1| 2147483647)} assume !!(main_~a~0#1 < 30); {789#(<= |ULTIMATE.start_main_~b~0#1| 2147483647)} is VALID [2022-02-21 03:03:37,874 INFO L290 TraceCheckUtils]: 3: Hoare triple {789#(<= |ULTIMATE.start_main_~b~0#1| 2147483647)} assume !(main_~b~0#1 < main_~a~0#1); {789#(<= |ULTIMATE.start_main_~b~0#1| 2147483647)} is VALID [2022-02-21 03:03:37,874 INFO L290 TraceCheckUtils]: 4: Hoare triple {789#(<= |ULTIMATE.start_main_~b~0#1| 2147483647)} assume 2 + main_~a~0#1 <= 2147483647; {789#(<= |ULTIMATE.start_main_~b~0#1| 2147483647)} is VALID [2022-02-21 03:03:37,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {789#(<= |ULTIMATE.start_main_~b~0#1| 2147483647)} assume 2 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 2 + main_~a~0#1; {789#(<= |ULTIMATE.start_main_~b~0#1| 2147483647)} is VALID [2022-02-21 03:03:37,875 INFO L290 TraceCheckUtils]: 6: Hoare triple {789#(<= |ULTIMATE.start_main_~b~0#1| 2147483647)} assume !(main_~b~0#1 - 10 <= 2147483647); {788#false} is VALID [2022-02-21 03:03:37,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:03:37,875 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:37,875 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657857185] [2022-02-21 03:03:37,876 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657857185] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:03:37,876 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:03:37,876 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:03:37,876 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731273463] [2022-02-21 03:03:37,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:03:37,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-21 03:03:37,877 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:37,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:37,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:37,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:03:37,881 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:37,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:03:37,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:03:37,882 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:37,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:37,939 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2022-02-21 03:03:37,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:03:37,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-21 03:03:37,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:37,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:37,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-02-21 03:03:37,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:37,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-02-21 03:03:37,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 41 transitions. [2022-02-21 03:03:37,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:37,966 INFO L225 Difference]: With dead ends: 54 [2022-02-21 03:03:37,966 INFO L226 Difference]: Without dead ends: 53 [2022-02-21 03:03:37,967 INFO L932 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 [2022-02-21 03:03:37,967 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 12 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:37,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 24 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:03:37,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-02-21 03:03:37,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 45. [2022-02-21 03:03:37,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:37,981 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 45 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 44 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:37,982 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 45 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 44 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:37,982 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 45 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 44 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:37,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:37,983 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2022-02-21 03:03:37,983 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2022-02-21 03:03:37,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:37,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:37,984 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 44 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 53 states. [2022-02-21 03:03:37,984 INFO L87 Difference]: Start difference. First operand has 45 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 44 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 53 states. [2022-02-21 03:03:37,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:37,985 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2022-02-21 03:03:37,985 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2022-02-21 03:03:37,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:37,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:37,985 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:37,985 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:37,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 44 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:37,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2022-02-21 03:03:37,987 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 7 [2022-02-21 03:03:37,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:37,987 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2022-02-21 03:03:37,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:37,987 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2022-02-21 03:03:37,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-21 03:03:37,988 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:37,988 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:03:37,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-21 03:03:37,988 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-02-21 03:03:37,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:37,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1810846092, now seen corresponding path program 1 times [2022-02-21 03:03:37,989 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:37,989 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981737205] [2022-02-21 03:03:37,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:37,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:38,005 INFO L290 TraceCheckUtils]: 0: Hoare triple {1011#true} assume { :begin_inline_ULTIMATE.init } true; {1011#true} is VALID [2022-02-21 03:03:38,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {1011#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~a~0#1, main_~b~0#1;havoc main_~a~0#1;havoc main_~b~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~b~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {1013#(<= 0 (+ |ULTIMATE.start_main_~b~0#1| 2147483648))} is VALID [2022-02-21 03:03:38,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {1013#(<= 0 (+ |ULTIMATE.start_main_~b~0#1| 2147483648))} assume !!(main_~a~0#1 < 30); {1013#(<= 0 (+ |ULTIMATE.start_main_~b~0#1| 2147483648))} is VALID [2022-02-21 03:03:38,007 INFO L290 TraceCheckUtils]: 3: Hoare triple {1013#(<= 0 (+ |ULTIMATE.start_main_~b~0#1| 2147483648))} assume !!(main_~b~0#1 < main_~a~0#1); {1013#(<= 0 (+ |ULTIMATE.start_main_~b~0#1| 2147483648))} is VALID [2022-02-21 03:03:38,007 INFO L290 TraceCheckUtils]: 4: Hoare triple {1013#(<= 0 (+ |ULTIMATE.start_main_~b~0#1| 2147483648))} assume main_~b~0#1 > 5; {1013#(<= 0 (+ |ULTIMATE.start_main_~b~0#1| 2147483648))} is VALID [2022-02-21 03:03:38,007 INFO L290 TraceCheckUtils]: 5: Hoare triple {1013#(<= 0 (+ |ULTIMATE.start_main_~b~0#1| 2147483648))} assume 7 + main_~b~0#1 <= 2147483647; {1013#(<= 0 (+ |ULTIMATE.start_main_~b~0#1| 2147483648))} is VALID [2022-02-21 03:03:38,008 INFO L290 TraceCheckUtils]: 6: Hoare triple {1013#(<= 0 (+ |ULTIMATE.start_main_~b~0#1| 2147483648))} assume !(7 + main_~b~0#1 >= -2147483648); {1012#false} is VALID [2022-02-21 03:03:38,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:03:38,008 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:38,008 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981737205] [2022-02-21 03:03:38,008 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981737205] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:03:38,009 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:03:38,009 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:03:38,009 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802176803] [2022-02-21 03:03:38,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:03:38,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-21 03:03:38,009 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:38,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:38,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:38,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:03:38,014 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:38,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:03:38,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:03:38,014 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:38,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:38,049 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2022-02-21 03:03:38,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:03:38,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-21 03:03:38,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:38,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:38,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-02-21 03:03:38,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:38,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-02-21 03:03:38,051 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 29 transitions. [2022-02-21 03:03:38,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:38,068 INFO L225 Difference]: With dead ends: 45 [2022-02-21 03:03:38,068 INFO L226 Difference]: Without dead ends: 43 [2022-02-21 03:03:38,068 INFO L932 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 [2022-02-21 03:03:38,069 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:38,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 13 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:03:38,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-21 03:03:38,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-02-21 03:03:38,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:38,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 42 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:38,085 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 42 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:38,085 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 42 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:38,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:38,086 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-02-21 03:03:38,086 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-02-21 03:03:38,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:38,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:38,087 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 42 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 43 states. [2022-02-21 03:03:38,087 INFO L87 Difference]: Start difference. First operand has 43 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 42 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 43 states. [2022-02-21 03:03:38,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:38,088 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-02-21 03:03:38,088 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-02-21 03:03:38,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:38,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:38,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:38,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:38,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 42 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:38,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2022-02-21 03:03:38,092 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 7 [2022-02-21 03:03:38,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:38,092 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2022-02-21 03:03:38,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:38,092 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-02-21 03:03:38,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-21 03:03:38,092 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:38,093 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:03:38,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-21 03:03:38,093 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-02-21 03:03:38,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:38,093 INFO L85 PathProgramCache]: Analyzing trace with hash 300730541, now seen corresponding path program 1 times [2022-02-21 03:03:38,094 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:38,094 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620933362] [2022-02-21 03:03:38,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:38,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:38,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:03:38,106 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:03:38,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:03:38,118 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:03:38,118 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-21 03:03:38,119 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2022-02-21 03:03:38,121 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2022-02-21 03:03:38,121 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2022-02-21 03:03:38,122 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2022-02-21 03:03:38,122 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2022-02-21 03:03:38,122 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2022-02-21 03:03:38,122 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2022-02-21 03:03:38,122 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2022-02-21 03:03:38,122 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2022-02-21 03:03:38,122 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2022-02-21 03:03:38,123 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2022-02-21 03:03:38,123 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2022-02-21 03:03:38,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-21 03:03:38,125 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:03:38,127 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-21 03:03:38,143 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-21 03:03:38,143 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-21 03:03:38,143 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-02-21 03:03:38,143 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-02-21 03:03:38,143 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-02-21 03:03:38,143 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2022-02-21 03:03:38,144 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-02-21 03:03:38,144 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-02-21 03:03:38,144 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-02-21 03:03:38,144 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-02-21 03:03:38,144 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2022-02-21 03:03:38,144 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2022-02-21 03:03:38,144 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-21 03:03:38,144 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-21 03:03:38,144 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-21 03:03:38,144 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-02-21 03:03:38,145 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-02-21 03:03:38,145 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-21 03:03:38,145 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-21 03:03:38,145 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-21 03:03:38,145 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-21 03:03:38,145 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-21 03:03:38,145 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-21 03:03:38,145 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2022-02-21 03:03:38,145 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2022-02-21 03:03:38,145 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-02-21 03:03:38,145 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-02-21 03:03:38,146 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-02-21 03:03:38,146 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-02-21 03:03:38,146 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-02-21 03:03:38,146 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-02-21 03:03:38,146 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-21 03:03:38,146 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-21 03:03:38,146 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-21 03:03:38,146 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-21 03:03:38,147 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-02-21 03:03:38,147 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-02-21 03:03:38,147 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-02-21 03:03:38,147 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-02-21 03:03:38,147 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-21 03:03:38,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 03:03:38 BoogieIcfgContainer [2022-02-21 03:03:38,148 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-21 03:03:38,148 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:03:38,148 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:03:38,148 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:03:38,149 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:03:36" (3/4) ... [2022-02-21 03:03:38,150 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-21 03:03:38,170 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 03:03:38,170 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:03:38,171 INFO L158 Benchmark]: Toolchain (without parser) took 1863.25ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 50.2MB in the beginning and 70.7MB in the end (delta: -20.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:03:38,171 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 83.9MB. Free memory was 56.0MB in the beginning and 56.0MB in the end (delta: 24.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:03:38,171 INFO L158 Benchmark]: CACSL2BoogieTranslator took 153.63ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 49.9MB in the beginning and 77.9MB in the end (delta: -28.0MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2022-02-21 03:03:38,172 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.70ms. Allocated memory is still 100.7MB. Free memory was 77.9MB in the beginning and 76.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:03:38,172 INFO L158 Benchmark]: Boogie Preprocessor took 14.91ms. Allocated memory is still 100.7MB. Free memory was 76.2MB in the beginning and 75.4MB in the end (delta: 742.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:03:38,172 INFO L158 Benchmark]: RCFGBuilder took 282.66ms. Allocated memory is still 100.7MB. Free memory was 75.4MB in the beginning and 63.3MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:03:38,172 INFO L158 Benchmark]: TraceAbstraction took 1358.58ms. Allocated memory is still 100.7MB. Free memory was 63.0MB in the beginning and 72.2MB in the end (delta: -9.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:03:38,172 INFO L158 Benchmark]: Witness Printer took 21.96ms. Allocated memory is still 100.7MB. Free memory was 72.2MB in the beginning and 70.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:03:38,175 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 83.9MB. Free memory was 56.0MB in the beginning and 56.0MB in the end (delta: 24.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 153.63ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 49.9MB in the beginning and 77.9MB in the end (delta: -28.0MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.70ms. Allocated memory is still 100.7MB. Free memory was 77.9MB in the beginning and 76.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 14.91ms. Allocated memory is still 100.7MB. Free memory was 76.2MB in the beginning and 75.4MB in the end (delta: 742.7kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 282.66ms. Allocated memory is still 100.7MB. Free memory was 75.4MB in the beginning and 63.3MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1358.58ms. Allocated memory is still 100.7MB. Free memory was 63.0MB in the beginning and 72.2MB in the end (delta: -9.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 21.96ms. Allocated memory is still 100.7MB. Free memory was 72.2MB in the beginning and 70.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 30]: integer overflow possible integer overflow possible We found a FailurePath: [L13] int a, b; [L14] a = __VERIFIER_nondet_int() [L15] b = __VERIFIER_nondet_int() [L16] COND TRUE a < 30 VAL [a=-2147483639, b=-2147483639] [L17] COND FALSE !(b < a) VAL [a=-2147483639, b=-2147483639] [L29] EXPR a + 2 [L29] a = a + 2 VAL [a=-2147483637, b=-2147483639] [L30] b - 10 VAL [a=-2147483637, b=-2147483639] - UnprovableResult [Line: 19]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 21]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 21]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 24]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 24]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 26]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 26]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 30]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 34 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 103 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 103 mSDsluCounter, 158 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 39 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 138 IncrementalHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 119 mSDtfsCounter, 138 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=4, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 22 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 44 NumberOfCodeBlocks, 44 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 30 ConstructedInterpolants, 0 QuantifiedInterpolants, 86 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-02-21 03:03:38,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)