./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/geo3-ll_valuebound10.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/nla-digbench-scaling/geo3-ll_valuebound10.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 69ffbc0bd4f07a8cc2897410fc013fb815dd984602255263415f4f8a1a4c1714 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:29:29,542 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:29:29,545 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:29:29,578 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:29:29,579 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:29:29,582 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:29:29,583 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:29:29,588 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:29:29,589 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:29:29,594 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:29:29,594 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:29:29,595 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:29:29,595 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:29:29,596 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:29:29,596 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:29:29,597 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:29:29,598 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:29:29,598 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:29:29,599 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:29:29,600 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:29:29,601 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:29:29,602 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:29:29,605 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:29:29,606 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:29:29,610 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:29:29,610 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:29:29,611 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:29:29,612 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:29:29,612 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:29:29,613 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:29:29,613 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:29:29,614 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:29:29,615 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:29:29,616 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:29:29,617 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:29:29,617 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:29:29,617 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:29:29,618 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:29:29,618 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:29:29,618 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:29:29,619 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:29:29,620 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:29:29,652 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:29:29,652 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:29:29,652 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:29:29,652 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:29:29,653 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:29:29,653 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:29:29,654 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:29:29,654 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:29:29,654 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:29:29,654 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:29:29,655 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:29:29,655 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:29:29,655 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:29:29,655 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:29:29,655 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:29:29,656 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:29:29,656 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:29:29,656 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:29:29,656 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:29:29,656 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:29:29,656 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:29:29,657 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:29:29,657 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:29:29,657 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:29:29,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:29:29,657 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:29:29,657 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:29:29,658 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:29:29,658 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:29:29,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:29:29,658 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:29:29,658 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:29:29,658 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:29:29,659 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 ! call(reach_error())) ) 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 69ffbc0bd4f07a8cc2897410fc013fb815dd984602255263415f4f8a1a4c1714 [2022-02-20 17:29:29,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:29:29,872 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:29:29,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:29:29,875 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:29:29,875 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:29:29,876 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/geo3-ll_valuebound10.c [2022-02-20 17:29:29,928 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/268541a2c/edf1e6bcb8984d03accf8e87b650c2ac/FLAGcfc39921a [2022-02-20 17:29:30,289 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:29:30,289 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo3-ll_valuebound10.c [2022-02-20 17:29:30,293 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/268541a2c/edf1e6bcb8984d03accf8e87b650c2ac/FLAGcfc39921a [2022-02-20 17:29:30,304 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/268541a2c/edf1e6bcb8984d03accf8e87b650c2ac [2022-02-20 17:29:30,306 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:29:30,307 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:29:30,308 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:29:30,308 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:29:30,310 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:29:30,311 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:29:30" (1/1) ... [2022-02-20 17:29:30,311 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47691a5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:30, skipping insertion in model container [2022-02-20 17:29:30,312 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:29:30" (1/1) ... [2022-02-20 17:29:30,316 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:29:30,324 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:29:30,441 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo3-ll_valuebound10.c[525,538] [2022-02-20 17:29:30,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:29:30,462 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:29:30,470 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo3-ll_valuebound10.c[525,538] [2022-02-20 17:29:30,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:29:30,486 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:29:30,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:30 WrapperNode [2022-02-20 17:29:30,487 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:29:30,488 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:29:30,489 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:29:30,489 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:29:30,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:30" (1/1) ... [2022-02-20 17:29:30,498 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:30" (1/1) ... [2022-02-20 17:29:30,515 INFO L137 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 46 [2022-02-20 17:29:30,516 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:29:30,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:29:30,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:29:30,517 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:29:30,521 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:30" (1/1) ... [2022-02-20 17:29:30,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:30" (1/1) ... [2022-02-20 17:29:30,522 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:30" (1/1) ... [2022-02-20 17:29:30,522 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:30" (1/1) ... [2022-02-20 17:29:30,524 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:30" (1/1) ... [2022-02-20 17:29:30,537 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:30" (1/1) ... [2022-02-20 17:29:30,538 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:30" (1/1) ... [2022-02-20 17:29:30,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:29:30,540 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:29:30,540 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:29:30,545 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:29:30,546 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:30" (1/1) ... [2022-02-20 17:29:30,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:29:30,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:29:30,567 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-20 17:29:30,575 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-20 17:29:30,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:29:30,593 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 17:29:30,593 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 17:29:30,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:29:30,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:29:30,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:29:30,593 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:29:30,593 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:29:30,631 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:29:30,632 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:29:30,804 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:29:30,810 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:29:30,811 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:29:30,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:29:30 BoogieIcfgContainer [2022-02-20 17:29:30,812 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:29:30,813 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:29:30,813 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:29:30,816 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:29:30,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:29:30" (1/3) ... [2022-02-20 17:29:30,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3acf2fc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:29:30, skipping insertion in model container [2022-02-20 17:29:30,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:30" (2/3) ... [2022-02-20 17:29:30,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3acf2fc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:29:30, skipping insertion in model container [2022-02-20 17:29:30,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:29:30" (3/3) ... [2022-02-20 17:29:30,818 INFO L111 eAbstractionObserver]: Analyzing ICFG geo3-ll_valuebound10.c [2022-02-20 17:29:30,821 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:29:30,821 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:29:30,848 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:29:30,879 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=PETRI_NET, 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-20 17:29:30,884 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:29:30,910 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:29:30,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 17:29:30,915 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:30,915 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:30,916 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:30,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:30,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1024559358, now seen corresponding path program 1 times [2022-02-20 17:29:30,930 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:29:30,931 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635767823] [2022-02-20 17:29:30,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:30,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:29:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:31,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 17:29:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:31,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#true} ~cond := #in~cond; {29#true} is VALID [2022-02-20 17:29:31,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume 0 == ~cond;assume false; {30#false} is VALID [2022-02-20 17:29:31,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {30#false} assume true; {30#false} is VALID [2022-02-20 17:29:31,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30#false} {29#true} #52#return; {30#false} is VALID [2022-02-20 17:29:31,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 17:29:31,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:31,115 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#true} ~cond := #in~cond; {29#true} is VALID [2022-02-20 17:29:31,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume 0 == ~cond;assume false; {30#false} is VALID [2022-02-20 17:29:31,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {30#false} assume true; {30#false} is VALID [2022-02-20 17:29:31,116 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30#false} {30#false} #54#return; {30#false} is VALID [2022-02-20 17:29:31,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 17:29:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:31,130 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#true} ~cond := #in~cond; {29#true} is VALID [2022-02-20 17:29:31,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume 0 == ~cond;assume false; {30#false} is VALID [2022-02-20 17:29:31,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {30#false} assume true; {30#false} is VALID [2022-02-20 17:29:31,131 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30#false} {30#false} #56#return; {30#false} is VALID [2022-02-20 17:29:31,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29#true} is VALID [2022-02-20 17:29:31,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_~z~0#1, main_~a~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1, main_~az~0#1;havoc main_~z~0#1;havoc main_~a~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~0#1;havoc main_~az~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~z~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {29#true} is VALID [2022-02-20 17:29:31,132 INFO L272 TraceCheckUtils]: 2: Hoare triple {29#true} call assume_abort_if_not((if main_~z~0#1 >= 0 && main_~z~0#1 <= 10 then 1 else 0)); {29#true} is VALID [2022-02-20 17:29:31,132 INFO L290 TraceCheckUtils]: 3: Hoare triple {29#true} ~cond := #in~cond; {29#true} is VALID [2022-02-20 17:29:31,133 INFO L290 TraceCheckUtils]: 4: Hoare triple {29#true} assume 0 == ~cond;assume false; {30#false} is VALID [2022-02-20 17:29:31,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {30#false} assume true; {30#false} is VALID [2022-02-20 17:29:31,133 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {30#false} {29#true} #52#return; {30#false} is VALID [2022-02-20 17:29:31,133 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#false} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~a~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {30#false} is VALID [2022-02-20 17:29:31,134 INFO L272 TraceCheckUtils]: 8: Hoare triple {30#false} call assume_abort_if_not((if main_~a~0#1 >= 0 && main_~a~0#1 <= 10 then 1 else 0)); {29#true} is VALID [2022-02-20 17:29:31,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#true} ~cond := #in~cond; {29#true} is VALID [2022-02-20 17:29:31,135 INFO L290 TraceCheckUtils]: 10: Hoare triple {29#true} assume 0 == ~cond;assume false; {30#false} is VALID [2022-02-20 17:29:31,135 INFO L290 TraceCheckUtils]: 11: Hoare triple {30#false} assume true; {30#false} is VALID [2022-02-20 17:29:31,136 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {30#false} {30#false} #54#return; {30#false} is VALID [2022-02-20 17:29:31,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {30#false} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~k~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {30#false} is VALID [2022-02-20 17:29:31,136 INFO L272 TraceCheckUtils]: 14: Hoare triple {30#false} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 10 then 1 else 0)); {29#true} is VALID [2022-02-20 17:29:31,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {29#true} ~cond := #in~cond; {29#true} is VALID [2022-02-20 17:29:31,137 INFO L290 TraceCheckUtils]: 16: Hoare triple {29#true} assume 0 == ~cond;assume false; {30#false} is VALID [2022-02-20 17:29:31,137 INFO L290 TraceCheckUtils]: 17: Hoare triple {30#false} assume true; {30#false} is VALID [2022-02-20 17:29:31,137 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {30#false} {30#false} #56#return; {30#false} is VALID [2022-02-20 17:29:31,138 INFO L290 TraceCheckUtils]: 19: Hoare triple {30#false} main_~x~0#1 := main_~a~0#1;main_~y~0#1 := 1;main_~c~0#1 := 1;main_~az~0#1 := main_~a~0#1 * main_~z~0#1; {30#false} is VALID [2022-02-20 17:29:31,138 INFO L290 TraceCheckUtils]: 20: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-02-20 17:29:31,139 INFO L272 TraceCheckUtils]: 21: Hoare triple {30#false} call __VERIFIER_assert((if 0 == main_~z~0#1 * main_~x~0#1 - main_~x~0#1 + main_~a~0#1 - main_~az~0#1 * main_~y~0#1 then 1 else 0)); {30#false} is VALID [2022-02-20 17:29:31,139 INFO L290 TraceCheckUtils]: 22: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-02-20 17:29:31,139 INFO L290 TraceCheckUtils]: 23: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-02-20 17:29:31,139 INFO L290 TraceCheckUtils]: 24: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-02-20 17:29:31,140 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:29:31,140 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:29:31,141 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635767823] [2022-02-20 17:29:31,142 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635767823] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:29:31,142 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:29:31,142 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:29:31,143 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041180941] [2022-02-20 17:29:31,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:29:31,148 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-02-20 17:29:31,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:31,153 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:29:31,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:31,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:29:31,188 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:29:31,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:29:31,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:29:31,217 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:29:31,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:31,280 INFO L93 Difference]: Finished difference Result 49 states and 67 transitions. [2022-02-20 17:29:31,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:29:31,281 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-02-20 17:29:31,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:31,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:29:31,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 67 transitions. [2022-02-20 17:29:31,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:29:31,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 67 transitions. [2022-02-20 17:29:31,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 67 transitions. [2022-02-20 17:29:31,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:31,382 INFO L225 Difference]: With dead ends: 49 [2022-02-20 17:29:31,382 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 17:29:31,385 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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-20 17:29:31,388 INFO L933 BasicCegarLoop]: 29 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, 29 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-20 17:29:31,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:29:31,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 17:29:31,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 17:29:31,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:31,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:29:31,417 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:29:31,418 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:29:31,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:31,426 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-02-20 17:29:31,427 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-02-20 17:29:31,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:31,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:31,432 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 22 states. [2022-02-20 17:29:31,432 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 22 states. [2022-02-20 17:29:31,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:31,437 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-02-20 17:29:31,437 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-02-20 17:29:31,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:31,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:31,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:31,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:31,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:29:31,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-02-20 17:29:31,442 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 25 [2022-02-20 17:29:31,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:31,442 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-02-20 17:29:31,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:29:31,443 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-02-20 17:29:31,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 17:29:31,444 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:31,444 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:31,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:29:31,445 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:31,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:31,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1201662840, now seen corresponding path program 1 times [2022-02-20 17:29:31,446 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:29:31,446 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759786755] [2022-02-20 17:29:31,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:31,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:29:31,481 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:29:31,481 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1055588638] [2022-02-20 17:29:31,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:31,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:29:31,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:29:31,483 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:29:31,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 17:29:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:31,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 17:29:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:31,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:29:31,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {185#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {185#true} is VALID [2022-02-20 17:29:31,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {185#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_~z~0#1, main_~a~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1, main_~az~0#1;havoc main_~z~0#1;havoc main_~a~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~0#1;havoc main_~az~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~z~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {185#true} is VALID [2022-02-20 17:29:31,666 INFO L272 TraceCheckUtils]: 2: Hoare triple {185#true} call assume_abort_if_not((if main_~z~0#1 >= 0 && main_~z~0#1 <= 10 then 1 else 0)); {185#true} is VALID [2022-02-20 17:29:31,667 INFO L290 TraceCheckUtils]: 3: Hoare triple {185#true} ~cond := #in~cond; {185#true} is VALID [2022-02-20 17:29:31,667 INFO L290 TraceCheckUtils]: 4: Hoare triple {185#true} assume !(0 == ~cond); {185#true} is VALID [2022-02-20 17:29:31,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {185#true} assume true; {185#true} is VALID [2022-02-20 17:29:31,667 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {185#true} {185#true} #52#return; {185#true} is VALID [2022-02-20 17:29:31,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {185#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~a~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {185#true} is VALID [2022-02-20 17:29:31,668 INFO L272 TraceCheckUtils]: 8: Hoare triple {185#true} call assume_abort_if_not((if main_~a~0#1 >= 0 && main_~a~0#1 <= 10 then 1 else 0)); {185#true} is VALID [2022-02-20 17:29:31,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {185#true} ~cond := #in~cond; {185#true} is VALID [2022-02-20 17:29:31,668 INFO L290 TraceCheckUtils]: 10: Hoare triple {185#true} assume !(0 == ~cond); {185#true} is VALID [2022-02-20 17:29:31,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {185#true} assume true; {185#true} is VALID [2022-02-20 17:29:31,668 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {185#true} {185#true} #54#return; {185#true} is VALID [2022-02-20 17:29:31,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {185#true} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~k~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {185#true} is VALID [2022-02-20 17:29:31,669 INFO L272 TraceCheckUtils]: 14: Hoare triple {185#true} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 10 then 1 else 0)); {185#true} is VALID [2022-02-20 17:29:31,669 INFO L290 TraceCheckUtils]: 15: Hoare triple {185#true} ~cond := #in~cond; {185#true} is VALID [2022-02-20 17:29:31,669 INFO L290 TraceCheckUtils]: 16: Hoare triple {185#true} assume !(0 == ~cond); {185#true} is VALID [2022-02-20 17:29:31,669 INFO L290 TraceCheckUtils]: 17: Hoare triple {185#true} assume true; {185#true} is VALID [2022-02-20 17:29:31,670 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {185#true} {185#true} #56#return; {185#true} is VALID [2022-02-20 17:29:31,670 INFO L290 TraceCheckUtils]: 19: Hoare triple {185#true} main_~x~0#1 := main_~a~0#1;main_~y~0#1 := 1;main_~c~0#1 := 1;main_~az~0#1 := main_~a~0#1 * main_~z~0#1; {247#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~az~0#1| (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|)))} is VALID [2022-02-20 17:29:31,671 INFO L290 TraceCheckUtils]: 20: Hoare triple {247#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~az~0#1| (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|)))} assume !false; {247#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~az~0#1| (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|)))} is VALID [2022-02-20 17:29:31,675 INFO L272 TraceCheckUtils]: 21: Hoare triple {247#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~az~0#1| (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|)))} call __VERIFIER_assert((if 0 == main_~z~0#1 * main_~x~0#1 - main_~x~0#1 + main_~a~0#1 - main_~az~0#1 * main_~y~0#1 then 1 else 0)); {254#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:29:31,676 INFO L290 TraceCheckUtils]: 22: Hoare triple {254#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {258#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:29:31,677 INFO L290 TraceCheckUtils]: 23: Hoare triple {258#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {186#false} is VALID [2022-02-20 17:29:31,677 INFO L290 TraceCheckUtils]: 24: Hoare triple {186#false} assume !false; {186#false} is VALID [2022-02-20 17:29:31,677 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:29:31,677 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:29:31,678 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:29:31,678 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759786755] [2022-02-20 17:29:31,678 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:29:31,679 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055588638] [2022-02-20 17:29:31,681 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055588638] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:29:31,681 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:29:31,682 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:29:31,682 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147909133] [2022-02-20 17:29:31,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:29:31,683 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2022-02-20 17:29:31,683 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:31,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:29:31,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:31,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:29:31,700 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:29:31,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:29:31,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:29:31,702 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:29:31,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:31,798 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-02-20 17:29:31,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:29:31,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2022-02-20 17:29:31,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:31,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:29:31,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-02-20 17:29:31,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:29:31,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-02-20 17:29:31,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-02-20 17:29:31,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:31,829 INFO L225 Difference]: With dead ends: 32 [2022-02-20 17:29:31,829 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 17:29:31,830 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:29:31,830 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:29:31,831 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 83 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:29:31,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 17:29:31,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-02-20 17:29:31,835 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:31,835 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:29:31,835 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:29:31,836 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:29:31,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:31,837 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-02-20 17:29:31,837 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-02-20 17:29:31,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:31,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:31,838 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 29 states. [2022-02-20 17:29:31,838 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 29 states. [2022-02-20 17:29:31,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:31,840 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-02-20 17:29:31,840 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-02-20 17:29:31,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:31,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:31,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:31,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:31,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:29:31,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-02-20 17:29:31,842 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 25 [2022-02-20 17:29:31,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:31,843 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-02-20 17:29:31,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:29:31,843 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-02-20 17:29:31,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 17:29:31,844 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:31,844 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:31,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:29:32,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:29:32,060 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:32,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:32,060 INFO L85 PathProgramCache]: Analyzing trace with hash -202357475, now seen corresponding path program 1 times [2022-02-20 17:29:32,060 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:29:32,060 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810622974] [2022-02-20 17:29:32,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:32,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:29:32,074 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:29:32,083 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1708926559] [2022-02-20 17:29:32,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:32,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:29:32,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:29:32,085 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:29:32,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 17:29:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:32,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-20 17:29:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:32,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:29:32,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {408#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {408#true} is VALID [2022-02-20 17:29:32,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {408#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_~z~0#1, main_~a~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1, main_~az~0#1;havoc main_~z~0#1;havoc main_~a~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~0#1;havoc main_~az~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~z~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {408#true} is VALID [2022-02-20 17:29:32,385 INFO L272 TraceCheckUtils]: 2: Hoare triple {408#true} call assume_abort_if_not((if main_~z~0#1 >= 0 && main_~z~0#1 <= 10 then 1 else 0)); {408#true} is VALID [2022-02-20 17:29:32,385 INFO L290 TraceCheckUtils]: 3: Hoare triple {408#true} ~cond := #in~cond; {408#true} is VALID [2022-02-20 17:29:32,385 INFO L290 TraceCheckUtils]: 4: Hoare triple {408#true} assume !(0 == ~cond); {408#true} is VALID [2022-02-20 17:29:32,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {408#true} assume true; {408#true} is VALID [2022-02-20 17:29:32,386 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {408#true} {408#true} #52#return; {408#true} is VALID [2022-02-20 17:29:32,386 INFO L290 TraceCheckUtils]: 7: Hoare triple {408#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~a~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {408#true} is VALID [2022-02-20 17:29:32,386 INFO L272 TraceCheckUtils]: 8: Hoare triple {408#true} call assume_abort_if_not((if main_~a~0#1 >= 0 && main_~a~0#1 <= 10 then 1 else 0)); {408#true} is VALID [2022-02-20 17:29:32,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {408#true} ~cond := #in~cond; {408#true} is VALID [2022-02-20 17:29:32,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {408#true} assume !(0 == ~cond); {408#true} is VALID [2022-02-20 17:29:32,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {408#true} assume true; {408#true} is VALID [2022-02-20 17:29:32,387 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {408#true} {408#true} #54#return; {408#true} is VALID [2022-02-20 17:29:32,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {408#true} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~k~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {408#true} is VALID [2022-02-20 17:29:32,387 INFO L272 TraceCheckUtils]: 14: Hoare triple {408#true} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 10 then 1 else 0)); {408#true} is VALID [2022-02-20 17:29:32,387 INFO L290 TraceCheckUtils]: 15: Hoare triple {408#true} ~cond := #in~cond; {408#true} is VALID [2022-02-20 17:29:32,387 INFO L290 TraceCheckUtils]: 16: Hoare triple {408#true} assume !(0 == ~cond); {408#true} is VALID [2022-02-20 17:29:32,387 INFO L290 TraceCheckUtils]: 17: Hoare triple {408#true} assume true; {408#true} is VALID [2022-02-20 17:29:32,388 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {408#true} {408#true} #56#return; {408#true} is VALID [2022-02-20 17:29:32,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {408#true} main_~x~0#1 := main_~a~0#1;main_~y~0#1 := 1;main_~c~0#1 := 1;main_~az~0#1 := main_~a~0#1 * main_~z~0#1; {470#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~az~0#1| (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|)))} is VALID [2022-02-20 17:29:32,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {470#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~az~0#1| (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|)))} assume !false; {470#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~az~0#1| (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|)))} is VALID [2022-02-20 17:29:32,390 INFO L272 TraceCheckUtils]: 21: Hoare triple {470#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~az~0#1| (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|)))} call __VERIFIER_assert((if 0 == main_~z~0#1 * main_~x~0#1 - main_~x~0#1 + main_~a~0#1 - main_~az~0#1 * main_~y~0#1 then 1 else 0)); {408#true} is VALID [2022-02-20 17:29:32,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {408#true} ~cond := #in~cond; {480#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:29:32,391 INFO L290 TraceCheckUtils]: 23: Hoare triple {480#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {484#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:29:32,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {484#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {484#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:29:32,392 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {484#(not (= |__VERIFIER_assert_#in~cond| 0))} {470#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~az~0#1| (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|)))} #58#return; {470#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~az~0#1| (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|)))} is VALID [2022-02-20 17:29:32,394 INFO L290 TraceCheckUtils]: 26: Hoare triple {470#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~az~0#1| (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~x~0#1 := main_~x~0#1 * main_~z~0#1 + main_~a~0#1;main_~y~0#1 := main_~y~0#1 * main_~z~0#1; {494#(and (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (= (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~az~0#1| (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|)))} is VALID [2022-02-20 17:29:32,394 INFO L290 TraceCheckUtils]: 27: Hoare triple {494#(and (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (= (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~az~0#1| (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|)))} assume !false; {494#(and (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (= (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~az~0#1| (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|)))} is VALID [2022-02-20 17:29:32,396 INFO L272 TraceCheckUtils]: 28: Hoare triple {494#(and (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (= (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~az~0#1| (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|)))} call __VERIFIER_assert((if 0 == main_~z~0#1 * main_~x~0#1 - main_~x~0#1 + main_~a~0#1 - main_~az~0#1 * main_~y~0#1 then 1 else 0)); {501#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:29:32,396 INFO L290 TraceCheckUtils]: 29: Hoare triple {501#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {505#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:29:32,397 INFO L290 TraceCheckUtils]: 30: Hoare triple {505#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {409#false} is VALID [2022-02-20 17:29:32,397 INFO L290 TraceCheckUtils]: 31: Hoare triple {409#false} assume !false; {409#false} is VALID [2022-02-20 17:29:32,397 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:29:32,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:29:43,900 INFO L290 TraceCheckUtils]: 31: Hoare triple {409#false} assume !false; {409#false} is VALID [2022-02-20 17:29:43,900 INFO L290 TraceCheckUtils]: 30: Hoare triple {505#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {409#false} is VALID [2022-02-20 17:29:43,901 INFO L290 TraceCheckUtils]: 29: Hoare triple {501#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {505#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:29:43,902 INFO L272 TraceCheckUtils]: 28: Hoare triple {521#(= (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) (+ |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~az~0#1| |ULTIMATE.start_main_~y~0#1|)))} call __VERIFIER_assert((if 0 == main_~z~0#1 * main_~x~0#1 - main_~x~0#1 + main_~a~0#1 - main_~az~0#1 * main_~y~0#1 then 1 else 0)); {501#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:29:43,902 INFO L290 TraceCheckUtils]: 27: Hoare triple {521#(= (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) (+ |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~az~0#1| |ULTIMATE.start_main_~y~0#1|)))} assume !false; {521#(= (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) (+ |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~az~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:29:43,936 INFO L290 TraceCheckUtils]: 26: Hoare triple {528#(= (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~az~0#1|) |ULTIMATE.start_main_~a~0#1|) (+ |ULTIMATE.start_main_~a~0#1| (* (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) |ULTIMATE.start_main_~z~0#1|)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~x~0#1 := main_~x~0#1 * main_~z~0#1 + main_~a~0#1;main_~y~0#1 := main_~y~0#1 * main_~z~0#1; {521#(= (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) (+ |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~az~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:29:43,940 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {484#(not (= |__VERIFIER_assert_#in~cond| 0))} {408#true} #58#return; {528#(= (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~az~0#1|) |ULTIMATE.start_main_~a~0#1|) (+ |ULTIMATE.start_main_~a~0#1| (* (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) |ULTIMATE.start_main_~z~0#1|)))} is VALID [2022-02-20 17:29:43,940 INFO L290 TraceCheckUtils]: 24: Hoare triple {484#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {484#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:29:43,941 INFO L290 TraceCheckUtils]: 23: Hoare triple {541#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {484#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:29:43,943 INFO L290 TraceCheckUtils]: 22: Hoare triple {408#true} ~cond := #in~cond; {541#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:29:43,943 INFO L272 TraceCheckUtils]: 21: Hoare triple {408#true} call __VERIFIER_assert((if 0 == main_~z~0#1 * main_~x~0#1 - main_~x~0#1 + main_~a~0#1 - main_~az~0#1 * main_~y~0#1 then 1 else 0)); {408#true} is VALID [2022-02-20 17:29:43,943 INFO L290 TraceCheckUtils]: 20: Hoare triple {408#true} assume !false; {408#true} is VALID [2022-02-20 17:29:43,943 INFO L290 TraceCheckUtils]: 19: Hoare triple {408#true} main_~x~0#1 := main_~a~0#1;main_~y~0#1 := 1;main_~c~0#1 := 1;main_~az~0#1 := main_~a~0#1 * main_~z~0#1; {408#true} is VALID [2022-02-20 17:29:43,943 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {408#true} {408#true} #56#return; {408#true} is VALID [2022-02-20 17:29:43,943 INFO L290 TraceCheckUtils]: 17: Hoare triple {408#true} assume true; {408#true} is VALID [2022-02-20 17:29:43,943 INFO L290 TraceCheckUtils]: 16: Hoare triple {408#true} assume !(0 == ~cond); {408#true} is VALID [2022-02-20 17:29:43,943 INFO L290 TraceCheckUtils]: 15: Hoare triple {408#true} ~cond := #in~cond; {408#true} is VALID [2022-02-20 17:29:43,944 INFO L272 TraceCheckUtils]: 14: Hoare triple {408#true} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 10 then 1 else 0)); {408#true} is VALID [2022-02-20 17:29:43,944 INFO L290 TraceCheckUtils]: 13: Hoare triple {408#true} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~k~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {408#true} is VALID [2022-02-20 17:29:43,944 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {408#true} {408#true} #54#return; {408#true} is VALID [2022-02-20 17:29:43,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {408#true} assume true; {408#true} is VALID [2022-02-20 17:29:43,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {408#true} assume !(0 == ~cond); {408#true} is VALID [2022-02-20 17:29:43,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {408#true} ~cond := #in~cond; {408#true} is VALID [2022-02-20 17:29:43,944 INFO L272 TraceCheckUtils]: 8: Hoare triple {408#true} call assume_abort_if_not((if main_~a~0#1 >= 0 && main_~a~0#1 <= 10 then 1 else 0)); {408#true} is VALID [2022-02-20 17:29:43,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {408#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~a~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {408#true} is VALID [2022-02-20 17:29:43,944 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {408#true} {408#true} #52#return; {408#true} is VALID [2022-02-20 17:29:43,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {408#true} assume true; {408#true} is VALID [2022-02-20 17:29:43,945 INFO L290 TraceCheckUtils]: 4: Hoare triple {408#true} assume !(0 == ~cond); {408#true} is VALID [2022-02-20 17:29:43,945 INFO L290 TraceCheckUtils]: 3: Hoare triple {408#true} ~cond := #in~cond; {408#true} is VALID [2022-02-20 17:29:43,945 INFO L272 TraceCheckUtils]: 2: Hoare triple {408#true} call assume_abort_if_not((if main_~z~0#1 >= 0 && main_~z~0#1 <= 10 then 1 else 0)); {408#true} is VALID [2022-02-20 17:29:43,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {408#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_~z~0#1, main_~a~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1, main_~az~0#1;havoc main_~z~0#1;havoc main_~a~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~0#1;havoc main_~az~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~z~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {408#true} is VALID [2022-02-20 17:29:43,945 INFO L290 TraceCheckUtils]: 0: Hoare triple {408#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {408#true} is VALID [2022-02-20 17:29:43,945 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:29:43,945 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:29:43,946 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810622974] [2022-02-20 17:29:43,946 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:29:43,946 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708926559] [2022-02-20 17:29:43,946 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708926559] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:29:43,946 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:29:43,946 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-02-20 17:29:43,946 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958446383] [2022-02-20 17:29:43,946 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:29:43,947 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-02-20 17:29:43,947 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:43,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:29:44,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:44,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 17:29:44,034 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:29:44,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 17:29:44,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:29:44,034 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:29:45,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:45,298 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-02-20 17:29:45,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:29:45,298 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-02-20 17:29:45,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:45,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:29:45,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2022-02-20 17:29:45,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:29:45,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2022-02-20 17:29:45,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 35 transitions. [2022-02-20 17:29:45,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:45,779 INFO L225 Difference]: With dead ends: 33 [2022-02-20 17:29:45,779 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 17:29:45,780 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:29:45,781 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 17:29:45,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 158 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 17:29:45,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 17:29:45,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 17:29:45,782 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:45,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-20 17:29:45,782 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-20 17:29:45,782 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-20 17:29:45,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:45,782 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:29:45,782 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:29:45,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:45,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:45,783 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 0 states. [2022-02-20 17:29:45,783 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 0 states. [2022-02-20 17:29:45,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:45,783 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:29:45,783 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:29:45,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:45,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:45,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:45,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:45,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-20 17:29:45,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 17:29:45,784 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2022-02-20 17:29:45,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:45,784 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 17:29:45,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:29:45,785 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:29:45,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:45,786 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:29:45,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-20 17:29:45,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-02-20 17:29:46,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 17:29:46,104 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 17:29:46,104 INFO L861 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: true [2022-02-20 17:29:46,104 INFO L858 garLoopResultBuilder]: For program point L29-1(line 29) no Hoare annotation was computed. [2022-02-20 17:29:46,104 INFO L861 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: true [2022-02-20 17:29:46,104 INFO L858 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2022-02-20 17:29:46,104 INFO L861 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: true [2022-02-20 17:29:46,104 INFO L858 garLoopResultBuilder]: For program point L25-1(line 25) no Hoare annotation was computed. [2022-02-20 17:29:46,104 INFO L858 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2022-02-20 17:29:46,104 INFO L854 garLoopResultBuilder]: At program point L36-2(lines 36 45) the Hoare annotation is: (= (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) (+ |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~az~0#1| |ULTIMATE.start_main_~y~0#1|))) [2022-02-20 17:29:46,104 INFO L854 garLoopResultBuilder]: At program point L36-3(lines 36 45) the Hoare annotation is: (= (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) (+ |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~az~0#1| |ULTIMATE.start_main_~y~0#1|))) [2022-02-20 17:29:46,105 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 17:29:46,105 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 17:29:46,105 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 17:29:46,105 INFO L861 garLoopResultBuilder]: At program point L47(lines 21 48) the Hoare annotation is: true [2022-02-20 17:29:46,105 INFO L854 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (= (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) (+ |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~az~0#1| |ULTIMATE.start_main_~y~0#1|))) [2022-02-20 17:29:46,105 INFO L858 garLoopResultBuilder]: For program point L37-1(lines 36 45) no Hoare annotation was computed. [2022-02-20 17:29:46,105 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 11 13) the Hoare annotation is: true [2022-02-20 17:29:46,105 INFO L858 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2022-02-20 17:29:46,105 INFO L858 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2022-02-20 17:29:46,106 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2022-02-20 17:29:46,106 INFO L858 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2022-02-20 17:29:46,106 INFO L858 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2022-02-20 17:29:46,106 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-02-20 17:29:46,106 INFO L858 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2022-02-20 17:29:46,106 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2022-02-20 17:29:46,106 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2022-02-20 17:29:46,108 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 17:29:46,109 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:29:46,111 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 17:29:46,111 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 17:29:46,111 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 17:29:46,111 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 17:29:46,112 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 17:29:46,112 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 17:29:46,112 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 17:29:46,112 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 17:29:46,112 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-02-20 17:29:46,112 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-02-20 17:29:46,112 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-02-20 17:29:46,112 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-02-20 17:29:46,112 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-02-20 17:29:46,112 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-02-20 17:29:46,112 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 17:29:46,112 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 17:29:46,113 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 17:29:46,113 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:29:46,113 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:29:46,113 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 17:29:46,113 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 17:29:46,113 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-02-20 17:29:46,113 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-02-20 17:29:46,113 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-02-20 17:29:46,113 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 17:29:46,113 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-02-20 17:29:46,114 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 17:29:46,114 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:29:46,114 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-02-20 17:29:46,114 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:29:46,114 INFO L163 areAnnotationChecker]: CFG has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 17:29:46,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 05:29:46 BoogieIcfgContainer [2022-02-20 17:29:46,120 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 17:29:46,121 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 17:29:46,121 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 17:29:46,121 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 17:29:46,122 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:29:30" (3/4) ... [2022-02-20 17:29:46,123 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 17:29:46,127 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-02-20 17:29:46,127 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-02-20 17:29:46,130 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-02-20 17:29:46,130 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 17:29:46,130 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 17:29:46,130 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 17:29:46,154 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 17:29:46,154 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 17:29:46,155 INFO L158 Benchmark]: Toolchain (without parser) took 15848.44ms. Allocated memory was 90.2MB in the beginning and 113.2MB in the end (delta: 23.1MB). Free memory was 55.9MB in the beginning and 59.9MB in the end (delta: -3.9MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2022-02-20 17:29:46,156 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 90.2MB. Free memory was 60.2MB in the beginning and 60.2MB in the end (delta: 23.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:29:46,156 INFO L158 Benchmark]: CACSL2BoogieTranslator took 179.71ms. Allocated memory is still 90.2MB. Free memory was 55.8MB in the beginning and 65.8MB in the end (delta: -10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:29:46,156 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.49ms. Allocated memory is still 90.2MB. Free memory was 65.8MB in the beginning and 64.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:29:46,156 INFO L158 Benchmark]: Boogie Preprocessor took 22.92ms. Allocated memory is still 90.2MB. Free memory was 64.1MB in the beginning and 63.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:29:46,156 INFO L158 Benchmark]: RCFGBuilder took 272.25ms. Allocated memory is still 90.2MB. Free memory was 63.1MB in the beginning and 52.1MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 17:29:46,157 INFO L158 Benchmark]: TraceAbstraction took 15307.50ms. Allocated memory was 90.2MB in the beginning and 113.2MB in the end (delta: 23.1MB). Free memory was 51.5MB in the beginning and 62.0MB in the end (delta: -10.4MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. [2022-02-20 17:29:46,157 INFO L158 Benchmark]: Witness Printer took 33.59ms. Allocated memory is still 113.2MB. Free memory was 62.0MB in the beginning and 59.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:29:46,159 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.16ms. Allocated memory is still 90.2MB. Free memory was 60.2MB in the beginning and 60.2MB in the end (delta: 23.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 179.71ms. Allocated memory is still 90.2MB. Free memory was 55.8MB in the beginning and 65.8MB in the end (delta: -10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.49ms. Allocated memory is still 90.2MB. Free memory was 65.8MB in the beginning and 64.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.92ms. Allocated memory is still 90.2MB. Free memory was 64.1MB in the beginning and 63.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 272.25ms. Allocated memory is still 90.2MB. Free memory was 63.1MB in the beginning and 52.1MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 15307.50ms. Allocated memory was 90.2MB in the beginning and 113.2MB in the end (delta: 23.1MB). Free memory was 51.5MB in the beginning and 62.0MB in the end (delta: -10.4MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. * Witness Printer took 33.59ms. Allocated memory is still 113.2MB. Free memory was 62.0MB in the beginning and 59.9MB in the end (delta: 2.1MB). 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 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.3s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19 mSDsluCounter, 270 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 198 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 74 IncrementalHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 72 mSDtfsCounter, 74 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=2, InterpolantAutomatonStates: 14, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 20 PreInvPairs, 32 NumberOfFragments, 39 HoareAnnotationTreeSize, 20 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 87 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 12.1s InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 110 ConstructedInterpolants, 0 QuantifiedInterpolants, 267 SizeOfPredicates, 3 NumberOfNonLiveVariables, 177 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 52/56 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: x * z + a == x + az * y RESULT: Ultimate proved your program to be correct! [2022-02-20 17:29:46,191 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 Result: TRUE