./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/geo2-ll_unwindbound2.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/geo2-ll_unwindbound2.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 2e05249da124fa8fd89a00721e51c7b41eff3d4952cff855bee564f7b5deef09 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:29:16,546 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:29:16,567 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:29:16,596 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:29:16,597 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:29:16,597 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:29:16,602 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:29:16,607 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:29:16,609 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:29:16,614 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:29:16,614 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:29:16,616 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:29:16,616 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:29:16,618 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:29:16,620 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:29:16,621 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:29:16,622 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:29:16,622 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:29:16,626 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:29:16,629 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:29:16,631 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:29:16,631 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:29:16,633 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:29:16,633 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:29:16,636 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:29:16,637 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:29:16,637 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:29:16,638 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:29:16,639 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:29:16,639 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:29:16,639 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:29:16,640 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:29:16,641 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:29:16,642 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:29:16,643 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:29:16,643 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:29:16,644 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:29:16,644 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:29:16,644 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:29:16,645 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:29:16,645 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:29:16,646 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:16,675 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:29:16,676 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:29:16,676 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:29:16,676 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:29:16,677 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:29:16,677 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:29:16,677 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:29:16,678 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:29:16,678 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:29:16,678 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:29:16,678 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:29:16,679 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:29:16,679 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:29:16,679 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:29:16,679 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:29:16,679 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:29:16,680 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:29:16,680 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:29:16,680 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:29:16,680 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:29:16,680 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:29:16,680 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:29:16,680 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:29:16,681 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:29:16,681 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:29:16,681 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:29:16,681 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:29:16,681 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:29:16,681 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:29:16,682 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:29:16,682 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:29:16,682 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:29:16,682 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:29:16,682 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 -> 2e05249da124fa8fd89a00721e51c7b41eff3d4952cff855bee564f7b5deef09 [2022-02-20 17:29:16,868 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:29:16,884 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:29:16,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:29:16,887 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:29:16,887 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:29:16,888 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/geo2-ll_unwindbound2.c [2022-02-20 17:29:16,940 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b4581252/b210f97c6af04964b27c59e20b10a9a3/FLAG33f4b0fd0 [2022-02-20 17:29:17,298 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:29:17,299 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo2-ll_unwindbound2.c [2022-02-20 17:29:17,311 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b4581252/b210f97c6af04964b27c59e20b10a9a3/FLAG33f4b0fd0 [2022-02-20 17:29:17,726 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b4581252/b210f97c6af04964b27c59e20b10a9a3 [2022-02-20 17:29:17,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:29:17,728 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:29:17,729 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:29:17,729 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:29:17,731 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:29:17,733 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:29:17" (1/1) ... [2022-02-20 17:29:17,734 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4600d300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:17, skipping insertion in model container [2022-02-20 17:29:17,734 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:29:17" (1/1) ... [2022-02-20 17:29:17,738 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:29:17,747 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:29:17,865 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/geo2-ll_unwindbound2.c[525,538] [2022-02-20 17:29:17,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:29:17,898 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:29:17,908 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/geo2-ll_unwindbound2.c[525,538] [2022-02-20 17:29:17,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:29:17,930 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:29:17,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:17 WrapperNode [2022-02-20 17:29:17,931 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:29:17,932 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:29:17,932 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:29:17,933 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:29:17,938 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:17" (1/1) ... [2022-02-20 17:29:17,943 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:17" (1/1) ... [2022-02-20 17:29:17,959 INFO L137 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 42 [2022-02-20 17:29:17,960 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:29:17,960 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:29:17,961 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:29:17,961 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:29:17,966 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:17" (1/1) ... [2022-02-20 17:29:17,966 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:17" (1/1) ... [2022-02-20 17:29:17,972 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:17" (1/1) ... [2022-02-20 17:29:17,973 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:17" (1/1) ... [2022-02-20 17:29:17,983 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:17" (1/1) ... [2022-02-20 17:29:17,986 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:17" (1/1) ... [2022-02-20 17:29:17,987 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:17" (1/1) ... [2022-02-20 17:29:17,991 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:29:17,992 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:29:17,992 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:29:17,993 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:29:17,994 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:17" (1/1) ... [2022-02-20 17:29:17,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:29:18,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:29:18,017 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:18,035 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:18,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:29:18,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:29:18,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:29:18,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:29:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:29:18,046 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:29:18,092 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:29:18,093 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:29:18,250 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:29:18,273 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:29:18,273 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:29:18,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:29:18 BoogieIcfgContainer [2022-02-20 17:29:18,279 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:29:18,280 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:29:18,288 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:29:18,291 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:29:18,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:29:17" (1/3) ... [2022-02-20 17:29:18,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c0c553c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:29:18, skipping insertion in model container [2022-02-20 17:29:18,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:17" (2/3) ... [2022-02-20 17:29:18,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c0c553c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:29:18, skipping insertion in model container [2022-02-20 17:29:18,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:29:18" (3/3) ... [2022-02-20 17:29:18,293 INFO L111 eAbstractionObserver]: Analyzing ICFG geo2-ll_unwindbound2.c [2022-02-20 17:29:18,296 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:29:18,297 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:29:18,325 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:29:18,330 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:18,330 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:29:18,343 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:18,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 17:29:18,352 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:18,353 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:18,353 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:18,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:18,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1819757606, now seen corresponding path program 1 times [2022-02-20 17:29:18,368 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:29:18,370 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109455275] [2022-02-20 17:29:18,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:18,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:29:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:18,511 INFO L290 TraceCheckUtils]: 0: Hoare triple {20#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);~counter~0 := 0; {20#true} is VALID [2022-02-20 17:29:18,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {20#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~post6#1, main_~z~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1;havoc main_~z~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~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;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~k~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 1;main_~y~0#1 := 1;main_~c~0#1 := 1; {20#true} is VALID [2022-02-20 17:29:18,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {20#true} assume !true; {21#false} is VALID [2022-02-20 17:29:18,513 INFO L272 TraceCheckUtils]: 3: Hoare triple {21#false} call __VERIFIER_assert((if 0 == 1 + main_~x~0#1 * main_~z~0#1 - main_~x~0#1 - main_~z~0#1 * main_~y~0#1 then 1 else 0)); {21#false} is VALID [2022-02-20 17:29:18,513 INFO L290 TraceCheckUtils]: 4: Hoare triple {21#false} ~cond := #in~cond; {21#false} is VALID [2022-02-20 17:29:18,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#false} assume 0 == ~cond; {21#false} is VALID [2022-02-20 17:29:18,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#false} assume !false; {21#false} is VALID [2022-02-20 17:29:18,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:29:18,515 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:29:18,516 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109455275] [2022-02-20 17:29:18,517 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109455275] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:29:18,517 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:29:18,517 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:29:18,520 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347964577] [2022-02-20 17:29:18,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:29:18,524 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 17:29:18,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:18,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:18,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:18,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:29:18,549 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:29:18,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:29:18,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:29:18,570 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:18,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:18,609 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-02-20 17:29:18,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:29:18,610 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 17:29:18,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:18,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:18,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 42 transitions. [2022-02-20 17:29:18,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:18,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 42 transitions. [2022-02-20 17:29:18,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 42 transitions. [2022-02-20 17:29:18,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:18,673 INFO L225 Difference]: With dead ends: 32 [2022-02-20 17:29:18,674 INFO L226 Difference]: Without dead ends: 13 [2022-02-20 17:29:18,677 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:29:18,681 INFO L933 BasicCegarLoop]: 19 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, 19 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:18,682 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 19 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:18,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-02-20 17:29:18,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-02-20 17:29:18,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:18,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:29:18,715 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:29:18,716 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:29:18,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:18,722 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2022-02-20 17:29:18,722 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-02-20 17:29:18,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:18,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:18,724 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-02-20 17:29:18,724 INFO L87 Difference]: Start difference. First operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-02-20 17:29:18,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:18,728 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2022-02-20 17:29:18,728 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-02-20 17:29:18,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:18,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:18,729 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:18,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:18,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:29:18,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2022-02-20 17:29:18,736 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2022-02-20 17:29:18,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:18,737 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-02-20 17:29:18,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:18,738 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-02-20 17:29:18,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:29:18,739 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:18,739 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:18,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:29:18,740 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:18,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:18,743 INFO L85 PathProgramCache]: Analyzing trace with hash 178410715, now seen corresponding path program 1 times [2022-02-20 17:29:18,743 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:29:18,743 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400659057] [2022-02-20 17:29:18,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:18,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:29:18,769 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:29:18,771 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2115362401] [2022-02-20 17:29:18,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:18,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:29:18,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:29:18,773 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:18,792 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:18,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:18,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 17:29:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:18,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:29:18,930 INFO L290 TraceCheckUtils]: 0: Hoare triple {109#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);~counter~0 := 0; {114#(<= ~counter~0 0)} is VALID [2022-02-20 17:29:18,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {114#(<= ~counter~0 0)} 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~post6#1, main_~z~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1;havoc main_~z~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~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;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~k~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 1;main_~y~0#1 := 1;main_~c~0#1 := 1; {114#(<= ~counter~0 0)} is VALID [2022-02-20 17:29:18,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {114#(<= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {121#(<= |ULTIMATE.start_main_#t~post6#1| 0)} is VALID [2022-02-20 17:29:18,933 INFO L290 TraceCheckUtils]: 3: Hoare triple {121#(<= |ULTIMATE.start_main_#t~post6#1| 0)} assume !(main_#t~post6#1 < 2);havoc main_#t~post6#1; {110#false} is VALID [2022-02-20 17:29:18,933 INFO L272 TraceCheckUtils]: 4: Hoare triple {110#false} call __VERIFIER_assert((if 0 == 1 + main_~x~0#1 * main_~z~0#1 - main_~x~0#1 - main_~z~0#1 * main_~y~0#1 then 1 else 0)); {110#false} is VALID [2022-02-20 17:29:18,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {110#false} ~cond := #in~cond; {110#false} is VALID [2022-02-20 17:29:18,933 INFO L290 TraceCheckUtils]: 6: Hoare triple {110#false} assume 0 == ~cond; {110#false} is VALID [2022-02-20 17:29:18,933 INFO L290 TraceCheckUtils]: 7: Hoare triple {110#false} assume !false; {110#false} is VALID [2022-02-20 17:29:18,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:29:18,934 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:29:18,934 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:29:18,934 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400659057] [2022-02-20 17:29:18,934 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:29:18,935 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115362401] [2022-02-20 17:29:18,937 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115362401] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:29:18,938 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:29:18,938 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:29:18,939 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868478968] [2022-02-20 17:29:18,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:29:18,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:29:18,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:18,940 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:18,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:18,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:29:18,952 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:29:18,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:29:18,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:29:18,954 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:19,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:19,013 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-02-20 17:29:19,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:29:19,014 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:29:19,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:19,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:19,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2022-02-20 17:29:19,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:19,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2022-02-20 17:29:19,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 24 transitions. [2022-02-20 17:29:19,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:19,038 INFO L225 Difference]: With dead ends: 22 [2022-02-20 17:29:19,038 INFO L226 Difference]: Without dead ends: 15 [2022-02-20 17:29:19,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:29:19,040 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:29:19,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:29:19,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-02-20 17:29:19,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-02-20 17:29:19,058 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:19,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:29:19,059 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:29:19,059 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:29:19,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:19,060 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-20 17:29:19,060 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 17:29:19,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:19,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:19,061 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-02-20 17:29:19,061 INFO L87 Difference]: Start difference. First operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-02-20 17:29:19,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:19,062 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-20 17:29:19,062 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 17:29:19,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:19,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:19,062 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:19,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:19,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:29:19,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-02-20 17:29:19,064 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 8 [2022-02-20 17:29:19,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:19,064 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-02-20 17:29:19,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:19,064 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 17:29:19,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:29:19,065 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:19,065 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:19,084 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:19,284 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:19,285 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:19,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:19,285 INFO L85 PathProgramCache]: Analyzing trace with hash 180198175, now seen corresponding path program 1 times [2022-02-20 17:29:19,285 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:29:19,286 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859698079] [2022-02-20 17:29:19,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:19,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:29:19,295 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:29:19,295 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1292438684] [2022-02-20 17:29:19,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:19,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:29:19,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:29:19,297 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:19,298 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:19,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:19,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:29:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:19,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:29:19,402 INFO L290 TraceCheckUtils]: 0: Hoare triple {215#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);~counter~0 := 0; {215#true} is VALID [2022-02-20 17:29:19,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {215#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~post6#1, main_~z~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1;havoc main_~z~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~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;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~k~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 1;main_~y~0#1 := 1;main_~c~0#1 := 1; {223#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:29:19,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {223#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {223#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:29:19,405 INFO L290 TraceCheckUtils]: 3: Hoare triple {223#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_#t~post6#1 < 2);havoc main_#t~post6#1; {223#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:29:19,406 INFO L272 TraceCheckUtils]: 4: Hoare triple {223#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} call __VERIFIER_assert((if 0 == 1 + main_~x~0#1 * main_~z~0#1 - main_~x~0#1 - main_~z~0#1 * main_~y~0#1 then 1 else 0)); {233#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:29:19,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {233#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {237#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:29:19,407 INFO L290 TraceCheckUtils]: 6: Hoare triple {237#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {216#false} is VALID [2022-02-20 17:29:19,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {216#false} assume !false; {216#false} is VALID [2022-02-20 17:29:19,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:29:19,407 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:29:19,407 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:29:19,408 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859698079] [2022-02-20 17:29:19,408 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:29:19,408 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292438684] [2022-02-20 17:29:19,408 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292438684] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:29:19,409 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:29:19,409 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:29:19,409 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812782716] [2022-02-20 17:29:19,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:29:19,410 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:29:19,410 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:19,410 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:19,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:19,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:29:19,419 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:29:19,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:29:19,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:29:19,420 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:19,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:19,480 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-02-20 17:29:19,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:29:19,481 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:29:19,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:19,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:19,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-02-20 17:29:19,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:19,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-02-20 17:29:19,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2022-02-20 17:29:19,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:19,506 INFO L225 Difference]: With dead ends: 24 [2022-02-20 17:29:19,506 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 17:29:19,507 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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:19,508 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:29:19,508 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 45 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:29:19,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 17:29:19,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-20 17:29:19,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:19,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:19,512 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:19,513 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:19,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:19,514 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-02-20 17:29:19,514 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 17:29:19,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:19,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:19,514 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 21 states. [2022-02-20 17:29:19,515 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 21 states. [2022-02-20 17:29:19,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:19,516 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-02-20 17:29:19,516 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 17:29:19,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:19,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:19,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:19,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:19,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:19,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-02-20 17:29:19,518 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 8 [2022-02-20 17:29:19,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:19,518 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-02-20 17:29:19,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:19,518 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 17:29:19,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 17:29:19,519 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:19,519 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:19,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 17:29:19,743 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:19,744 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:19,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:19,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1542398814, now seen corresponding path program 1 times [2022-02-20 17:29:19,744 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:29:19,744 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612912132] [2022-02-20 17:29:19,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:19,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:29:19,756 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:29:19,759 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1672189164] [2022-02-20 17:29:19,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:19,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:29:19,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:29:19,761 INFO L229 MonitoredProcess]: Starting monitored process 4 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:19,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 17:29:19,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:19,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:29:19,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:19,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:29:19,885 INFO L290 TraceCheckUtils]: 0: Hoare triple {347#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);~counter~0 := 0; {352#(<= ~counter~0 0)} is VALID [2022-02-20 17:29:19,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {352#(<= ~counter~0 0)} 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~post6#1, main_~z~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1;havoc main_~z~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~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;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~k~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 1;main_~y~0#1 := 1;main_~c~0#1 := 1; {352#(<= ~counter~0 0)} is VALID [2022-02-20 17:29:19,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {352#(<= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {359#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:19,887 INFO L290 TraceCheckUtils]: 3: Hoare triple {359#(<= ~counter~0 1)} assume !!(main_#t~post6#1 < 2);havoc main_#t~post6#1; {359#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:19,888 INFO L272 TraceCheckUtils]: 4: Hoare triple {359#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 1 + main_~x~0#1 * main_~z~0#1 - main_~x~0#1 - main_~z~0#1 * main_~y~0#1 then 1 else 0)); {359#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:19,888 INFO L290 TraceCheckUtils]: 5: Hoare triple {359#(<= ~counter~0 1)} ~cond := #in~cond; {359#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:19,888 INFO L290 TraceCheckUtils]: 6: Hoare triple {359#(<= ~counter~0 1)} assume !(0 == ~cond); {359#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:19,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {359#(<= ~counter~0 1)} assume true; {359#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:19,889 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {359#(<= ~counter~0 1)} {359#(<= ~counter~0 1)} #39#return; {359#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:19,890 INFO L290 TraceCheckUtils]: 9: Hoare triple {359#(<= ~counter~0 1)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~x~0#1 := 1 + main_~x~0#1 * main_~z~0#1;main_~y~0#1 := main_~y~0#1 * main_~z~0#1; {359#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:19,890 INFO L290 TraceCheckUtils]: 10: Hoare triple {359#(<= ~counter~0 1)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {384#(<= |ULTIMATE.start_main_#t~post6#1| 1)} is VALID [2022-02-20 17:29:19,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {384#(<= |ULTIMATE.start_main_#t~post6#1| 1)} assume !(main_#t~post6#1 < 2);havoc main_#t~post6#1; {348#false} is VALID [2022-02-20 17:29:19,891 INFO L272 TraceCheckUtils]: 12: Hoare triple {348#false} call __VERIFIER_assert((if 0 == 1 + main_~x~0#1 * main_~z~0#1 - main_~x~0#1 - main_~z~0#1 * main_~y~0#1 then 1 else 0)); {348#false} is VALID [2022-02-20 17:29:19,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {348#false} ~cond := #in~cond; {348#false} is VALID [2022-02-20 17:29:19,891 INFO L290 TraceCheckUtils]: 14: Hoare triple {348#false} assume 0 == ~cond; {348#false} is VALID [2022-02-20 17:29:19,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {348#false} assume !false; {348#false} is VALID [2022-02-20 17:29:19,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:29:19,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:29:19,979 INFO L290 TraceCheckUtils]: 15: Hoare triple {348#false} assume !false; {348#false} is VALID [2022-02-20 17:29:19,979 INFO L290 TraceCheckUtils]: 14: Hoare triple {348#false} assume 0 == ~cond; {348#false} is VALID [2022-02-20 17:29:19,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {348#false} ~cond := #in~cond; {348#false} is VALID [2022-02-20 17:29:19,980 INFO L272 TraceCheckUtils]: 12: Hoare triple {348#false} call __VERIFIER_assert((if 0 == 1 + main_~x~0#1 * main_~z~0#1 - main_~x~0#1 - main_~z~0#1 * main_~y~0#1 then 1 else 0)); {348#false} is VALID [2022-02-20 17:29:19,980 INFO L290 TraceCheckUtils]: 11: Hoare triple {384#(<= |ULTIMATE.start_main_#t~post6#1| 1)} assume !(main_#t~post6#1 < 2);havoc main_#t~post6#1; {348#false} is VALID [2022-02-20 17:29:19,980 INFO L290 TraceCheckUtils]: 10: Hoare triple {359#(<= ~counter~0 1)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {384#(<= |ULTIMATE.start_main_#t~post6#1| 1)} is VALID [2022-02-20 17:29:19,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {359#(<= ~counter~0 1)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~x~0#1 := 1 + main_~x~0#1 * main_~z~0#1;main_~y~0#1 := main_~y~0#1 * main_~z~0#1; {359#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:19,981 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {347#true} {359#(<= ~counter~0 1)} #39#return; {359#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:19,981 INFO L290 TraceCheckUtils]: 7: Hoare triple {347#true} assume true; {347#true} is VALID [2022-02-20 17:29:19,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {347#true} assume !(0 == ~cond); {347#true} is VALID [2022-02-20 17:29:19,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {347#true} ~cond := #in~cond; {347#true} is VALID [2022-02-20 17:29:19,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {359#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 1 + main_~x~0#1 * main_~z~0#1 - main_~x~0#1 - main_~z~0#1 * main_~y~0#1 then 1 else 0)); {347#true} is VALID [2022-02-20 17:29:19,982 INFO L290 TraceCheckUtils]: 3: Hoare triple {359#(<= ~counter~0 1)} assume !!(main_#t~post6#1 < 2);havoc main_#t~post6#1; {359#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:19,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {352#(<= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {359#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:19,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {352#(<= ~counter~0 0)} 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~post6#1, main_~z~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1;havoc main_~z~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~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;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~k~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 1;main_~y~0#1 := 1;main_~c~0#1 := 1; {352#(<= ~counter~0 0)} is VALID [2022-02-20 17:29:19,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {347#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);~counter~0 := 0; {352#(<= ~counter~0 0)} is VALID [2022-02-20 17:29:19,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:29:19,991 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:29:19,991 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612912132] [2022-02-20 17:29:19,991 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:29:19,991 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672189164] [2022-02-20 17:29:19,991 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672189164] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:29:19,992 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:29:19,992 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 5 [2022-02-20 17:29:19,992 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443841509] [2022-02-20 17:29:19,992 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:29:19,993 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2022-02-20 17:29:19,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:19,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:29:20,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:20,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:29:20,008 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:29:20,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:29:20,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:29:20,009 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:29:20,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:20,067 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-02-20 17:29:20,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:29:20,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2022-02-20 17:29:20,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:20,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:29:20,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-02-20 17:29:20,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:29:20,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-02-20 17:29:20,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2022-02-20 17:29:20,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:20,092 INFO L225 Difference]: With dead ends: 30 [2022-02-20 17:29:20,092 INFO L226 Difference]: Without dead ends: 23 [2022-02-20 17:29:20,092 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:29:20,093 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:29:20,093 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 41 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:29:20,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-20 17:29:20,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-02-20 17:29:20,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:20,098 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:20,098 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:20,098 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:20,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:20,109 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-02-20 17:29:20,109 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-02-20 17:29:20,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:20,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:20,110 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-02-20 17:29:20,110 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-02-20 17:29:20,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:20,111 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-02-20 17:29:20,111 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-02-20 17:29:20,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:20,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:20,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:20,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:20,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:20,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-02-20 17:29:20,112 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 16 [2022-02-20 17:29:20,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:20,113 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-02-20 17:29:20,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:29:20,113 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-02-20 17:29:20,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 17:29:20,114 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:20,114 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:20,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 17:29:20,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:29:20,320 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:20,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:20,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1540611354, now seen corresponding path program 1 times [2022-02-20 17:29:20,320 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:29:20,320 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214473351] [2022-02-20 17:29:20,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:20,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:29:20,335 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:29:20,336 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1004821223] [2022-02-20 17:29:20,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:20,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:29:20,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:29:20,344 INFO L229 MonitoredProcess]: Starting monitored process 5 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:20,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 17:29:20,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:20,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 17:29:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:20,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:29:20,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {563#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);~counter~0 := 0; {563#true} is VALID [2022-02-20 17:29:20,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {563#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~post6#1, main_~z~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1;havoc main_~z~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~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;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~k~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 1;main_~y~0#1 := 1;main_~c~0#1 := 1; {571#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:29:20,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {571#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {571#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:29:20,544 INFO L290 TraceCheckUtils]: 3: Hoare triple {571#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_#t~post6#1 < 2);havoc main_#t~post6#1; {571#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:29:20,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {571#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} call __VERIFIER_assert((if 0 == 1 + main_~x~0#1 * main_~z~0#1 - main_~x~0#1 - main_~z~0#1 * main_~y~0#1 then 1 else 0)); {563#true} is VALID [2022-02-20 17:29:20,545 INFO L290 TraceCheckUtils]: 5: Hoare triple {563#true} ~cond := #in~cond; {563#true} is VALID [2022-02-20 17:29:20,545 INFO L290 TraceCheckUtils]: 6: Hoare triple {563#true} assume !(0 == ~cond); {563#true} is VALID [2022-02-20 17:29:20,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {563#true} assume true; {563#true} is VALID [2022-02-20 17:29:20,546 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {563#true} {571#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} #39#return; {571#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:29:20,546 INFO L290 TraceCheckUtils]: 9: Hoare triple {571#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~x~0#1 := 1 + main_~x~0#1 * main_~z~0#1;main_~y~0#1 := main_~y~0#1 * main_~z~0#1; {596#(and (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)))} is VALID [2022-02-20 17:29:20,547 INFO L290 TraceCheckUtils]: 10: Hoare triple {596#(and (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {596#(and (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)))} is VALID [2022-02-20 17:29:20,547 INFO L290 TraceCheckUtils]: 11: Hoare triple {596#(and (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)))} assume !!(main_#t~post6#1 < 2);havoc main_#t~post6#1; {596#(and (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)))} is VALID [2022-02-20 17:29:20,548 INFO L272 TraceCheckUtils]: 12: Hoare triple {596#(and (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)))} call __VERIFIER_assert((if 0 == 1 + main_~x~0#1 * main_~z~0#1 - main_~x~0#1 - main_~z~0#1 * main_~y~0#1 then 1 else 0)); {606#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:29:20,549 INFO L290 TraceCheckUtils]: 13: Hoare triple {606#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {610#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:29:20,550 INFO L290 TraceCheckUtils]: 14: Hoare triple {610#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {564#false} is VALID [2022-02-20 17:29:20,550 INFO L290 TraceCheckUtils]: 15: Hoare triple {564#false} assume !false; {564#false} is VALID [2022-02-20 17:29:20,551 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:29:20,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:29:20,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {564#false} assume !false; {564#false} is VALID [2022-02-20 17:29:20,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {610#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {564#false} is VALID [2022-02-20 17:29:20,764 INFO L290 TraceCheckUtils]: 13: Hoare triple {606#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {610#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:29:20,764 INFO L272 TraceCheckUtils]: 12: Hoare triple {626#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~x~0#1|) (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 1))} call __VERIFIER_assert((if 0 == 1 + main_~x~0#1 * main_~z~0#1 - main_~x~0#1 - main_~z~0#1 * main_~y~0#1 then 1 else 0)); {606#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:29:20,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {626#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~x~0#1|) (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 1))} assume !!(main_#t~post6#1 < 2);havoc main_#t~post6#1; {626#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~x~0#1|) (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 1))} is VALID [2022-02-20 17:29:20,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {626#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~x~0#1|) (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 1))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {626#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~x~0#1|) (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 1))} is VALID [2022-02-20 17:29:20,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {571#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~x~0#1 := 1 + main_~x~0#1 * main_~z~0#1;main_~y~0#1 := main_~y~0#1 * main_~z~0#1; {626#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~x~0#1|) (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 1))} is VALID [2022-02-20 17:29:20,775 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {563#true} {571#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} #39#return; {571#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:29:20,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {563#true} assume true; {563#true} is VALID [2022-02-20 17:29:20,775 INFO L290 TraceCheckUtils]: 6: Hoare triple {563#true} assume !(0 == ~cond); {563#true} is VALID [2022-02-20 17:29:20,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {563#true} ~cond := #in~cond; {563#true} is VALID [2022-02-20 17:29:20,776 INFO L272 TraceCheckUtils]: 4: Hoare triple {571#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} call __VERIFIER_assert((if 0 == 1 + main_~x~0#1 * main_~z~0#1 - main_~x~0#1 - main_~z~0#1 * main_~y~0#1 then 1 else 0)); {563#true} is VALID [2022-02-20 17:29:20,776 INFO L290 TraceCheckUtils]: 3: Hoare triple {571#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_#t~post6#1 < 2);havoc main_#t~post6#1; {571#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:29:20,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {571#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {571#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:29:20,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {563#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~post6#1, main_~z~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1;havoc main_~z~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~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;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~k~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 1;main_~y~0#1 := 1;main_~c~0#1 := 1; {571#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:29:20,778 INFO L290 TraceCheckUtils]: 0: Hoare triple {563#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);~counter~0 := 0; {563#true} is VALID [2022-02-20 17:29:20,778 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:29:20,778 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:29:20,778 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214473351] [2022-02-20 17:29:20,778 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:29:20,779 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004821223] [2022-02-20 17:29:20,779 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004821223] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:29:20,779 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:29:20,779 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-02-20 17:29:20,779 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474294150] [2022-02-20 17:29:20,780 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:29:20,781 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 17:29:20,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:20,781 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:29:20,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:20,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 17:29:20,802 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:29:20,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 17:29:20,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:29:20,803 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:29:20,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:20,995 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-02-20 17:29:20,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:29:20,995 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 17:29:20,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:20,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:29:20,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2022-02-20 17:29:20,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:29:20,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2022-02-20 17:29:20,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 27 transitions. [2022-02-20 17:29:21,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:21,042 INFO L225 Difference]: With dead ends: 26 [2022-02-20 17:29:21,042 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 17:29:21,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:29:21,043 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 9 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:29:21,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 49 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:29:21,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 17:29:21,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 17:29:21,044 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:21,044 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:21,044 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:21,045 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:21,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:21,045 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:29:21,045 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:29:21,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:21,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:21,045 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:21,046 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:21,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:21,046 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:29:21,046 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:29:21,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:21,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:21,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:21,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:21,047 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:21,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 17:29:21,047 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2022-02-20 17:29:21,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:21,047 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 17:29:21,047 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:29:21,047 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:29:21,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:21,049 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:29:21,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 17:29:21,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:29:21,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 17:29:21,313 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 17:29:21,313 INFO L858 garLoopResultBuilder]: For program point L44(line 44) no Hoare annotation was computed. [2022-02-20 17:29:21,313 INFO L858 garLoopResultBuilder]: For program point L34-1(lines 34 43) no Hoare annotation was computed. [2022-02-20 17:29:21,314 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 17:29:21,314 INFO L854 garLoopResultBuilder]: At program point L34-3(lines 34 43) the Hoare annotation is: (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~x~0#1|) (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 1)) [2022-02-20 17:29:21,314 INFO L854 garLoopResultBuilder]: At program point L34-4(lines 34 43) the Hoare annotation is: (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~x~0#1|) (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 1)) [2022-02-20 17:29:21,314 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 17:29:21,314 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 17:29:21,314 INFO L861 garLoopResultBuilder]: At program point L45(lines 24 46) the Hoare annotation is: true [2022-02-20 17:29:21,314 INFO L854 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~x~0#1|) (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 1)) [2022-02-20 17:29:21,314 INFO L858 garLoopResultBuilder]: For program point L35-1(lines 34 43) no Hoare annotation was computed. [2022-02-20 17:29:21,314 INFO L858 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2022-02-20 17:29:21,314 INFO L858 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2022-02-20 17:29:21,314 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-02-20 17:29:21,315 INFO L858 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2022-02-20 17:29:21,315 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2022-02-20 17:29:21,315 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2022-02-20 17:29:21,317 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-02-20 17:29:21,318 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:29:21,321 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 17:29:21,321 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 17:29:21,321 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 17:29:21,321 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 17:29:21,321 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 17:29:21,322 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-02-20 17:29:21,322 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-02-20 17:29:21,322 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-02-20 17:29:21,322 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-02-20 17:29:21,322 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-02-20 17:29:21,322 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-02-20 17:29:21,322 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-02-20 17:29:21,322 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:29:21,322 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:29:21,322 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-02-20 17:29:21,322 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-02-20 17:29:21,322 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-02-20 17:29:21,322 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-02-20 17:29:21,322 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:29:21,322 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:29:21,322 INFO L163 areAnnotationChecker]: CFG has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 17:29:21,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 05:29:21 BoogieIcfgContainer [2022-02-20 17:29:21,328 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 17:29:21,329 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 17:29:21,329 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 17:29:21,329 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 17:29:21,329 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:18" (3/4) ... [2022-02-20 17:29:21,331 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 17:29:21,335 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-02-20 17:29:21,337 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-02-20 17:29:21,338 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 17:29:21,338 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 17:29:21,338 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 17:29:21,357 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 17:29:21,357 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 17:29:21,358 INFO L158 Benchmark]: Toolchain (without parser) took 3629.62ms. Allocated memory was 90.2MB in the beginning and 111.1MB in the end (delta: 21.0MB). Free memory was 59.8MB in the beginning and 54.8MB in the end (delta: 5.0MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. [2022-02-20 17:29:21,358 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 90.2MB. Free memory was 46.3MB in the beginning and 46.3MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:29:21,358 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.36ms. Allocated memory was 90.2MB in the beginning and 111.1MB in the end (delta: 21.0MB). Free memory was 59.5MB in the beginning and 86.6MB in the end (delta: -27.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:29:21,359 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.68ms. Allocated memory is still 111.1MB. Free memory was 86.6MB in the beginning and 85.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:29:21,359 INFO L158 Benchmark]: Boogie Preprocessor took 31.20ms. Allocated memory is still 111.1MB. Free memory was 85.0MB in the beginning and 83.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:29:21,359 INFO L158 Benchmark]: RCFGBuilder took 286.91ms. Allocated memory is still 111.1MB. Free memory was 83.9MB in the beginning and 73.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 17:29:21,359 INFO L158 Benchmark]: TraceAbstraction took 3048.31ms. Allocated memory is still 111.1MB. Free memory was 72.9MB in the beginning and 57.3MB in the end (delta: 15.6MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2022-02-20 17:29:21,360 INFO L158 Benchmark]: Witness Printer took 28.32ms. Allocated memory is still 111.1MB. Free memory was 57.3MB in the beginning and 54.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:29:21,361 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.17ms. Allocated memory is still 90.2MB. Free memory was 46.3MB in the beginning and 46.3MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 202.36ms. Allocated memory was 90.2MB in the beginning and 111.1MB in the end (delta: 21.0MB). Free memory was 59.5MB in the beginning and 86.6MB in the end (delta: -27.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.68ms. Allocated memory is still 111.1MB. Free memory was 86.6MB in the beginning and 85.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.20ms. Allocated memory is still 111.1MB. Free memory was 85.0MB in the beginning and 83.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 286.91ms. Allocated memory is still 111.1MB. Free memory was 83.9MB in the beginning and 73.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3048.31ms. Allocated memory is still 111.1MB. Free memory was 72.9MB in the beginning and 57.3MB in the end (delta: 15.6MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. * Witness Printer took 28.32ms. Allocated memory is still 111.1MB. Free memory was 57.3MB in the beginning and 54.8MB in the end (delta: 2.6MB). 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 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16 mSDsluCounter, 189 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 119 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 66 IncrementalHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 70 mSDtfsCounter, 66 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=4, InterpolantAutomatonStates: 24, 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, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 14 PreInvPairs, 24 NumberOfFragments, 35 HoareAnnotationTreeSize, 14 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 75 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 55 NumberOfCodeBlocks, 55 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 254 SizeOfPredicates, 4 NumberOfNonLiveVariables, 246 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 8/18 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: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: y * z + x == x * z + 1 RESULT: Ultimate proved your program to be correct! [2022-02-20 17:29:21,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE