./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_unwindbound100.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/egcd3-ll_unwindbound100.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 d4daf1340b92ad99da0e14bd9974ded6768f4e200672f7478b349dd411e40bd7 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:22:21,236 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:22:21,238 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:22:21,271 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:22:21,271 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:22:21,274 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:22:21,274 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:22:21,276 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:22:21,278 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:22:21,281 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:22:21,281 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:22:21,283 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:22:21,283 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:22:21,284 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:22:21,285 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:22:21,288 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:22:21,288 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:22:21,289 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:22:21,291 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:22:21,295 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:22:21,296 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:22:21,296 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:22:21,298 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:22:21,298 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:22:21,303 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:22:21,303 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:22:21,303 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:22:21,304 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:22:21,305 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:22:21,305 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:22:21,306 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:22:21,306 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:22:21,307 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:22:21,308 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:22:21,309 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:22:21,309 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:22:21,310 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:22:21,310 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:22:21,310 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:22:21,311 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:22:21,312 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:22:21,312 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:22:21,335 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:22:21,335 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:22:21,336 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:22:21,336 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:22:21,336 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:22:21,337 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:22:21,337 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:22:21,337 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:22:21,337 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:22:21,337 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:22:21,338 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:22:21,338 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:22:21,338 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:22:21,339 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:22:21,339 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:22:21,339 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:22:21,339 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:22:21,339 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:22:21,339 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:22:21,339 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:22:21,340 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:22:21,340 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:22:21,340 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:22:21,340 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:22:21,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:22:21,340 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:22:21,341 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:22:21,341 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:22:21,342 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:22:21,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:22:21,342 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:22:21,342 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:22:21,342 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:22:21,342 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 -> d4daf1340b92ad99da0e14bd9974ded6768f4e200672f7478b349dd411e40bd7 [2022-02-20 17:22:21,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:22:21,575 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:22:21,577 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:22:21,578 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:22:21,578 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:22:21,579 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_unwindbound100.c [2022-02-20 17:22:21,635 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf0abf1f2/0432a44a0ce14d78938140fd2ea169fa/FLAG9feeb8415 [2022-02-20 17:22:21,910 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:22:21,910 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_unwindbound100.c [2022-02-20 17:22:21,915 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf0abf1f2/0432a44a0ce14d78938140fd2ea169fa/FLAG9feeb8415 [2022-02-20 17:22:22,357 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf0abf1f2/0432a44a0ce14d78938140fd2ea169fa [2022-02-20 17:22:22,360 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:22:22,361 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:22:22,364 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:22:22,364 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:22:22,366 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:22:22,367 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:22:22" (1/1) ... [2022-02-20 17:22:22,368 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25284050 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:22:22, skipping insertion in model container [2022-02-20 17:22:22,368 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:22:22" (1/1) ... [2022-02-20 17:22:22,372 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:22:22,384 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:22:22,499 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/egcd3-ll_unwindbound100.c[490,503] [2022-02-20 17:22:22,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:22:22,534 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:22:22,547 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/egcd3-ll_unwindbound100.c[490,503] [2022-02-20 17:22:22,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:22:22,574 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:22:22,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:22:22 WrapperNode [2022-02-20 17:22:22,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:22:22,578 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:22:22,578 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:22:22,578 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:22:22,582 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:22:22" (1/1) ... [2022-02-20 17:22:22,588 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:22:22" (1/1) ... [2022-02-20 17:22:22,610 INFO L137 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 91 [2022-02-20 17:22:22,610 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:22:22,611 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:22:22,611 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:22:22,611 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:22:22,616 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:22:22" (1/1) ... [2022-02-20 17:22:22,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:22:22" (1/1) ... [2022-02-20 17:22:22,623 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:22:22" (1/1) ... [2022-02-20 17:22:22,623 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:22:22" (1/1) ... [2022-02-20 17:22:22,632 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:22:22" (1/1) ... [2022-02-20 17:22:22,635 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:22:22" (1/1) ... [2022-02-20 17:22:22,639 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:22:22" (1/1) ... [2022-02-20 17:22:22,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:22:22,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:22:22,642 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:22:22,643 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:22:22,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:22:22" (1/1) ... [2022-02-20 17:22:22,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:22:22,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:22:22,717 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:22:22,774 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:22:22,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:22:22,802 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 17:22:22,802 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 17:22:22,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:22:22,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:22:22,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:22:22,802 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:22:22,803 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:22:22,847 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:22:22,849 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:22:23,042 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:22:23,058 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:22:23,071 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 17:22:23,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:22:23 BoogieIcfgContainer [2022-02-20 17:22:23,073 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:22:23,074 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:22:23,074 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:22:23,076 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:22:23,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:22:22" (1/3) ... [2022-02-20 17:22:23,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65380d80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:22:23, skipping insertion in model container [2022-02-20 17:22:23,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:22:22" (2/3) ... [2022-02-20 17:22:23,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65380d80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:22:23, skipping insertion in model container [2022-02-20 17:22:23,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:22:23" (3/3) ... [2022-02-20 17:22:23,078 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd3-ll_unwindbound100.c [2022-02-20 17:22:23,081 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:22:23,083 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:22:23,148 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:22:23,157 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:22:23,157 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:22:23,171 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 24 states have (on average 1.5) internal successors, (36), 25 states have internal predecessors, (36), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:22:23,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 17:22:23,174 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:22:23,174 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:22:23,175 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:22:23,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:22:23,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1663185933, now seen corresponding path program 1 times [2022-02-20 17:22:23,184 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:22:23,184 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964387754] [2022-02-20 17:22:23,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:22:23,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:22:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:22:23,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 17:22:23,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:22:23,324 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-02-20 17:22:23,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-02-20 17:22:23,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#false} assume true; {39#false} is VALID [2022-02-20 17:22:23,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#false} {38#true} #91#return; {39#false} is VALID [2022-02-20 17:22:23,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 17:22:23,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:22:23,331 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-02-20 17:22:23,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-02-20 17:22:23,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#false} assume true; {39#false} is VALID [2022-02-20 17:22:23,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#false} {39#false} #93#return; {39#false} is VALID [2022-02-20 17:22:23,332 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {38#true} is VALID [2022-02-20 17:22:23,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#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~post8#1, main_~d~0#1, main_~v~0#1, main_#t~post7#1, main_~c~0#1, main_~k~0#1, main_~temp~0#1, main_#t~post6#1, main_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~s~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~s~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {38#true} is VALID [2022-02-20 17:22:23,333 INFO L272 TraceCheckUtils]: 2: Hoare triple {38#true} call assume_abort_if_not((if main_~x~0#1 >= 1 then 1 else 0)); {38#true} is VALID [2022-02-20 17:22:23,333 INFO L290 TraceCheckUtils]: 3: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-02-20 17:22:23,337 INFO L290 TraceCheckUtils]: 4: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-02-20 17:22:23,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {39#false} assume true; {39#false} is VALID [2022-02-20 17:22:23,337 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {39#false} {38#true} #91#return; {39#false} is VALID [2022-02-20 17:22:23,337 INFO L272 TraceCheckUtils]: 7: Hoare triple {39#false} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {38#true} is VALID [2022-02-20 17:22:23,338 INFO L290 TraceCheckUtils]: 8: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-02-20 17:22:23,338 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-02-20 17:22:23,338 INFO L290 TraceCheckUtils]: 10: Hoare triple {39#false} assume true; {39#false} is VALID [2022-02-20 17:22:23,339 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {39#false} {39#false} #93#return; {39#false} is VALID [2022-02-20 17:22:23,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {39#false} main_~a~0#1 := main_~x~0#1;main_~b~0#1 := main_~y~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0;main_~r~0#1 := 0;main_~s~0#1 := 1; {39#false} is VALID [2022-02-20 17:22:23,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {39#false} assume !true; {39#false} is VALID [2022-02-20 17:22:23,339 INFO L272 TraceCheckUtils]: 14: Hoare triple {39#false} call __VERIFIER_assert((if main_~p~0#1 * main_~x~0#1 - main_~q~0#1 * main_~x~0#1 + main_~r~0#1 * main_~y~0#1 - main_~s~0#1 * main_~y~0#1 == main_~a~0#1 then 1 else 0)); {39#false} is VALID [2022-02-20 17:22:23,339 INFO L290 TraceCheckUtils]: 15: Hoare triple {39#false} ~cond := #in~cond; {39#false} is VALID [2022-02-20 17:22:23,340 INFO L290 TraceCheckUtils]: 16: Hoare triple {39#false} assume 0 == ~cond; {39#false} is VALID [2022-02-20 17:22:23,341 INFO L290 TraceCheckUtils]: 17: Hoare triple {39#false} assume !false; {39#false} is VALID [2022-02-20 17:22:23,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:22:23,341 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:22:23,341 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964387754] [2022-02-20 17:22:23,342 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964387754] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:22:23,342 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:22:23,342 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:22:23,343 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720730207] [2022-02-20 17:22:23,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:22:23,348 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-02-20 17:22:23,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:22:23,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:22:23,374 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:22:23,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:22:23,374 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:22:23,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:22:23,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:22:23,390 INFO L87 Difference]: Start difference. First operand has 35 states, 24 states have (on average 1.5) internal successors, (36), 25 states have internal predecessors, (36), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:22:23,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:23,440 INFO L93 Difference]: Finished difference Result 67 states and 103 transitions. [2022-02-20 17:22:23,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:22:23,441 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-02-20 17:22:23,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:22:23,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:22:23,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 103 transitions. [2022-02-20 17:22:23,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:22:23,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 103 transitions. [2022-02-20 17:22:23,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 103 transitions. [2022-02-20 17:22:23,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:22:23,555 INFO L225 Difference]: With dead ends: 67 [2022-02-20 17:22:23,555 INFO L226 Difference]: Without dead ends: 31 [2022-02-20 17:22:23,557 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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:22:23,560 INFO L933 BasicCegarLoop]: 45 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, 45 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:22:23,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:22:23,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-20 17:22:23,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-02-20 17:22:23,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:22:23,580 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:22:23,580 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:22:23,581 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:22:23,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:23,585 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2022-02-20 17:22:23,585 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-02-20 17:22:23,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:22:23,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:22:23,587 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-02-20 17:22:23,587 INFO L87 Difference]: Start difference. First operand has 31 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-02-20 17:22:23,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:23,591 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2022-02-20 17:22:23,591 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-02-20 17:22:23,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:22:23,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:22:23,592 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:22:23,592 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:22:23,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:22:23,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2022-02-20 17:22:23,597 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 18 [2022-02-20 17:22:23,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:22:23,597 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2022-02-20 17:22:23,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:22:23,598 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-02-20 17:22:23,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:22:23,598 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:22:23,598 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:22:23,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:22:23,599 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:22:23,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:22:23,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1013747788, now seen corresponding path program 1 times [2022-02-20 17:22:23,600 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:22:23,600 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902641551] [2022-02-20 17:22:23,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:22:23,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:22:23,617 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:22:23,618 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1765028764] [2022-02-20 17:22:23,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:22:23,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:22:23,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:22:23,631 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:22:23,659 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:22:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:22:23,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 17:22:23,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:22:23,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:22:23,839 INFO L290 TraceCheckUtils]: 0: Hoare triple {247#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {252#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:23,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {252#(<= ~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~post8#1, main_~d~0#1, main_~v~0#1, main_#t~post7#1, main_~c~0#1, main_~k~0#1, main_~temp~0#1, main_#t~post6#1, main_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~s~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~s~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {252#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:23,840 INFO L272 TraceCheckUtils]: 2: Hoare triple {252#(<= ~counter~0 0)} call assume_abort_if_not((if main_~x~0#1 >= 1 then 1 else 0)); {252#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:23,841 INFO L290 TraceCheckUtils]: 3: Hoare triple {252#(<= ~counter~0 0)} ~cond := #in~cond; {252#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:23,841 INFO L290 TraceCheckUtils]: 4: Hoare triple {252#(<= ~counter~0 0)} assume !(0 == ~cond); {252#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:23,842 INFO L290 TraceCheckUtils]: 5: Hoare triple {252#(<= ~counter~0 0)} assume true; {252#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:23,842 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {252#(<= ~counter~0 0)} {252#(<= ~counter~0 0)} #91#return; {252#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:23,843 INFO L272 TraceCheckUtils]: 7: Hoare triple {252#(<= ~counter~0 0)} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {252#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:23,844 INFO L290 TraceCheckUtils]: 8: Hoare triple {252#(<= ~counter~0 0)} ~cond := #in~cond; {252#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:23,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {252#(<= ~counter~0 0)} assume !(0 == ~cond); {252#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:23,845 INFO L290 TraceCheckUtils]: 10: Hoare triple {252#(<= ~counter~0 0)} assume true; {252#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:23,845 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {252#(<= ~counter~0 0)} {252#(<= ~counter~0 0)} #93#return; {252#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:23,846 INFO L290 TraceCheckUtils]: 12: Hoare triple {252#(<= ~counter~0 0)} main_~a~0#1 := main_~x~0#1;main_~b~0#1 := main_~y~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0;main_~r~0#1 := 0;main_~s~0#1 := 1; {252#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:23,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {252#(<= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {292#(<= |ULTIMATE.start_main_#t~post6#1| 0)} is VALID [2022-02-20 17:22:23,847 INFO L290 TraceCheckUtils]: 14: Hoare triple {292#(<= |ULTIMATE.start_main_#t~post6#1| 0)} assume !(main_#t~post6#1 < 100);havoc main_#t~post6#1; {248#false} is VALID [2022-02-20 17:22:23,847 INFO L272 TraceCheckUtils]: 15: Hoare triple {248#false} call __VERIFIER_assert((if main_~p~0#1 * main_~x~0#1 - main_~q~0#1 * main_~x~0#1 + main_~r~0#1 * main_~y~0#1 - main_~s~0#1 * main_~y~0#1 == main_~a~0#1 then 1 else 0)); {248#false} is VALID [2022-02-20 17:22:23,847 INFO L290 TraceCheckUtils]: 16: Hoare triple {248#false} ~cond := #in~cond; {248#false} is VALID [2022-02-20 17:22:23,848 INFO L290 TraceCheckUtils]: 17: Hoare triple {248#false} assume 0 == ~cond; {248#false} is VALID [2022-02-20 17:22:23,848 INFO L290 TraceCheckUtils]: 18: Hoare triple {248#false} assume !false; {248#false} is VALID [2022-02-20 17:22:23,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:22:23,848 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:22:23,849 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:22:23,849 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902641551] [2022-02-20 17:22:23,849 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:22:23,850 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765028764] [2022-02-20 17:22:23,852 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765028764] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:22:23,852 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:22:23,853 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:22:23,853 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992438531] [2022-02-20 17:22:23,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:22:23,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 17:22:23,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:22:23,855 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:22:23,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:22:23,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:22:23,874 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:22:23,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:22:23,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:22:23,876 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:22:23,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:23,991 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-02-20 17:22:23,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:22:23,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 17:22:23,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:22:23,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:22:23,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-02-20 17:22:23,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:22:23,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-02-20 17:22:24,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2022-02-20 17:22:24,039 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:22:24,043 INFO L225 Difference]: With dead ends: 40 [2022-02-20 17:22:24,043 INFO L226 Difference]: Without dead ends: 33 [2022-02-20 17:22:24,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 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:22:24,045 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:22:24,046 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:22:24,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-20 17:22:24,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-02-20 17:22:24,057 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:22:24,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:22:24,060 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:22:24,060 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:22:24,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:24,063 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-02-20 17:22:24,063 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-02-20 17:22:24,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:22:24,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:22:24,065 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-02-20 17:22:24,066 INFO L87 Difference]: Start difference. First operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-02-20 17:22:24,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:24,073 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-02-20 17:22:24,073 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-02-20 17:22:24,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:22:24,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:22:24,078 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:22:24,078 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:22:24,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:22:24,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2022-02-20 17:22:24,082 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 19 [2022-02-20 17:22:24,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:22:24,082 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2022-02-20 17:22:24,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:22:24,083 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-02-20 17:22:24,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 17:22:24,083 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:22:24,083 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:22:24,115 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:22:24,302 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:22:24,302 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:22:24,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:22:24,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1341775226, now seen corresponding path program 1 times [2022-02-20 17:22:24,303 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:22:24,303 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165294124] [2022-02-20 17:22:24,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:22:24,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:22:24,319 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:22:24,319 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [671222251] [2022-02-20 17:22:24,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:22:24,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:22:24,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:22:24,320 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:22:24,322 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:22:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:22:24,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:22:24,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:22:24,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:22:24,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {474#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {474#true} is VALID [2022-02-20 17:22:24,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {474#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~post8#1, main_~d~0#1, main_~v~0#1, main_#t~post7#1, main_~c~0#1, main_~k~0#1, main_~temp~0#1, main_#t~post6#1, main_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~s~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~s~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {474#true} is VALID [2022-02-20 17:22:24,446 INFO L272 TraceCheckUtils]: 2: Hoare triple {474#true} call assume_abort_if_not((if main_~x~0#1 >= 1 then 1 else 0)); {474#true} is VALID [2022-02-20 17:22:24,446 INFO L290 TraceCheckUtils]: 3: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-02-20 17:22:24,446 INFO L290 TraceCheckUtils]: 4: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-02-20 17:22:24,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {474#true} assume true; {474#true} is VALID [2022-02-20 17:22:24,446 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {474#true} {474#true} #91#return; {474#true} is VALID [2022-02-20 17:22:24,447 INFO L272 TraceCheckUtils]: 7: Hoare triple {474#true} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {474#true} is VALID [2022-02-20 17:22:24,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {474#true} ~cond := #in~cond; {503#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 17:22:24,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {503#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {507#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:22:24,448 INFO L290 TraceCheckUtils]: 10: Hoare triple {507#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {507#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:22:24,448 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {507#(not (= |assume_abort_if_not_#in~cond| 0))} {474#true} #93#return; {514#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-20 17:22:24,449 INFO L290 TraceCheckUtils]: 12: Hoare triple {514#(<= 1 |ULTIMATE.start_main_~y~0#1|)} main_~a~0#1 := main_~x~0#1;main_~b~0#1 := main_~y~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0;main_~r~0#1 := 0;main_~s~0#1 := 1; {518#(<= 1 |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:22:24,449 INFO L290 TraceCheckUtils]: 13: Hoare triple {518#(<= 1 |ULTIMATE.start_main_~b~0#1|)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {518#(<= 1 |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:22:24,450 INFO L290 TraceCheckUtils]: 14: Hoare triple {518#(<= 1 |ULTIMATE.start_main_~b~0#1|)} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1; {518#(<= 1 |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:22:24,450 INFO L290 TraceCheckUtils]: 15: Hoare triple {518#(<= 1 |ULTIMATE.start_main_~b~0#1|)} assume !(0 != main_~b~0#1); {475#false} is VALID [2022-02-20 17:22:24,450 INFO L272 TraceCheckUtils]: 16: Hoare triple {475#false} call __VERIFIER_assert((if main_~p~0#1 * main_~x~0#1 - main_~q~0#1 * main_~x~0#1 + main_~r~0#1 * main_~y~0#1 - main_~s~0#1 * main_~y~0#1 == main_~a~0#1 then 1 else 0)); {475#false} is VALID [2022-02-20 17:22:24,451 INFO L290 TraceCheckUtils]: 17: Hoare triple {475#false} ~cond := #in~cond; {475#false} is VALID [2022-02-20 17:22:24,451 INFO L290 TraceCheckUtils]: 18: Hoare triple {475#false} assume 0 == ~cond; {475#false} is VALID [2022-02-20 17:22:24,451 INFO L290 TraceCheckUtils]: 19: Hoare triple {475#false} assume !false; {475#false} is VALID [2022-02-20 17:22:24,451 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 17:22:24,451 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:22:24,452 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:22:24,452 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165294124] [2022-02-20 17:22:24,452 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:22:24,452 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671222251] [2022-02-20 17:22:24,452 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671222251] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:22:24,452 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:22:24,452 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 17:22:24,453 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226318458] [2022-02-20 17:22:24,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:22:24,453 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-02-20 17:22:24,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:22:24,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:22:24,467 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:22:24,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:22:24,467 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:22:24,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:22:24,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:22:24,468 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:22:24,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:24,675 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2022-02-20 17:22:24,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:22:24,675 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-02-20 17:22:24,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:22:24,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:22:24,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-02-20 17:22:24,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:22:24,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-02-20 17:22:24,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 71 transitions. [2022-02-20 17:22:24,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:22:24,730 INFO L225 Difference]: With dead ends: 53 [2022-02-20 17:22:24,730 INFO L226 Difference]: Without dead ends: 46 [2022-02-20 17:22:24,730 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:22:24,731 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 46 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:22:24,731 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 149 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:22:24,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-20 17:22:24,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2022-02-20 17:22:24,744 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:22:24,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 34 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:22:24,744 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 34 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:22:24,744 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 34 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:22:24,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:24,746 INFO L93 Difference]: Finished difference Result 46 states and 64 transitions. [2022-02-20 17:22:24,746 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 64 transitions. [2022-02-20 17:22:24,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:22:24,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:22:24,747 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 46 states. [2022-02-20 17:22:24,747 INFO L87 Difference]: Start difference. First operand has 34 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 46 states. [2022-02-20 17:22:24,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:24,749 INFO L93 Difference]: Finished difference Result 46 states and 64 transitions. [2022-02-20 17:22:24,749 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 64 transitions. [2022-02-20 17:22:24,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:22:24,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:22:24,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:22:24,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:22:24,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:22:24,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2022-02-20 17:22:24,752 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 20 [2022-02-20 17:22:24,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:22:24,752 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2022-02-20 17:22:24,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:22:24,752 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2022-02-20 17:22:24,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 17:22:24,753 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:22:24,753 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:22:24,790 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:22:24,971 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:22:24,972 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:22:24,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:22:24,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1315139464, now seen corresponding path program 1 times [2022-02-20 17:22:24,975 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:22:24,975 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362660669] [2022-02-20 17:22:24,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:22:24,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:22:24,990 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:22:24,992 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [609720105] [2022-02-20 17:22:24,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:22:24,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:22:24,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:22:24,994 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:22:25,034 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:22:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:22:25,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:22:25,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:22:25,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:22:25,147 INFO L290 TraceCheckUtils]: 0: Hoare triple {756#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {761#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:25,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {761#(<= ~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~post8#1, main_~d~0#1, main_~v~0#1, main_#t~post7#1, main_~c~0#1, main_~k~0#1, main_~temp~0#1, main_#t~post6#1, main_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~s~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~s~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {761#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:25,148 INFO L272 TraceCheckUtils]: 2: Hoare triple {761#(<= ~counter~0 0)} call assume_abort_if_not((if main_~x~0#1 >= 1 then 1 else 0)); {761#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:25,149 INFO L290 TraceCheckUtils]: 3: Hoare triple {761#(<= ~counter~0 0)} ~cond := #in~cond; {761#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:25,149 INFO L290 TraceCheckUtils]: 4: Hoare triple {761#(<= ~counter~0 0)} assume !(0 == ~cond); {761#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:25,149 INFO L290 TraceCheckUtils]: 5: Hoare triple {761#(<= ~counter~0 0)} assume true; {761#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:25,150 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {761#(<= ~counter~0 0)} {761#(<= ~counter~0 0)} #91#return; {761#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:25,150 INFO L272 TraceCheckUtils]: 7: Hoare triple {761#(<= ~counter~0 0)} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {761#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:25,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {761#(<= ~counter~0 0)} ~cond := #in~cond; {761#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:25,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {761#(<= ~counter~0 0)} assume !(0 == ~cond); {761#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:25,151 INFO L290 TraceCheckUtils]: 10: Hoare triple {761#(<= ~counter~0 0)} assume true; {761#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:25,152 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {761#(<= ~counter~0 0)} {761#(<= ~counter~0 0)} #93#return; {761#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:25,152 INFO L290 TraceCheckUtils]: 12: Hoare triple {761#(<= ~counter~0 0)} main_~a~0#1 := main_~x~0#1;main_~b~0#1 := main_~y~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0;main_~r~0#1 := 0;main_~s~0#1 := 1; {761#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:25,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {761#(<= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {801#(<= ~counter~0 1)} is VALID [2022-02-20 17:22:25,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {801#(<= ~counter~0 1)} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1; {801#(<= ~counter~0 1)} is VALID [2022-02-20 17:22:25,154 INFO L290 TraceCheckUtils]: 15: Hoare triple {801#(<= ~counter~0 1)} assume !!(0 != main_~b~0#1);havoc main_~c~0#1;havoc main_~k~0#1;main_~c~0#1 := main_~a~0#1;main_~k~0#1 := 0; {801#(<= ~counter~0 1)} is VALID [2022-02-20 17:22:25,154 INFO L290 TraceCheckUtils]: 16: Hoare triple {801#(<= ~counter~0 1)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {811#(<= |ULTIMATE.start_main_#t~post7#1| 1)} is VALID [2022-02-20 17:22:25,155 INFO L290 TraceCheckUtils]: 17: Hoare triple {811#(<= |ULTIMATE.start_main_#t~post7#1| 1)} assume !(main_#t~post7#1 < 100);havoc main_#t~post7#1; {757#false} is VALID [2022-02-20 17:22:25,155 INFO L290 TraceCheckUtils]: 18: Hoare triple {757#false} main_~a~0#1 := main_~b~0#1;main_~b~0#1 := main_~c~0#1;havoc main_~temp~0#1;main_~temp~0#1 := main_~p~0#1;main_~p~0#1 := main_~q~0#1;main_~q~0#1 := main_~temp~0#1 - main_~q~0#1 * main_~k~0#1;main_~temp~0#1 := main_~r~0#1;main_~r~0#1 := main_~s~0#1;main_~s~0#1 := main_~temp~0#1 - main_~s~0#1 * main_~k~0#1; {757#false} is VALID [2022-02-20 17:22:25,155 INFO L290 TraceCheckUtils]: 19: Hoare triple {757#false} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {757#false} is VALID [2022-02-20 17:22:25,155 INFO L290 TraceCheckUtils]: 20: Hoare triple {757#false} assume !(main_#t~post6#1 < 100);havoc main_#t~post6#1; {757#false} is VALID [2022-02-20 17:22:25,155 INFO L272 TraceCheckUtils]: 21: Hoare triple {757#false} call __VERIFIER_assert((if main_~p~0#1 * main_~x~0#1 - main_~q~0#1 * main_~x~0#1 + main_~r~0#1 * main_~y~0#1 - main_~s~0#1 * main_~y~0#1 == main_~a~0#1 then 1 else 0)); {757#false} is VALID [2022-02-20 17:22:25,156 INFO L290 TraceCheckUtils]: 22: Hoare triple {757#false} ~cond := #in~cond; {757#false} is VALID [2022-02-20 17:22:25,156 INFO L290 TraceCheckUtils]: 23: Hoare triple {757#false} assume 0 == ~cond; {757#false} is VALID [2022-02-20 17:22:25,156 INFO L290 TraceCheckUtils]: 24: Hoare triple {757#false} assume !false; {757#false} is VALID [2022-02-20 17:22:25,156 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:22:25,156 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:22:25,156 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:22:25,157 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362660669] [2022-02-20 17:22:25,157 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:22:25,157 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609720105] [2022-02-20 17:22:25,157 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609720105] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:22:25,157 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:22:25,157 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 17:22:25,158 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152634956] [2022-02-20 17:22:25,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:22:25,158 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-02-20 17:22:25,158 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:22:25,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:22:25,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:22:25,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:22:25,173 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:22:25,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:22:25,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:22:25,174 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:22:25,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:25,252 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2022-02-20 17:22:25,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:22:25,253 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-02-20 17:22:25,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:22:25,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:22:25,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-02-20 17:22:25,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:22:25,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-02-20 17:22:25,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 78 transitions. [2022-02-20 17:22:25,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:22:25,307 INFO L225 Difference]: With dead ends: 58 [2022-02-20 17:22:25,307 INFO L226 Difference]: Without dead ends: 36 [2022-02-20 17:22:25,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:22:25,308 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 5 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:22:25,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 103 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:22:25,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-20 17:22:25,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-02-20 17:22:25,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:22:25,323 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:22:25,323 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:22:25,324 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:22:25,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:25,325 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-02-20 17:22:25,325 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-02-20 17:22:25,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:22:25,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:22:25,326 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 36 states. [2022-02-20 17:22:25,326 INFO L87 Difference]: Start difference. First operand has 36 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 36 states. [2022-02-20 17:22:25,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:25,328 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-02-20 17:22:25,328 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-02-20 17:22:25,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:22:25,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:22:25,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:22:25,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:22:25,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:22:25,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2022-02-20 17:22:25,330 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 25 [2022-02-20 17:22:25,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:22:25,331 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2022-02-20 17:22:25,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:22:25,331 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-02-20 17:22:25,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 17:22:25,332 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:22:25,332 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:22:25,356 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:22:25,547 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:22:25,547 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:22:25,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:22:25,548 INFO L85 PathProgramCache]: Analyzing trace with hash 570907173, now seen corresponding path program 1 times [2022-02-20 17:22:25,548 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:22:25,548 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719966935] [2022-02-20 17:22:25,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:22:25,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:22:25,561 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:22:25,562 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [841969651] [2022-02-20 17:22:25,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:22:25,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:22:25,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:22:25,563 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:22:25,564 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:22:25,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:22:25,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 17:22:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:22:25,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:22:25,864 INFO L290 TraceCheckUtils]: 0: Hoare triple {1038#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1038#true} is VALID [2022-02-20 17:22:25,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {1038#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~post8#1, main_~d~0#1, main_~v~0#1, main_#t~post7#1, main_~c~0#1, main_~k~0#1, main_~temp~0#1, main_#t~post6#1, main_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~s~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~s~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1046#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} is VALID [2022-02-20 17:22:25,865 INFO L272 TraceCheckUtils]: 2: Hoare triple {1046#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} call assume_abort_if_not((if main_~x~0#1 >= 1 then 1 else 0)); {1038#true} is VALID [2022-02-20 17:22:25,865 INFO L290 TraceCheckUtils]: 3: Hoare triple {1038#true} ~cond := #in~cond; {1038#true} is VALID [2022-02-20 17:22:25,866 INFO L290 TraceCheckUtils]: 4: Hoare triple {1038#true} assume !(0 == ~cond); {1038#true} is VALID [2022-02-20 17:22:25,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {1038#true} assume true; {1038#true} is VALID [2022-02-20 17:22:25,866 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1038#true} {1046#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} #91#return; {1046#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} is VALID [2022-02-20 17:22:25,867 INFO L272 TraceCheckUtils]: 7: Hoare triple {1046#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {1038#true} is VALID [2022-02-20 17:22:25,867 INFO L290 TraceCheckUtils]: 8: Hoare triple {1038#true} ~cond := #in~cond; {1068#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 17:22:25,867 INFO L290 TraceCheckUtils]: 9: Hoare triple {1068#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1072#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:22:25,868 INFO L290 TraceCheckUtils]: 10: Hoare triple {1072#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1072#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:22:25,868 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1072#(not (= |assume_abort_if_not_#in~cond| 0))} {1046#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} #93#return; {1079#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 2147483647))} is VALID [2022-02-20 17:22:25,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {1079#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 2147483647))} main_~a~0#1 := main_~x~0#1;main_~b~0#1 := main_~y~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0;main_~r~0#1 := 0;main_~s~0#1 := 1; {1083#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 2147483647))} is VALID [2022-02-20 17:22:25,870 INFO L290 TraceCheckUtils]: 13: Hoare triple {1083#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 2147483647))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1083#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 2147483647))} is VALID [2022-02-20 17:22:25,870 INFO L290 TraceCheckUtils]: 14: Hoare triple {1083#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 2147483647))} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1; {1083#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 2147483647))} is VALID [2022-02-20 17:22:25,871 INFO L290 TraceCheckUtils]: 15: Hoare triple {1083#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 2147483647))} assume !!(0 != main_~b~0#1);havoc main_~c~0#1;havoc main_~k~0#1;main_~c~0#1 := main_~a~0#1;main_~k~0#1 := 0; {1083#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 2147483647))} is VALID [2022-02-20 17:22:25,871 INFO L290 TraceCheckUtils]: 16: Hoare triple {1083#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 2147483647))} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {1083#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 2147483647))} is VALID [2022-02-20 17:22:25,872 INFO L290 TraceCheckUtils]: 17: Hoare triple {1083#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 2147483647))} assume !!(main_#t~post7#1 < 100);havoc main_#t~post7#1; {1083#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 2147483647))} is VALID [2022-02-20 17:22:25,872 INFO L290 TraceCheckUtils]: 18: Hoare triple {1083#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 2147483647))} assume !!(main_~c~0#1 >= main_~b~0#1);havoc main_~d~0#1;havoc main_~v~0#1;main_~d~0#1 := 1;main_~v~0#1 := main_~b~0#1; {1083#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 2147483647))} is VALID [2022-02-20 17:22:25,873 INFO L290 TraceCheckUtils]: 19: Hoare triple {1083#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 2147483647))} main_#t~post8#1 := ~counter~0;~counter~0 := 1 + main_#t~post8#1; {1083#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 2147483647))} is VALID [2022-02-20 17:22:25,873 INFO L290 TraceCheckUtils]: 20: Hoare triple {1083#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 2147483647))} assume !!(main_#t~post8#1 < 100);havoc main_#t~post8#1; {1083#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 2147483647))} is VALID [2022-02-20 17:22:25,874 INFO L272 TraceCheckUtils]: 21: Hoare triple {1083#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 2147483647))} call __VERIFIER_assert((if main_~a~0#1 == main_~y~0#1 * main_~r~0#1 + main_~x~0#1 * main_~p~0#1 then 1 else 0)); {1111#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:22:25,875 INFO L290 TraceCheckUtils]: 22: Hoare triple {1111#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1115#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:22:25,875 INFO L290 TraceCheckUtils]: 23: Hoare triple {1115#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1039#false} is VALID [2022-02-20 17:22:25,875 INFO L290 TraceCheckUtils]: 24: Hoare triple {1039#false} assume !false; {1039#false} is VALID [2022-02-20 17:22:25,875 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 17:22:25,876 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:22:25,876 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:22:25,876 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719966935] [2022-02-20 17:22:25,876 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:22:25,876 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841969651] [2022-02-20 17:22:25,876 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841969651] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:22:25,876 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:22:25,877 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 17:22:25,877 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621872040] [2022-02-20 17:22:25,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:22:25,877 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-02-20 17:22:25,878 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:22:25,878 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:22:25,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:22:25,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 17:22:25,897 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:22:25,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 17:22:25,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-02-20 17:22:25,898 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:22:26,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:26,212 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2022-02-20 17:22:26,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 17:22:26,212 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-02-20 17:22:26,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:22:26,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:22:26,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2022-02-20 17:22:26,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:22:26,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2022-02-20 17:22:26,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 69 transitions. [2022-02-20 17:22:26,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:22:26,264 INFO L225 Difference]: With dead ends: 54 [2022-02-20 17:22:26,264 INFO L226 Difference]: Without dead ends: 52 [2022-02-20 17:22:26,265 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:22:26,265 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 39 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:22:26,265 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 221 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:22:26,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-02-20 17:22:26,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2022-02-20 17:22:26,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:22:26,294 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 51 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 37 states have internal predecessors, (47), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:22:26,294 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 51 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 37 states have internal predecessors, (47), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:22:26,294 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 51 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 37 states have internal predecessors, (47), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:22:26,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:26,296 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2022-02-20 17:22:26,296 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 69 transitions. [2022-02-20 17:22:26,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:22:26,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:22:26,296 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 37 states have internal predecessors, (47), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 52 states. [2022-02-20 17:22:26,296 INFO L87 Difference]: Start difference. First operand has 51 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 37 states have internal predecessors, (47), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 52 states. [2022-02-20 17:22:26,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:26,298 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2022-02-20 17:22:26,298 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 69 transitions. [2022-02-20 17:22:26,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:22:26,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:22:26,298 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:22:26,298 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:22:26,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 37 states have internal predecessors, (47), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:22:26,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 68 transitions. [2022-02-20 17:22:26,299 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 68 transitions. Word has length 25 [2022-02-20 17:22:26,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:22:26,300 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 68 transitions. [2022-02-20 17:22:26,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:22:26,300 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-02-20 17:22:26,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 17:22:26,300 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:22:26,300 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:22:26,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-02-20 17:22:26,501 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:22:26,501 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:22:26,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:22:26,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1698298847, now seen corresponding path program 1 times [2022-02-20 17:22:26,501 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:22:26,501 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430581145] [2022-02-20 17:22:26,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:22:26,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:22:26,529 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:22:26,534 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [899092283] [2022-02-20 17:22:26,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:22:26,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:22:26,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:22:26,544 INFO L229 MonitoredProcess]: Starting monitored process 6 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:22:26,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 17:22:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:22:26,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:22:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:22:26,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:22:26,713 INFO L290 TraceCheckUtils]: 0: Hoare triple {1376#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1381#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:26,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {1381#(<= ~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~post8#1, main_~d~0#1, main_~v~0#1, main_#t~post7#1, main_~c~0#1, main_~k~0#1, main_~temp~0#1, main_#t~post6#1, main_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~s~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~s~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1381#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:26,714 INFO L272 TraceCheckUtils]: 2: Hoare triple {1381#(<= ~counter~0 0)} call assume_abort_if_not((if main_~x~0#1 >= 1 then 1 else 0)); {1381#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:26,727 INFO L290 TraceCheckUtils]: 3: Hoare triple {1381#(<= ~counter~0 0)} ~cond := #in~cond; {1381#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:26,728 INFO L290 TraceCheckUtils]: 4: Hoare triple {1381#(<= ~counter~0 0)} assume !(0 == ~cond); {1381#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:26,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {1381#(<= ~counter~0 0)} assume true; {1381#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:26,744 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1381#(<= ~counter~0 0)} {1381#(<= ~counter~0 0)} #91#return; {1381#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:26,745 INFO L272 TraceCheckUtils]: 7: Hoare triple {1381#(<= ~counter~0 0)} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {1381#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:26,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {1381#(<= ~counter~0 0)} ~cond := #in~cond; {1381#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:26,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {1381#(<= ~counter~0 0)} assume !(0 == ~cond); {1381#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:26,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {1381#(<= ~counter~0 0)} assume true; {1381#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:26,746 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1381#(<= ~counter~0 0)} {1381#(<= ~counter~0 0)} #93#return; {1381#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:26,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {1381#(<= ~counter~0 0)} main_~a~0#1 := main_~x~0#1;main_~b~0#1 := main_~y~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0;main_~r~0#1 := 0;main_~s~0#1 := 1; {1381#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:26,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {1381#(<= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1421#(<= ~counter~0 1)} is VALID [2022-02-20 17:22:26,748 INFO L290 TraceCheckUtils]: 14: Hoare triple {1421#(<= ~counter~0 1)} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1; {1421#(<= ~counter~0 1)} is VALID [2022-02-20 17:22:26,748 INFO L290 TraceCheckUtils]: 15: Hoare triple {1421#(<= ~counter~0 1)} assume !!(0 != main_~b~0#1);havoc main_~c~0#1;havoc main_~k~0#1;main_~c~0#1 := main_~a~0#1;main_~k~0#1 := 0; {1421#(<= ~counter~0 1)} is VALID [2022-02-20 17:22:26,748 INFO L290 TraceCheckUtils]: 16: Hoare triple {1421#(<= ~counter~0 1)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {1431#(<= ~counter~0 2)} is VALID [2022-02-20 17:22:26,749 INFO L290 TraceCheckUtils]: 17: Hoare triple {1431#(<= ~counter~0 2)} assume !!(main_#t~post7#1 < 100);havoc main_#t~post7#1; {1431#(<= ~counter~0 2)} is VALID [2022-02-20 17:22:26,749 INFO L290 TraceCheckUtils]: 18: Hoare triple {1431#(<= ~counter~0 2)} assume !(main_~c~0#1 >= main_~b~0#1); {1431#(<= ~counter~0 2)} is VALID [2022-02-20 17:22:26,749 INFO L290 TraceCheckUtils]: 19: Hoare triple {1431#(<= ~counter~0 2)} main_~a~0#1 := main_~b~0#1;main_~b~0#1 := main_~c~0#1;havoc main_~temp~0#1;main_~temp~0#1 := main_~p~0#1;main_~p~0#1 := main_~q~0#1;main_~q~0#1 := main_~temp~0#1 - main_~q~0#1 * main_~k~0#1;main_~temp~0#1 := main_~r~0#1;main_~r~0#1 := main_~s~0#1;main_~s~0#1 := main_~temp~0#1 - main_~s~0#1 * main_~k~0#1; {1431#(<= ~counter~0 2)} is VALID [2022-02-20 17:22:26,750 INFO L290 TraceCheckUtils]: 20: Hoare triple {1431#(<= ~counter~0 2)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1444#(<= |ULTIMATE.start_main_#t~post6#1| 2)} is VALID [2022-02-20 17:22:26,750 INFO L290 TraceCheckUtils]: 21: Hoare triple {1444#(<= |ULTIMATE.start_main_#t~post6#1| 2)} assume !(main_#t~post6#1 < 100);havoc main_#t~post6#1; {1377#false} is VALID [2022-02-20 17:22:26,750 INFO L272 TraceCheckUtils]: 22: Hoare triple {1377#false} call __VERIFIER_assert((if main_~p~0#1 * main_~x~0#1 - main_~q~0#1 * main_~x~0#1 + main_~r~0#1 * main_~y~0#1 - main_~s~0#1 * main_~y~0#1 == main_~a~0#1 then 1 else 0)); {1377#false} is VALID [2022-02-20 17:22:26,750 INFO L290 TraceCheckUtils]: 23: Hoare triple {1377#false} ~cond := #in~cond; {1377#false} is VALID [2022-02-20 17:22:26,750 INFO L290 TraceCheckUtils]: 24: Hoare triple {1377#false} assume 0 == ~cond; {1377#false} is VALID [2022-02-20 17:22:26,750 INFO L290 TraceCheckUtils]: 25: Hoare triple {1377#false} assume !false; {1377#false} is VALID [2022-02-20 17:22:26,751 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:22:26,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:22:26,920 INFO L290 TraceCheckUtils]: 25: Hoare triple {1377#false} assume !false; {1377#false} is VALID [2022-02-20 17:22:26,920 INFO L290 TraceCheckUtils]: 24: Hoare triple {1377#false} assume 0 == ~cond; {1377#false} is VALID [2022-02-20 17:22:26,920 INFO L290 TraceCheckUtils]: 23: Hoare triple {1377#false} ~cond := #in~cond; {1377#false} is VALID [2022-02-20 17:22:26,921 INFO L272 TraceCheckUtils]: 22: Hoare triple {1377#false} call __VERIFIER_assert((if main_~p~0#1 * main_~x~0#1 - main_~q~0#1 * main_~x~0#1 + main_~r~0#1 * main_~y~0#1 - main_~s~0#1 * main_~y~0#1 == main_~a~0#1 then 1 else 0)); {1377#false} is VALID [2022-02-20 17:22:26,921 INFO L290 TraceCheckUtils]: 21: Hoare triple {1472#(< |ULTIMATE.start_main_#t~post6#1| 100)} assume !(main_#t~post6#1 < 100);havoc main_#t~post6#1; {1377#false} is VALID [2022-02-20 17:22:26,921 INFO L290 TraceCheckUtils]: 20: Hoare triple {1476#(< ~counter~0 100)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1472#(< |ULTIMATE.start_main_#t~post6#1| 100)} is VALID [2022-02-20 17:22:26,922 INFO L290 TraceCheckUtils]: 19: Hoare triple {1476#(< ~counter~0 100)} main_~a~0#1 := main_~b~0#1;main_~b~0#1 := main_~c~0#1;havoc main_~temp~0#1;main_~temp~0#1 := main_~p~0#1;main_~p~0#1 := main_~q~0#1;main_~q~0#1 := main_~temp~0#1 - main_~q~0#1 * main_~k~0#1;main_~temp~0#1 := main_~r~0#1;main_~r~0#1 := main_~s~0#1;main_~s~0#1 := main_~temp~0#1 - main_~s~0#1 * main_~k~0#1; {1476#(< ~counter~0 100)} is VALID [2022-02-20 17:22:26,922 INFO L290 TraceCheckUtils]: 18: Hoare triple {1476#(< ~counter~0 100)} assume !(main_~c~0#1 >= main_~b~0#1); {1476#(< ~counter~0 100)} is VALID [2022-02-20 17:22:26,922 INFO L290 TraceCheckUtils]: 17: Hoare triple {1476#(< ~counter~0 100)} assume !!(main_#t~post7#1 < 100);havoc main_#t~post7#1; {1476#(< ~counter~0 100)} is VALID [2022-02-20 17:22:26,923 INFO L290 TraceCheckUtils]: 16: Hoare triple {1489#(< ~counter~0 99)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {1476#(< ~counter~0 100)} is VALID [2022-02-20 17:22:26,923 INFO L290 TraceCheckUtils]: 15: Hoare triple {1489#(< ~counter~0 99)} assume !!(0 != main_~b~0#1);havoc main_~c~0#1;havoc main_~k~0#1;main_~c~0#1 := main_~a~0#1;main_~k~0#1 := 0; {1489#(< ~counter~0 99)} is VALID [2022-02-20 17:22:26,923 INFO L290 TraceCheckUtils]: 14: Hoare triple {1489#(< ~counter~0 99)} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1; {1489#(< ~counter~0 99)} is VALID [2022-02-20 17:22:26,926 INFO L290 TraceCheckUtils]: 13: Hoare triple {1499#(< ~counter~0 98)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1489#(< ~counter~0 99)} is VALID [2022-02-20 17:22:26,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {1499#(< ~counter~0 98)} main_~a~0#1 := main_~x~0#1;main_~b~0#1 := main_~y~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0;main_~r~0#1 := 0;main_~s~0#1 := 1; {1499#(< ~counter~0 98)} is VALID [2022-02-20 17:22:26,926 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1376#true} {1499#(< ~counter~0 98)} #93#return; {1499#(< ~counter~0 98)} is VALID [2022-02-20 17:22:26,927 INFO L290 TraceCheckUtils]: 10: Hoare triple {1376#true} assume true; {1376#true} is VALID [2022-02-20 17:22:26,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {1376#true} assume !(0 == ~cond); {1376#true} is VALID [2022-02-20 17:22:26,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {1376#true} ~cond := #in~cond; {1376#true} is VALID [2022-02-20 17:22:26,927 INFO L272 TraceCheckUtils]: 7: Hoare triple {1499#(< ~counter~0 98)} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {1376#true} is VALID [2022-02-20 17:22:26,927 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1376#true} {1499#(< ~counter~0 98)} #91#return; {1499#(< ~counter~0 98)} is VALID [2022-02-20 17:22:26,927 INFO L290 TraceCheckUtils]: 5: Hoare triple {1376#true} assume true; {1376#true} is VALID [2022-02-20 17:22:26,928 INFO L290 TraceCheckUtils]: 4: Hoare triple {1376#true} assume !(0 == ~cond); {1376#true} is VALID [2022-02-20 17:22:26,928 INFO L290 TraceCheckUtils]: 3: Hoare triple {1376#true} ~cond := #in~cond; {1376#true} is VALID [2022-02-20 17:22:26,928 INFO L272 TraceCheckUtils]: 2: Hoare triple {1499#(< ~counter~0 98)} call assume_abort_if_not((if main_~x~0#1 >= 1 then 1 else 0)); {1376#true} is VALID [2022-02-20 17:22:26,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {1499#(< ~counter~0 98)} 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~post8#1, main_~d~0#1, main_~v~0#1, main_#t~post7#1, main_~c~0#1, main_~k~0#1, main_~temp~0#1, main_#t~post6#1, main_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~s~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~s~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1499#(< ~counter~0 98)} is VALID [2022-02-20 17:22:26,929 INFO L290 TraceCheckUtils]: 0: Hoare triple {1376#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1499#(< ~counter~0 98)} is VALID [2022-02-20 17:22:26,929 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:22:26,929 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:22:26,929 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430581145] [2022-02-20 17:22:26,929 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:22:26,929 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899092283] [2022-02-20 17:22:26,929 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899092283] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:22:26,929 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:22:26,930 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2022-02-20 17:22:26,930 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491470498] [2022-02-20 17:22:26,930 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:22:26,930 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2022-02-20 17:22:26,931 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:22:26,931 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:22:26,993 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:22:26,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 17:22:26,994 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:22:26,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 17:22:26,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:22:26,994 INFO L87 Difference]: Start difference. First operand 51 states and 68 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:22:27,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:27,453 INFO L93 Difference]: Finished difference Result 147 states and 193 transitions. [2022-02-20 17:22:27,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 17:22:27,453 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2022-02-20 17:22:27,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:22:27,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:22:27,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions. [2022-02-20 17:22:27,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:22:27,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions. [2022-02-20 17:22:27,470 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 141 transitions. [2022-02-20 17:22:27,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:22:27,568 INFO L225 Difference]: With dead ends: 147 [2022-02-20 17:22:27,568 INFO L226 Difference]: Without dead ends: 140 [2022-02-20 17:22:27,568 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-02-20 17:22:27,569 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 91 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:22:27,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 213 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:22:27,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-02-20 17:22:27,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 97. [2022-02-20 17:22:27,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:22:27,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand has 97 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 71 states have internal predecessors, (92), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 17:22:27,646 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand has 97 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 71 states have internal predecessors, (92), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 17:22:27,646 INFO L87 Difference]: Start difference. First operand 140 states. Second operand has 97 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 71 states have internal predecessors, (92), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 17:22:27,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:27,650 INFO L93 Difference]: Finished difference Result 140 states and 184 transitions. [2022-02-20 17:22:27,650 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 184 transitions. [2022-02-20 17:22:27,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:22:27,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:22:27,652 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 71 states have internal predecessors, (92), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 140 states. [2022-02-20 17:22:27,652 INFO L87 Difference]: Start difference. First operand has 97 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 71 states have internal predecessors, (92), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 140 states. [2022-02-20 17:22:27,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:27,656 INFO L93 Difference]: Finished difference Result 140 states and 184 transitions. [2022-02-20 17:22:27,656 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 184 transitions. [2022-02-20 17:22:27,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:22:27,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:22:27,657 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:22:27,657 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:22:27,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 71 states have internal predecessors, (92), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 17:22:27,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 130 transitions. [2022-02-20 17:22:27,660 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 130 transitions. Word has length 26 [2022-02-20 17:22:27,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:22:27,660 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 130 transitions. [2022-02-20 17:22:27,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:22:27,661 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 130 transitions. [2022-02-20 17:22:27,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 17:22:27,661 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:22:27,661 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:22:27,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 17:22:27,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:22:27,878 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:22:27,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:22:27,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1127291835, now seen corresponding path program 1 times [2022-02-20 17:22:27,879 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:22:27,879 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128407295] [2022-02-20 17:22:27,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:22:27,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:22:27,891 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:22:27,891 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [211458951] [2022-02-20 17:22:27,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:22:27,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:22:27,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:22:27,892 INFO L229 MonitoredProcess]: Starting monitored process 7 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:22:27,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 17:22:27,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:22:27,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 17:22:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:22:27,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:22:28,068 INFO L290 TraceCheckUtils]: 0: Hoare triple {2169#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2169#true} is VALID [2022-02-20 17:22:28,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {2169#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~post8#1, main_~d~0#1, main_~v~0#1, main_#t~post7#1, main_~c~0#1, main_~k~0#1, main_~temp~0#1, main_#t~post6#1, main_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~s~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~s~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2169#true} is VALID [2022-02-20 17:22:28,068 INFO L272 TraceCheckUtils]: 2: Hoare triple {2169#true} call assume_abort_if_not((if main_~x~0#1 >= 1 then 1 else 0)); {2169#true} is VALID [2022-02-20 17:22:28,069 INFO L290 TraceCheckUtils]: 3: Hoare triple {2169#true} ~cond := #in~cond; {2183#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 17:22:28,069 INFO L290 TraceCheckUtils]: 4: Hoare triple {2183#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2187#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:22:28,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {2187#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2187#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:22:28,070 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2187#(not (= |assume_abort_if_not_#in~cond| 0))} {2169#true} #91#return; {2194#(<= 1 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 17:22:28,070 INFO L272 TraceCheckUtils]: 7: Hoare triple {2194#(<= 1 |ULTIMATE.start_main_~x~0#1|)} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {2169#true} is VALID [2022-02-20 17:22:28,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {2169#true} ~cond := #in~cond; {2169#true} is VALID [2022-02-20 17:22:28,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {2169#true} assume !(0 == ~cond); {2169#true} is VALID [2022-02-20 17:22:28,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {2169#true} assume true; {2169#true} is VALID [2022-02-20 17:22:28,071 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2169#true} {2194#(<= 1 |ULTIMATE.start_main_~x~0#1|)} #93#return; {2194#(<= 1 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 17:22:28,071 INFO L290 TraceCheckUtils]: 12: Hoare triple {2194#(<= 1 |ULTIMATE.start_main_~x~0#1|)} main_~a~0#1 := main_~x~0#1;main_~b~0#1 := main_~y~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0;main_~r~0#1 := 0;main_~s~0#1 := 1; {2213#(<= 1 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:22:28,072 INFO L290 TraceCheckUtils]: 13: Hoare triple {2213#(<= 1 |ULTIMATE.start_main_~a~0#1|)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {2213#(<= 1 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:22:28,072 INFO L290 TraceCheckUtils]: 14: Hoare triple {2213#(<= 1 |ULTIMATE.start_main_~a~0#1|)} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1; {2213#(<= 1 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:22:28,072 INFO L290 TraceCheckUtils]: 15: Hoare triple {2213#(<= 1 |ULTIMATE.start_main_~a~0#1|)} assume !!(0 != main_~b~0#1);havoc main_~c~0#1;havoc main_~k~0#1;main_~c~0#1 := main_~a~0#1;main_~k~0#1 := 0; {2223#(<= 1 |ULTIMATE.start_main_~c~0#1|)} is VALID [2022-02-20 17:22:28,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {2223#(<= 1 |ULTIMATE.start_main_~c~0#1|)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {2223#(<= 1 |ULTIMATE.start_main_~c~0#1|)} is VALID [2022-02-20 17:22:28,074 INFO L290 TraceCheckUtils]: 17: Hoare triple {2223#(<= 1 |ULTIMATE.start_main_~c~0#1|)} assume !!(main_#t~post7#1 < 100);havoc main_#t~post7#1; {2223#(<= 1 |ULTIMATE.start_main_~c~0#1|)} is VALID [2022-02-20 17:22:28,074 INFO L290 TraceCheckUtils]: 18: Hoare triple {2223#(<= 1 |ULTIMATE.start_main_~c~0#1|)} assume !(main_~c~0#1 >= main_~b~0#1); {2223#(<= 1 |ULTIMATE.start_main_~c~0#1|)} is VALID [2022-02-20 17:22:28,074 INFO L290 TraceCheckUtils]: 19: Hoare triple {2223#(<= 1 |ULTIMATE.start_main_~c~0#1|)} main_~a~0#1 := main_~b~0#1;main_~b~0#1 := main_~c~0#1;havoc main_~temp~0#1;main_~temp~0#1 := main_~p~0#1;main_~p~0#1 := main_~q~0#1;main_~q~0#1 := main_~temp~0#1 - main_~q~0#1 * main_~k~0#1;main_~temp~0#1 := main_~r~0#1;main_~r~0#1 := main_~s~0#1;main_~s~0#1 := main_~temp~0#1 - main_~s~0#1 * main_~k~0#1; {2236#(<= 1 |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:22:28,075 INFO L290 TraceCheckUtils]: 20: Hoare triple {2236#(<= 1 |ULTIMATE.start_main_~b~0#1|)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {2236#(<= 1 |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:22:28,075 INFO L290 TraceCheckUtils]: 21: Hoare triple {2236#(<= 1 |ULTIMATE.start_main_~b~0#1|)} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1; {2236#(<= 1 |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:22:28,076 INFO L290 TraceCheckUtils]: 22: Hoare triple {2236#(<= 1 |ULTIMATE.start_main_~b~0#1|)} assume !(0 != main_~b~0#1); {2170#false} is VALID [2022-02-20 17:22:28,076 INFO L272 TraceCheckUtils]: 23: Hoare triple {2170#false} call __VERIFIER_assert((if main_~p~0#1 * main_~x~0#1 - main_~q~0#1 * main_~x~0#1 + main_~r~0#1 * main_~y~0#1 - main_~s~0#1 * main_~y~0#1 == main_~a~0#1 then 1 else 0)); {2170#false} is VALID [2022-02-20 17:22:28,076 INFO L290 TraceCheckUtils]: 24: Hoare triple {2170#false} ~cond := #in~cond; {2170#false} is VALID [2022-02-20 17:22:28,076 INFO L290 TraceCheckUtils]: 25: Hoare triple {2170#false} assume 0 == ~cond; {2170#false} is VALID [2022-02-20 17:22:28,076 INFO L290 TraceCheckUtils]: 26: Hoare triple {2170#false} assume !false; {2170#false} is VALID [2022-02-20 17:22:28,076 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 17:22:28,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:22:28,248 INFO L290 TraceCheckUtils]: 26: Hoare triple {2170#false} assume !false; {2170#false} is VALID [2022-02-20 17:22:28,248 INFO L290 TraceCheckUtils]: 25: Hoare triple {2170#false} assume 0 == ~cond; {2170#false} is VALID [2022-02-20 17:22:28,248 INFO L290 TraceCheckUtils]: 24: Hoare triple {2170#false} ~cond := #in~cond; {2170#false} is VALID [2022-02-20 17:22:28,248 INFO L272 TraceCheckUtils]: 23: Hoare triple {2170#false} call __VERIFIER_assert((if main_~p~0#1 * main_~x~0#1 - main_~q~0#1 * main_~x~0#1 + main_~r~0#1 * main_~y~0#1 - main_~s~0#1 * main_~y~0#1 == main_~a~0#1 then 1 else 0)); {2170#false} is VALID [2022-02-20 17:22:28,248 INFO L290 TraceCheckUtils]: 22: Hoare triple {2236#(<= 1 |ULTIMATE.start_main_~b~0#1|)} assume !(0 != main_~b~0#1); {2170#false} is VALID [2022-02-20 17:22:28,249 INFO L290 TraceCheckUtils]: 21: Hoare triple {2236#(<= 1 |ULTIMATE.start_main_~b~0#1|)} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1; {2236#(<= 1 |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:22:28,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {2236#(<= 1 |ULTIMATE.start_main_~b~0#1|)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {2236#(<= 1 |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:22:28,252 INFO L290 TraceCheckUtils]: 19: Hoare triple {2223#(<= 1 |ULTIMATE.start_main_~c~0#1|)} main_~a~0#1 := main_~b~0#1;main_~b~0#1 := main_~c~0#1;havoc main_~temp~0#1;main_~temp~0#1 := main_~p~0#1;main_~p~0#1 := main_~q~0#1;main_~q~0#1 := main_~temp~0#1 - main_~q~0#1 * main_~k~0#1;main_~temp~0#1 := main_~r~0#1;main_~r~0#1 := main_~s~0#1;main_~s~0#1 := main_~temp~0#1 - main_~s~0#1 * main_~k~0#1; {2236#(<= 1 |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:22:28,252 INFO L290 TraceCheckUtils]: 18: Hoare triple {2223#(<= 1 |ULTIMATE.start_main_~c~0#1|)} assume !(main_~c~0#1 >= main_~b~0#1); {2223#(<= 1 |ULTIMATE.start_main_~c~0#1|)} is VALID [2022-02-20 17:22:28,253 INFO L290 TraceCheckUtils]: 17: Hoare triple {2223#(<= 1 |ULTIMATE.start_main_~c~0#1|)} assume !!(main_#t~post7#1 < 100);havoc main_#t~post7#1; {2223#(<= 1 |ULTIMATE.start_main_~c~0#1|)} is VALID [2022-02-20 17:22:28,253 INFO L290 TraceCheckUtils]: 16: Hoare triple {2223#(<= 1 |ULTIMATE.start_main_~c~0#1|)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {2223#(<= 1 |ULTIMATE.start_main_~c~0#1|)} is VALID [2022-02-20 17:22:28,253 INFO L290 TraceCheckUtils]: 15: Hoare triple {2213#(<= 1 |ULTIMATE.start_main_~a~0#1|)} assume !!(0 != main_~b~0#1);havoc main_~c~0#1;havoc main_~k~0#1;main_~c~0#1 := main_~a~0#1;main_~k~0#1 := 0; {2223#(<= 1 |ULTIMATE.start_main_~c~0#1|)} is VALID [2022-02-20 17:22:28,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {2213#(<= 1 |ULTIMATE.start_main_~a~0#1|)} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1; {2213#(<= 1 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:22:28,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {2213#(<= 1 |ULTIMATE.start_main_~a~0#1|)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {2213#(<= 1 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:22:28,254 INFO L290 TraceCheckUtils]: 12: Hoare triple {2194#(<= 1 |ULTIMATE.start_main_~x~0#1|)} main_~a~0#1 := main_~x~0#1;main_~b~0#1 := main_~y~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0;main_~r~0#1 := 0;main_~s~0#1 := 1; {2213#(<= 1 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:22:28,254 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2169#true} {2194#(<= 1 |ULTIMATE.start_main_~x~0#1|)} #93#return; {2194#(<= 1 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 17:22:28,255 INFO L290 TraceCheckUtils]: 10: Hoare triple {2169#true} assume true; {2169#true} is VALID [2022-02-20 17:22:28,255 INFO L290 TraceCheckUtils]: 9: Hoare triple {2169#true} assume !(0 == ~cond); {2169#true} is VALID [2022-02-20 17:22:28,255 INFO L290 TraceCheckUtils]: 8: Hoare triple {2169#true} ~cond := #in~cond; {2169#true} is VALID [2022-02-20 17:22:28,255 INFO L272 TraceCheckUtils]: 7: Hoare triple {2194#(<= 1 |ULTIMATE.start_main_~x~0#1|)} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {2169#true} is VALID [2022-02-20 17:22:28,255 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2187#(not (= |assume_abort_if_not_#in~cond| 0))} {2169#true} #91#return; {2194#(<= 1 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 17:22:28,256 INFO L290 TraceCheckUtils]: 5: Hoare triple {2187#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2187#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:22:28,256 INFO L290 TraceCheckUtils]: 4: Hoare triple {2327#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {2187#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:22:28,256 INFO L290 TraceCheckUtils]: 3: Hoare triple {2169#true} ~cond := #in~cond; {2327#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-02-20 17:22:28,256 INFO L272 TraceCheckUtils]: 2: Hoare triple {2169#true} call assume_abort_if_not((if main_~x~0#1 >= 1 then 1 else 0)); {2169#true} is VALID [2022-02-20 17:22:28,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {2169#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~post8#1, main_~d~0#1, main_~v~0#1, main_#t~post7#1, main_~c~0#1, main_~k~0#1, main_~temp~0#1, main_#t~post6#1, main_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~s~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~s~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2169#true} is VALID [2022-02-20 17:22:28,257 INFO L290 TraceCheckUtils]: 0: Hoare triple {2169#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2169#true} is VALID [2022-02-20 17:22:28,257 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 17:22:28,257 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:22:28,257 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128407295] [2022-02-20 17:22:28,257 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:22:28,257 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211458951] [2022-02-20 17:22:28,258 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211458951] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:22:28,258 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:22:28,258 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-02-20 17:22:28,258 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32407080] [2022-02-20 17:22:28,258 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:22:28,258 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-02-20 17:22:28,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:22:28,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:22:28,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:22:28,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 17:22:28,273 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:22:28,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 17:22:28,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 17:22:28,274 INFO L87 Difference]: Start difference. First operand 97 states and 130 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:22:28,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:28,959 INFO L93 Difference]: Finished difference Result 183 states and 261 transitions. [2022-02-20 17:22:28,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 17:22:28,959 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-02-20 17:22:28,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:22:28,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:22:28,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 151 transitions. [2022-02-20 17:22:28,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:22:28,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 151 transitions. [2022-02-20 17:22:28,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 151 transitions. [2022-02-20 17:22:29,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:22:29,087 INFO L225 Difference]: With dead ends: 183 [2022-02-20 17:22:29,087 INFO L226 Difference]: Without dead ends: 171 [2022-02-20 17:22:29,087 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-02-20 17:22:29,088 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 115 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:22:29,088 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 333 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:22:29,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-02-20 17:22:29,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 128. [2022-02-20 17:22:29,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:22:29,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states. Second operand has 128 states, 97 states have (on average 1.3505154639175259) internal successors, (131), 98 states have internal predecessors, (131), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:22:29,264 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand has 128 states, 97 states have (on average 1.3505154639175259) internal successors, (131), 98 states have internal predecessors, (131), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:22:29,264 INFO L87 Difference]: Start difference. First operand 171 states. Second operand has 128 states, 97 states have (on average 1.3505154639175259) internal successors, (131), 98 states have internal predecessors, (131), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:22:29,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:29,269 INFO L93 Difference]: Finished difference Result 171 states and 247 transitions. [2022-02-20 17:22:29,269 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 247 transitions. [2022-02-20 17:22:29,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:22:29,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:22:29,270 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 97 states have (on average 1.3505154639175259) internal successors, (131), 98 states have internal predecessors, (131), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 171 states. [2022-02-20 17:22:29,271 INFO L87 Difference]: Start difference. First operand has 128 states, 97 states have (on average 1.3505154639175259) internal successors, (131), 98 states have internal predecessors, (131), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 171 states. [2022-02-20 17:22:29,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:29,290 INFO L93 Difference]: Finished difference Result 171 states and 247 transitions. [2022-02-20 17:22:29,290 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 247 transitions. [2022-02-20 17:22:29,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:22:29,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:22:29,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:22:29,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:22:29,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 97 states have (on average 1.3505154639175259) internal successors, (131), 98 states have internal predecessors, (131), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:22:29,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 176 transitions. [2022-02-20 17:22:29,295 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 176 transitions. Word has length 27 [2022-02-20 17:22:29,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:22:29,295 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 176 transitions. [2022-02-20 17:22:29,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:22:29,295 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 176 transitions. [2022-02-20 17:22:29,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 17:22:29,296 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:22:29,296 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:22:29,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-20 17:22:29,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:22:29,510 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:22:29,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:22:29,510 INFO L85 PathProgramCache]: Analyzing trace with hash -200071253, now seen corresponding path program 1 times [2022-02-20 17:22:29,510 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:22:29,510 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746008461] [2022-02-20 17:22:29,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:22:29,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:22:29,536 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:22:29,536 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1274506729] [2022-02-20 17:22:29,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:22:29,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:22:29,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:22:29,538 INFO L229 MonitoredProcess]: Starting monitored process 8 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:22:29,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-20 17:22:29,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:22:29,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-20 17:22:29,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:22:29,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:22:29,972 INFO L290 TraceCheckUtils]: 0: Hoare triple {3134#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3134#true} is VALID [2022-02-20 17:22:29,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {3134#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~post8#1, main_~d~0#1, main_~v~0#1, main_#t~post7#1, main_~c~0#1, main_~k~0#1, main_~temp~0#1, main_#t~post6#1, main_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~s~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~s~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {3142#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} is VALID [2022-02-20 17:22:29,973 INFO L272 TraceCheckUtils]: 2: Hoare triple {3142#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} call assume_abort_if_not((if main_~x~0#1 >= 1 then 1 else 0)); {3134#true} is VALID [2022-02-20 17:22:29,973 INFO L290 TraceCheckUtils]: 3: Hoare triple {3134#true} ~cond := #in~cond; {3134#true} is VALID [2022-02-20 17:22:29,973 INFO L290 TraceCheckUtils]: 4: Hoare triple {3134#true} assume !(0 == ~cond); {3134#true} is VALID [2022-02-20 17:22:29,973 INFO L290 TraceCheckUtils]: 5: Hoare triple {3134#true} assume true; {3134#true} is VALID [2022-02-20 17:22:29,974 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3134#true} {3142#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} #91#return; {3142#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} is VALID [2022-02-20 17:22:29,974 INFO L272 TraceCheckUtils]: 7: Hoare triple {3142#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {3134#true} is VALID [2022-02-20 17:22:29,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {3134#true} ~cond := #in~cond; {3164#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 17:22:29,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {3164#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3168#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:22:29,975 INFO L290 TraceCheckUtils]: 10: Hoare triple {3168#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3168#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:22:29,975 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {3168#(not (= |assume_abort_if_not_#in~cond| 0))} {3142#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} #93#return; {3175#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2147483647))} is VALID [2022-02-20 17:22:29,976 INFO L290 TraceCheckUtils]: 12: Hoare triple {3175#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2147483647))} main_~a~0#1 := main_~x~0#1;main_~b~0#1 := main_~y~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0;main_~r~0#1 := 0;main_~s~0#1 := 1; {3179#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:22:29,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {3179#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {3179#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:22:29,977 INFO L290 TraceCheckUtils]: 14: Hoare triple {3179#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1; {3179#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:22:29,977 INFO L290 TraceCheckUtils]: 15: Hoare triple {3179#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} assume !!(0 != main_~b~0#1);havoc main_~c~0#1;havoc main_~k~0#1;main_~c~0#1 := main_~a~0#1;main_~k~0#1 := 0; {3189#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (<= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:22:29,978 INFO L290 TraceCheckUtils]: 16: Hoare triple {3189#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (<= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {3189#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (<= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:22:29,978 INFO L290 TraceCheckUtils]: 17: Hoare triple {3189#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (<= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} assume !!(main_#t~post7#1 < 100);havoc main_#t~post7#1; {3189#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (<= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:22:29,979 INFO L290 TraceCheckUtils]: 18: Hoare triple {3189#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (<= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} assume !!(main_~c~0#1 >= main_~b~0#1);havoc main_~d~0#1;havoc main_~v~0#1;main_~d~0#1 := 1;main_~v~0#1 := main_~b~0#1; {3199#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (<= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:22:29,979 INFO L290 TraceCheckUtils]: 19: Hoare triple {3199#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (<= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} main_#t~post8#1 := ~counter~0;~counter~0 := 1 + main_#t~post8#1; {3199#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (<= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:22:29,980 INFO L290 TraceCheckUtils]: 20: Hoare triple {3199#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (<= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} assume !!(main_#t~post8#1 < 100);havoc main_#t~post8#1; {3199#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (<= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:22:29,980 INFO L272 TraceCheckUtils]: 21: Hoare triple {3199#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (<= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} call __VERIFIER_assert((if main_~a~0#1 == main_~y~0#1 * main_~r~0#1 + main_~x~0#1 * main_~p~0#1 then 1 else 0)); {3134#true} is VALID [2022-02-20 17:22:29,980 INFO L290 TraceCheckUtils]: 22: Hoare triple {3134#true} ~cond := #in~cond; {3134#true} is VALID [2022-02-20 17:22:29,980 INFO L290 TraceCheckUtils]: 23: Hoare triple {3134#true} assume !(0 == ~cond); {3134#true} is VALID [2022-02-20 17:22:29,980 INFO L290 TraceCheckUtils]: 24: Hoare triple {3134#true} assume true; {3134#true} is VALID [2022-02-20 17:22:29,981 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3134#true} {3199#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (<= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} #95#return; {3199#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (<= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:22:29,982 INFO L272 TraceCheckUtils]: 26: Hoare triple {3199#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (<= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} call __VERIFIER_assert((if main_~b~0#1 == main_~x~0#1 * main_~q~0#1 + main_~y~0#1 * main_~s~0#1 then 1 else 0)); {3224#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:22:29,984 INFO L290 TraceCheckUtils]: 27: Hoare triple {3224#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3228#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:22:29,985 INFO L290 TraceCheckUtils]: 28: Hoare triple {3228#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3135#false} is VALID [2022-02-20 17:22:29,985 INFO L290 TraceCheckUtils]: 29: Hoare triple {3135#false} assume !false; {3135#false} is VALID [2022-02-20 17:22:29,985 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 17:22:29,985 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:22:29,985 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:22:29,985 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746008461] [2022-02-20 17:22:29,985 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:22:29,986 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274506729] [2022-02-20 17:22:29,986 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274506729] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:22:29,986 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:22:29,986 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-20 17:22:29,986 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188560172] [2022-02-20 17:22:29,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:22:29,986 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2022-02-20 17:22:29,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:22:29,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:22:30,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:22:30,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 17:22:30,007 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:22:30,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 17:22:30,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:22:30,007 INFO L87 Difference]: Start difference. First operand 128 states and 176 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:22:30,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:30,689 INFO L93 Difference]: Finished difference Result 153 states and 206 transitions. [2022-02-20 17:22:30,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 17:22:30,689 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2022-02-20 17:22:30,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:22:30,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:22:30,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 89 transitions. [2022-02-20 17:22:30,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:22:30,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 89 transitions. [2022-02-20 17:22:30,692 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 89 transitions. [2022-02-20 17:22:30,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:22:30,762 INFO L225 Difference]: With dead ends: 153 [2022-02-20 17:22:30,762 INFO L226 Difference]: Without dead ends: 151 [2022-02-20 17:22:30,762 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-02-20 17:22:30,762 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 72 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:22:30,763 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 273 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:22:30,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-02-20 17:22:30,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 140. [2022-02-20 17:22:30,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:22:30,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand has 140 states, 106 states have (on average 1.320754716981132) internal successors, (140), 107 states have internal predecessors, (140), 23 states have call successors, (23), 10 states have call predecessors, (23), 10 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:22:30,937 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand has 140 states, 106 states have (on average 1.320754716981132) internal successors, (140), 107 states have internal predecessors, (140), 23 states have call successors, (23), 10 states have call predecessors, (23), 10 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:22:30,937 INFO L87 Difference]: Start difference. First operand 151 states. Second operand has 140 states, 106 states have (on average 1.320754716981132) internal successors, (140), 107 states have internal predecessors, (140), 23 states have call successors, (23), 10 states have call predecessors, (23), 10 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:22:30,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:30,941 INFO L93 Difference]: Finished difference Result 151 states and 202 transitions. [2022-02-20 17:22:30,941 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 202 transitions. [2022-02-20 17:22:30,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:22:30,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:22:30,942 INFO L74 IsIncluded]: Start isIncluded. First operand has 140 states, 106 states have (on average 1.320754716981132) internal successors, (140), 107 states have internal predecessors, (140), 23 states have call successors, (23), 10 states have call predecessors, (23), 10 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 151 states. [2022-02-20 17:22:30,942 INFO L87 Difference]: Start difference. First operand has 140 states, 106 states have (on average 1.320754716981132) internal successors, (140), 107 states have internal predecessors, (140), 23 states have call successors, (23), 10 states have call predecessors, (23), 10 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 151 states. [2022-02-20 17:22:30,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:30,946 INFO L93 Difference]: Finished difference Result 151 states and 202 transitions. [2022-02-20 17:22:30,946 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 202 transitions. [2022-02-20 17:22:30,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:22:30,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:22:30,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:22:30,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:22:30,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 106 states have (on average 1.320754716981132) internal successors, (140), 107 states have internal predecessors, (140), 23 states have call successors, (23), 10 states have call predecessors, (23), 10 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:22:30,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 185 transitions. [2022-02-20 17:22:30,950 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 185 transitions. Word has length 30 [2022-02-20 17:22:30,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:22:30,950 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 185 transitions. [2022-02-20 17:22:30,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:22:30,951 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 185 transitions. [2022-02-20 17:22:30,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 17:22:30,951 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:22:30,951 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:22:30,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-02-20 17:22:31,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:22:31,167 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:22:31,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:22:31,168 INFO L85 PathProgramCache]: Analyzing trace with hash 164485690, now seen corresponding path program 1 times [2022-02-20 17:22:31,168 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:22:31,168 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069594141] [2022-02-20 17:22:31,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:22:31,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:22:31,181 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:22:31,181 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1006327474] [2022-02-20 17:22:31,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:22:31,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:22:31,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:22:31,183 INFO L229 MonitoredProcess]: Starting monitored process 9 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:22:31,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-20 17:22:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:22:31,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-20 17:22:31,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:22:31,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:22:31,530 INFO L290 TraceCheckUtils]: 0: Hoare triple {3952#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3952#true} is VALID [2022-02-20 17:22:31,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {3952#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~post8#1, main_~d~0#1, main_~v~0#1, main_#t~post7#1, main_~c~0#1, main_~k~0#1, main_~temp~0#1, main_#t~post6#1, main_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~s~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~s~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {3952#true} is VALID [2022-02-20 17:22:31,531 INFO L272 TraceCheckUtils]: 2: Hoare triple {3952#true} call assume_abort_if_not((if main_~x~0#1 >= 1 then 1 else 0)); {3952#true} is VALID [2022-02-20 17:22:31,531 INFO L290 TraceCheckUtils]: 3: Hoare triple {3952#true} ~cond := #in~cond; {3966#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 17:22:31,534 INFO L290 TraceCheckUtils]: 4: Hoare triple {3966#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3970#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:22:31,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {3970#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3970#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:22:31,535 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3970#(not (= |assume_abort_if_not_#in~cond| 0))} {3952#true} #91#return; {3977#(<= 1 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 17:22:31,535 INFO L272 TraceCheckUtils]: 7: Hoare triple {3977#(<= 1 |ULTIMATE.start_main_~x~0#1|)} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {3952#true} is VALID [2022-02-20 17:22:31,535 INFO L290 TraceCheckUtils]: 8: Hoare triple {3952#true} ~cond := #in~cond; {3952#true} is VALID [2022-02-20 17:22:31,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {3952#true} assume !(0 == ~cond); {3952#true} is VALID [2022-02-20 17:22:31,535 INFO L290 TraceCheckUtils]: 10: Hoare triple {3952#true} assume true; {3952#true} is VALID [2022-02-20 17:22:31,535 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {3952#true} {3977#(<= 1 |ULTIMATE.start_main_~x~0#1|)} #93#return; {3977#(<= 1 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 17:22:31,536 INFO L290 TraceCheckUtils]: 12: Hoare triple {3977#(<= 1 |ULTIMATE.start_main_~x~0#1|)} main_~a~0#1 := main_~x~0#1;main_~b~0#1 := main_~y~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0;main_~r~0#1 := 0;main_~s~0#1 := 1; {3996#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (<= 1 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:22:31,536 INFO L290 TraceCheckUtils]: 13: Hoare triple {3996#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (<= 1 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {3996#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (<= 1 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:22:31,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {3996#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (<= 1 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1; {3996#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (<= 1 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:22:31,537 INFO L290 TraceCheckUtils]: 15: Hoare triple {3996#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (<= 1 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} assume !!(0 != main_~b~0#1);havoc main_~c~0#1;havoc main_~k~0#1;main_~c~0#1 := main_~a~0#1;main_~k~0#1 := 0; {4006#(and (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (<= 1 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:22:31,537 INFO L290 TraceCheckUtils]: 16: Hoare triple {4006#(and (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (<= 1 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {4006#(and (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (<= 1 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:22:31,538 INFO L290 TraceCheckUtils]: 17: Hoare triple {4006#(and (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (<= 1 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} assume !!(main_#t~post7#1 < 100);havoc main_#t~post7#1; {4006#(and (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (<= 1 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:22:31,538 INFO L290 TraceCheckUtils]: 18: Hoare triple {4006#(and (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (<= 1 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} assume !(main_~c~0#1 >= main_~b~0#1); {4006#(and (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (<= 1 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:22:31,539 INFO L290 TraceCheckUtils]: 19: Hoare triple {4006#(and (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (<= 1 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} main_~a~0#1 := main_~b~0#1;main_~b~0#1 := main_~c~0#1;havoc main_~temp~0#1;main_~temp~0#1 := main_~p~0#1;main_~p~0#1 := main_~q~0#1;main_~q~0#1 := main_~temp~0#1 - main_~q~0#1 * main_~k~0#1;main_~temp~0#1 := main_~r~0#1;main_~r~0#1 := main_~s~0#1;main_~s~0#1 := main_~temp~0#1 - main_~s~0#1 * main_~k~0#1; {4019#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) (<= 1 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~r~0#1| 1))} is VALID [2022-02-20 17:22:31,539 INFO L290 TraceCheckUtils]: 20: Hoare triple {4019#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) (<= 1 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~r~0#1| 1))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {4019#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) (<= 1 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~r~0#1| 1))} is VALID [2022-02-20 17:22:31,540 INFO L290 TraceCheckUtils]: 21: Hoare triple {4019#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) (<= 1 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~r~0#1| 1))} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1; {4019#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) (<= 1 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~r~0#1| 1))} is VALID [2022-02-20 17:22:31,540 INFO L290 TraceCheckUtils]: 22: Hoare triple {4019#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) (<= 1 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~r~0#1| 1))} assume !!(0 != main_~b~0#1);havoc main_~c~0#1;havoc main_~k~0#1;main_~c~0#1 := main_~a~0#1;main_~k~0#1 := 0; {4019#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) (<= 1 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~r~0#1| 1))} is VALID [2022-02-20 17:22:31,540 INFO L290 TraceCheckUtils]: 23: Hoare triple {4019#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) (<= 1 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~r~0#1| 1))} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {4019#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) (<= 1 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~r~0#1| 1))} is VALID [2022-02-20 17:22:31,541 INFO L290 TraceCheckUtils]: 24: Hoare triple {4019#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) (<= 1 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~r~0#1| 1))} assume !!(main_#t~post7#1 < 100);havoc main_#t~post7#1; {4019#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) (<= 1 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~r~0#1| 1))} is VALID [2022-02-20 17:22:31,541 INFO L290 TraceCheckUtils]: 25: Hoare triple {4019#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) (<= 1 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~r~0#1| 1))} assume !!(main_~c~0#1 >= main_~b~0#1);havoc main_~d~0#1;havoc main_~v~0#1;main_~d~0#1 := 1;main_~v~0#1 := main_~b~0#1; {4019#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) (<= 1 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~r~0#1| 1))} is VALID [2022-02-20 17:22:31,541 INFO L290 TraceCheckUtils]: 26: Hoare triple {4019#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) (<= 1 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~r~0#1| 1))} main_#t~post8#1 := ~counter~0;~counter~0 := 1 + main_#t~post8#1; {4019#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) (<= 1 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~r~0#1| 1))} is VALID [2022-02-20 17:22:31,542 INFO L290 TraceCheckUtils]: 27: Hoare triple {4019#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) (<= 1 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~r~0#1| 1))} assume !!(main_#t~post8#1 < 100);havoc main_#t~post8#1; {4019#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) (<= 1 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~r~0#1| 1))} is VALID [2022-02-20 17:22:31,542 INFO L272 TraceCheckUtils]: 28: Hoare triple {4019#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) (<= 1 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~r~0#1| 1))} call __VERIFIER_assert((if main_~a~0#1 == main_~y~0#1 * main_~r~0#1 + main_~x~0#1 * main_~p~0#1 then 1 else 0)); {4047#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:22:31,543 INFO L290 TraceCheckUtils]: 29: Hoare triple {4047#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4051#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:22:31,544 INFO L290 TraceCheckUtils]: 30: Hoare triple {4051#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3953#false} is VALID [2022-02-20 17:22:31,544 INFO L290 TraceCheckUtils]: 31: Hoare triple {3953#false} assume !false; {3953#false} is VALID [2022-02-20 17:22:31,544 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 17:22:31,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:22:31,705 INFO L290 TraceCheckUtils]: 31: Hoare triple {3953#false} assume !false; {3953#false} is VALID [2022-02-20 17:22:31,705 INFO L290 TraceCheckUtils]: 30: Hoare triple {4051#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3953#false} is VALID [2022-02-20 17:22:31,706 INFO L290 TraceCheckUtils]: 29: Hoare triple {4047#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4051#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:22:31,709 INFO L272 TraceCheckUtils]: 28: Hoare triple {4067#(= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|)} call __VERIFIER_assert((if main_~a~0#1 == main_~y~0#1 * main_~r~0#1 + main_~x~0#1 * main_~p~0#1 then 1 else 0)); {4047#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:22:31,709 INFO L290 TraceCheckUtils]: 27: Hoare triple {4067#(= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|)} assume !!(main_#t~post8#1 < 100);havoc main_#t~post8#1; {4067#(= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:22:31,710 INFO L290 TraceCheckUtils]: 26: Hoare triple {4067#(= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|)} main_#t~post8#1 := ~counter~0;~counter~0 := 1 + main_#t~post8#1; {4067#(= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:22:31,710 INFO L290 TraceCheckUtils]: 25: Hoare triple {4067#(= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|)} assume !!(main_~c~0#1 >= main_~b~0#1);havoc main_~d~0#1;havoc main_~v~0#1;main_~d~0#1 := 1;main_~v~0#1 := main_~b~0#1; {4067#(= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:22:31,710 INFO L290 TraceCheckUtils]: 24: Hoare triple {4067#(= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|)} assume !!(main_#t~post7#1 < 100);havoc main_#t~post7#1; {4067#(= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:22:31,711 INFO L290 TraceCheckUtils]: 23: Hoare triple {4067#(= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {4067#(= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:22:31,711 INFO L290 TraceCheckUtils]: 22: Hoare triple {4067#(= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|)} assume !!(0 != main_~b~0#1);havoc main_~c~0#1;havoc main_~k~0#1;main_~c~0#1 := main_~a~0#1;main_~k~0#1 := 0; {4067#(= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:22:31,711 INFO L290 TraceCheckUtils]: 21: Hoare triple {4067#(= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|)} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1; {4067#(= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:22:31,712 INFO L290 TraceCheckUtils]: 20: Hoare triple {4067#(= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {4067#(= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:22:31,712 INFO L290 TraceCheckUtils]: 19: Hoare triple {4095#(= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)} main_~a~0#1 := main_~b~0#1;main_~b~0#1 := main_~c~0#1;havoc main_~temp~0#1;main_~temp~0#1 := main_~p~0#1;main_~p~0#1 := main_~q~0#1;main_~q~0#1 := main_~temp~0#1 - main_~q~0#1 * main_~k~0#1;main_~temp~0#1 := main_~r~0#1;main_~r~0#1 := main_~s~0#1;main_~s~0#1 := main_~temp~0#1 - main_~s~0#1 * main_~k~0#1; {4067#(= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:22:31,712 INFO L290 TraceCheckUtils]: 18: Hoare triple {4095#(= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)} assume !(main_~c~0#1 >= main_~b~0#1); {4095#(= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:22:31,713 INFO L290 TraceCheckUtils]: 17: Hoare triple {4095#(= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)} assume !!(main_#t~post7#1 < 100);havoc main_#t~post7#1; {4095#(= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:22:31,713 INFO L290 TraceCheckUtils]: 16: Hoare triple {4095#(= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {4095#(= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:22:31,714 INFO L290 TraceCheckUtils]: 15: Hoare triple {4095#(= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)} assume !!(0 != main_~b~0#1);havoc main_~c~0#1;havoc main_~k~0#1;main_~c~0#1 := main_~a~0#1;main_~k~0#1 := 0; {4095#(= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:22:31,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {4095#(= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1; {4095#(= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:22:31,715 INFO L290 TraceCheckUtils]: 13: Hoare triple {4095#(= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {4095#(= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:22:31,715 INFO L290 TraceCheckUtils]: 12: Hoare triple {3952#true} main_~a~0#1 := main_~x~0#1;main_~b~0#1 := main_~y~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0;main_~r~0#1 := 0;main_~s~0#1 := 1; {4095#(= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:22:31,715 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {3952#true} {3952#true} #93#return; {3952#true} is VALID [2022-02-20 17:22:31,715 INFO L290 TraceCheckUtils]: 10: Hoare triple {3952#true} assume true; {3952#true} is VALID [2022-02-20 17:22:31,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {3952#true} assume !(0 == ~cond); {3952#true} is VALID [2022-02-20 17:22:31,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {3952#true} ~cond := #in~cond; {3952#true} is VALID [2022-02-20 17:22:31,716 INFO L272 TraceCheckUtils]: 7: Hoare triple {3952#true} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {3952#true} is VALID [2022-02-20 17:22:31,716 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3952#true} {3952#true} #91#return; {3952#true} is VALID [2022-02-20 17:22:31,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {3952#true} assume true; {3952#true} is VALID [2022-02-20 17:22:31,716 INFO L290 TraceCheckUtils]: 4: Hoare triple {3952#true} assume !(0 == ~cond); {3952#true} is VALID [2022-02-20 17:22:31,716 INFO L290 TraceCheckUtils]: 3: Hoare triple {3952#true} ~cond := #in~cond; {3952#true} is VALID [2022-02-20 17:22:31,716 INFO L272 TraceCheckUtils]: 2: Hoare triple {3952#true} call assume_abort_if_not((if main_~x~0#1 >= 1 then 1 else 0)); {3952#true} is VALID [2022-02-20 17:22:31,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {3952#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~post8#1, main_~d~0#1, main_~v~0#1, main_#t~post7#1, main_~c~0#1, main_~k~0#1, main_~temp~0#1, main_#t~post6#1, main_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~s~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~s~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {3952#true} is VALID [2022-02-20 17:22:31,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {3952#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3952#true} is VALID [2022-02-20 17:22:31,716 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:22:31,716 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:22:31,716 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069594141] [2022-02-20 17:22:31,716 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:22:31,717 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006327474] [2022-02-20 17:22:31,717 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006327474] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:22:31,717 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:22:31,717 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 12 [2022-02-20 17:22:31,717 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982445300] [2022-02-20 17:22:31,717 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:22:31,718 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-02-20 17:22:31,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:22:31,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:22:31,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:22:31,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 17:22:31,753 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:22:31,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 17:22:31,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:22:31,753 INFO L87 Difference]: Start difference. First operand 140 states and 185 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:22:33,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:33,072 INFO L93 Difference]: Finished difference Result 183 states and 251 transitions. [2022-02-20 17:22:33,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 17:22:33,073 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-02-20 17:22:33,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:22:33,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:22:33,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2022-02-20 17:22:33,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:22:33,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2022-02-20 17:22:33,081 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 114 transitions. [2022-02-20 17:22:33,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:22:33,202 INFO L225 Difference]: With dead ends: 183 [2022-02-20 17:22:33,202 INFO L226 Difference]: Without dead ends: 181 [2022-02-20 17:22:33,202 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-02-20 17:22:33,204 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 110 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 17:22:33,204 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 372 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 17:22:33,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-02-20 17:22:33,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 170. [2022-02-20 17:22:33,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:22:33,432 INFO L82 GeneralOperation]: Start isEquivalent. First operand 181 states. Second operand has 170 states, 127 states have (on average 1.3464566929133859) internal successors, (171), 128 states have internal predecessors, (171), 31 states have call successors, (31), 11 states have call predecessors, (31), 11 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-02-20 17:22:33,432 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand has 170 states, 127 states have (on average 1.3464566929133859) internal successors, (171), 128 states have internal predecessors, (171), 31 states have call successors, (31), 11 states have call predecessors, (31), 11 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-02-20 17:22:33,433 INFO L87 Difference]: Start difference. First operand 181 states. Second operand has 170 states, 127 states have (on average 1.3464566929133859) internal successors, (171), 128 states have internal predecessors, (171), 31 states have call successors, (31), 11 states have call predecessors, (31), 11 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-02-20 17:22:33,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:33,437 INFO L93 Difference]: Finished difference Result 181 states and 249 transitions. [2022-02-20 17:22:33,437 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 249 transitions. [2022-02-20 17:22:33,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:22:33,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:22:33,438 INFO L74 IsIncluded]: Start isIncluded. First operand has 170 states, 127 states have (on average 1.3464566929133859) internal successors, (171), 128 states have internal predecessors, (171), 31 states have call successors, (31), 11 states have call predecessors, (31), 11 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand 181 states. [2022-02-20 17:22:33,438 INFO L87 Difference]: Start difference. First operand has 170 states, 127 states have (on average 1.3464566929133859) internal successors, (171), 128 states have internal predecessors, (171), 31 states have call successors, (31), 11 states have call predecessors, (31), 11 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand 181 states. [2022-02-20 17:22:33,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:33,441 INFO L93 Difference]: Finished difference Result 181 states and 249 transitions. [2022-02-20 17:22:33,442 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 249 transitions. [2022-02-20 17:22:33,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:22:33,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:22:33,442 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:22:33,442 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:22:33,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 127 states have (on average 1.3464566929133859) internal successors, (171), 128 states have internal predecessors, (171), 31 states have call successors, (31), 11 states have call predecessors, (31), 11 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-02-20 17:22:33,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 232 transitions. [2022-02-20 17:22:33,446 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 232 transitions. Word has length 32 [2022-02-20 17:22:33,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:22:33,446 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 232 transitions. [2022-02-20 17:22:33,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:22:33,446 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 232 transitions. [2022-02-20 17:22:33,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 17:22:33,447 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:22:33,447 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:22:33,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-20 17:22:33,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-02-20 17:22:33,660 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:22:33,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:22:33,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1985711111, now seen corresponding path program 1 times [2022-02-20 17:22:33,661 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:22:33,661 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532425397] [2022-02-20 17:22:33,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:22:33,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:22:33,672 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:22:33,672 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1331288781] [2022-02-20 17:22:33,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:22:33,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:22:33,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:22:33,673 INFO L229 MonitoredProcess]: Starting monitored process 10 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:22:33,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-20 17:22:33,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:22:33,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:22:33,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:22:33,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:22:33,845 INFO L290 TraceCheckUtils]: 0: Hoare triple {5017#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5022#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:33,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {5022#(<= ~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~post8#1, main_~d~0#1, main_~v~0#1, main_#t~post7#1, main_~c~0#1, main_~k~0#1, main_~temp~0#1, main_#t~post6#1, main_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~s~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~s~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {5022#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:33,846 INFO L272 TraceCheckUtils]: 2: Hoare triple {5022#(<= ~counter~0 0)} call assume_abort_if_not((if main_~x~0#1 >= 1 then 1 else 0)); {5022#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:33,846 INFO L290 TraceCheckUtils]: 3: Hoare triple {5022#(<= ~counter~0 0)} ~cond := #in~cond; {5022#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:33,846 INFO L290 TraceCheckUtils]: 4: Hoare triple {5022#(<= ~counter~0 0)} assume !(0 == ~cond); {5022#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:33,847 INFO L290 TraceCheckUtils]: 5: Hoare triple {5022#(<= ~counter~0 0)} assume true; {5022#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:33,848 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5022#(<= ~counter~0 0)} {5022#(<= ~counter~0 0)} #91#return; {5022#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:33,848 INFO L272 TraceCheckUtils]: 7: Hoare triple {5022#(<= ~counter~0 0)} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {5022#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:33,848 INFO L290 TraceCheckUtils]: 8: Hoare triple {5022#(<= ~counter~0 0)} ~cond := #in~cond; {5022#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:33,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {5022#(<= ~counter~0 0)} assume !(0 == ~cond); {5022#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:33,849 INFO L290 TraceCheckUtils]: 10: Hoare triple {5022#(<= ~counter~0 0)} assume true; {5022#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:33,849 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {5022#(<= ~counter~0 0)} {5022#(<= ~counter~0 0)} #93#return; {5022#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:33,850 INFO L290 TraceCheckUtils]: 12: Hoare triple {5022#(<= ~counter~0 0)} main_~a~0#1 := main_~x~0#1;main_~b~0#1 := main_~y~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0;main_~r~0#1 := 0;main_~s~0#1 := 1; {5022#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:33,850 INFO L290 TraceCheckUtils]: 13: Hoare triple {5022#(<= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {5062#(<= ~counter~0 1)} is VALID [2022-02-20 17:22:33,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {5062#(<= ~counter~0 1)} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1; {5062#(<= ~counter~0 1)} is VALID [2022-02-20 17:22:33,851 INFO L290 TraceCheckUtils]: 15: Hoare triple {5062#(<= ~counter~0 1)} assume !!(0 != main_~b~0#1);havoc main_~c~0#1;havoc main_~k~0#1;main_~c~0#1 := main_~a~0#1;main_~k~0#1 := 0; {5062#(<= ~counter~0 1)} is VALID [2022-02-20 17:22:33,851 INFO L290 TraceCheckUtils]: 16: Hoare triple {5062#(<= ~counter~0 1)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {5072#(<= ~counter~0 2)} is VALID [2022-02-20 17:22:33,851 INFO L290 TraceCheckUtils]: 17: Hoare triple {5072#(<= ~counter~0 2)} assume !!(main_#t~post7#1 < 100);havoc main_#t~post7#1; {5072#(<= ~counter~0 2)} is VALID [2022-02-20 17:22:33,858 INFO L290 TraceCheckUtils]: 18: Hoare triple {5072#(<= ~counter~0 2)} assume !!(main_~c~0#1 >= main_~b~0#1);havoc main_~d~0#1;havoc main_~v~0#1;main_~d~0#1 := 1;main_~v~0#1 := main_~b~0#1; {5072#(<= ~counter~0 2)} is VALID [2022-02-20 17:22:33,859 INFO L290 TraceCheckUtils]: 19: Hoare triple {5072#(<= ~counter~0 2)} main_#t~post8#1 := ~counter~0;~counter~0 := 1 + main_#t~post8#1; {5082#(<= |ULTIMATE.start_main_#t~post8#1| 2)} is VALID [2022-02-20 17:22:33,859 INFO L290 TraceCheckUtils]: 20: Hoare triple {5082#(<= |ULTIMATE.start_main_#t~post8#1| 2)} assume !(main_#t~post8#1 < 100);havoc main_#t~post8#1; {5018#false} is VALID [2022-02-20 17:22:33,859 INFO L290 TraceCheckUtils]: 21: Hoare triple {5018#false} main_~c~0#1 := main_~c~0#1 - main_~v~0#1;main_~k~0#1 := main_~k~0#1 + main_~d~0#1; {5018#false} is VALID [2022-02-20 17:22:33,859 INFO L290 TraceCheckUtils]: 22: Hoare triple {5018#false} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {5018#false} is VALID [2022-02-20 17:22:33,859 INFO L290 TraceCheckUtils]: 23: Hoare triple {5018#false} assume !(main_#t~post7#1 < 100);havoc main_#t~post7#1; {5018#false} is VALID [2022-02-20 17:22:33,860 INFO L290 TraceCheckUtils]: 24: Hoare triple {5018#false} main_~a~0#1 := main_~b~0#1;main_~b~0#1 := main_~c~0#1;havoc main_~temp~0#1;main_~temp~0#1 := main_~p~0#1;main_~p~0#1 := main_~q~0#1;main_~q~0#1 := main_~temp~0#1 - main_~q~0#1 * main_~k~0#1;main_~temp~0#1 := main_~r~0#1;main_~r~0#1 := main_~s~0#1;main_~s~0#1 := main_~temp~0#1 - main_~s~0#1 * main_~k~0#1; {5018#false} is VALID [2022-02-20 17:22:33,860 INFO L290 TraceCheckUtils]: 25: Hoare triple {5018#false} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {5018#false} is VALID [2022-02-20 17:22:33,860 INFO L290 TraceCheckUtils]: 26: Hoare triple {5018#false} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1; {5018#false} is VALID [2022-02-20 17:22:33,860 INFO L290 TraceCheckUtils]: 27: Hoare triple {5018#false} assume !(0 != main_~b~0#1); {5018#false} is VALID [2022-02-20 17:22:33,860 INFO L272 TraceCheckUtils]: 28: Hoare triple {5018#false} call __VERIFIER_assert((if main_~p~0#1 * main_~x~0#1 - main_~q~0#1 * main_~x~0#1 + main_~r~0#1 * main_~y~0#1 - main_~s~0#1 * main_~y~0#1 == main_~a~0#1 then 1 else 0)); {5018#false} is VALID [2022-02-20 17:22:33,860 INFO L290 TraceCheckUtils]: 29: Hoare triple {5018#false} ~cond := #in~cond; {5018#false} is VALID [2022-02-20 17:22:33,860 INFO L290 TraceCheckUtils]: 30: Hoare triple {5018#false} assume 0 == ~cond; {5018#false} is VALID [2022-02-20 17:22:33,860 INFO L290 TraceCheckUtils]: 31: Hoare triple {5018#false} assume !false; {5018#false} is VALID [2022-02-20 17:22:33,861 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:22:33,861 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:22:33,861 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:22:33,861 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532425397] [2022-02-20 17:22:33,861 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:22:33,861 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331288781] [2022-02-20 17:22:33,861 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331288781] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:22:33,861 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:22:33,862 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:22:33,862 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760754657] [2022-02-20 17:22:33,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:22:33,862 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-02-20 17:22:33,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:22:33,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:22:33,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:22:33,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:22:33,878 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:22:33,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:22:33,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:22:33,879 INFO L87 Difference]: Start difference. First operand 170 states and 232 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:22:34,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:34,210 INFO L93 Difference]: Finished difference Result 237 states and 325 transitions. [2022-02-20 17:22:34,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:22:34,210 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-02-20 17:22:34,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:22:34,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:22:34,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2022-02-20 17:22:34,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:22:34,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2022-02-20 17:22:34,218 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 84 transitions. [2022-02-20 17:22:34,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:22:34,297 INFO L225 Difference]: With dead ends: 237 [2022-02-20 17:22:34,297 INFO L226 Difference]: Without dead ends: 170 [2022-02-20 17:22:34,298 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 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:22:34,298 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:22:34,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 128 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:22:34,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-02-20 17:22:34,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2022-02-20 17:22:34,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:22:34,527 INFO L82 GeneralOperation]: Start isEquivalent. First operand 170 states. Second operand has 170 states, 127 states have (on average 1.3385826771653544) internal successors, (170), 128 states have internal predecessors, (170), 31 states have call successors, (31), 11 states have call predecessors, (31), 11 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-02-20 17:22:34,527 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand has 170 states, 127 states have (on average 1.3385826771653544) internal successors, (170), 128 states have internal predecessors, (170), 31 states have call successors, (31), 11 states have call predecessors, (31), 11 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-02-20 17:22:34,528 INFO L87 Difference]: Start difference. First operand 170 states. Second operand has 170 states, 127 states have (on average 1.3385826771653544) internal successors, (170), 128 states have internal predecessors, (170), 31 states have call successors, (31), 11 states have call predecessors, (31), 11 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-02-20 17:22:34,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:34,531 INFO L93 Difference]: Finished difference Result 170 states and 231 transitions. [2022-02-20 17:22:34,531 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 231 transitions. [2022-02-20 17:22:34,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:22:34,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:22:34,532 INFO L74 IsIncluded]: Start isIncluded. First operand has 170 states, 127 states have (on average 1.3385826771653544) internal successors, (170), 128 states have internal predecessors, (170), 31 states have call successors, (31), 11 states have call predecessors, (31), 11 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand 170 states. [2022-02-20 17:22:34,533 INFO L87 Difference]: Start difference. First operand has 170 states, 127 states have (on average 1.3385826771653544) internal successors, (170), 128 states have internal predecessors, (170), 31 states have call successors, (31), 11 states have call predecessors, (31), 11 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand 170 states. [2022-02-20 17:22:34,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:34,535 INFO L93 Difference]: Finished difference Result 170 states and 231 transitions. [2022-02-20 17:22:34,535 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 231 transitions. [2022-02-20 17:22:34,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:22:34,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:22:34,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:22:34,536 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:22:34,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 127 states have (on average 1.3385826771653544) internal successors, (170), 128 states have internal predecessors, (170), 31 states have call successors, (31), 11 states have call predecessors, (31), 11 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-02-20 17:22:34,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 231 transitions. [2022-02-20 17:22:34,539 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 231 transitions. Word has length 32 [2022-02-20 17:22:34,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:22:34,540 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 231 transitions. [2022-02-20 17:22:34,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:22:34,540 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 231 transitions. [2022-02-20 17:22:34,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 17:22:34,540 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:22:34,541 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:22:34,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-02-20 17:22:34,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-02-20 17:22:34,759 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:22:34,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:22:34,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1730540965, now seen corresponding path program 1 times [2022-02-20 17:22:34,760 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:22:34,760 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387327116] [2022-02-20 17:22:34,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:22:34,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:22:34,784 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:22:34,784 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [319019593] [2022-02-20 17:22:34,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:22:34,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:22:34,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:22:34,785 INFO L229 MonitoredProcess]: Starting monitored process 11 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:22:34,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-20 17:22:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:22:34,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:22:34,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:22:34,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:22:34,930 INFO L290 TraceCheckUtils]: 0: Hoare triple {6028#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6028#true} is VALID [2022-02-20 17:22:34,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {6028#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~post8#1, main_~d~0#1, main_~v~0#1, main_#t~post7#1, main_~c~0#1, main_~k~0#1, main_~temp~0#1, main_#t~post6#1, main_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~s~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~s~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {6028#true} is VALID [2022-02-20 17:22:34,930 INFO L272 TraceCheckUtils]: 2: Hoare triple {6028#true} call assume_abort_if_not((if main_~x~0#1 >= 1 then 1 else 0)); {6028#true} is VALID [2022-02-20 17:22:34,931 INFO L290 TraceCheckUtils]: 3: Hoare triple {6028#true} ~cond := #in~cond; {6028#true} is VALID [2022-02-20 17:22:34,931 INFO L290 TraceCheckUtils]: 4: Hoare triple {6028#true} assume !(0 == ~cond); {6028#true} is VALID [2022-02-20 17:22:34,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {6028#true} assume true; {6028#true} is VALID [2022-02-20 17:22:34,931 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {6028#true} {6028#true} #91#return; {6028#true} is VALID [2022-02-20 17:22:34,931 INFO L272 TraceCheckUtils]: 7: Hoare triple {6028#true} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {6028#true} is VALID [2022-02-20 17:22:34,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {6028#true} ~cond := #in~cond; {6028#true} is VALID [2022-02-20 17:22:34,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {6028#true} assume !(0 == ~cond); {6028#true} is VALID [2022-02-20 17:22:34,931 INFO L290 TraceCheckUtils]: 10: Hoare triple {6028#true} assume true; {6028#true} is VALID [2022-02-20 17:22:34,931 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {6028#true} {6028#true} #93#return; {6028#true} is VALID [2022-02-20 17:22:34,931 INFO L290 TraceCheckUtils]: 12: Hoare triple {6028#true} main_~a~0#1 := main_~x~0#1;main_~b~0#1 := main_~y~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0;main_~r~0#1 := 0;main_~s~0#1 := 1; {6028#true} is VALID [2022-02-20 17:22:34,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {6028#true} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {6028#true} is VALID [2022-02-20 17:22:34,931 INFO L290 TraceCheckUtils]: 14: Hoare triple {6028#true} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1; {6028#true} is VALID [2022-02-20 17:22:34,932 INFO L290 TraceCheckUtils]: 15: Hoare triple {6028#true} assume !!(0 != main_~b~0#1);havoc main_~c~0#1;havoc main_~k~0#1;main_~c~0#1 := main_~a~0#1;main_~k~0#1 := 0; {6078#(and (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~c~0#1|) (= |ULTIMATE.start_main_~k~0#1| 0))} is VALID [2022-02-20 17:22:34,932 INFO L290 TraceCheckUtils]: 16: Hoare triple {6078#(and (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~c~0#1|) (= |ULTIMATE.start_main_~k~0#1| 0))} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {6078#(and (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~c~0#1|) (= |ULTIMATE.start_main_~k~0#1| 0))} is VALID [2022-02-20 17:22:34,932 INFO L290 TraceCheckUtils]: 17: Hoare triple {6078#(and (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~c~0#1|) (= |ULTIMATE.start_main_~k~0#1| 0))} assume !!(main_#t~post7#1 < 100);havoc main_#t~post7#1; {6078#(and (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~c~0#1|) (= |ULTIMATE.start_main_~k~0#1| 0))} is VALID [2022-02-20 17:22:34,933 INFO L290 TraceCheckUtils]: 18: Hoare triple {6078#(and (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~c~0#1|) (= |ULTIMATE.start_main_~k~0#1| 0))} assume !!(main_~c~0#1 >= main_~b~0#1);havoc main_~d~0#1;havoc main_~v~0#1;main_~d~0#1 := 1;main_~v~0#1 := main_~b~0#1; {6078#(and (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~c~0#1|) (= |ULTIMATE.start_main_~k~0#1| 0))} is VALID [2022-02-20 17:22:34,933 INFO L290 TraceCheckUtils]: 19: Hoare triple {6078#(and (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~c~0#1|) (= |ULTIMATE.start_main_~k~0#1| 0))} main_#t~post8#1 := ~counter~0;~counter~0 := 1 + main_#t~post8#1; {6078#(and (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~c~0#1|) (= |ULTIMATE.start_main_~k~0#1| 0))} is VALID [2022-02-20 17:22:34,933 INFO L290 TraceCheckUtils]: 20: Hoare triple {6078#(and (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~c~0#1|) (= |ULTIMATE.start_main_~k~0#1| 0))} assume !!(main_#t~post8#1 < 100);havoc main_#t~post8#1; {6078#(and (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~c~0#1|) (= |ULTIMATE.start_main_~k~0#1| 0))} is VALID [2022-02-20 17:22:34,933 INFO L272 TraceCheckUtils]: 21: Hoare triple {6078#(and (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~c~0#1|) (= |ULTIMATE.start_main_~k~0#1| 0))} call __VERIFIER_assert((if main_~a~0#1 == main_~y~0#1 * main_~r~0#1 + main_~x~0#1 * main_~p~0#1 then 1 else 0)); {6028#true} is VALID [2022-02-20 17:22:34,933 INFO L290 TraceCheckUtils]: 22: Hoare triple {6028#true} ~cond := #in~cond; {6028#true} is VALID [2022-02-20 17:22:34,933 INFO L290 TraceCheckUtils]: 23: Hoare triple {6028#true} assume !(0 == ~cond); {6028#true} is VALID [2022-02-20 17:22:34,934 INFO L290 TraceCheckUtils]: 24: Hoare triple {6028#true} assume true; {6028#true} is VALID [2022-02-20 17:22:34,934 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {6028#true} {6078#(and (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~c~0#1|) (= |ULTIMATE.start_main_~k~0#1| 0))} #95#return; {6078#(and (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~c~0#1|) (= |ULTIMATE.start_main_~k~0#1| 0))} is VALID [2022-02-20 17:22:34,934 INFO L272 TraceCheckUtils]: 26: Hoare triple {6078#(and (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~c~0#1|) (= |ULTIMATE.start_main_~k~0#1| 0))} call __VERIFIER_assert((if main_~b~0#1 == main_~x~0#1 * main_~q~0#1 + main_~y~0#1 * main_~s~0#1 then 1 else 0)); {6028#true} is VALID [2022-02-20 17:22:34,934 INFO L290 TraceCheckUtils]: 27: Hoare triple {6028#true} ~cond := #in~cond; {6028#true} is VALID [2022-02-20 17:22:34,934 INFO L290 TraceCheckUtils]: 28: Hoare triple {6028#true} assume !(0 == ~cond); {6028#true} is VALID [2022-02-20 17:22:34,934 INFO L290 TraceCheckUtils]: 29: Hoare triple {6028#true} assume true; {6028#true} is VALID [2022-02-20 17:22:34,939 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {6028#true} {6078#(and (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~c~0#1|) (= |ULTIMATE.start_main_~k~0#1| 0))} #97#return; {6078#(and (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~c~0#1|) (= |ULTIMATE.start_main_~k~0#1| 0))} is VALID [2022-02-20 17:22:34,940 INFO L272 TraceCheckUtils]: 31: Hoare triple {6078#(and (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~c~0#1|) (= |ULTIMATE.start_main_~k~0#1| 0))} call __VERIFIER_assert((if main_~a~0#1 == main_~k~0#1 * main_~b~0#1 + main_~c~0#1 then 1 else 0)); {6127#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:22:34,940 INFO L290 TraceCheckUtils]: 32: Hoare triple {6127#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6131#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:22:34,940 INFO L290 TraceCheckUtils]: 33: Hoare triple {6131#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6029#false} is VALID [2022-02-20 17:22:34,941 INFO L290 TraceCheckUtils]: 34: Hoare triple {6029#false} assume !false; {6029#false} is VALID [2022-02-20 17:22:34,941 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 17:22:34,941 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:22:34,941 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:22:34,941 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387327116] [2022-02-20 17:22:34,941 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:22:34,941 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319019593] [2022-02-20 17:22:34,941 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319019593] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:22:34,941 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:22:34,942 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:22:34,942 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968544933] [2022-02-20 17:22:34,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:22:34,942 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2022-02-20 17:22:34,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:22:34,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:22:34,963 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:22:34,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:22:34,963 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:22:34,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:22:34,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:22:34,964 INFO L87 Difference]: Start difference. First operand 170 states and 231 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:22:35,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:35,404 INFO L93 Difference]: Finished difference Result 235 states and 331 transitions. [2022-02-20 17:22:35,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:22:35,405 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2022-02-20 17:22:35,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:22:35,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:22:35,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-02-20 17:22:35,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:22:35,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-02-20 17:22:35,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 66 transitions. [2022-02-20 17:22:35,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:22:35,467 INFO L225 Difference]: With dead ends: 235 [2022-02-20 17:22:35,467 INFO L226 Difference]: Without dead ends: 233 [2022-02-20 17:22:35,468 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 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:22:35,468 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 10 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:22:35,469 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 139 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:22:35,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-02-20 17:22:35,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 226. [2022-02-20 17:22:35,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:22:35,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 233 states. Second operand has 226 states, 160 states have (on average 1.36875) internal successors, (219), 161 states have internal predecessors, (219), 51 states have call successors, (51), 14 states have call predecessors, (51), 14 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2022-02-20 17:22:35,820 INFO L74 IsIncluded]: Start isIncluded. First operand 233 states. Second operand has 226 states, 160 states have (on average 1.36875) internal successors, (219), 161 states have internal predecessors, (219), 51 states have call successors, (51), 14 states have call predecessors, (51), 14 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2022-02-20 17:22:35,820 INFO L87 Difference]: Start difference. First operand 233 states. Second operand has 226 states, 160 states have (on average 1.36875) internal successors, (219), 161 states have internal predecessors, (219), 51 states have call successors, (51), 14 states have call predecessors, (51), 14 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2022-02-20 17:22:35,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:35,825 INFO L93 Difference]: Finished difference Result 233 states and 327 transitions. [2022-02-20 17:22:35,825 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 327 transitions. [2022-02-20 17:22:35,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:22:35,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:22:35,826 INFO L74 IsIncluded]: Start isIncluded. First operand has 226 states, 160 states have (on average 1.36875) internal successors, (219), 161 states have internal predecessors, (219), 51 states have call successors, (51), 14 states have call predecessors, (51), 14 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) Second operand 233 states. [2022-02-20 17:22:35,826 INFO L87 Difference]: Start difference. First operand has 226 states, 160 states have (on average 1.36875) internal successors, (219), 161 states have internal predecessors, (219), 51 states have call successors, (51), 14 states have call predecessors, (51), 14 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) Second operand 233 states. [2022-02-20 17:22:35,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:35,831 INFO L93 Difference]: Finished difference Result 233 states and 327 transitions. [2022-02-20 17:22:35,831 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 327 transitions. [2022-02-20 17:22:35,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:22:35,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:22:35,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:22:35,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:22:35,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 160 states have (on average 1.36875) internal successors, (219), 161 states have internal predecessors, (219), 51 states have call successors, (51), 14 states have call predecessors, (51), 14 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2022-02-20 17:22:35,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 320 transitions. [2022-02-20 17:22:35,837 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 320 transitions. Word has length 35 [2022-02-20 17:22:35,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:22:35,837 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 320 transitions. [2022-02-20 17:22:35,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:22:35,838 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 320 transitions. [2022-02-20 17:22:35,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 17:22:35,838 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:22:35,838 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:22:35,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-20 17:22:36,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-02-20 17:22:36,061 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:22:36,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:22:36,062 INFO L85 PathProgramCache]: Analyzing trace with hash -2009961290, now seen corresponding path program 1 times [2022-02-20 17:22:36,062 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:22:36,062 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795244163] [2022-02-20 17:22:36,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:22:36,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:22:36,072 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:22:36,072 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [257325571] [2022-02-20 17:22:36,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:22:36,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:22:36,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:22:36,074 INFO L229 MonitoredProcess]: Starting monitored process 12 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:22:36,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-20 17:22:36,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:22:36,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 27 conjunts are in the unsatisfiable core [2022-02-20 17:22:36,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:22:36,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:22:36,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {7264#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7264#true} is VALID [2022-02-20 17:22:36,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {7264#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~post8#1, main_~d~0#1, main_~v~0#1, main_#t~post7#1, main_~c~0#1, main_~k~0#1, main_~temp~0#1, main_#t~post6#1, main_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~s~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~s~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {7264#true} is VALID [2022-02-20 17:22:36,410 INFO L272 TraceCheckUtils]: 2: Hoare triple {7264#true} call assume_abort_if_not((if main_~x~0#1 >= 1 then 1 else 0)); {7264#true} is VALID [2022-02-20 17:22:36,410 INFO L290 TraceCheckUtils]: 3: Hoare triple {7264#true} ~cond := #in~cond; {7264#true} is VALID [2022-02-20 17:22:36,411 INFO L290 TraceCheckUtils]: 4: Hoare triple {7264#true} assume !(0 == ~cond); {7264#true} is VALID [2022-02-20 17:22:36,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {7264#true} assume true; {7264#true} is VALID [2022-02-20 17:22:36,411 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {7264#true} {7264#true} #91#return; {7264#true} is VALID [2022-02-20 17:22:36,411 INFO L272 TraceCheckUtils]: 7: Hoare triple {7264#true} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {7264#true} is VALID [2022-02-20 17:22:36,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {7264#true} ~cond := #in~cond; {7264#true} is VALID [2022-02-20 17:22:36,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {7264#true} assume !(0 == ~cond); {7264#true} is VALID [2022-02-20 17:22:36,411 INFO L290 TraceCheckUtils]: 10: Hoare triple {7264#true} assume true; {7264#true} is VALID [2022-02-20 17:22:36,411 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {7264#true} {7264#true} #93#return; {7264#true} is VALID [2022-02-20 17:22:36,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {7264#true} main_~a~0#1 := main_~x~0#1;main_~b~0#1 := main_~y~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0;main_~r~0#1 := 0;main_~s~0#1 := 1; {7305#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:22:36,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {7305#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {7305#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:22:36,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {7305#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1; {7305#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:22:36,413 INFO L290 TraceCheckUtils]: 15: Hoare triple {7305#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} assume !!(0 != main_~b~0#1);havoc main_~c~0#1;havoc main_~k~0#1;main_~c~0#1 := main_~a~0#1;main_~k~0#1 := 0; {7315#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:22:36,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {7315#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {7315#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:22:36,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {7315#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} assume !!(main_#t~post7#1 < 100);havoc main_#t~post7#1; {7315#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:22:36,415 INFO L290 TraceCheckUtils]: 18: Hoare triple {7315#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} assume !(main_~c~0#1 >= main_~b~0#1); {7315#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:22:36,415 INFO L290 TraceCheckUtils]: 19: Hoare triple {7315#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} main_~a~0#1 := main_~b~0#1;main_~b~0#1 := main_~c~0#1;havoc main_~temp~0#1;main_~temp~0#1 := main_~p~0#1;main_~p~0#1 := main_~q~0#1;main_~q~0#1 := main_~temp~0#1 - main_~q~0#1 * main_~k~0#1;main_~temp~0#1 := main_~r~0#1;main_~r~0#1 := main_~s~0#1;main_~s~0#1 := main_~temp~0#1 - main_~s~0#1 * main_~k~0#1; {7328#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 1) (= (* (- 1) |ULTIMATE.start_main_~s~0#1|) 0))} is VALID [2022-02-20 17:22:36,416 INFO L290 TraceCheckUtils]: 20: Hoare triple {7328#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 1) (= (* (- 1) |ULTIMATE.start_main_~s~0#1|) 0))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {7328#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 1) (= (* (- 1) |ULTIMATE.start_main_~s~0#1|) 0))} is VALID [2022-02-20 17:22:36,416 INFO L290 TraceCheckUtils]: 21: Hoare triple {7328#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 1) (= (* (- 1) |ULTIMATE.start_main_~s~0#1|) 0))} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1; {7328#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 1) (= (* (- 1) |ULTIMATE.start_main_~s~0#1|) 0))} is VALID [2022-02-20 17:22:36,416 INFO L290 TraceCheckUtils]: 22: Hoare triple {7328#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 1) (= (* (- 1) |ULTIMATE.start_main_~s~0#1|) 0))} assume !!(0 != main_~b~0#1);havoc main_~c~0#1;havoc main_~k~0#1;main_~c~0#1 := main_~a~0#1;main_~k~0#1 := 0; {7328#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 1) (= (* (- 1) |ULTIMATE.start_main_~s~0#1|) 0))} is VALID [2022-02-20 17:22:36,417 INFO L290 TraceCheckUtils]: 23: Hoare triple {7328#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 1) (= (* (- 1) |ULTIMATE.start_main_~s~0#1|) 0))} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {7328#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 1) (= (* (- 1) |ULTIMATE.start_main_~s~0#1|) 0))} is VALID [2022-02-20 17:22:36,417 INFO L290 TraceCheckUtils]: 24: Hoare triple {7328#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 1) (= (* (- 1) |ULTIMATE.start_main_~s~0#1|) 0))} assume !!(main_#t~post7#1 < 100);havoc main_#t~post7#1; {7328#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 1) (= (* (- 1) |ULTIMATE.start_main_~s~0#1|) 0))} is VALID [2022-02-20 17:22:36,418 INFO L290 TraceCheckUtils]: 25: Hoare triple {7328#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 1) (= (* (- 1) |ULTIMATE.start_main_~s~0#1|) 0))} assume !!(main_~c~0#1 >= main_~b~0#1);havoc main_~d~0#1;havoc main_~v~0#1;main_~d~0#1 := 1;main_~v~0#1 := main_~b~0#1; {7328#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 1) (= (* (- 1) |ULTIMATE.start_main_~s~0#1|) 0))} is VALID [2022-02-20 17:22:36,418 INFO L290 TraceCheckUtils]: 26: Hoare triple {7328#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 1) (= (* (- 1) |ULTIMATE.start_main_~s~0#1|) 0))} main_#t~post8#1 := ~counter~0;~counter~0 := 1 + main_#t~post8#1; {7328#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 1) (= (* (- 1) |ULTIMATE.start_main_~s~0#1|) 0))} is VALID [2022-02-20 17:22:36,419 INFO L290 TraceCheckUtils]: 27: Hoare triple {7328#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 1) (= (* (- 1) |ULTIMATE.start_main_~s~0#1|) 0))} assume !!(main_#t~post8#1 < 100);havoc main_#t~post8#1; {7328#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 1) (= (* (- 1) |ULTIMATE.start_main_~s~0#1|) 0))} is VALID [2022-02-20 17:22:36,419 INFO L272 TraceCheckUtils]: 28: Hoare triple {7328#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 1) (= (* (- 1) |ULTIMATE.start_main_~s~0#1|) 0))} call __VERIFIER_assert((if main_~a~0#1 == main_~y~0#1 * main_~r~0#1 + main_~x~0#1 * main_~p~0#1 then 1 else 0)); {7264#true} is VALID [2022-02-20 17:22:36,419 INFO L290 TraceCheckUtils]: 29: Hoare triple {7264#true} ~cond := #in~cond; {7264#true} is VALID [2022-02-20 17:22:36,419 INFO L290 TraceCheckUtils]: 30: Hoare triple {7264#true} assume !(0 == ~cond); {7264#true} is VALID [2022-02-20 17:22:36,419 INFO L290 TraceCheckUtils]: 31: Hoare triple {7264#true} assume true; {7264#true} is VALID [2022-02-20 17:22:36,420 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7264#true} {7328#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 1) (= (* (- 1) |ULTIMATE.start_main_~s~0#1|) 0))} #95#return; {7328#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 1) (= (* (- 1) |ULTIMATE.start_main_~s~0#1|) 0))} is VALID [2022-02-20 17:22:36,421 INFO L272 TraceCheckUtils]: 33: Hoare triple {7328#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 1) (= (* (- 1) |ULTIMATE.start_main_~s~0#1|) 0))} call __VERIFIER_assert((if main_~b~0#1 == main_~x~0#1 * main_~q~0#1 + main_~y~0#1 * main_~s~0#1 then 1 else 0)); {7371#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:22:36,421 INFO L290 TraceCheckUtils]: 34: Hoare triple {7371#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7375#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:22:36,421 INFO L290 TraceCheckUtils]: 35: Hoare triple {7375#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7265#false} is VALID [2022-02-20 17:22:36,421 INFO L290 TraceCheckUtils]: 36: Hoare triple {7265#false} assume !false; {7265#false} is VALID [2022-02-20 17:22:36,422 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:22:36,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:22:36,628 INFO L290 TraceCheckUtils]: 36: Hoare triple {7265#false} assume !false; {7265#false} is VALID [2022-02-20 17:22:36,628 INFO L290 TraceCheckUtils]: 35: Hoare triple {7375#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7265#false} is VALID [2022-02-20 17:22:36,628 INFO L290 TraceCheckUtils]: 34: Hoare triple {7371#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7375#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:22:36,629 INFO L272 TraceCheckUtils]: 33: Hoare triple {7391#(= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)} call __VERIFIER_assert((if main_~b~0#1 == main_~x~0#1 * main_~q~0#1 + main_~y~0#1 * main_~s~0#1 then 1 else 0)); {7371#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:22:36,630 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7264#true} {7391#(= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)} #95#return; {7391#(= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:22:36,630 INFO L290 TraceCheckUtils]: 31: Hoare triple {7264#true} assume true; {7264#true} is VALID [2022-02-20 17:22:36,630 INFO L290 TraceCheckUtils]: 30: Hoare triple {7264#true} assume !(0 == ~cond); {7264#true} is VALID [2022-02-20 17:22:36,630 INFO L290 TraceCheckUtils]: 29: Hoare triple {7264#true} ~cond := #in~cond; {7264#true} is VALID [2022-02-20 17:22:36,630 INFO L272 TraceCheckUtils]: 28: Hoare triple {7391#(= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)} call __VERIFIER_assert((if main_~a~0#1 == main_~y~0#1 * main_~r~0#1 + main_~x~0#1 * main_~p~0#1 then 1 else 0)); {7264#true} is VALID [2022-02-20 17:22:36,630 INFO L290 TraceCheckUtils]: 27: Hoare triple {7391#(= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)} assume !!(main_#t~post8#1 < 100);havoc main_#t~post8#1; {7391#(= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:22:36,631 INFO L290 TraceCheckUtils]: 26: Hoare triple {7391#(= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)} main_#t~post8#1 := ~counter~0;~counter~0 := 1 + main_#t~post8#1; {7391#(= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:22:36,631 INFO L290 TraceCheckUtils]: 25: Hoare triple {7391#(= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)} assume !!(main_~c~0#1 >= main_~b~0#1);havoc main_~d~0#1;havoc main_~v~0#1;main_~d~0#1 := 1;main_~v~0#1 := main_~b~0#1; {7391#(= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:22:36,632 INFO L290 TraceCheckUtils]: 24: Hoare triple {7391#(= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)} assume !!(main_#t~post7#1 < 100);havoc main_#t~post7#1; {7391#(= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:22:36,632 INFO L290 TraceCheckUtils]: 23: Hoare triple {7391#(= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {7391#(= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:22:36,632 INFO L290 TraceCheckUtils]: 22: Hoare triple {7391#(= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)} assume !!(0 != main_~b~0#1);havoc main_~c~0#1;havoc main_~k~0#1;main_~c~0#1 := main_~a~0#1;main_~k~0#1 := 0; {7391#(= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:22:36,633 INFO L290 TraceCheckUtils]: 21: Hoare triple {7391#(= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1; {7391#(= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:22:36,633 INFO L290 TraceCheckUtils]: 20: Hoare triple {7391#(= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {7391#(= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:22:36,850 INFO L290 TraceCheckUtils]: 19: Hoare triple {7434#(= |ULTIMATE.start_main_~c~0#1| (+ (* (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~s~0#1|))) |ULTIMATE.start_main_~y~0#1|) (* (+ (* (- 1) |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~x~0#1|)))} main_~a~0#1 := main_~b~0#1;main_~b~0#1 := main_~c~0#1;havoc main_~temp~0#1;main_~temp~0#1 := main_~p~0#1;main_~p~0#1 := main_~q~0#1;main_~q~0#1 := main_~temp~0#1 - main_~q~0#1 * main_~k~0#1;main_~temp~0#1 := main_~r~0#1;main_~r~0#1 := main_~s~0#1;main_~s~0#1 := main_~temp~0#1 - main_~s~0#1 * main_~k~0#1; {7391#(= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:22:36,851 INFO L290 TraceCheckUtils]: 18: Hoare triple {7434#(= |ULTIMATE.start_main_~c~0#1| (+ (* (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~s~0#1|))) |ULTIMATE.start_main_~y~0#1|) (* (+ (* (- 1) |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~x~0#1|)))} assume !(main_~c~0#1 >= main_~b~0#1); {7434#(= |ULTIMATE.start_main_~c~0#1| (+ (* (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~s~0#1|))) |ULTIMATE.start_main_~y~0#1|) (* (+ (* (- 1) |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-20 17:22:36,851 INFO L290 TraceCheckUtils]: 17: Hoare triple {7434#(= |ULTIMATE.start_main_~c~0#1| (+ (* (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~s~0#1|))) |ULTIMATE.start_main_~y~0#1|) (* (+ (* (- 1) |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~x~0#1|)))} assume !!(main_#t~post7#1 < 100);havoc main_#t~post7#1; {7434#(= |ULTIMATE.start_main_~c~0#1| (+ (* (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~s~0#1|))) |ULTIMATE.start_main_~y~0#1|) (* (+ (* (- 1) |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-20 17:22:36,851 INFO L290 TraceCheckUtils]: 16: Hoare triple {7434#(= |ULTIMATE.start_main_~c~0#1| (+ (* (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~s~0#1|))) |ULTIMATE.start_main_~y~0#1|) (* (+ (* (- 1) |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~x~0#1|)))} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {7434#(= |ULTIMATE.start_main_~c~0#1| (+ (* (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~s~0#1|))) |ULTIMATE.start_main_~y~0#1|) (* (+ (* (- 1) |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-20 17:22:36,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {7447#(= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|)} assume !!(0 != main_~b~0#1);havoc main_~c~0#1;havoc main_~k~0#1;main_~c~0#1 := main_~a~0#1;main_~k~0#1 := 0; {7434#(= |ULTIMATE.start_main_~c~0#1| (+ (* (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~s~0#1|))) |ULTIMATE.start_main_~y~0#1|) (* (+ (* (- 1) |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-20 17:22:36,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {7447#(= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|)} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1; {7447#(= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:22:36,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {7447#(= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {7447#(= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:22:36,853 INFO L290 TraceCheckUtils]: 12: Hoare triple {7264#true} main_~a~0#1 := main_~x~0#1;main_~b~0#1 := main_~y~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0;main_~r~0#1 := 0;main_~s~0#1 := 1; {7447#(= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:22:36,853 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {7264#true} {7264#true} #93#return; {7264#true} is VALID [2022-02-20 17:22:36,853 INFO L290 TraceCheckUtils]: 10: Hoare triple {7264#true} assume true; {7264#true} is VALID [2022-02-20 17:22:36,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {7264#true} assume !(0 == ~cond); {7264#true} is VALID [2022-02-20 17:22:36,853 INFO L290 TraceCheckUtils]: 8: Hoare triple {7264#true} ~cond := #in~cond; {7264#true} is VALID [2022-02-20 17:22:36,853 INFO L272 TraceCheckUtils]: 7: Hoare triple {7264#true} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {7264#true} is VALID [2022-02-20 17:22:36,853 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {7264#true} {7264#true} #91#return; {7264#true} is VALID [2022-02-20 17:22:36,854 INFO L290 TraceCheckUtils]: 5: Hoare triple {7264#true} assume true; {7264#true} is VALID [2022-02-20 17:22:36,854 INFO L290 TraceCheckUtils]: 4: Hoare triple {7264#true} assume !(0 == ~cond); {7264#true} is VALID [2022-02-20 17:22:36,854 INFO L290 TraceCheckUtils]: 3: Hoare triple {7264#true} ~cond := #in~cond; {7264#true} is VALID [2022-02-20 17:22:36,854 INFO L272 TraceCheckUtils]: 2: Hoare triple {7264#true} call assume_abort_if_not((if main_~x~0#1 >= 1 then 1 else 0)); {7264#true} is VALID [2022-02-20 17:22:36,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {7264#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~post8#1, main_~d~0#1, main_~v~0#1, main_#t~post7#1, main_~c~0#1, main_~k~0#1, main_~temp~0#1, main_#t~post6#1, main_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~s~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~s~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {7264#true} is VALID [2022-02-20 17:22:36,854 INFO L290 TraceCheckUtils]: 0: Hoare triple {7264#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7264#true} is VALID [2022-02-20 17:22:36,854 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:22:36,854 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:22:36,854 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795244163] [2022-02-20 17:22:36,854 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:22:36,854 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257325571] [2022-02-20 17:22:36,854 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257325571] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:22:36,854 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:22:36,854 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-02-20 17:22:36,855 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171173159] [2022-02-20 17:22:36,855 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:22:36,855 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 37 [2022-02-20 17:22:36,855 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:22:36,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 17:22:37,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:22:37,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 17:22:37,085 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:22:37,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 17:22:37,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:22:37,085 INFO L87 Difference]: Start difference. First operand 226 states and 320 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 17:22:39,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:39,390 INFO L93 Difference]: Finished difference Result 388 states and 574 transitions. [2022-02-20 17:22:39,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 17:22:39,390 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 37 [2022-02-20 17:22:39,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:22:39,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 17:22:39,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 248 transitions. [2022-02-20 17:22:39,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 17:22:39,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 248 transitions. [2022-02-20 17:22:39,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 248 transitions. [2022-02-20 17:22:40,026 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 248 edges. 248 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:22:40,038 INFO L225 Difference]: With dead ends: 388 [2022-02-20 17:22:40,039 INFO L226 Difference]: Without dead ends: 386 [2022-02-20 17:22:40,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-02-20 17:22:40,040 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 170 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 17:22:40,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 356 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 17:22:40,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2022-02-20 17:22:40,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 373. [2022-02-20 17:22:40,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:22:40,581 INFO L82 GeneralOperation]: Start isEquivalent. First operand 386 states. Second operand has 373 states, 265 states have (on average 1.4264150943396225) internal successors, (378), 266 states have internal predecessors, (378), 91 states have call successors, (91), 16 states have call predecessors, (91), 16 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2022-02-20 17:22:40,583 INFO L74 IsIncluded]: Start isIncluded. First operand 386 states. Second operand has 373 states, 265 states have (on average 1.4264150943396225) internal successors, (378), 266 states have internal predecessors, (378), 91 states have call successors, (91), 16 states have call predecessors, (91), 16 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2022-02-20 17:22:40,584 INFO L87 Difference]: Start difference. First operand 386 states. Second operand has 373 states, 265 states have (on average 1.4264150943396225) internal successors, (378), 266 states have internal predecessors, (378), 91 states have call successors, (91), 16 states have call predecessors, (91), 16 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2022-02-20 17:22:40,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:40,593 INFO L93 Difference]: Finished difference Result 386 states and 572 transitions. [2022-02-20 17:22:40,594 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 572 transitions. [2022-02-20 17:22:40,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:22:40,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:22:40,595 INFO L74 IsIncluded]: Start isIncluded. First operand has 373 states, 265 states have (on average 1.4264150943396225) internal successors, (378), 266 states have internal predecessors, (378), 91 states have call successors, (91), 16 states have call predecessors, (91), 16 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) Second operand 386 states. [2022-02-20 17:22:40,596 INFO L87 Difference]: Start difference. First operand has 373 states, 265 states have (on average 1.4264150943396225) internal successors, (378), 266 states have internal predecessors, (378), 91 states have call successors, (91), 16 states have call predecessors, (91), 16 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) Second operand 386 states. [2022-02-20 17:22:40,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:40,605 INFO L93 Difference]: Finished difference Result 386 states and 572 transitions. [2022-02-20 17:22:40,605 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 572 transitions. [2022-02-20 17:22:40,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:22:40,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:22:40,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:22:40,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:22:40,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 265 states have (on average 1.4264150943396225) internal successors, (378), 266 states have internal predecessors, (378), 91 states have call successors, (91), 16 states have call predecessors, (91), 16 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2022-02-20 17:22:40,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 559 transitions. [2022-02-20 17:22:40,617 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 559 transitions. Word has length 37 [2022-02-20 17:22:40,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:22:40,617 INFO L470 AbstractCegarLoop]: Abstraction has 373 states and 559 transitions. [2022-02-20 17:22:40,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 17:22:40,617 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 559 transitions. [2022-02-20 17:22:40,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-20 17:22:40,618 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:22:40,618 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:22:40,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-02-20 17:22:40,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-02-20 17:22:40,834 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:22:40,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:22:40,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1954288725, now seen corresponding path program 1 times [2022-02-20 17:22:40,834 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:22:40,835 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217781755] [2022-02-20 17:22:40,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:22:40,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:22:40,845 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:22:40,847 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [123871071] [2022-02-20 17:22:40,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:22:40,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:22:40,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:22:40,848 INFO L229 MonitoredProcess]: Starting monitored process 13 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:22:40,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-02-20 17:22:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:22:40,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:22:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:22:40,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:22:40,971 INFO L290 TraceCheckUtils]: 0: Hoare triple {9384#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9384#true} is VALID [2022-02-20 17:22:40,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {9384#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~post8#1, main_~d~0#1, main_~v~0#1, main_#t~post7#1, main_~c~0#1, main_~k~0#1, main_~temp~0#1, main_#t~post6#1, main_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~s~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~s~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {9384#true} is VALID [2022-02-20 17:22:40,971 INFO L272 TraceCheckUtils]: 2: Hoare triple {9384#true} call assume_abort_if_not((if main_~x~0#1 >= 1 then 1 else 0)); {9384#true} is VALID [2022-02-20 17:22:40,972 INFO L290 TraceCheckUtils]: 3: Hoare triple {9384#true} ~cond := #in~cond; {9384#true} is VALID [2022-02-20 17:22:40,972 INFO L290 TraceCheckUtils]: 4: Hoare triple {9384#true} assume !(0 == ~cond); {9384#true} is VALID [2022-02-20 17:22:40,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {9384#true} assume true; {9384#true} is VALID [2022-02-20 17:22:40,972 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {9384#true} {9384#true} #91#return; {9384#true} is VALID [2022-02-20 17:22:40,972 INFO L272 TraceCheckUtils]: 7: Hoare triple {9384#true} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {9384#true} is VALID [2022-02-20 17:22:40,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {9384#true} ~cond := #in~cond; {9384#true} is VALID [2022-02-20 17:22:40,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {9384#true} assume !(0 == ~cond); {9384#true} is VALID [2022-02-20 17:22:40,973 INFO L290 TraceCheckUtils]: 10: Hoare triple {9384#true} assume true; {9384#true} is VALID [2022-02-20 17:22:40,973 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {9384#true} {9384#true} #93#return; {9384#true} is VALID [2022-02-20 17:22:40,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {9384#true} main_~a~0#1 := main_~x~0#1;main_~b~0#1 := main_~y~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0;main_~r~0#1 := 0;main_~s~0#1 := 1; {9384#true} is VALID [2022-02-20 17:22:40,973 INFO L290 TraceCheckUtils]: 13: Hoare triple {9384#true} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {9384#true} is VALID [2022-02-20 17:22:40,973 INFO L290 TraceCheckUtils]: 14: Hoare triple {9384#true} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1; {9384#true} is VALID [2022-02-20 17:22:40,973 INFO L290 TraceCheckUtils]: 15: Hoare triple {9384#true} assume !!(0 != main_~b~0#1);havoc main_~c~0#1;havoc main_~k~0#1;main_~c~0#1 := main_~a~0#1;main_~k~0#1 := 0; {9384#true} is VALID [2022-02-20 17:22:40,973 INFO L290 TraceCheckUtils]: 16: Hoare triple {9384#true} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {9384#true} is VALID [2022-02-20 17:22:40,973 INFO L290 TraceCheckUtils]: 17: Hoare triple {9384#true} assume !!(main_#t~post7#1 < 100);havoc main_#t~post7#1; {9384#true} is VALID [2022-02-20 17:22:40,974 INFO L290 TraceCheckUtils]: 18: Hoare triple {9384#true} assume !!(main_~c~0#1 >= main_~b~0#1);havoc main_~d~0#1;havoc main_~v~0#1;main_~d~0#1 := 1;main_~v~0#1 := main_~b~0#1; {9443#(and (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~v~0#1|))} is VALID [2022-02-20 17:22:40,974 INFO L290 TraceCheckUtils]: 19: Hoare triple {9443#(and (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~v~0#1|))} main_#t~post8#1 := ~counter~0;~counter~0 := 1 + main_#t~post8#1; {9443#(and (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~v~0#1|))} is VALID [2022-02-20 17:22:40,974 INFO L290 TraceCheckUtils]: 20: Hoare triple {9443#(and (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~v~0#1|))} assume !!(main_#t~post8#1 < 100);havoc main_#t~post8#1; {9443#(and (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~v~0#1|))} is VALID [2022-02-20 17:22:40,975 INFO L272 TraceCheckUtils]: 21: Hoare triple {9443#(and (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~v~0#1|))} call __VERIFIER_assert((if main_~a~0#1 == main_~y~0#1 * main_~r~0#1 + main_~x~0#1 * main_~p~0#1 then 1 else 0)); {9384#true} is VALID [2022-02-20 17:22:40,975 INFO L290 TraceCheckUtils]: 22: Hoare triple {9384#true} ~cond := #in~cond; {9384#true} is VALID [2022-02-20 17:22:40,975 INFO L290 TraceCheckUtils]: 23: Hoare triple {9384#true} assume !(0 == ~cond); {9384#true} is VALID [2022-02-20 17:22:40,975 INFO L290 TraceCheckUtils]: 24: Hoare triple {9384#true} assume true; {9384#true} is VALID [2022-02-20 17:22:40,975 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {9384#true} {9443#(and (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~v~0#1|))} #95#return; {9443#(and (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~v~0#1|))} is VALID [2022-02-20 17:22:40,976 INFO L272 TraceCheckUtils]: 26: Hoare triple {9443#(and (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~v~0#1|))} call __VERIFIER_assert((if main_~b~0#1 == main_~x~0#1 * main_~q~0#1 + main_~y~0#1 * main_~s~0#1 then 1 else 0)); {9384#true} is VALID [2022-02-20 17:22:40,976 INFO L290 TraceCheckUtils]: 27: Hoare triple {9384#true} ~cond := #in~cond; {9384#true} is VALID [2022-02-20 17:22:40,976 INFO L290 TraceCheckUtils]: 28: Hoare triple {9384#true} assume !(0 == ~cond); {9384#true} is VALID [2022-02-20 17:22:40,976 INFO L290 TraceCheckUtils]: 29: Hoare triple {9384#true} assume true; {9384#true} is VALID [2022-02-20 17:22:40,976 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {9384#true} {9443#(and (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~v~0#1|))} #97#return; {9443#(and (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~v~0#1|))} is VALID [2022-02-20 17:22:40,977 INFO L272 TraceCheckUtils]: 31: Hoare triple {9443#(and (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~v~0#1|))} call __VERIFIER_assert((if main_~a~0#1 == main_~k~0#1 * main_~b~0#1 + main_~c~0#1 then 1 else 0)); {9384#true} is VALID [2022-02-20 17:22:40,977 INFO L290 TraceCheckUtils]: 32: Hoare triple {9384#true} ~cond := #in~cond; {9384#true} is VALID [2022-02-20 17:22:40,977 INFO L290 TraceCheckUtils]: 33: Hoare triple {9384#true} assume !(0 == ~cond); {9384#true} is VALID [2022-02-20 17:22:40,977 INFO L290 TraceCheckUtils]: 34: Hoare triple {9384#true} assume true; {9384#true} is VALID [2022-02-20 17:22:40,977 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {9384#true} {9443#(and (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~v~0#1|))} #99#return; {9443#(and (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~v~0#1|))} is VALID [2022-02-20 17:22:40,978 INFO L272 TraceCheckUtils]: 36: Hoare triple {9443#(and (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~v~0#1|))} call __VERIFIER_assert((if main_~v~0#1 == main_~b~0#1 * main_~d~0#1 then 1 else 0)); {9498#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:22:40,978 INFO L290 TraceCheckUtils]: 37: Hoare triple {9498#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9502#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:22:40,978 INFO L290 TraceCheckUtils]: 38: Hoare triple {9502#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9385#false} is VALID [2022-02-20 17:22:40,979 INFO L290 TraceCheckUtils]: 39: Hoare triple {9385#false} assume !false; {9385#false} is VALID [2022-02-20 17:22:40,979 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 17:22:40,979 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:22:40,979 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:22:40,979 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217781755] [2022-02-20 17:22:40,979 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:22:40,979 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123871071] [2022-02-20 17:22:40,979 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123871071] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:22:40,980 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:22:40,980 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:22:40,980 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142549626] [2022-02-20 17:22:40,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:22:40,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 40 [2022-02-20 17:22:40,980 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:22:40,981 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:22:41,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:22:41,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:22:41,011 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:22:41,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:22:41,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:22:41,011 INFO L87 Difference]: Start difference. First operand 373 states and 559 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:22:42,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:42,094 INFO L93 Difference]: Finished difference Result 562 states and 883 transitions. [2022-02-20 17:22:42,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:22:42,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 40 [2022-02-20 17:22:42,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:22:42,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:22:42,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-02-20 17:22:42,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:22:42,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-02-20 17:22:42,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 66 transitions. [2022-02-20 17:22:42,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:22:42,156 INFO L225 Difference]: With dead ends: 562 [2022-02-20 17:22:42,156 INFO L226 Difference]: Without dead ends: 560 [2022-02-20 17:22:42,157 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 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:22:42,157 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 12 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:22:42,158 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 156 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:22:42,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2022-02-20 17:22:42,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 491. [2022-02-20 17:22:42,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:22:42,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 560 states. Second operand has 491 states, 306 states have (on average 1.4281045751633987) internal successors, (437), 326 states have internal predecessors, (437), 167 states have call successors, (167), 17 states have call predecessors, (167), 17 states have return successors, (166), 147 states have call predecessors, (166), 166 states have call successors, (166) [2022-02-20 17:22:42,921 INFO L74 IsIncluded]: Start isIncluded. First operand 560 states. Second operand has 491 states, 306 states have (on average 1.4281045751633987) internal successors, (437), 326 states have internal predecessors, (437), 167 states have call successors, (167), 17 states have call predecessors, (167), 17 states have return successors, (166), 147 states have call predecessors, (166), 166 states have call successors, (166) [2022-02-20 17:22:42,922 INFO L87 Difference]: Start difference. First operand 560 states. Second operand has 491 states, 306 states have (on average 1.4281045751633987) internal successors, (437), 326 states have internal predecessors, (437), 167 states have call successors, (167), 17 states have call predecessors, (167), 17 states have return successors, (166), 147 states have call predecessors, (166), 166 states have call successors, (166) [2022-02-20 17:22:42,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:42,947 INFO L93 Difference]: Finished difference Result 560 states and 880 transitions. [2022-02-20 17:22:42,947 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 880 transitions. [2022-02-20 17:22:42,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:22:42,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:22:42,953 INFO L74 IsIncluded]: Start isIncluded. First operand has 491 states, 306 states have (on average 1.4281045751633987) internal successors, (437), 326 states have internal predecessors, (437), 167 states have call successors, (167), 17 states have call predecessors, (167), 17 states have return successors, (166), 147 states have call predecessors, (166), 166 states have call successors, (166) Second operand 560 states. [2022-02-20 17:22:42,963 INFO L87 Difference]: Start difference. First operand has 491 states, 306 states have (on average 1.4281045751633987) internal successors, (437), 326 states have internal predecessors, (437), 167 states have call successors, (167), 17 states have call predecessors, (167), 17 states have return successors, (166), 147 states have call predecessors, (166), 166 states have call successors, (166) Second operand 560 states. [2022-02-20 17:22:42,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:42,992 INFO L93 Difference]: Finished difference Result 560 states and 880 transitions. [2022-02-20 17:22:42,992 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 880 transitions. [2022-02-20 17:22:42,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:22:42,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:22:42,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:22:42,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:22:42,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 306 states have (on average 1.4281045751633987) internal successors, (437), 326 states have internal predecessors, (437), 167 states have call successors, (167), 17 states have call predecessors, (167), 17 states have return successors, (166), 147 states have call predecessors, (166), 166 states have call successors, (166) [2022-02-20 17:22:43,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 770 transitions. [2022-02-20 17:22:43,013 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 770 transitions. Word has length 40 [2022-02-20 17:22:43,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:22:43,014 INFO L470 AbstractCegarLoop]: Abstraction has 491 states and 770 transitions. [2022-02-20 17:22:43,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:22:43,014 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 770 transitions. [2022-02-20 17:22:43,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 17:22:43,015 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:22:43,015 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:22:43,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-02-20 17:22:43,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-02-20 17:22:43,232 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:22:43,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:22:43,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1977082887, now seen corresponding path program 1 times [2022-02-20 17:22:43,233 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:22:43,233 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327821520] [2022-02-20 17:22:43,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:22:43,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:22:43,250 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:22:43,253 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [123960102] [2022-02-20 17:22:43,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:22:43,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:22:43,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:22:43,276 INFO L229 MonitoredProcess]: Starting monitored process 14 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:22:43,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-02-20 17:22:43,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:22:43,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 17:22:43,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:22:43,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:22:43,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {12226#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12231#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:43,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {12231#(<= ~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~post8#1, main_~d~0#1, main_~v~0#1, main_#t~post7#1, main_~c~0#1, main_~k~0#1, main_~temp~0#1, main_#t~post6#1, main_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~s~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~s~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {12231#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:43,475 INFO L272 TraceCheckUtils]: 2: Hoare triple {12231#(<= ~counter~0 0)} call assume_abort_if_not((if main_~x~0#1 >= 1 then 1 else 0)); {12231#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:43,475 INFO L290 TraceCheckUtils]: 3: Hoare triple {12231#(<= ~counter~0 0)} ~cond := #in~cond; {12231#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:43,475 INFO L290 TraceCheckUtils]: 4: Hoare triple {12231#(<= ~counter~0 0)} assume !(0 == ~cond); {12231#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:43,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {12231#(<= ~counter~0 0)} assume true; {12231#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:43,476 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {12231#(<= ~counter~0 0)} {12231#(<= ~counter~0 0)} #91#return; {12231#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:43,476 INFO L272 TraceCheckUtils]: 7: Hoare triple {12231#(<= ~counter~0 0)} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {12231#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:43,477 INFO L290 TraceCheckUtils]: 8: Hoare triple {12231#(<= ~counter~0 0)} ~cond := #in~cond; {12231#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:43,484 INFO L290 TraceCheckUtils]: 9: Hoare triple {12231#(<= ~counter~0 0)} assume !(0 == ~cond); {12231#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:43,484 INFO L290 TraceCheckUtils]: 10: Hoare triple {12231#(<= ~counter~0 0)} assume true; {12231#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:43,484 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {12231#(<= ~counter~0 0)} {12231#(<= ~counter~0 0)} #93#return; {12231#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:43,485 INFO L290 TraceCheckUtils]: 12: Hoare triple {12231#(<= ~counter~0 0)} main_~a~0#1 := main_~x~0#1;main_~b~0#1 := main_~y~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0;main_~r~0#1 := 0;main_~s~0#1 := 1; {12231#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:43,485 INFO L290 TraceCheckUtils]: 13: Hoare triple {12231#(<= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {12271#(<= ~counter~0 1)} is VALID [2022-02-20 17:22:43,486 INFO L290 TraceCheckUtils]: 14: Hoare triple {12271#(<= ~counter~0 1)} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1; {12271#(<= ~counter~0 1)} is VALID [2022-02-20 17:22:43,486 INFO L290 TraceCheckUtils]: 15: Hoare triple {12271#(<= ~counter~0 1)} assume !!(0 != main_~b~0#1);havoc main_~c~0#1;havoc main_~k~0#1;main_~c~0#1 := main_~a~0#1;main_~k~0#1 := 0; {12271#(<= ~counter~0 1)} is VALID [2022-02-20 17:22:43,487 INFO L290 TraceCheckUtils]: 16: Hoare triple {12271#(<= ~counter~0 1)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {12281#(<= ~counter~0 2)} is VALID [2022-02-20 17:22:43,487 INFO L290 TraceCheckUtils]: 17: Hoare triple {12281#(<= ~counter~0 2)} assume !!(main_#t~post7#1 < 100);havoc main_#t~post7#1; {12281#(<= ~counter~0 2)} is VALID [2022-02-20 17:22:43,487 INFO L290 TraceCheckUtils]: 18: Hoare triple {12281#(<= ~counter~0 2)} assume !(main_~c~0#1 >= main_~b~0#1); {12281#(<= ~counter~0 2)} is VALID [2022-02-20 17:22:43,488 INFO L290 TraceCheckUtils]: 19: Hoare triple {12281#(<= ~counter~0 2)} main_~a~0#1 := main_~b~0#1;main_~b~0#1 := main_~c~0#1;havoc main_~temp~0#1;main_~temp~0#1 := main_~p~0#1;main_~p~0#1 := main_~q~0#1;main_~q~0#1 := main_~temp~0#1 - main_~q~0#1 * main_~k~0#1;main_~temp~0#1 := main_~r~0#1;main_~r~0#1 := main_~s~0#1;main_~s~0#1 := main_~temp~0#1 - main_~s~0#1 * main_~k~0#1; {12281#(<= ~counter~0 2)} is VALID [2022-02-20 17:22:43,488 INFO L290 TraceCheckUtils]: 20: Hoare triple {12281#(<= ~counter~0 2)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {12294#(<= ~counter~0 3)} is VALID [2022-02-20 17:22:43,489 INFO L290 TraceCheckUtils]: 21: Hoare triple {12294#(<= ~counter~0 3)} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1; {12294#(<= ~counter~0 3)} is VALID [2022-02-20 17:22:43,489 INFO L290 TraceCheckUtils]: 22: Hoare triple {12294#(<= ~counter~0 3)} assume !!(0 != main_~b~0#1);havoc main_~c~0#1;havoc main_~k~0#1;main_~c~0#1 := main_~a~0#1;main_~k~0#1 := 0; {12294#(<= ~counter~0 3)} is VALID [2022-02-20 17:22:43,489 INFO L290 TraceCheckUtils]: 23: Hoare triple {12294#(<= ~counter~0 3)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {12304#(<= |ULTIMATE.start_main_#t~post7#1| 3)} is VALID [2022-02-20 17:22:43,490 INFO L290 TraceCheckUtils]: 24: Hoare triple {12304#(<= |ULTIMATE.start_main_#t~post7#1| 3)} assume !(main_#t~post7#1 < 100);havoc main_#t~post7#1; {12227#false} is VALID [2022-02-20 17:22:43,490 INFO L290 TraceCheckUtils]: 25: Hoare triple {12227#false} main_~a~0#1 := main_~b~0#1;main_~b~0#1 := main_~c~0#1;havoc main_~temp~0#1;main_~temp~0#1 := main_~p~0#1;main_~p~0#1 := main_~q~0#1;main_~q~0#1 := main_~temp~0#1 - main_~q~0#1 * main_~k~0#1;main_~temp~0#1 := main_~r~0#1;main_~r~0#1 := main_~s~0#1;main_~s~0#1 := main_~temp~0#1 - main_~s~0#1 * main_~k~0#1; {12227#false} is VALID [2022-02-20 17:22:43,490 INFO L290 TraceCheckUtils]: 26: Hoare triple {12227#false} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {12227#false} is VALID [2022-02-20 17:22:43,490 INFO L290 TraceCheckUtils]: 27: Hoare triple {12227#false} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1; {12227#false} is VALID [2022-02-20 17:22:43,490 INFO L290 TraceCheckUtils]: 28: Hoare triple {12227#false} assume !!(0 != main_~b~0#1);havoc main_~c~0#1;havoc main_~k~0#1;main_~c~0#1 := main_~a~0#1;main_~k~0#1 := 0; {12227#false} is VALID [2022-02-20 17:22:43,490 INFO L290 TraceCheckUtils]: 29: Hoare triple {12227#false} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {12227#false} is VALID [2022-02-20 17:22:43,491 INFO L290 TraceCheckUtils]: 30: Hoare triple {12227#false} assume !(main_#t~post7#1 < 100);havoc main_#t~post7#1; {12227#false} is VALID [2022-02-20 17:22:43,491 INFO L290 TraceCheckUtils]: 31: Hoare triple {12227#false} main_~a~0#1 := main_~b~0#1;main_~b~0#1 := main_~c~0#1;havoc main_~temp~0#1;main_~temp~0#1 := main_~p~0#1;main_~p~0#1 := main_~q~0#1;main_~q~0#1 := main_~temp~0#1 - main_~q~0#1 * main_~k~0#1;main_~temp~0#1 := main_~r~0#1;main_~r~0#1 := main_~s~0#1;main_~s~0#1 := main_~temp~0#1 - main_~s~0#1 * main_~k~0#1; {12227#false} is VALID [2022-02-20 17:22:43,491 INFO L290 TraceCheckUtils]: 32: Hoare triple {12227#false} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {12227#false} is VALID [2022-02-20 17:22:43,491 INFO L290 TraceCheckUtils]: 33: Hoare triple {12227#false} assume !(main_#t~post6#1 < 100);havoc main_#t~post6#1; {12227#false} is VALID [2022-02-20 17:22:43,491 INFO L272 TraceCheckUtils]: 34: Hoare triple {12227#false} call __VERIFIER_assert((if main_~p~0#1 * main_~x~0#1 - main_~q~0#1 * main_~x~0#1 + main_~r~0#1 * main_~y~0#1 - main_~s~0#1 * main_~y~0#1 == main_~a~0#1 then 1 else 0)); {12227#false} is VALID [2022-02-20 17:22:43,491 INFO L290 TraceCheckUtils]: 35: Hoare triple {12227#false} ~cond := #in~cond; {12227#false} is VALID [2022-02-20 17:22:43,492 INFO L290 TraceCheckUtils]: 36: Hoare triple {12227#false} assume 0 == ~cond; {12227#false} is VALID [2022-02-20 17:22:43,492 INFO L290 TraceCheckUtils]: 37: Hoare triple {12227#false} assume !false; {12227#false} is VALID [2022-02-20 17:22:43,492 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 17:22:43,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:22:43,619 INFO L290 TraceCheckUtils]: 37: Hoare triple {12227#false} assume !false; {12227#false} is VALID [2022-02-20 17:22:43,619 INFO L290 TraceCheckUtils]: 36: Hoare triple {12227#false} assume 0 == ~cond; {12227#false} is VALID [2022-02-20 17:22:43,619 INFO L290 TraceCheckUtils]: 35: Hoare triple {12227#false} ~cond := #in~cond; {12227#false} is VALID [2022-02-20 17:22:43,619 INFO L272 TraceCheckUtils]: 34: Hoare triple {12227#false} call __VERIFIER_assert((if main_~p~0#1 * main_~x~0#1 - main_~q~0#1 * main_~x~0#1 + main_~r~0#1 * main_~y~0#1 - main_~s~0#1 * main_~y~0#1 == main_~a~0#1 then 1 else 0)); {12227#false} is VALID [2022-02-20 17:22:43,620 INFO L290 TraceCheckUtils]: 33: Hoare triple {12227#false} assume !(main_#t~post6#1 < 100);havoc main_#t~post6#1; {12227#false} is VALID [2022-02-20 17:22:43,620 INFO L290 TraceCheckUtils]: 32: Hoare triple {12227#false} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {12227#false} is VALID [2022-02-20 17:22:43,620 INFO L290 TraceCheckUtils]: 31: Hoare triple {12227#false} main_~a~0#1 := main_~b~0#1;main_~b~0#1 := main_~c~0#1;havoc main_~temp~0#1;main_~temp~0#1 := main_~p~0#1;main_~p~0#1 := main_~q~0#1;main_~q~0#1 := main_~temp~0#1 - main_~q~0#1 * main_~k~0#1;main_~temp~0#1 := main_~r~0#1;main_~r~0#1 := main_~s~0#1;main_~s~0#1 := main_~temp~0#1 - main_~s~0#1 * main_~k~0#1; {12227#false} is VALID [2022-02-20 17:22:43,620 INFO L290 TraceCheckUtils]: 30: Hoare triple {12227#false} assume !(main_#t~post7#1 < 100);havoc main_#t~post7#1; {12227#false} is VALID [2022-02-20 17:22:43,620 INFO L290 TraceCheckUtils]: 29: Hoare triple {12227#false} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {12227#false} is VALID [2022-02-20 17:22:43,620 INFO L290 TraceCheckUtils]: 28: Hoare triple {12227#false} assume !!(0 != main_~b~0#1);havoc main_~c~0#1;havoc main_~k~0#1;main_~c~0#1 := main_~a~0#1;main_~k~0#1 := 0; {12227#false} is VALID [2022-02-20 17:22:43,620 INFO L290 TraceCheckUtils]: 27: Hoare triple {12227#false} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1; {12227#false} is VALID [2022-02-20 17:22:43,620 INFO L290 TraceCheckUtils]: 26: Hoare triple {12227#false} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {12227#false} is VALID [2022-02-20 17:22:43,620 INFO L290 TraceCheckUtils]: 25: Hoare triple {12227#false} main_~a~0#1 := main_~b~0#1;main_~b~0#1 := main_~c~0#1;havoc main_~temp~0#1;main_~temp~0#1 := main_~p~0#1;main_~p~0#1 := main_~q~0#1;main_~q~0#1 := main_~temp~0#1 - main_~q~0#1 * main_~k~0#1;main_~temp~0#1 := main_~r~0#1;main_~r~0#1 := main_~s~0#1;main_~s~0#1 := main_~temp~0#1 - main_~s~0#1 * main_~k~0#1; {12227#false} is VALID [2022-02-20 17:22:43,620 INFO L290 TraceCheckUtils]: 24: Hoare triple {12386#(< |ULTIMATE.start_main_#t~post7#1| 100)} assume !(main_#t~post7#1 < 100);havoc main_#t~post7#1; {12227#false} is VALID [2022-02-20 17:22:43,620 INFO L290 TraceCheckUtils]: 23: Hoare triple {12390#(< ~counter~0 100)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {12386#(< |ULTIMATE.start_main_#t~post7#1| 100)} is VALID [2022-02-20 17:22:43,621 INFO L290 TraceCheckUtils]: 22: Hoare triple {12390#(< ~counter~0 100)} assume !!(0 != main_~b~0#1);havoc main_~c~0#1;havoc main_~k~0#1;main_~c~0#1 := main_~a~0#1;main_~k~0#1 := 0; {12390#(< ~counter~0 100)} is VALID [2022-02-20 17:22:43,621 INFO L290 TraceCheckUtils]: 21: Hoare triple {12390#(< ~counter~0 100)} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1; {12390#(< ~counter~0 100)} is VALID [2022-02-20 17:22:43,621 INFO L290 TraceCheckUtils]: 20: Hoare triple {12400#(< ~counter~0 99)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {12390#(< ~counter~0 100)} is VALID [2022-02-20 17:22:43,622 INFO L290 TraceCheckUtils]: 19: Hoare triple {12400#(< ~counter~0 99)} main_~a~0#1 := main_~b~0#1;main_~b~0#1 := main_~c~0#1;havoc main_~temp~0#1;main_~temp~0#1 := main_~p~0#1;main_~p~0#1 := main_~q~0#1;main_~q~0#1 := main_~temp~0#1 - main_~q~0#1 * main_~k~0#1;main_~temp~0#1 := main_~r~0#1;main_~r~0#1 := main_~s~0#1;main_~s~0#1 := main_~temp~0#1 - main_~s~0#1 * main_~k~0#1; {12400#(< ~counter~0 99)} is VALID [2022-02-20 17:22:43,622 INFO L290 TraceCheckUtils]: 18: Hoare triple {12400#(< ~counter~0 99)} assume !(main_~c~0#1 >= main_~b~0#1); {12400#(< ~counter~0 99)} is VALID [2022-02-20 17:22:43,622 INFO L290 TraceCheckUtils]: 17: Hoare triple {12400#(< ~counter~0 99)} assume !!(main_#t~post7#1 < 100);havoc main_#t~post7#1; {12400#(< ~counter~0 99)} is VALID [2022-02-20 17:22:43,622 INFO L290 TraceCheckUtils]: 16: Hoare triple {12413#(< ~counter~0 98)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {12400#(< ~counter~0 99)} is VALID [2022-02-20 17:22:43,623 INFO L290 TraceCheckUtils]: 15: Hoare triple {12413#(< ~counter~0 98)} assume !!(0 != main_~b~0#1);havoc main_~c~0#1;havoc main_~k~0#1;main_~c~0#1 := main_~a~0#1;main_~k~0#1 := 0; {12413#(< ~counter~0 98)} is VALID [2022-02-20 17:22:43,623 INFO L290 TraceCheckUtils]: 14: Hoare triple {12413#(< ~counter~0 98)} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1; {12413#(< ~counter~0 98)} is VALID [2022-02-20 17:22:43,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {12423#(< ~counter~0 97)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {12413#(< ~counter~0 98)} is VALID [2022-02-20 17:22:43,624 INFO L290 TraceCheckUtils]: 12: Hoare triple {12423#(< ~counter~0 97)} main_~a~0#1 := main_~x~0#1;main_~b~0#1 := main_~y~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0;main_~r~0#1 := 0;main_~s~0#1 := 1; {12423#(< ~counter~0 97)} is VALID [2022-02-20 17:22:43,624 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {12226#true} {12423#(< ~counter~0 97)} #93#return; {12423#(< ~counter~0 97)} is VALID [2022-02-20 17:22:43,624 INFO L290 TraceCheckUtils]: 10: Hoare triple {12226#true} assume true; {12226#true} is VALID [2022-02-20 17:22:43,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {12226#true} assume !(0 == ~cond); {12226#true} is VALID [2022-02-20 17:22:43,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {12226#true} ~cond := #in~cond; {12226#true} is VALID [2022-02-20 17:22:43,624 INFO L272 TraceCheckUtils]: 7: Hoare triple {12423#(< ~counter~0 97)} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {12226#true} is VALID [2022-02-20 17:22:43,625 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {12226#true} {12423#(< ~counter~0 97)} #91#return; {12423#(< ~counter~0 97)} is VALID [2022-02-20 17:22:43,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {12226#true} assume true; {12226#true} is VALID [2022-02-20 17:22:43,625 INFO L290 TraceCheckUtils]: 4: Hoare triple {12226#true} assume !(0 == ~cond); {12226#true} is VALID [2022-02-20 17:22:43,625 INFO L290 TraceCheckUtils]: 3: Hoare triple {12226#true} ~cond := #in~cond; {12226#true} is VALID [2022-02-20 17:22:43,625 INFO L272 TraceCheckUtils]: 2: Hoare triple {12423#(< ~counter~0 97)} call assume_abort_if_not((if main_~x~0#1 >= 1 then 1 else 0)); {12226#true} is VALID [2022-02-20 17:22:43,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {12423#(< ~counter~0 97)} 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~post8#1, main_~d~0#1, main_~v~0#1, main_#t~post7#1, main_~c~0#1, main_~k~0#1, main_~temp~0#1, main_#t~post6#1, main_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~s~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~s~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {12423#(< ~counter~0 97)} is VALID [2022-02-20 17:22:43,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {12226#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12423#(< ~counter~0 97)} is VALID [2022-02-20 17:22:43,626 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 17:22:43,626 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:22:43,626 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327821520] [2022-02-20 17:22:43,626 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:22:43,626 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123960102] [2022-02-20 17:22:43,626 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123960102] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:22:43,626 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:22:43,626 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2022-02-20 17:22:43,626 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980038746] [2022-02-20 17:22:43,626 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:22:43,627 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2022-02-20 17:22:43,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:22:43,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:22:43,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:22:43,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 17:22:43,648 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:22:43,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 17:22:43,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:22:43,648 INFO L87 Difference]: Start difference. First operand 491 states and 770 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:22:45,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:45,189 INFO L93 Difference]: Finished difference Result 1123 states and 1717 transitions. [2022-02-20 17:22:45,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 17:22:45,189 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2022-02-20 17:22:45,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:22:45,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:22:45,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 220 transitions. [2022-02-20 17:22:45,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:22:45,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 220 transitions. [2022-02-20 17:22:45,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 220 transitions. [2022-02-20 17:22:45,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 220 edges. 220 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:22:45,367 INFO L225 Difference]: With dead ends: 1123 [2022-02-20 17:22:45,367 INFO L226 Difference]: Without dead ends: 766 [2022-02-20 17:22:45,370 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2022-02-20 17:22:45,373 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 154 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:22:45,373 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 324 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:22:45,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2022-02-20 17:22:46,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 732. [2022-02-20 17:22:46,830 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:22:46,844 INFO L82 GeneralOperation]: Start isEquivalent. First operand 766 states. Second operand has 732 states, 470 states have (on average 1.3638297872340426) internal successors, (641), 494 states have internal predecessors, (641), 222 states have call successors, (222), 39 states have call predecessors, (222), 39 states have return successors, (218), 198 states have call predecessors, (218), 218 states have call successors, (218) [2022-02-20 17:22:46,860 INFO L74 IsIncluded]: Start isIncluded. First operand 766 states. Second operand has 732 states, 470 states have (on average 1.3638297872340426) internal successors, (641), 494 states have internal predecessors, (641), 222 states have call successors, (222), 39 states have call predecessors, (222), 39 states have return successors, (218), 198 states have call predecessors, (218), 218 states have call successors, (218) [2022-02-20 17:22:46,861 INFO L87 Difference]: Start difference. First operand 766 states. Second operand has 732 states, 470 states have (on average 1.3638297872340426) internal successors, (641), 494 states have internal predecessors, (641), 222 states have call successors, (222), 39 states have call predecessors, (222), 39 states have return successors, (218), 198 states have call predecessors, (218), 218 states have call successors, (218) [2022-02-20 17:22:46,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:46,901 INFO L93 Difference]: Finished difference Result 766 states and 1114 transitions. [2022-02-20 17:22:46,901 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1114 transitions. [2022-02-20 17:22:46,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:22:46,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:22:46,905 INFO L74 IsIncluded]: Start isIncluded. First operand has 732 states, 470 states have (on average 1.3638297872340426) internal successors, (641), 494 states have internal predecessors, (641), 222 states have call successors, (222), 39 states have call predecessors, (222), 39 states have return successors, (218), 198 states have call predecessors, (218), 218 states have call successors, (218) Second operand 766 states. [2022-02-20 17:22:46,905 INFO L87 Difference]: Start difference. First operand has 732 states, 470 states have (on average 1.3638297872340426) internal successors, (641), 494 states have internal predecessors, (641), 222 states have call successors, (222), 39 states have call predecessors, (222), 39 states have return successors, (218), 198 states have call predecessors, (218), 218 states have call successors, (218) Second operand 766 states. [2022-02-20 17:22:46,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:46,959 INFO L93 Difference]: Finished difference Result 766 states and 1114 transitions. [2022-02-20 17:22:46,959 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1114 transitions. [2022-02-20 17:22:46,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:22:46,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:22:46,961 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:22:46,962 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:22:46,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 470 states have (on average 1.3638297872340426) internal successors, (641), 494 states have internal predecessors, (641), 222 states have call successors, (222), 39 states have call predecessors, (222), 39 states have return successors, (218), 198 states have call predecessors, (218), 218 states have call successors, (218) [2022-02-20 17:22:47,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 1081 transitions. [2022-02-20 17:22:47,033 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 1081 transitions. Word has length 38 [2022-02-20 17:22:47,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:22:47,034 INFO L470 AbstractCegarLoop]: Abstraction has 732 states and 1081 transitions. [2022-02-20 17:22:47,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:22:47,034 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1081 transitions. [2022-02-20 17:22:47,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 17:22:47,034 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:22:47,034 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:22:47,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-02-20 17:22:47,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-02-20 17:22:47,250 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:22:47,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:22:47,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1715872859, now seen corresponding path program 1 times [2022-02-20 17:22:47,251 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:22:47,251 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382713885] [2022-02-20 17:22:47,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:22:47,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:22:47,263 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:22:47,270 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [185956867] [2022-02-20 17:22:47,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:22:47,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:22:47,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:22:47,288 INFO L229 MonitoredProcess]: Starting monitored process 15 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:22:47,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-02-20 17:22:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:22:47,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 17:22:47,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:22:47,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:22:47,618 INFO L290 TraceCheckUtils]: 0: Hoare triple {16823#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {16828#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:47,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {16828#(<= ~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~post8#1, main_~d~0#1, main_~v~0#1, main_#t~post7#1, main_~c~0#1, main_~k~0#1, main_~temp~0#1, main_#t~post6#1, main_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~s~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~s~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {16828#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:47,619 INFO L272 TraceCheckUtils]: 2: Hoare triple {16828#(<= ~counter~0 0)} call assume_abort_if_not((if main_~x~0#1 >= 1 then 1 else 0)); {16828#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:47,619 INFO L290 TraceCheckUtils]: 3: Hoare triple {16828#(<= ~counter~0 0)} ~cond := #in~cond; {16828#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:47,619 INFO L290 TraceCheckUtils]: 4: Hoare triple {16828#(<= ~counter~0 0)} assume !(0 == ~cond); {16828#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:47,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {16828#(<= ~counter~0 0)} assume true; {16828#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:47,620 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {16828#(<= ~counter~0 0)} {16828#(<= ~counter~0 0)} #91#return; {16828#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:47,621 INFO L272 TraceCheckUtils]: 7: Hoare triple {16828#(<= ~counter~0 0)} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {16828#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:47,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {16828#(<= ~counter~0 0)} ~cond := #in~cond; {16828#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:47,621 INFO L290 TraceCheckUtils]: 9: Hoare triple {16828#(<= ~counter~0 0)} assume !(0 == ~cond); {16828#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:47,621 INFO L290 TraceCheckUtils]: 10: Hoare triple {16828#(<= ~counter~0 0)} assume true; {16828#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:47,622 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {16828#(<= ~counter~0 0)} {16828#(<= ~counter~0 0)} #93#return; {16828#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:47,622 INFO L290 TraceCheckUtils]: 12: Hoare triple {16828#(<= ~counter~0 0)} main_~a~0#1 := main_~x~0#1;main_~b~0#1 := main_~y~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0;main_~r~0#1 := 0;main_~s~0#1 := 1; {16828#(<= ~counter~0 0)} is VALID [2022-02-20 17:22:47,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {16828#(<= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {16868#(<= ~counter~0 1)} is VALID [2022-02-20 17:22:47,623 INFO L290 TraceCheckUtils]: 14: Hoare triple {16868#(<= ~counter~0 1)} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1; {16868#(<= ~counter~0 1)} is VALID [2022-02-20 17:22:47,623 INFO L290 TraceCheckUtils]: 15: Hoare triple {16868#(<= ~counter~0 1)} assume !!(0 != main_~b~0#1);havoc main_~c~0#1;havoc main_~k~0#1;main_~c~0#1 := main_~a~0#1;main_~k~0#1 := 0; {16868#(<= ~counter~0 1)} is VALID [2022-02-20 17:22:47,624 INFO L290 TraceCheckUtils]: 16: Hoare triple {16868#(<= ~counter~0 1)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {16878#(<= ~counter~0 2)} is VALID [2022-02-20 17:22:47,624 INFO L290 TraceCheckUtils]: 17: Hoare triple {16878#(<= ~counter~0 2)} assume !!(main_#t~post7#1 < 100);havoc main_#t~post7#1; {16878#(<= ~counter~0 2)} is VALID [2022-02-20 17:22:47,625 INFO L290 TraceCheckUtils]: 18: Hoare triple {16878#(<= ~counter~0 2)} assume !(main_~c~0#1 >= main_~b~0#1); {16878#(<= ~counter~0 2)} is VALID [2022-02-20 17:22:47,625 INFO L290 TraceCheckUtils]: 19: Hoare triple {16878#(<= ~counter~0 2)} main_~a~0#1 := main_~b~0#1;main_~b~0#1 := main_~c~0#1;havoc main_~temp~0#1;main_~temp~0#1 := main_~p~0#1;main_~p~0#1 := main_~q~0#1;main_~q~0#1 := main_~temp~0#1 - main_~q~0#1 * main_~k~0#1;main_~temp~0#1 := main_~r~0#1;main_~r~0#1 := main_~s~0#1;main_~s~0#1 := main_~temp~0#1 - main_~s~0#1 * main_~k~0#1; {16878#(<= ~counter~0 2)} is VALID [2022-02-20 17:22:47,625 INFO L290 TraceCheckUtils]: 20: Hoare triple {16878#(<= ~counter~0 2)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {16891#(<= ~counter~0 3)} is VALID [2022-02-20 17:22:47,626 INFO L290 TraceCheckUtils]: 21: Hoare triple {16891#(<= ~counter~0 3)} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1; {16891#(<= ~counter~0 3)} is VALID [2022-02-20 17:22:47,626 INFO L290 TraceCheckUtils]: 22: Hoare triple {16891#(<= ~counter~0 3)} assume !!(0 != main_~b~0#1);havoc main_~c~0#1;havoc main_~k~0#1;main_~c~0#1 := main_~a~0#1;main_~k~0#1 := 0; {16891#(<= ~counter~0 3)} is VALID [2022-02-20 17:22:47,626 INFO L290 TraceCheckUtils]: 23: Hoare triple {16891#(<= ~counter~0 3)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {16901#(<= ~counter~0 4)} is VALID [2022-02-20 17:22:47,627 INFO L290 TraceCheckUtils]: 24: Hoare triple {16901#(<= ~counter~0 4)} assume !!(main_#t~post7#1 < 100);havoc main_#t~post7#1; {16901#(<= ~counter~0 4)} is VALID [2022-02-20 17:22:47,627 INFO L290 TraceCheckUtils]: 25: Hoare triple {16901#(<= ~counter~0 4)} assume !!(main_~c~0#1 >= main_~b~0#1);havoc main_~d~0#1;havoc main_~v~0#1;main_~d~0#1 := 1;main_~v~0#1 := main_~b~0#1; {16901#(<= ~counter~0 4)} is VALID [2022-02-20 17:22:47,627 INFO L290 TraceCheckUtils]: 26: Hoare triple {16901#(<= ~counter~0 4)} main_#t~post8#1 := ~counter~0;~counter~0 := 1 + main_#t~post8#1; {16911#(<= |ULTIMATE.start_main_#t~post8#1| 4)} is VALID [2022-02-20 17:22:47,628 INFO L290 TraceCheckUtils]: 27: Hoare triple {16911#(<= |ULTIMATE.start_main_#t~post8#1| 4)} assume !(main_#t~post8#1 < 100);havoc main_#t~post8#1; {16824#false} is VALID [2022-02-20 17:22:47,628 INFO L290 TraceCheckUtils]: 28: Hoare triple {16824#false} main_~c~0#1 := main_~c~0#1 - main_~v~0#1;main_~k~0#1 := main_~k~0#1 + main_~d~0#1; {16824#false} is VALID [2022-02-20 17:22:47,628 INFO L290 TraceCheckUtils]: 29: Hoare triple {16824#false} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {16824#false} is VALID [2022-02-20 17:22:47,628 INFO L290 TraceCheckUtils]: 30: Hoare triple {16824#false} assume !!(main_#t~post7#1 < 100);havoc main_#t~post7#1; {16824#false} is VALID [2022-02-20 17:22:47,628 INFO L290 TraceCheckUtils]: 31: Hoare triple {16824#false} assume !(main_~c~0#1 >= main_~b~0#1); {16824#false} is VALID [2022-02-20 17:22:47,628 INFO L290 TraceCheckUtils]: 32: Hoare triple {16824#false} main_~a~0#1 := main_~b~0#1;main_~b~0#1 := main_~c~0#1;havoc main_~temp~0#1;main_~temp~0#1 := main_~p~0#1;main_~p~0#1 := main_~q~0#1;main_~q~0#1 := main_~temp~0#1 - main_~q~0#1 * main_~k~0#1;main_~temp~0#1 := main_~r~0#1;main_~r~0#1 := main_~s~0#1;main_~s~0#1 := main_~temp~0#1 - main_~s~0#1 * main_~k~0#1; {16824#false} is VALID [2022-02-20 17:22:47,628 INFO L290 TraceCheckUtils]: 33: Hoare triple {16824#false} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {16824#false} is VALID [2022-02-20 17:22:47,629 INFO L290 TraceCheckUtils]: 34: Hoare triple {16824#false} assume !(main_#t~post6#1 < 100);havoc main_#t~post6#1; {16824#false} is VALID [2022-02-20 17:22:47,629 INFO L272 TraceCheckUtils]: 35: Hoare triple {16824#false} call __VERIFIER_assert((if main_~p~0#1 * main_~x~0#1 - main_~q~0#1 * main_~x~0#1 + main_~r~0#1 * main_~y~0#1 - main_~s~0#1 * main_~y~0#1 == main_~a~0#1 then 1 else 0)); {16824#false} is VALID [2022-02-20 17:22:47,629 INFO L290 TraceCheckUtils]: 36: Hoare triple {16824#false} ~cond := #in~cond; {16824#false} is VALID [2022-02-20 17:22:47,629 INFO L290 TraceCheckUtils]: 37: Hoare triple {16824#false} assume 0 == ~cond; {16824#false} is VALID [2022-02-20 17:22:47,629 INFO L290 TraceCheckUtils]: 38: Hoare triple {16824#false} assume !false; {16824#false} is VALID [2022-02-20 17:22:47,629 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:22:47,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:22:47,922 INFO L290 TraceCheckUtils]: 38: Hoare triple {16824#false} assume !false; {16824#false} is VALID [2022-02-20 17:22:47,922 INFO L290 TraceCheckUtils]: 37: Hoare triple {16824#false} assume 0 == ~cond; {16824#false} is VALID [2022-02-20 17:22:47,922 INFO L290 TraceCheckUtils]: 36: Hoare triple {16824#false} ~cond := #in~cond; {16824#false} is VALID [2022-02-20 17:22:47,922 INFO L272 TraceCheckUtils]: 35: Hoare triple {16824#false} call __VERIFIER_assert((if main_~p~0#1 * main_~x~0#1 - main_~q~0#1 * main_~x~0#1 + main_~r~0#1 * main_~y~0#1 - main_~s~0#1 * main_~y~0#1 == main_~a~0#1 then 1 else 0)); {16824#false} is VALID [2022-02-20 17:22:47,922 INFO L290 TraceCheckUtils]: 34: Hoare triple {16824#false} assume !(main_#t~post6#1 < 100);havoc main_#t~post6#1; {16824#false} is VALID [2022-02-20 17:22:47,923 INFO L290 TraceCheckUtils]: 33: Hoare triple {16824#false} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {16824#false} is VALID [2022-02-20 17:22:47,923 INFO L290 TraceCheckUtils]: 32: Hoare triple {16824#false} main_~a~0#1 := main_~b~0#1;main_~b~0#1 := main_~c~0#1;havoc main_~temp~0#1;main_~temp~0#1 := main_~p~0#1;main_~p~0#1 := main_~q~0#1;main_~q~0#1 := main_~temp~0#1 - main_~q~0#1 * main_~k~0#1;main_~temp~0#1 := main_~r~0#1;main_~r~0#1 := main_~s~0#1;main_~s~0#1 := main_~temp~0#1 - main_~s~0#1 * main_~k~0#1; {16824#false} is VALID [2022-02-20 17:22:47,923 INFO L290 TraceCheckUtils]: 31: Hoare triple {16824#false} assume !(main_~c~0#1 >= main_~b~0#1); {16824#false} is VALID [2022-02-20 17:22:47,923 INFO L290 TraceCheckUtils]: 30: Hoare triple {16824#false} assume !!(main_#t~post7#1 < 100);havoc main_#t~post7#1; {16824#false} is VALID [2022-02-20 17:22:47,923 INFO L290 TraceCheckUtils]: 29: Hoare triple {16824#false} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {16824#false} is VALID [2022-02-20 17:22:47,923 INFO L290 TraceCheckUtils]: 28: Hoare triple {16824#false} main_~c~0#1 := main_~c~0#1 - main_~v~0#1;main_~k~0#1 := main_~k~0#1 + main_~d~0#1; {16824#false} is VALID [2022-02-20 17:22:47,923 INFO L290 TraceCheckUtils]: 27: Hoare triple {16981#(< |ULTIMATE.start_main_#t~post8#1| 100)} assume !(main_#t~post8#1 < 100);havoc main_#t~post8#1; {16824#false} is VALID [2022-02-20 17:22:47,924 INFO L290 TraceCheckUtils]: 26: Hoare triple {16985#(< ~counter~0 100)} main_#t~post8#1 := ~counter~0;~counter~0 := 1 + main_#t~post8#1; {16981#(< |ULTIMATE.start_main_#t~post8#1| 100)} is VALID [2022-02-20 17:22:47,924 INFO L290 TraceCheckUtils]: 25: Hoare triple {16985#(< ~counter~0 100)} assume !!(main_~c~0#1 >= main_~b~0#1);havoc main_~d~0#1;havoc main_~v~0#1;main_~d~0#1 := 1;main_~v~0#1 := main_~b~0#1; {16985#(< ~counter~0 100)} is VALID [2022-02-20 17:22:47,925 INFO L290 TraceCheckUtils]: 24: Hoare triple {16985#(< ~counter~0 100)} assume !!(main_#t~post7#1 < 100);havoc main_#t~post7#1; {16985#(< ~counter~0 100)} is VALID [2022-02-20 17:22:47,925 INFO L290 TraceCheckUtils]: 23: Hoare triple {16995#(< ~counter~0 99)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {16985#(< ~counter~0 100)} is VALID [2022-02-20 17:22:47,926 INFO L290 TraceCheckUtils]: 22: Hoare triple {16995#(< ~counter~0 99)} assume !!(0 != main_~b~0#1);havoc main_~c~0#1;havoc main_~k~0#1;main_~c~0#1 := main_~a~0#1;main_~k~0#1 := 0; {16995#(< ~counter~0 99)} is VALID [2022-02-20 17:22:47,926 INFO L290 TraceCheckUtils]: 21: Hoare triple {16995#(< ~counter~0 99)} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1; {16995#(< ~counter~0 99)} is VALID [2022-02-20 17:22:47,926 INFO L290 TraceCheckUtils]: 20: Hoare triple {17005#(< ~counter~0 98)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {16995#(< ~counter~0 99)} is VALID [2022-02-20 17:22:47,927 INFO L290 TraceCheckUtils]: 19: Hoare triple {17005#(< ~counter~0 98)} main_~a~0#1 := main_~b~0#1;main_~b~0#1 := main_~c~0#1;havoc main_~temp~0#1;main_~temp~0#1 := main_~p~0#1;main_~p~0#1 := main_~q~0#1;main_~q~0#1 := main_~temp~0#1 - main_~q~0#1 * main_~k~0#1;main_~temp~0#1 := main_~r~0#1;main_~r~0#1 := main_~s~0#1;main_~s~0#1 := main_~temp~0#1 - main_~s~0#1 * main_~k~0#1; {17005#(< ~counter~0 98)} is VALID [2022-02-20 17:22:47,927 INFO L290 TraceCheckUtils]: 18: Hoare triple {17005#(< ~counter~0 98)} assume !(main_~c~0#1 >= main_~b~0#1); {17005#(< ~counter~0 98)} is VALID [2022-02-20 17:22:47,927 INFO L290 TraceCheckUtils]: 17: Hoare triple {17005#(< ~counter~0 98)} assume !!(main_#t~post7#1 < 100);havoc main_#t~post7#1; {17005#(< ~counter~0 98)} is VALID [2022-02-20 17:22:47,928 INFO L290 TraceCheckUtils]: 16: Hoare triple {17018#(< ~counter~0 97)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {17005#(< ~counter~0 98)} is VALID [2022-02-20 17:22:47,928 INFO L290 TraceCheckUtils]: 15: Hoare triple {17018#(< ~counter~0 97)} assume !!(0 != main_~b~0#1);havoc main_~c~0#1;havoc main_~k~0#1;main_~c~0#1 := main_~a~0#1;main_~k~0#1 := 0; {17018#(< ~counter~0 97)} is VALID [2022-02-20 17:22:47,929 INFO L290 TraceCheckUtils]: 14: Hoare triple {17018#(< ~counter~0 97)} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1; {17018#(< ~counter~0 97)} is VALID [2022-02-20 17:22:47,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {17028#(< ~counter~0 96)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {17018#(< ~counter~0 97)} is VALID [2022-02-20 17:22:47,930 INFO L290 TraceCheckUtils]: 12: Hoare triple {17028#(< ~counter~0 96)} main_~a~0#1 := main_~x~0#1;main_~b~0#1 := main_~y~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0;main_~r~0#1 := 0;main_~s~0#1 := 1; {17028#(< ~counter~0 96)} is VALID [2022-02-20 17:22:47,930 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {16823#true} {17028#(< ~counter~0 96)} #93#return; {17028#(< ~counter~0 96)} is VALID [2022-02-20 17:22:47,930 INFO L290 TraceCheckUtils]: 10: Hoare triple {16823#true} assume true; {16823#true} is VALID [2022-02-20 17:22:47,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {16823#true} assume !(0 == ~cond); {16823#true} is VALID [2022-02-20 17:22:47,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {16823#true} ~cond := #in~cond; {16823#true} is VALID [2022-02-20 17:22:47,930 INFO L272 TraceCheckUtils]: 7: Hoare triple {17028#(< ~counter~0 96)} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {16823#true} is VALID [2022-02-20 17:22:47,931 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {16823#true} {17028#(< ~counter~0 96)} #91#return; {17028#(< ~counter~0 96)} is VALID [2022-02-20 17:22:47,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {16823#true} assume true; {16823#true} is VALID [2022-02-20 17:22:47,931 INFO L290 TraceCheckUtils]: 4: Hoare triple {16823#true} assume !(0 == ~cond); {16823#true} is VALID [2022-02-20 17:22:47,931 INFO L290 TraceCheckUtils]: 3: Hoare triple {16823#true} ~cond := #in~cond; {16823#true} is VALID [2022-02-20 17:22:47,932 INFO L272 TraceCheckUtils]: 2: Hoare triple {17028#(< ~counter~0 96)} call assume_abort_if_not((if main_~x~0#1 >= 1 then 1 else 0)); {16823#true} is VALID [2022-02-20 17:22:47,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {17028#(< ~counter~0 96)} 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~post8#1, main_~d~0#1, main_~v~0#1, main_#t~post7#1, main_~c~0#1, main_~k~0#1, main_~temp~0#1, main_#t~post6#1, main_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~s~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~s~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {17028#(< ~counter~0 96)} is VALID [2022-02-20 17:22:47,933 INFO L290 TraceCheckUtils]: 0: Hoare triple {16823#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {17028#(< ~counter~0 96)} is VALID [2022-02-20 17:22:47,944 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:22:47,944 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:22:47,945 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382713885] [2022-02-20 17:22:47,945 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:22:47,945 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185956867] [2022-02-20 17:22:47,945 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185956867] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:22:47,945 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:22:47,946 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-02-20 17:22:47,946 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457129406] [2022-02-20 17:22:47,946 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:22:47,950 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2022-02-20 17:22:47,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:22:47,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:22:48,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:22:48,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 17:22:48,016 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:22:48,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 17:22:48,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-02-20 17:22:48,018 INFO L87 Difference]: Start difference. First operand 732 states and 1081 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:22:51,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:51,200 INFO L93 Difference]: Finished difference Result 1593 states and 2375 transitions. [2022-02-20 17:22:51,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-20 17:22:51,200 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2022-02-20 17:22:51,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:22:51,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:22:51,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 277 transitions. [2022-02-20 17:22:51,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:22:51,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 277 transitions. [2022-02-20 17:22:51,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 277 transitions. [2022-02-20 17:22:51,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 277 edges. 277 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:22:51,474 INFO L225 Difference]: With dead ends: 1593 [2022-02-20 17:22:51,475 INFO L226 Difference]: Without dead ends: 1115 [2022-02-20 17:22:51,476 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=144, Invalid=276, Unknown=0, NotChecked=0, Total=420 [2022-02-20 17:22:51,476 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 180 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:22:51,476 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 437 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:22:51,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2022-02-20 17:22:53,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1068. [2022-02-20 17:22:53,762 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:22:53,764 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1115 states. Second operand has 1068 states, 696 states have (on average 1.3117816091954022) internal successors, (913), 729 states have internal predecessors, (913), 316 states have call successors, (316), 55 states have call predecessors, (316), 55 states have return successors, (310), 283 states have call predecessors, (310), 310 states have call successors, (310) [2022-02-20 17:22:53,765 INFO L74 IsIncluded]: Start isIncluded. First operand 1115 states. Second operand has 1068 states, 696 states have (on average 1.3117816091954022) internal successors, (913), 729 states have internal predecessors, (913), 316 states have call successors, (316), 55 states have call predecessors, (316), 55 states have return successors, (310), 283 states have call predecessors, (310), 310 states have call successors, (310) [2022-02-20 17:22:53,766 INFO L87 Difference]: Start difference. First operand 1115 states. Second operand has 1068 states, 696 states have (on average 1.3117816091954022) internal successors, (913), 729 states have internal predecessors, (913), 316 states have call successors, (316), 55 states have call predecessors, (316), 55 states have return successors, (310), 283 states have call predecessors, (310), 310 states have call successors, (310) [2022-02-20 17:22:53,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:53,809 INFO L93 Difference]: Finished difference Result 1115 states and 1580 transitions. [2022-02-20 17:22:53,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1580 transitions. [2022-02-20 17:22:53,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:22:53,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:22:53,813 INFO L74 IsIncluded]: Start isIncluded. First operand has 1068 states, 696 states have (on average 1.3117816091954022) internal successors, (913), 729 states have internal predecessors, (913), 316 states have call successors, (316), 55 states have call predecessors, (316), 55 states have return successors, (310), 283 states have call predecessors, (310), 310 states have call successors, (310) Second operand 1115 states. [2022-02-20 17:22:53,814 INFO L87 Difference]: Start difference. First operand has 1068 states, 696 states have (on average 1.3117816091954022) internal successors, (913), 729 states have internal predecessors, (913), 316 states have call successors, (316), 55 states have call predecessors, (316), 55 states have return successors, (310), 283 states have call predecessors, (310), 310 states have call successors, (310) Second operand 1115 states. [2022-02-20 17:22:53,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:53,856 INFO L93 Difference]: Finished difference Result 1115 states and 1580 transitions. [2022-02-20 17:22:53,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1580 transitions. [2022-02-20 17:22:53,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:22:53,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:22:53,860 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:22:53,860 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:22:53,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1068 states, 696 states have (on average 1.3117816091954022) internal successors, (913), 729 states have internal predecessors, (913), 316 states have call successors, (316), 55 states have call predecessors, (316), 55 states have return successors, (310), 283 states have call predecessors, (310), 310 states have call successors, (310) [2022-02-20 17:22:53,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1539 transitions. [2022-02-20 17:22:53,924 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1539 transitions. Word has length 39 [2022-02-20 17:22:53,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:22:53,925 INFO L470 AbstractCegarLoop]: Abstraction has 1068 states and 1539 transitions. [2022-02-20 17:22:53,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:22:53,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1539 transitions. [2022-02-20 17:22:53,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-20 17:22:53,925 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:22:53,926 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:22:53,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-02-20 17:22:54,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:22:54,142 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:22:54,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:22:54,142 INFO L85 PathProgramCache]: Analyzing trace with hash -827121215, now seen corresponding path program 2 times [2022-02-20 17:22:54,142 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:22:54,142 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774326945] [2022-02-20 17:22:54,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:22:54,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:22:54,153 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:22:54,157 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2104601947] [2022-02-20 17:22:54,157 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:22:54,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:22:54,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:22:54,172 INFO L229 MonitoredProcess]: Starting monitored process 16 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:22:54,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-02-20 17:22:54,211 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:22:54,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:22:54,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:22:54,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:22:54,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:22:54,338 INFO L290 TraceCheckUtils]: 0: Hoare triple {23334#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {23334#true} is VALID [2022-02-20 17:22:54,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {23334#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~post8#1, main_~d~0#1, main_~v~0#1, main_#t~post7#1, main_~c~0#1, main_~k~0#1, main_~temp~0#1, main_#t~post6#1, main_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~s~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~s~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {23334#true} is VALID [2022-02-20 17:22:54,338 INFO L272 TraceCheckUtils]: 2: Hoare triple {23334#true} call assume_abort_if_not((if main_~x~0#1 >= 1 then 1 else 0)); {23334#true} is VALID [2022-02-20 17:22:54,338 INFO L290 TraceCheckUtils]: 3: Hoare triple {23334#true} ~cond := #in~cond; {23334#true} is VALID [2022-02-20 17:22:54,338 INFO L290 TraceCheckUtils]: 4: Hoare triple {23334#true} assume !(0 == ~cond); {23334#true} is VALID [2022-02-20 17:22:54,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {23334#true} assume true; {23334#true} is VALID [2022-02-20 17:22:54,339 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {23334#true} {23334#true} #91#return; {23334#true} is VALID [2022-02-20 17:22:54,339 INFO L272 TraceCheckUtils]: 7: Hoare triple {23334#true} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {23334#true} is VALID [2022-02-20 17:22:54,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {23334#true} ~cond := #in~cond; {23334#true} is VALID [2022-02-20 17:22:54,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {23334#true} assume !(0 == ~cond); {23334#true} is VALID [2022-02-20 17:22:54,339 INFO L290 TraceCheckUtils]: 10: Hoare triple {23334#true} assume true; {23334#true} is VALID [2022-02-20 17:22:54,339 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {23334#true} {23334#true} #93#return; {23334#true} is VALID [2022-02-20 17:22:54,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {23334#true} main_~a~0#1 := main_~x~0#1;main_~b~0#1 := main_~y~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0;main_~r~0#1 := 0;main_~s~0#1 := 1; {23334#true} is VALID [2022-02-20 17:22:54,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {23334#true} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {23334#true} is VALID [2022-02-20 17:22:54,339 INFO L290 TraceCheckUtils]: 14: Hoare triple {23334#true} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1; {23334#true} is VALID [2022-02-20 17:22:54,340 INFO L290 TraceCheckUtils]: 15: Hoare triple {23334#true} assume !!(0 != main_~b~0#1);havoc main_~c~0#1;havoc main_~k~0#1;main_~c~0#1 := main_~a~0#1;main_~k~0#1 := 0; {23334#true} is VALID [2022-02-20 17:22:54,340 INFO L290 TraceCheckUtils]: 16: Hoare triple {23334#true} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {23334#true} is VALID [2022-02-20 17:22:54,340 INFO L290 TraceCheckUtils]: 17: Hoare triple {23334#true} assume !!(main_#t~post7#1 < 100);havoc main_#t~post7#1; {23334#true} is VALID [2022-02-20 17:22:54,340 INFO L290 TraceCheckUtils]: 18: Hoare triple {23334#true} assume !(main_~c~0#1 >= main_~b~0#1); {23393#(not (<= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:22:54,341 INFO L290 TraceCheckUtils]: 19: Hoare triple {23393#(not (<= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~c~0#1|))} main_~a~0#1 := main_~b~0#1;main_~b~0#1 := main_~c~0#1;havoc main_~temp~0#1;main_~temp~0#1 := main_~p~0#1;main_~p~0#1 := main_~q~0#1;main_~q~0#1 := main_~temp~0#1 - main_~q~0#1 * main_~k~0#1;main_~temp~0#1 := main_~r~0#1;main_~r~0#1 := main_~s~0#1;main_~s~0#1 := main_~temp~0#1 - main_~s~0#1 * main_~k~0#1; {23397#(< |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:22:54,341 INFO L290 TraceCheckUtils]: 20: Hoare triple {23397#(< |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~a~0#1|)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {23397#(< |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:22:54,341 INFO L290 TraceCheckUtils]: 21: Hoare triple {23397#(< |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~a~0#1|)} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1; {23397#(< |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:22:54,342 INFO L290 TraceCheckUtils]: 22: Hoare triple {23397#(< |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~a~0#1|)} assume !!(0 != main_~b~0#1);havoc main_~c~0#1;havoc main_~k~0#1;main_~c~0#1 := main_~a~0#1;main_~k~0#1 := 0; {23407#(< |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~c~0#1|)} is VALID [2022-02-20 17:22:54,342 INFO L290 TraceCheckUtils]: 23: Hoare triple {23407#(< |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~c~0#1|)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {23407#(< |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~c~0#1|)} is VALID [2022-02-20 17:22:54,342 INFO L290 TraceCheckUtils]: 24: Hoare triple {23407#(< |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~c~0#1|)} assume !!(main_#t~post7#1 < 100);havoc main_#t~post7#1; {23407#(< |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~c~0#1|)} is VALID [2022-02-20 17:22:54,343 INFO L290 TraceCheckUtils]: 25: Hoare triple {23407#(< |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~c~0#1|)} assume !(main_~c~0#1 >= main_~b~0#1); {23335#false} is VALID [2022-02-20 17:22:54,343 INFO L290 TraceCheckUtils]: 26: Hoare triple {23335#false} main_~a~0#1 := main_~b~0#1;main_~b~0#1 := main_~c~0#1;havoc main_~temp~0#1;main_~temp~0#1 := main_~p~0#1;main_~p~0#1 := main_~q~0#1;main_~q~0#1 := main_~temp~0#1 - main_~q~0#1 * main_~k~0#1;main_~temp~0#1 := main_~r~0#1;main_~r~0#1 := main_~s~0#1;main_~s~0#1 := main_~temp~0#1 - main_~s~0#1 * main_~k~0#1; {23335#false} is VALID [2022-02-20 17:22:54,343 INFO L290 TraceCheckUtils]: 27: Hoare triple {23335#false} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {23335#false} is VALID [2022-02-20 17:22:54,343 INFO L290 TraceCheckUtils]: 28: Hoare triple {23335#false} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1; {23335#false} is VALID [2022-02-20 17:22:54,343 INFO L290 TraceCheckUtils]: 29: Hoare triple {23335#false} assume !!(0 != main_~b~0#1);havoc main_~c~0#1;havoc main_~k~0#1;main_~c~0#1 := main_~a~0#1;main_~k~0#1 := 0; {23335#false} is VALID [2022-02-20 17:22:54,344 INFO L290 TraceCheckUtils]: 30: Hoare triple {23335#false} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {23335#false} is VALID [2022-02-20 17:22:54,344 INFO L290 TraceCheckUtils]: 31: Hoare triple {23335#false} assume !!(main_#t~post7#1 < 100);havoc main_#t~post7#1; {23335#false} is VALID [2022-02-20 17:22:54,344 INFO L290 TraceCheckUtils]: 32: Hoare triple {23335#false} assume !(main_~c~0#1 >= main_~b~0#1); {23335#false} is VALID [2022-02-20 17:22:54,344 INFO L290 TraceCheckUtils]: 33: Hoare triple {23335#false} main_~a~0#1 := main_~b~0#1;main_~b~0#1 := main_~c~0#1;havoc main_~temp~0#1;main_~temp~0#1 := main_~p~0#1;main_~p~0#1 := main_~q~0#1;main_~q~0#1 := main_~temp~0#1 - main_~q~0#1 * main_~k~0#1;main_~temp~0#1 := main_~r~0#1;main_~r~0#1 := main_~s~0#1;main_~s~0#1 := main_~temp~0#1 - main_~s~0#1 * main_~k~0#1; {23335#false} is VALID [2022-02-20 17:22:54,344 INFO L290 TraceCheckUtils]: 34: Hoare triple {23335#false} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {23335#false} is VALID [2022-02-20 17:22:54,344 INFO L290 TraceCheckUtils]: 35: Hoare triple {23335#false} assume !(main_#t~post6#1 < 100);havoc main_#t~post6#1; {23335#false} is VALID [2022-02-20 17:22:54,344 INFO L272 TraceCheckUtils]: 36: Hoare triple {23335#false} call __VERIFIER_assert((if main_~p~0#1 * main_~x~0#1 - main_~q~0#1 * main_~x~0#1 + main_~r~0#1 * main_~y~0#1 - main_~s~0#1 * main_~y~0#1 == main_~a~0#1 then 1 else 0)); {23335#false} is VALID [2022-02-20 17:22:54,344 INFO L290 TraceCheckUtils]: 37: Hoare triple {23335#false} ~cond := #in~cond; {23335#false} is VALID [2022-02-20 17:22:54,345 INFO L290 TraceCheckUtils]: 38: Hoare triple {23335#false} assume 0 == ~cond; {23335#false} is VALID [2022-02-20 17:22:54,345 INFO L290 TraceCheckUtils]: 39: Hoare triple {23335#false} assume !false; {23335#false} is VALID [2022-02-20 17:22:54,345 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 17:22:54,345 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:22:54,345 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:22:54,345 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774326945] [2022-02-20 17:22:54,345 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:22:54,345 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104601947] [2022-02-20 17:22:54,346 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104601947] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:22:54,346 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:22:54,346 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:22:54,346 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090059479] [2022-02-20 17:22:54,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:22:54,346 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2022-02-20 17:22:54,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:22:54,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:22:54,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:22:54,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:22:54,371 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:22:54,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:22:54,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:22:54,371 INFO L87 Difference]: Start difference. First operand 1068 states and 1539 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:22:56,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:56,580 INFO L93 Difference]: Finished difference Result 1696 states and 2535 transitions. [2022-02-20 17:22:56,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:22:56,580 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2022-02-20 17:22:56,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:22:56,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:22:56,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2022-02-20 17:22:56,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:22:56,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2022-02-20 17:22:56,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 120 transitions. [2022-02-20 17:22:56,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:22:56,760 INFO L225 Difference]: With dead ends: 1696 [2022-02-20 17:22:56,760 INFO L226 Difference]: Without dead ends: 1230 [2022-02-20 17:22:56,761 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:22:56,762 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 29 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:22:56,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 179 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:22:56,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2022-02-20 17:22:58,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 991. [2022-02-20 17:22:58,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:22:58,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1230 states. Second operand has 991 states, 659 states have (on average 1.3019726858877088) internal successors, (858), 689 states have internal predecessors, (858), 276 states have call successors, (276), 55 states have call predecessors, (276), 55 states have return successors, (270), 246 states have call predecessors, (270), 270 states have call successors, (270) [2022-02-20 17:22:58,080 INFO L74 IsIncluded]: Start isIncluded. First operand 1230 states. Second operand has 991 states, 659 states have (on average 1.3019726858877088) internal successors, (858), 689 states have internal predecessors, (858), 276 states have call successors, (276), 55 states have call predecessors, (276), 55 states have return successors, (270), 246 states have call predecessors, (270), 270 states have call successors, (270) [2022-02-20 17:22:58,081 INFO L87 Difference]: Start difference. First operand 1230 states. Second operand has 991 states, 659 states have (on average 1.3019726858877088) internal successors, (858), 689 states have internal predecessors, (858), 276 states have call successors, (276), 55 states have call predecessors, (276), 55 states have return successors, (270), 246 states have call predecessors, (270), 270 states have call successors, (270) [2022-02-20 17:22:58,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:58,135 INFO L93 Difference]: Finished difference Result 1230 states and 1811 transitions. [2022-02-20 17:22:58,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1811 transitions. [2022-02-20 17:22:58,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:22:58,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:22:58,140 INFO L74 IsIncluded]: Start isIncluded. First operand has 991 states, 659 states have (on average 1.3019726858877088) internal successors, (858), 689 states have internal predecessors, (858), 276 states have call successors, (276), 55 states have call predecessors, (276), 55 states have return successors, (270), 246 states have call predecessors, (270), 270 states have call successors, (270) Second operand 1230 states. [2022-02-20 17:22:58,141 INFO L87 Difference]: Start difference. First operand has 991 states, 659 states have (on average 1.3019726858877088) internal successors, (858), 689 states have internal predecessors, (858), 276 states have call successors, (276), 55 states have call predecessors, (276), 55 states have return successors, (270), 246 states have call predecessors, (270), 270 states have call successors, (270) Second operand 1230 states. [2022-02-20 17:22:58,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:22:58,203 INFO L93 Difference]: Finished difference Result 1230 states and 1811 transitions. [2022-02-20 17:22:58,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1811 transitions. [2022-02-20 17:22:58,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:22:58,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:22:58,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:22:58,207 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:22:58,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 659 states have (on average 1.3019726858877088) internal successors, (858), 689 states have internal predecessors, (858), 276 states have call successors, (276), 55 states have call predecessors, (276), 55 states have return successors, (270), 246 states have call predecessors, (270), 270 states have call successors, (270) [2022-02-20 17:22:58,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1404 transitions. [2022-02-20 17:22:58,251 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1404 transitions. Word has length 40 [2022-02-20 17:22:58,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:22:58,251 INFO L470 AbstractCegarLoop]: Abstraction has 991 states and 1404 transitions. [2022-02-20 17:22:58,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:22:58,251 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1404 transitions. [2022-02-20 17:22:58,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 17:22:58,252 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:22:58,252 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:22:58,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-02-20 17:22:58,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-02-20 17:22:58,468 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:22:58,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:22:58,468 INFO L85 PathProgramCache]: Analyzing trace with hash 753696694, now seen corresponding path program 1 times [2022-02-20 17:22:58,468 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:22:58,468 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65010244] [2022-02-20 17:22:58,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:22:58,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:22:58,478 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:22:58,480 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [414244201] [2022-02-20 17:22:58,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:22:58,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:22:58,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:22:58,481 INFO L229 MonitoredProcess]: Starting monitored process 17 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:22:58,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-02-20 17:22:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:22:58,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 48 conjunts are in the unsatisfiable core [2022-02-20 17:22:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:22:58,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:22:59,287 INFO L290 TraceCheckUtils]: 0: Hoare triple {29978#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {29978#true} is VALID [2022-02-20 17:22:59,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {29978#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~post8#1, main_~d~0#1, main_~v~0#1, main_#t~post7#1, main_~c~0#1, main_~k~0#1, main_~temp~0#1, main_#t~post6#1, main_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~s~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~s~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {29978#true} is VALID [2022-02-20 17:22:59,288 INFO L272 TraceCheckUtils]: 2: Hoare triple {29978#true} call assume_abort_if_not((if main_~x~0#1 >= 1 then 1 else 0)); {29978#true} is VALID [2022-02-20 17:22:59,288 INFO L290 TraceCheckUtils]: 3: Hoare triple {29978#true} ~cond := #in~cond; {29978#true} is VALID [2022-02-20 17:22:59,288 INFO L290 TraceCheckUtils]: 4: Hoare triple {29978#true} assume !(0 == ~cond); {29978#true} is VALID [2022-02-20 17:22:59,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {29978#true} assume true; {29978#true} is VALID [2022-02-20 17:22:59,288 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {29978#true} {29978#true} #91#return; {29978#true} is VALID [2022-02-20 17:22:59,288 INFO L272 TraceCheckUtils]: 7: Hoare triple {29978#true} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {29978#true} is VALID [2022-02-20 17:22:59,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {29978#true} ~cond := #in~cond; {29978#true} is VALID [2022-02-20 17:22:59,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {29978#true} assume !(0 == ~cond); {29978#true} is VALID [2022-02-20 17:22:59,289 INFO L290 TraceCheckUtils]: 10: Hoare triple {29978#true} assume true; {29978#true} is VALID [2022-02-20 17:22:59,289 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {29978#true} {29978#true} #93#return; {29978#true} is VALID [2022-02-20 17:22:59,289 INFO L290 TraceCheckUtils]: 12: Hoare triple {29978#true} main_~a~0#1 := main_~x~0#1;main_~b~0#1 := main_~y~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0;main_~r~0#1 := 0;main_~s~0#1 := 1; {30019#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:22:59,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {30019#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {30019#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:22:59,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {30019#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1; {30019#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:22:59,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {30019#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))} assume !!(0 != main_~b~0#1);havoc main_~c~0#1;havoc main_~k~0#1;main_~c~0#1 := main_~a~0#1;main_~k~0#1 := 0; {30029#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:22:59,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {30029#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {30029#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:22:59,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {30029#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} assume !!(main_#t~post7#1 < 100);havoc main_#t~post7#1; {30029#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:22:59,292 INFO L290 TraceCheckUtils]: 18: Hoare triple {30029#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} assume !!(main_~c~0#1 >= main_~b~0#1);havoc main_~d~0#1;havoc main_~v~0#1;main_~d~0#1 := 1;main_~v~0#1 := main_~b~0#1; {30039#(and (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:22:59,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {30039#(and (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} main_#t~post8#1 := ~counter~0;~counter~0 := 1 + main_#t~post8#1; {30039#(and (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:22:59,293 INFO L290 TraceCheckUtils]: 20: Hoare triple {30039#(and (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} assume !!(main_#t~post8#1 < 100);havoc main_#t~post8#1; {30039#(and (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:22:59,293 INFO L272 TraceCheckUtils]: 21: Hoare triple {30039#(and (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} call __VERIFIER_assert((if main_~a~0#1 == main_~y~0#1 * main_~r~0#1 + main_~x~0#1 * main_~p~0#1 then 1 else 0)); {29978#true} is VALID [2022-02-20 17:22:59,293 INFO L290 TraceCheckUtils]: 22: Hoare triple {29978#true} ~cond := #in~cond; {29978#true} is VALID [2022-02-20 17:22:59,293 INFO L290 TraceCheckUtils]: 23: Hoare triple {29978#true} assume !(0 == ~cond); {29978#true} is VALID [2022-02-20 17:22:59,293 INFO L290 TraceCheckUtils]: 24: Hoare triple {29978#true} assume true; {29978#true} is VALID [2022-02-20 17:22:59,294 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {29978#true} {30039#(and (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} #95#return; {30039#(and (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:22:59,294 INFO L272 TraceCheckUtils]: 26: Hoare triple {30039#(and (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} call __VERIFIER_assert((if main_~b~0#1 == main_~x~0#1 * main_~q~0#1 + main_~y~0#1 * main_~s~0#1 then 1 else 0)); {29978#true} is VALID [2022-02-20 17:22:59,295 INFO L290 TraceCheckUtils]: 27: Hoare triple {29978#true} ~cond := #in~cond; {30067#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:22:59,295 INFO L290 TraceCheckUtils]: 28: Hoare triple {30067#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {30071#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:22:59,295 INFO L290 TraceCheckUtils]: 29: Hoare triple {30071#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {30071#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:22:59,296 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {30071#(not (= |__VERIFIER_assert_#in~cond| 0))} {30039#(and (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} #97#return; {30039#(and (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:22:59,296 INFO L272 TraceCheckUtils]: 31: Hoare triple {30039#(and (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} call __VERIFIER_assert((if main_~a~0#1 == main_~k~0#1 * main_~b~0#1 + main_~c~0#1 then 1 else 0)); {29978#true} is VALID [2022-02-20 17:22:59,296 INFO L290 TraceCheckUtils]: 32: Hoare triple {29978#true} ~cond := #in~cond; {29978#true} is VALID [2022-02-20 17:22:59,297 INFO L290 TraceCheckUtils]: 33: Hoare triple {29978#true} assume !(0 == ~cond); {29978#true} is VALID [2022-02-20 17:22:59,297 INFO L290 TraceCheckUtils]: 34: Hoare triple {29978#true} assume true; {29978#true} is VALID [2022-02-20 17:22:59,297 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {29978#true} {30039#(and (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} #99#return; {30039#(and (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:22:59,298 INFO L272 TraceCheckUtils]: 36: Hoare triple {30039#(and (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} call __VERIFIER_assert((if main_~v~0#1 == main_~b~0#1 * main_~d~0#1 then 1 else 0)); {29978#true} is VALID [2022-02-20 17:22:59,298 INFO L290 TraceCheckUtils]: 37: Hoare triple {29978#true} ~cond := #in~cond; {29978#true} is VALID [2022-02-20 17:22:59,298 INFO L290 TraceCheckUtils]: 38: Hoare triple {29978#true} assume !(0 == ~cond); {29978#true} is VALID [2022-02-20 17:22:59,298 INFO L290 TraceCheckUtils]: 39: Hoare triple {29978#true} assume true; {29978#true} is VALID [2022-02-20 17:22:59,299 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {29978#true} {30039#(and (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} #101#return; {30039#(and (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:22:59,299 INFO L290 TraceCheckUtils]: 41: Hoare triple {30039#(and (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} assume !(main_~c~0#1 >= 2 * main_~v~0#1); {30039#(and (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:22:59,300 INFO L290 TraceCheckUtils]: 42: Hoare triple {30039#(and (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} main_~c~0#1 := main_~c~0#1 - main_~v~0#1;main_~k~0#1 := main_~k~0#1 + main_~d~0#1; {30114#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) (= |ULTIMATE.start_main_~s~0#1| 1) (= (+ |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~c~0#1|) |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:22:59,300 INFO L290 TraceCheckUtils]: 43: Hoare triple {30114#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) (= |ULTIMATE.start_main_~s~0#1| 1) (= (+ |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~c~0#1|) |ULTIMATE.start_main_~x~0#1|))} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {30114#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) (= |ULTIMATE.start_main_~s~0#1| 1) (= (+ |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~c~0#1|) |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:22:59,301 INFO L290 TraceCheckUtils]: 44: Hoare triple {30114#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) (= |ULTIMATE.start_main_~s~0#1| 1) (= (+ |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~c~0#1|) |ULTIMATE.start_main_~x~0#1|))} assume !!(main_#t~post7#1 < 100);havoc main_#t~post7#1; {30114#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) (= |ULTIMATE.start_main_~s~0#1| 1) (= (+ |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~c~0#1|) |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:22:59,301 INFO L290 TraceCheckUtils]: 45: Hoare triple {30114#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) (= |ULTIMATE.start_main_~s~0#1| 1) (= (+ |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~c~0#1|) |ULTIMATE.start_main_~x~0#1|))} assume !(main_~c~0#1 >= main_~b~0#1); {30114#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) (= |ULTIMATE.start_main_~s~0#1| 1) (= (+ |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~c~0#1|) |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:22:59,302 INFO L290 TraceCheckUtils]: 46: Hoare triple {30114#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) (= |ULTIMATE.start_main_~s~0#1| 1) (= (+ |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~c~0#1|) |ULTIMATE.start_main_~x~0#1|))} main_~a~0#1 := main_~b~0#1;main_~b~0#1 := main_~c~0#1;havoc main_~temp~0#1;main_~temp~0#1 := main_~p~0#1;main_~p~0#1 := main_~q~0#1;main_~q~0#1 := main_~temp~0#1 - main_~q~0#1 * main_~k~0#1;main_~temp~0#1 := main_~r~0#1;main_~r~0#1 := main_~s~0#1;main_~s~0#1 := main_~temp~0#1 - main_~s~0#1 * main_~k~0#1; {30127#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) (= (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~s~0#1|) 0) (= (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|) 1) (= |ULTIMATE.start_main_~r~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)))} is VALID [2022-02-20 17:22:59,302 INFO L290 TraceCheckUtils]: 47: Hoare triple {30127#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) (= (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~s~0#1|) 0) (= (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|) 1) (= |ULTIMATE.start_main_~r~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {30127#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) (= (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~s~0#1|) 0) (= (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|) 1) (= |ULTIMATE.start_main_~r~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)))} is VALID [2022-02-20 17:22:59,303 INFO L290 TraceCheckUtils]: 48: Hoare triple {30127#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) (= (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~s~0#1|) 0) (= (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|) 1) (= |ULTIMATE.start_main_~r~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)))} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1; {30127#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) (= (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~s~0#1|) 0) (= (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|) 1) (= |ULTIMATE.start_main_~r~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)))} is VALID [2022-02-20 17:22:59,304 INFO L290 TraceCheckUtils]: 49: Hoare triple {30127#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) (= (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~s~0#1|) 0) (= (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|) 1) (= |ULTIMATE.start_main_~r~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)))} assume !(0 != main_~b~0#1); {30137#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) (= (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~s~0#1|) 0) (= (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|) 1) (= |ULTIMATE.start_main_~r~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:22:59,304 INFO L272 TraceCheckUtils]: 50: Hoare triple {30137#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) (= (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~s~0#1|) 0) (= (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|) 1) (= |ULTIMATE.start_main_~r~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} call __VERIFIER_assert((if main_~p~0#1 * main_~x~0#1 - main_~q~0#1 * main_~x~0#1 + main_~r~0#1 * main_~y~0#1 - main_~s~0#1 * main_~y~0#1 == main_~a~0#1 then 1 else 0)); {30141#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:22:59,305 INFO L290 TraceCheckUtils]: 51: Hoare triple {30141#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {30145#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:22:59,305 INFO L290 TraceCheckUtils]: 52: Hoare triple {30145#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29979#false} is VALID [2022-02-20 17:22:59,305 INFO L290 TraceCheckUtils]: 53: Hoare triple {29979#false} assume !false; {29979#false} is VALID [2022-02-20 17:22:59,305 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-02-20 17:22:59,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:23:06,222 INFO L290 TraceCheckUtils]: 53: Hoare triple {29979#false} assume !false; {29979#false} is VALID [2022-02-20 17:23:06,223 INFO L290 TraceCheckUtils]: 52: Hoare triple {30145#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29979#false} is VALID [2022-02-20 17:23:06,223 INFO L290 TraceCheckUtils]: 51: Hoare triple {30141#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {30145#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:23:06,224 INFO L272 TraceCheckUtils]: 50: Hoare triple {30161#(= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) (+ |ULTIMATE.start_main_~a~0#1| (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)))} call __VERIFIER_assert((if main_~p~0#1 * main_~x~0#1 - main_~q~0#1 * main_~x~0#1 + main_~r~0#1 * main_~y~0#1 - main_~s~0#1 * main_~y~0#1 == main_~a~0#1 then 1 else 0)); {30141#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:23:06,224 INFO L290 TraceCheckUtils]: 49: Hoare triple {30165#(or (not (= |ULTIMATE.start_main_~b~0#1| 0)) (= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) (+ |ULTIMATE.start_main_~a~0#1| (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|))))} assume !(0 != main_~b~0#1); {30161#(= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) (+ |ULTIMATE.start_main_~a~0#1| (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-20 17:23:06,225 INFO L290 TraceCheckUtils]: 48: Hoare triple {30165#(or (not (= |ULTIMATE.start_main_~b~0#1| 0)) (= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) (+ |ULTIMATE.start_main_~a~0#1| (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|))))} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1; {30165#(or (not (= |ULTIMATE.start_main_~b~0#1| 0)) (= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) (+ |ULTIMATE.start_main_~a~0#1| (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 17:23:06,225 INFO L290 TraceCheckUtils]: 47: Hoare triple {30165#(or (not (= |ULTIMATE.start_main_~b~0#1| 0)) (= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) (+ |ULTIMATE.start_main_~a~0#1| (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|))))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {30165#(or (not (= |ULTIMATE.start_main_~b~0#1| 0)) (= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) (+ |ULTIMATE.start_main_~a~0#1| (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 17:23:06,315 INFO L290 TraceCheckUtils]: 46: Hoare triple {30175#(or (not (= |ULTIMATE.start_main_~c~0#1| 0)) (= (+ (* (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~s~0#1|))) |ULTIMATE.start_main_~y~0#1|) (* (+ (* (- 1) |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~b~0#1|) (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|))))} main_~a~0#1 := main_~b~0#1;main_~b~0#1 := main_~c~0#1;havoc main_~temp~0#1;main_~temp~0#1 := main_~p~0#1;main_~p~0#1 := main_~q~0#1;main_~q~0#1 := main_~temp~0#1 - main_~q~0#1 * main_~k~0#1;main_~temp~0#1 := main_~r~0#1;main_~r~0#1 := main_~s~0#1;main_~s~0#1 := main_~temp~0#1 - main_~s~0#1 * main_~k~0#1; {30165#(or (not (= |ULTIMATE.start_main_~b~0#1| 0)) (= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) (+ |ULTIMATE.start_main_~a~0#1| (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 17:23:06,315 INFO L290 TraceCheckUtils]: 45: Hoare triple {30175#(or (not (= |ULTIMATE.start_main_~c~0#1| 0)) (= (+ (* (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~s~0#1|))) |ULTIMATE.start_main_~y~0#1|) (* (+ (* (- 1) |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~b~0#1|) (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|))))} assume !(main_~c~0#1 >= main_~b~0#1); {30175#(or (not (= |ULTIMATE.start_main_~c~0#1| 0)) (= (+ (* (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~s~0#1|))) |ULTIMATE.start_main_~y~0#1|) (* (+ (* (- 1) |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~b~0#1|) (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 17:23:06,316 INFO L290 TraceCheckUtils]: 44: Hoare triple {30175#(or (not (= |ULTIMATE.start_main_~c~0#1| 0)) (= (+ (* (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~s~0#1|))) |ULTIMATE.start_main_~y~0#1|) (* (+ (* (- 1) |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~b~0#1|) (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|))))} assume !!(main_#t~post7#1 < 100);havoc main_#t~post7#1; {30175#(or (not (= |ULTIMATE.start_main_~c~0#1| 0)) (= (+ (* (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~s~0#1|))) |ULTIMATE.start_main_~y~0#1|) (* (+ (* (- 1) |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~b~0#1|) (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 17:23:06,316 INFO L290 TraceCheckUtils]: 43: Hoare triple {30175#(or (not (= |ULTIMATE.start_main_~c~0#1| 0)) (= (+ (* (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~s~0#1|))) |ULTIMATE.start_main_~y~0#1|) (* (+ (* (- 1) |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~b~0#1|) (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|))))} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {30175#(or (not (= |ULTIMATE.start_main_~c~0#1| 0)) (= (+ (* (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~s~0#1|))) |ULTIMATE.start_main_~y~0#1|) (* (+ (* (- 1) |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~b~0#1|) (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 17:23:06,341 INFO L290 TraceCheckUtils]: 42: Hoare triple {30188#(or (not (= (+ (* (- 1) |ULTIMATE.start_main_~v~0#1|) |ULTIMATE.start_main_~c~0#1|) 0)) (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) (* (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~s~0#1|)))) |ULTIMATE.start_main_~b~0#1| (* |ULTIMATE.start_main_~x~0#1| (+ (* (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~k~0#1|) (- 1) |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|)))))} main_~c~0#1 := main_~c~0#1 - main_~v~0#1;main_~k~0#1 := main_~k~0#1 + main_~d~0#1; {30175#(or (not (= |ULTIMATE.start_main_~c~0#1| 0)) (= (+ (* (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~s~0#1|))) |ULTIMATE.start_main_~y~0#1|) (* (+ (* (- 1) |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~b~0#1|) (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 17:23:06,342 INFO L290 TraceCheckUtils]: 41: Hoare triple {30188#(or (not (= (+ (* (- 1) |ULTIMATE.start_main_~v~0#1|) |ULTIMATE.start_main_~c~0#1|) 0)) (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) (* (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~s~0#1|)))) |ULTIMATE.start_main_~b~0#1| (* |ULTIMATE.start_main_~x~0#1| (+ (* (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~k~0#1|) (- 1) |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|)))))} assume !(main_~c~0#1 >= 2 * main_~v~0#1); {30188#(or (not (= (+ (* (- 1) |ULTIMATE.start_main_~v~0#1|) |ULTIMATE.start_main_~c~0#1|) 0)) (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) (* (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~s~0#1|)))) |ULTIMATE.start_main_~b~0#1| (* |ULTIMATE.start_main_~x~0#1| (+ (* (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~k~0#1|) (- 1) |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|)))))} is VALID [2022-02-20 17:23:06,342 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {29978#true} {30188#(or (not (= (+ (* (- 1) |ULTIMATE.start_main_~v~0#1|) |ULTIMATE.start_main_~c~0#1|) 0)) (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) (* (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~s~0#1|)))) |ULTIMATE.start_main_~b~0#1| (* |ULTIMATE.start_main_~x~0#1| (+ (* (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~k~0#1|) (- 1) |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|)))))} #101#return; {30188#(or (not (= (+ (* (- 1) |ULTIMATE.start_main_~v~0#1|) |ULTIMATE.start_main_~c~0#1|) 0)) (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) (* (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~s~0#1|)))) |ULTIMATE.start_main_~b~0#1| (* |ULTIMATE.start_main_~x~0#1| (+ (* (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~k~0#1|) (- 1) |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|)))))} is VALID [2022-02-20 17:23:06,343 INFO L290 TraceCheckUtils]: 39: Hoare triple {29978#true} assume true; {29978#true} is VALID [2022-02-20 17:23:06,343 INFO L290 TraceCheckUtils]: 38: Hoare triple {29978#true} assume !(0 == ~cond); {29978#true} is VALID [2022-02-20 17:23:06,343 INFO L290 TraceCheckUtils]: 37: Hoare triple {29978#true} ~cond := #in~cond; {29978#true} is VALID [2022-02-20 17:23:06,343 INFO L272 TraceCheckUtils]: 36: Hoare triple {30188#(or (not (= (+ (* (- 1) |ULTIMATE.start_main_~v~0#1|) |ULTIMATE.start_main_~c~0#1|) 0)) (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) (* (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~s~0#1|)))) |ULTIMATE.start_main_~b~0#1| (* |ULTIMATE.start_main_~x~0#1| (+ (* (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~k~0#1|) (- 1) |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|)))))} call __VERIFIER_assert((if main_~v~0#1 == main_~b~0#1 * main_~d~0#1 then 1 else 0)); {29978#true} is VALID [2022-02-20 17:23:06,344 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {29978#true} {30188#(or (not (= (+ (* (- 1) |ULTIMATE.start_main_~v~0#1|) |ULTIMATE.start_main_~c~0#1|) 0)) (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) (* (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~s~0#1|)))) |ULTIMATE.start_main_~b~0#1| (* |ULTIMATE.start_main_~x~0#1| (+ (* (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~k~0#1|) (- 1) |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|)))))} #99#return; {30188#(or (not (= (+ (* (- 1) |ULTIMATE.start_main_~v~0#1|) |ULTIMATE.start_main_~c~0#1|) 0)) (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) (* (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~s~0#1|)))) |ULTIMATE.start_main_~b~0#1| (* |ULTIMATE.start_main_~x~0#1| (+ (* (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~k~0#1|) (- 1) |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|)))))} is VALID [2022-02-20 17:23:06,344 INFO L290 TraceCheckUtils]: 34: Hoare triple {29978#true} assume true; {29978#true} is VALID [2022-02-20 17:23:06,344 INFO L290 TraceCheckUtils]: 33: Hoare triple {29978#true} assume !(0 == ~cond); {29978#true} is VALID [2022-02-20 17:23:06,344 INFO L290 TraceCheckUtils]: 32: Hoare triple {29978#true} ~cond := #in~cond; {29978#true} is VALID [2022-02-20 17:23:06,344 INFO L272 TraceCheckUtils]: 31: Hoare triple {30188#(or (not (= (+ (* (- 1) |ULTIMATE.start_main_~v~0#1|) |ULTIMATE.start_main_~c~0#1|) 0)) (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) (* (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~s~0#1|)))) |ULTIMATE.start_main_~b~0#1| (* |ULTIMATE.start_main_~x~0#1| (+ (* (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~k~0#1|) (- 1) |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|)))))} call __VERIFIER_assert((if main_~a~0#1 == main_~k~0#1 * main_~b~0#1 + main_~c~0#1 then 1 else 0)); {29978#true} is VALID [2022-02-20 17:23:06,345 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {30071#(not (= |__VERIFIER_assert_#in~cond| 0))} {30225#(or (not (= (+ (* (- 1) |ULTIMATE.start_main_~v~0#1|) |ULTIMATE.start_main_~c~0#1|) 0)) (not (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)) (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) (* (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~s~0#1|)))) |ULTIMATE.start_main_~b~0#1| (* |ULTIMATE.start_main_~x~0#1| (+ (* (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~k~0#1|) (- 1) |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|)))))} #97#return; {30188#(or (not (= (+ (* (- 1) |ULTIMATE.start_main_~v~0#1|) |ULTIMATE.start_main_~c~0#1|) 0)) (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) (* (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~s~0#1|)))) |ULTIMATE.start_main_~b~0#1| (* |ULTIMATE.start_main_~x~0#1| (+ (* (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~k~0#1|) (- 1) |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|)))))} is VALID [2022-02-20 17:23:06,345 INFO L290 TraceCheckUtils]: 29: Hoare triple {30071#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {30071#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:23:06,346 INFO L290 TraceCheckUtils]: 28: Hoare triple {30235#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {30071#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:23:06,346 INFO L290 TraceCheckUtils]: 27: Hoare triple {29978#true} ~cond := #in~cond; {30235#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:23:06,346 INFO L272 TraceCheckUtils]: 26: Hoare triple {30225#(or (not (= (+ (* (- 1) |ULTIMATE.start_main_~v~0#1|) |ULTIMATE.start_main_~c~0#1|) 0)) (not (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)) (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) (* (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~s~0#1|)))) |ULTIMATE.start_main_~b~0#1| (* |ULTIMATE.start_main_~x~0#1| (+ (* (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~k~0#1|) (- 1) |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|)))))} call __VERIFIER_assert((if main_~b~0#1 == main_~x~0#1 * main_~q~0#1 + main_~y~0#1 * main_~s~0#1 then 1 else 0)); {29978#true} is VALID [2022-02-20 17:23:06,347 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {29978#true} {30225#(or (not (= (+ (* (- 1) |ULTIMATE.start_main_~v~0#1|) |ULTIMATE.start_main_~c~0#1|) 0)) (not (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)) (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) (* (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~s~0#1|)))) |ULTIMATE.start_main_~b~0#1| (* |ULTIMATE.start_main_~x~0#1| (+ (* (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~k~0#1|) (- 1) |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|)))))} #95#return; {30225#(or (not (= (+ (* (- 1) |ULTIMATE.start_main_~v~0#1|) |ULTIMATE.start_main_~c~0#1|) 0)) (not (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)) (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) (* (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~s~0#1|)))) |ULTIMATE.start_main_~b~0#1| (* |ULTIMATE.start_main_~x~0#1| (+ (* (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~k~0#1|) (- 1) |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|)))))} is VALID [2022-02-20 17:23:06,347 INFO L290 TraceCheckUtils]: 24: Hoare triple {29978#true} assume true; {29978#true} is VALID [2022-02-20 17:23:06,347 INFO L290 TraceCheckUtils]: 23: Hoare triple {29978#true} assume !(0 == ~cond); {29978#true} is VALID [2022-02-20 17:23:06,347 INFO L290 TraceCheckUtils]: 22: Hoare triple {29978#true} ~cond := #in~cond; {29978#true} is VALID [2022-02-20 17:23:06,347 INFO L272 TraceCheckUtils]: 21: Hoare triple {30225#(or (not (= (+ (* (- 1) |ULTIMATE.start_main_~v~0#1|) |ULTIMATE.start_main_~c~0#1|) 0)) (not (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)) (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) (* (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~s~0#1|)))) |ULTIMATE.start_main_~b~0#1| (* |ULTIMATE.start_main_~x~0#1| (+ (* (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~k~0#1|) (- 1) |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|)))))} call __VERIFIER_assert((if main_~a~0#1 == main_~y~0#1 * main_~r~0#1 + main_~x~0#1 * main_~p~0#1 then 1 else 0)); {29978#true} is VALID [2022-02-20 17:23:06,348 INFO L290 TraceCheckUtils]: 20: Hoare triple {30225#(or (not (= (+ (* (- 1) |ULTIMATE.start_main_~v~0#1|) |ULTIMATE.start_main_~c~0#1|) 0)) (not (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)) (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) (* (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~s~0#1|)))) |ULTIMATE.start_main_~b~0#1| (* |ULTIMATE.start_main_~x~0#1| (+ (* (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~k~0#1|) (- 1) |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|)))))} assume !!(main_#t~post8#1 < 100);havoc main_#t~post8#1; {30225#(or (not (= (+ (* (- 1) |ULTIMATE.start_main_~v~0#1|) |ULTIMATE.start_main_~c~0#1|) 0)) (not (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)) (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) (* (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~s~0#1|)))) |ULTIMATE.start_main_~b~0#1| (* |ULTIMATE.start_main_~x~0#1| (+ (* (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~k~0#1|) (- 1) |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|)))))} is VALID [2022-02-20 17:23:06,348 INFO L290 TraceCheckUtils]: 19: Hoare triple {30225#(or (not (= (+ (* (- 1) |ULTIMATE.start_main_~v~0#1|) |ULTIMATE.start_main_~c~0#1|) 0)) (not (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)) (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) (* (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~s~0#1|)))) |ULTIMATE.start_main_~b~0#1| (* |ULTIMATE.start_main_~x~0#1| (+ (* (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~k~0#1|) (- 1) |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|)))))} main_#t~post8#1 := ~counter~0;~counter~0 := 1 + main_#t~post8#1; {30225#(or (not (= (+ (* (- 1) |ULTIMATE.start_main_~v~0#1|) |ULTIMATE.start_main_~c~0#1|) 0)) (not (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)) (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) (* (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~s~0#1|)))) |ULTIMATE.start_main_~b~0#1| (* |ULTIMATE.start_main_~x~0#1| (+ (* (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~k~0#1|) (- 1) |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|)))))} is VALID [2022-02-20 17:23:06,349 INFO L290 TraceCheckUtils]: 18: Hoare triple {30263#(or (= (+ (* |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~p~0#1| (* (+ |ULTIMATE.start_main_~k~0#1| 1) (- 1) |ULTIMATE.start_main_~q~0#1|))) (* |ULTIMATE.start_main_~y~0#1| (+ (* (- 1) (* (+ |ULTIMATE.start_main_~k~0#1| 1) |ULTIMATE.start_main_~s~0#1|)) |ULTIMATE.start_main_~r~0#1|)) |ULTIMATE.start_main_~b~0#1|) (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|))) (not (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~c~0#1|)) (not (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)))} assume !!(main_~c~0#1 >= main_~b~0#1);havoc main_~d~0#1;havoc main_~v~0#1;main_~d~0#1 := 1;main_~v~0#1 := main_~b~0#1; {30225#(or (not (= (+ (* (- 1) |ULTIMATE.start_main_~v~0#1|) |ULTIMATE.start_main_~c~0#1|) 0)) (not (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)) (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) (* (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~s~0#1|)))) |ULTIMATE.start_main_~b~0#1| (* |ULTIMATE.start_main_~x~0#1| (+ (* (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~k~0#1|) (- 1) |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|)))))} is VALID [2022-02-20 17:23:06,350 INFO L290 TraceCheckUtils]: 17: Hoare triple {30263#(or (= (+ (* |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~p~0#1| (* (+ |ULTIMATE.start_main_~k~0#1| 1) (- 1) |ULTIMATE.start_main_~q~0#1|))) (* |ULTIMATE.start_main_~y~0#1| (+ (* (- 1) (* (+ |ULTIMATE.start_main_~k~0#1| 1) |ULTIMATE.start_main_~s~0#1|)) |ULTIMATE.start_main_~r~0#1|)) |ULTIMATE.start_main_~b~0#1|) (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|))) (not (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~c~0#1|)) (not (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)))} assume !!(main_#t~post7#1 < 100);havoc main_#t~post7#1; {30263#(or (= (+ (* |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~p~0#1| (* (+ |ULTIMATE.start_main_~k~0#1| 1) (- 1) |ULTIMATE.start_main_~q~0#1|))) (* |ULTIMATE.start_main_~y~0#1| (+ (* (- 1) (* (+ |ULTIMATE.start_main_~k~0#1| 1) |ULTIMATE.start_main_~s~0#1|)) |ULTIMATE.start_main_~r~0#1|)) |ULTIMATE.start_main_~b~0#1|) (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|))) (not (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~c~0#1|)) (not (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)))} is VALID [2022-02-20 17:23:06,351 INFO L290 TraceCheckUtils]: 16: Hoare triple {30263#(or (= (+ (* |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~p~0#1| (* (+ |ULTIMATE.start_main_~k~0#1| 1) (- 1) |ULTIMATE.start_main_~q~0#1|))) (* |ULTIMATE.start_main_~y~0#1| (+ (* (- 1) (* (+ |ULTIMATE.start_main_~k~0#1| 1) |ULTIMATE.start_main_~s~0#1|)) |ULTIMATE.start_main_~r~0#1|)) |ULTIMATE.start_main_~b~0#1|) (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|))) (not (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~c~0#1|)) (not (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)))} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {30263#(or (= (+ (* |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~p~0#1| (* (+ |ULTIMATE.start_main_~k~0#1| 1) (- 1) |ULTIMATE.start_main_~q~0#1|))) (* |ULTIMATE.start_main_~y~0#1| (+ (* (- 1) (* (+ |ULTIMATE.start_main_~k~0#1| 1) |ULTIMATE.start_main_~s~0#1|)) |ULTIMATE.start_main_~r~0#1|)) |ULTIMATE.start_main_~b~0#1|) (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|))) (not (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~c~0#1|)) (not (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)))} is VALID [2022-02-20 17:23:06,351 INFO L290 TraceCheckUtils]: 15: Hoare triple {30273#(or (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) (+ |ULTIMATE.start_main_~b~0#1| (* (+ (* (- 1) |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~x~0#1|) (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) |ULTIMATE.start_main_~s~0#1|))))) (not (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)) (not (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)))} assume !!(0 != main_~b~0#1);havoc main_~c~0#1;havoc main_~k~0#1;main_~c~0#1 := main_~a~0#1;main_~k~0#1 := 0; {30263#(or (= (+ (* |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~p~0#1| (* (+ |ULTIMATE.start_main_~k~0#1| 1) (- 1) |ULTIMATE.start_main_~q~0#1|))) (* |ULTIMATE.start_main_~y~0#1| (+ (* (- 1) (* (+ |ULTIMATE.start_main_~k~0#1| 1) |ULTIMATE.start_main_~s~0#1|)) |ULTIMATE.start_main_~r~0#1|)) |ULTIMATE.start_main_~b~0#1|) (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|))) (not (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~c~0#1|)) (not (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)))} is VALID [2022-02-20 17:23:06,352 INFO L290 TraceCheckUtils]: 14: Hoare triple {30273#(or (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) (+ |ULTIMATE.start_main_~b~0#1| (* (+ (* (- 1) |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~x~0#1|) (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) |ULTIMATE.start_main_~s~0#1|))))) (not (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)) (not (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)))} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1; {30273#(or (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) (+ |ULTIMATE.start_main_~b~0#1| (* (+ (* (- 1) |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~x~0#1|) (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) |ULTIMATE.start_main_~s~0#1|))))) (not (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)) (not (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)))} is VALID [2022-02-20 17:23:06,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {30273#(or (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) (+ |ULTIMATE.start_main_~b~0#1| (* (+ (* (- 1) |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~x~0#1|) (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) |ULTIMATE.start_main_~s~0#1|))))) (not (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)) (not (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {30273#(or (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) (+ |ULTIMATE.start_main_~b~0#1| (* (+ (* (- 1) |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~x~0#1|) (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) |ULTIMATE.start_main_~s~0#1|))))) (not (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)) (not (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)))} is VALID [2022-02-20 17:23:06,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {29978#true} main_~a~0#1 := main_~x~0#1;main_~b~0#1 := main_~y~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0;main_~r~0#1 := 0;main_~s~0#1 := 1; {30273#(or (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) (+ |ULTIMATE.start_main_~b~0#1| (* (+ (* (- 1) |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~x~0#1|) (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) |ULTIMATE.start_main_~s~0#1|))))) (not (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)) (not (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)))} is VALID [2022-02-20 17:23:06,353 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {29978#true} {29978#true} #93#return; {29978#true} is VALID [2022-02-20 17:23:06,353 INFO L290 TraceCheckUtils]: 10: Hoare triple {29978#true} assume true; {29978#true} is VALID [2022-02-20 17:23:06,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {29978#true} assume !(0 == ~cond); {29978#true} is VALID [2022-02-20 17:23:06,353 INFO L290 TraceCheckUtils]: 8: Hoare triple {29978#true} ~cond := #in~cond; {29978#true} is VALID [2022-02-20 17:23:06,353 INFO L272 TraceCheckUtils]: 7: Hoare triple {29978#true} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {29978#true} is VALID [2022-02-20 17:23:06,353 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {29978#true} {29978#true} #91#return; {29978#true} is VALID [2022-02-20 17:23:06,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {29978#true} assume true; {29978#true} is VALID [2022-02-20 17:23:06,353 INFO L290 TraceCheckUtils]: 4: Hoare triple {29978#true} assume !(0 == ~cond); {29978#true} is VALID [2022-02-20 17:23:06,353 INFO L290 TraceCheckUtils]: 3: Hoare triple {29978#true} ~cond := #in~cond; {29978#true} is VALID [2022-02-20 17:23:06,353 INFO L272 TraceCheckUtils]: 2: Hoare triple {29978#true} call assume_abort_if_not((if main_~x~0#1 >= 1 then 1 else 0)); {29978#true} is VALID [2022-02-20 17:23:06,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {29978#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~post8#1, main_~d~0#1, main_~v~0#1, main_#t~post7#1, main_~c~0#1, main_~k~0#1, main_~temp~0#1, main_#t~post6#1, main_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~s~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~s~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {29978#true} is VALID [2022-02-20 17:23:06,354 INFO L290 TraceCheckUtils]: 0: Hoare triple {29978#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {29978#true} is VALID [2022-02-20 17:23:06,354 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-02-20 17:23:06,354 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:23:06,354 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65010244] [2022-02-20 17:23:06,354 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:23:06,354 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414244201] [2022-02-20 17:23:06,354 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414244201] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:23:06,354 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:23:06,355 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 20 [2022-02-20 17:23:06,355 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351750620] [2022-02-20 17:23:06,355 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:23:06,355 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 54 [2022-02-20 17:23:06,355 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:23:06,355 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-02-20 17:23:06,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:23:06,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-20 17:23:06,520 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:23:06,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-20 17:23:06,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2022-02-20 17:23:06,521 INFO L87 Difference]: Start difference. First operand 991 states and 1404 transitions. Second operand has 20 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-02-20 17:23:22,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:23:22,168 INFO L93 Difference]: Finished difference Result 1352 states and 1914 transitions. [2022-02-20 17:23:22,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 17:23:22,168 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 54 [2022-02-20 17:23:22,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:23:22,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-02-20 17:23:22,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 323 transitions. [2022-02-20 17:23:22,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-02-20 17:23:22,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 323 transitions. [2022-02-20 17:23:22,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 323 transitions. [2022-02-20 17:23:25,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 323 edges. 323 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:23:25,859 INFO L225 Difference]: With dead ends: 1352 [2022-02-20 17:23:25,860 INFO L226 Difference]: Without dead ends: 1344 [2022-02-20 17:23:25,861 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=320, Invalid=1486, Unknown=0, NotChecked=0, Total=1806 [2022-02-20 17:23:25,861 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 215 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 1107 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 1402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 1107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:23:25,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 709 Invalid, 1402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 1107 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2022-02-20 17:23:25,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2022-02-20 17:23:28,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 1194. [2022-02-20 17:23:28,609 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:23:28,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1344 states. Second operand has 1194 states, 812 states have (on average 1.293103448275862) internal successors, (1050), 837 states have internal predecessors, (1050), 310 states have call successors, (310), 71 states have call predecessors, (310), 71 states have return successors, (306), 285 states have call predecessors, (306), 306 states have call successors, (306) [2022-02-20 17:23:28,613 INFO L74 IsIncluded]: Start isIncluded. First operand 1344 states. Second operand has 1194 states, 812 states have (on average 1.293103448275862) internal successors, (1050), 837 states have internal predecessors, (1050), 310 states have call successors, (310), 71 states have call predecessors, (310), 71 states have return successors, (306), 285 states have call predecessors, (306), 306 states have call successors, (306) [2022-02-20 17:23:28,615 INFO L87 Difference]: Start difference. First operand 1344 states. Second operand has 1194 states, 812 states have (on average 1.293103448275862) internal successors, (1050), 837 states have internal predecessors, (1050), 310 states have call successors, (310), 71 states have call predecessors, (310), 71 states have return successors, (306), 285 states have call predecessors, (306), 306 states have call successors, (306) [2022-02-20 17:23:28,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:23:28,702 INFO L93 Difference]: Finished difference Result 1344 states and 1890 transitions. [2022-02-20 17:23:28,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 1890 transitions. [2022-02-20 17:23:28,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:23:28,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:23:28,709 INFO L74 IsIncluded]: Start isIncluded. First operand has 1194 states, 812 states have (on average 1.293103448275862) internal successors, (1050), 837 states have internal predecessors, (1050), 310 states have call successors, (310), 71 states have call predecessors, (310), 71 states have return successors, (306), 285 states have call predecessors, (306), 306 states have call successors, (306) Second operand 1344 states. [2022-02-20 17:23:28,710 INFO L87 Difference]: Start difference. First operand has 1194 states, 812 states have (on average 1.293103448275862) internal successors, (1050), 837 states have internal predecessors, (1050), 310 states have call successors, (310), 71 states have call predecessors, (310), 71 states have return successors, (306), 285 states have call predecessors, (306), 306 states have call successors, (306) Second operand 1344 states. [2022-02-20 17:23:28,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:23:28,766 INFO L93 Difference]: Finished difference Result 1344 states and 1890 transitions. [2022-02-20 17:23:28,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 1890 transitions. [2022-02-20 17:23:28,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:23:28,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:23:28,770 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:23:28,770 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:23:28,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1194 states, 812 states have (on average 1.293103448275862) internal successors, (1050), 837 states have internal predecessors, (1050), 310 states have call successors, (310), 71 states have call predecessors, (310), 71 states have return successors, (306), 285 states have call predecessors, (306), 306 states have call successors, (306) [2022-02-20 17:23:28,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1666 transitions. [2022-02-20 17:23:28,832 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 1666 transitions. Word has length 54 [2022-02-20 17:23:28,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:23:28,833 INFO L470 AbstractCegarLoop]: Abstraction has 1194 states and 1666 transitions. [2022-02-20 17:23:28,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-02-20 17:23:28,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1666 transitions. [2022-02-20 17:23:28,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-02-20 17:23:28,833 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:23:28,834 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:23:28,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-02-20 17:23:29,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-02-20 17:23:29,047 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:23:29,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:23:29,048 INFO L85 PathProgramCache]: Analyzing trace with hash -2108492507, now seen corresponding path program 1 times [2022-02-20 17:23:29,048 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:23:29,048 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67810611] [2022-02-20 17:23:29,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:23:29,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:23:29,062 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:23:29,064 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1645517541] [2022-02-20 17:23:29,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:23:29,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:23:29,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:23:29,066 INFO L229 MonitoredProcess]: Starting monitored process 18 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:23:29,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-02-20 17:23:29,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:23:29,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 17:23:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:23:29,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:23:29,494 INFO L290 TraceCheckUtils]: 0: Hoare triple {36819#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {36824#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:29,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {36824#(<= ~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~post8#1, main_~d~0#1, main_~v~0#1, main_#t~post7#1, main_~c~0#1, main_~k~0#1, main_~temp~0#1, main_#t~post6#1, main_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~s~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~s~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {36824#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:29,495 INFO L272 TraceCheckUtils]: 2: Hoare triple {36824#(<= ~counter~0 0)} call assume_abort_if_not((if main_~x~0#1 >= 1 then 1 else 0)); {36824#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:29,496 INFO L290 TraceCheckUtils]: 3: Hoare triple {36824#(<= ~counter~0 0)} ~cond := #in~cond; {36824#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:29,496 INFO L290 TraceCheckUtils]: 4: Hoare triple {36824#(<= ~counter~0 0)} assume !(0 == ~cond); {36824#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:29,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {36824#(<= ~counter~0 0)} assume true; {36824#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:29,497 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {36824#(<= ~counter~0 0)} {36824#(<= ~counter~0 0)} #91#return; {36824#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:29,498 INFO L272 TraceCheckUtils]: 7: Hoare triple {36824#(<= ~counter~0 0)} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {36824#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:29,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {36824#(<= ~counter~0 0)} ~cond := #in~cond; {36824#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:29,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {36824#(<= ~counter~0 0)} assume !(0 == ~cond); {36824#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:29,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {36824#(<= ~counter~0 0)} assume true; {36824#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:29,499 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {36824#(<= ~counter~0 0)} {36824#(<= ~counter~0 0)} #93#return; {36824#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:29,500 INFO L290 TraceCheckUtils]: 12: Hoare triple {36824#(<= ~counter~0 0)} main_~a~0#1 := main_~x~0#1;main_~b~0#1 := main_~y~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0;main_~r~0#1 := 0;main_~s~0#1 := 1; {36824#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:29,500 INFO L290 TraceCheckUtils]: 13: Hoare triple {36824#(<= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {36864#(<= ~counter~0 1)} is VALID [2022-02-20 17:23:29,501 INFO L290 TraceCheckUtils]: 14: Hoare triple {36864#(<= ~counter~0 1)} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1; {36864#(<= ~counter~0 1)} is VALID [2022-02-20 17:23:29,501 INFO L290 TraceCheckUtils]: 15: Hoare triple {36864#(<= ~counter~0 1)} assume !!(0 != main_~b~0#1);havoc main_~c~0#1;havoc main_~k~0#1;main_~c~0#1 := main_~a~0#1;main_~k~0#1 := 0; {36864#(<= ~counter~0 1)} is VALID [2022-02-20 17:23:29,502 INFO L290 TraceCheckUtils]: 16: Hoare triple {36864#(<= ~counter~0 1)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {36874#(<= ~counter~0 2)} is VALID [2022-02-20 17:23:29,502 INFO L290 TraceCheckUtils]: 17: Hoare triple {36874#(<= ~counter~0 2)} assume !!(main_#t~post7#1 < 100);havoc main_#t~post7#1; {36874#(<= ~counter~0 2)} is VALID [2022-02-20 17:23:29,502 INFO L290 TraceCheckUtils]: 18: Hoare triple {36874#(<= ~counter~0 2)} assume !(main_~c~0#1 >= main_~b~0#1); {36874#(<= ~counter~0 2)} is VALID [2022-02-20 17:23:29,503 INFO L290 TraceCheckUtils]: 19: Hoare triple {36874#(<= ~counter~0 2)} main_~a~0#1 := main_~b~0#1;main_~b~0#1 := main_~c~0#1;havoc main_~temp~0#1;main_~temp~0#1 := main_~p~0#1;main_~p~0#1 := main_~q~0#1;main_~q~0#1 := main_~temp~0#1 - main_~q~0#1 * main_~k~0#1;main_~temp~0#1 := main_~r~0#1;main_~r~0#1 := main_~s~0#1;main_~s~0#1 := main_~temp~0#1 - main_~s~0#1 * main_~k~0#1; {36874#(<= ~counter~0 2)} is VALID [2022-02-20 17:23:29,503 INFO L290 TraceCheckUtils]: 20: Hoare triple {36874#(<= ~counter~0 2)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {36887#(<= ~counter~0 3)} is VALID [2022-02-20 17:23:29,504 INFO L290 TraceCheckUtils]: 21: Hoare triple {36887#(<= ~counter~0 3)} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1; {36887#(<= ~counter~0 3)} is VALID [2022-02-20 17:23:29,504 INFO L290 TraceCheckUtils]: 22: Hoare triple {36887#(<= ~counter~0 3)} assume !!(0 != main_~b~0#1);havoc main_~c~0#1;havoc main_~k~0#1;main_~c~0#1 := main_~a~0#1;main_~k~0#1 := 0; {36887#(<= ~counter~0 3)} is VALID [2022-02-20 17:23:29,505 INFO L290 TraceCheckUtils]: 23: Hoare triple {36887#(<= ~counter~0 3)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {36897#(<= ~counter~0 4)} is VALID [2022-02-20 17:23:29,505 INFO L290 TraceCheckUtils]: 24: Hoare triple {36897#(<= ~counter~0 4)} assume !!(main_#t~post7#1 < 100);havoc main_#t~post7#1; {36897#(<= ~counter~0 4)} is VALID [2022-02-20 17:23:29,505 INFO L290 TraceCheckUtils]: 25: Hoare triple {36897#(<= ~counter~0 4)} assume !!(main_~c~0#1 >= main_~b~0#1);havoc main_~d~0#1;havoc main_~v~0#1;main_~d~0#1 := 1;main_~v~0#1 := main_~b~0#1; {36897#(<= ~counter~0 4)} is VALID [2022-02-20 17:23:29,506 INFO L290 TraceCheckUtils]: 26: Hoare triple {36897#(<= ~counter~0 4)} main_#t~post8#1 := ~counter~0;~counter~0 := 1 + main_#t~post8#1; {36907#(<= ~counter~0 5)} is VALID [2022-02-20 17:23:29,506 INFO L290 TraceCheckUtils]: 27: Hoare triple {36907#(<= ~counter~0 5)} assume !!(main_#t~post8#1 < 100);havoc main_#t~post8#1; {36907#(<= ~counter~0 5)} is VALID [2022-02-20 17:23:29,507 INFO L272 TraceCheckUtils]: 28: Hoare triple {36907#(<= ~counter~0 5)} call __VERIFIER_assert((if main_~a~0#1 == main_~y~0#1 * main_~r~0#1 + main_~x~0#1 * main_~p~0#1 then 1 else 0)); {36907#(<= ~counter~0 5)} is VALID [2022-02-20 17:23:29,507 INFO L290 TraceCheckUtils]: 29: Hoare triple {36907#(<= ~counter~0 5)} ~cond := #in~cond; {36907#(<= ~counter~0 5)} is VALID [2022-02-20 17:23:29,508 INFO L290 TraceCheckUtils]: 30: Hoare triple {36907#(<= ~counter~0 5)} assume !(0 == ~cond); {36907#(<= ~counter~0 5)} is VALID [2022-02-20 17:23:29,508 INFO L290 TraceCheckUtils]: 31: Hoare triple {36907#(<= ~counter~0 5)} assume true; {36907#(<= ~counter~0 5)} is VALID [2022-02-20 17:23:29,509 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {36907#(<= ~counter~0 5)} {36907#(<= ~counter~0 5)} #95#return; {36907#(<= ~counter~0 5)} is VALID [2022-02-20 17:23:29,509 INFO L272 TraceCheckUtils]: 33: Hoare triple {36907#(<= ~counter~0 5)} call __VERIFIER_assert((if main_~b~0#1 == main_~x~0#1 * main_~q~0#1 + main_~y~0#1 * main_~s~0#1 then 1 else 0)); {36907#(<= ~counter~0 5)} is VALID [2022-02-20 17:23:29,510 INFO L290 TraceCheckUtils]: 34: Hoare triple {36907#(<= ~counter~0 5)} ~cond := #in~cond; {36907#(<= ~counter~0 5)} is VALID [2022-02-20 17:23:29,510 INFO L290 TraceCheckUtils]: 35: Hoare triple {36907#(<= ~counter~0 5)} assume !(0 == ~cond); {36907#(<= ~counter~0 5)} is VALID [2022-02-20 17:23:29,510 INFO L290 TraceCheckUtils]: 36: Hoare triple {36907#(<= ~counter~0 5)} assume true; {36907#(<= ~counter~0 5)} is VALID [2022-02-20 17:23:29,511 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {36907#(<= ~counter~0 5)} {36907#(<= ~counter~0 5)} #97#return; {36907#(<= ~counter~0 5)} is VALID [2022-02-20 17:23:29,512 INFO L272 TraceCheckUtils]: 38: Hoare triple {36907#(<= ~counter~0 5)} call __VERIFIER_assert((if main_~a~0#1 == main_~k~0#1 * main_~b~0#1 + main_~c~0#1 then 1 else 0)); {36907#(<= ~counter~0 5)} is VALID [2022-02-20 17:23:29,512 INFO L290 TraceCheckUtils]: 39: Hoare triple {36907#(<= ~counter~0 5)} ~cond := #in~cond; {36907#(<= ~counter~0 5)} is VALID [2022-02-20 17:23:29,513 INFO L290 TraceCheckUtils]: 40: Hoare triple {36907#(<= ~counter~0 5)} assume !(0 == ~cond); {36907#(<= ~counter~0 5)} is VALID [2022-02-20 17:23:29,513 INFO L290 TraceCheckUtils]: 41: Hoare triple {36907#(<= ~counter~0 5)} assume true; {36907#(<= ~counter~0 5)} is VALID [2022-02-20 17:23:29,514 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {36907#(<= ~counter~0 5)} {36907#(<= ~counter~0 5)} #99#return; {36907#(<= ~counter~0 5)} is VALID [2022-02-20 17:23:29,514 INFO L272 TraceCheckUtils]: 43: Hoare triple {36907#(<= ~counter~0 5)} call __VERIFIER_assert((if main_~v~0#1 == main_~b~0#1 * main_~d~0#1 then 1 else 0)); {36907#(<= ~counter~0 5)} is VALID [2022-02-20 17:23:29,514 INFO L290 TraceCheckUtils]: 44: Hoare triple {36907#(<= ~counter~0 5)} ~cond := #in~cond; {36907#(<= ~counter~0 5)} is VALID [2022-02-20 17:23:29,515 INFO L290 TraceCheckUtils]: 45: Hoare triple {36907#(<= ~counter~0 5)} assume !(0 == ~cond); {36907#(<= ~counter~0 5)} is VALID [2022-02-20 17:23:29,515 INFO L290 TraceCheckUtils]: 46: Hoare triple {36907#(<= ~counter~0 5)} assume true; {36907#(<= ~counter~0 5)} is VALID [2022-02-20 17:23:29,516 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {36907#(<= ~counter~0 5)} {36907#(<= ~counter~0 5)} #101#return; {36907#(<= ~counter~0 5)} is VALID [2022-02-20 17:23:29,516 INFO L290 TraceCheckUtils]: 48: Hoare triple {36907#(<= ~counter~0 5)} assume !(main_~c~0#1 >= 2 * main_~v~0#1); {36907#(<= ~counter~0 5)} is VALID [2022-02-20 17:23:29,516 INFO L290 TraceCheckUtils]: 49: Hoare triple {36907#(<= ~counter~0 5)} main_~c~0#1 := main_~c~0#1 - main_~v~0#1;main_~k~0#1 := main_~k~0#1 + main_~d~0#1; {36907#(<= ~counter~0 5)} is VALID [2022-02-20 17:23:29,517 INFO L290 TraceCheckUtils]: 50: Hoare triple {36907#(<= ~counter~0 5)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {36980#(<= ~counter~0 6)} is VALID [2022-02-20 17:23:29,517 INFO L290 TraceCheckUtils]: 51: Hoare triple {36980#(<= ~counter~0 6)} assume !!(main_#t~post7#1 < 100);havoc main_#t~post7#1; {36980#(<= ~counter~0 6)} is VALID [2022-02-20 17:23:29,517 INFO L290 TraceCheckUtils]: 52: Hoare triple {36980#(<= ~counter~0 6)} assume !(main_~c~0#1 >= main_~b~0#1); {36980#(<= ~counter~0 6)} is VALID [2022-02-20 17:23:29,518 INFO L290 TraceCheckUtils]: 53: Hoare triple {36980#(<= ~counter~0 6)} main_~a~0#1 := main_~b~0#1;main_~b~0#1 := main_~c~0#1;havoc main_~temp~0#1;main_~temp~0#1 := main_~p~0#1;main_~p~0#1 := main_~q~0#1;main_~q~0#1 := main_~temp~0#1 - main_~q~0#1 * main_~k~0#1;main_~temp~0#1 := main_~r~0#1;main_~r~0#1 := main_~s~0#1;main_~s~0#1 := main_~temp~0#1 - main_~s~0#1 * main_~k~0#1; {36980#(<= ~counter~0 6)} is VALID [2022-02-20 17:23:29,518 INFO L290 TraceCheckUtils]: 54: Hoare triple {36980#(<= ~counter~0 6)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {36993#(<= |ULTIMATE.start_main_#t~post6#1| 6)} is VALID [2022-02-20 17:23:29,519 INFO L290 TraceCheckUtils]: 55: Hoare triple {36993#(<= |ULTIMATE.start_main_#t~post6#1| 6)} assume !(main_#t~post6#1 < 100);havoc main_#t~post6#1; {36820#false} is VALID [2022-02-20 17:23:29,519 INFO L272 TraceCheckUtils]: 56: Hoare triple {36820#false} call __VERIFIER_assert((if main_~p~0#1 * main_~x~0#1 - main_~q~0#1 * main_~x~0#1 + main_~r~0#1 * main_~y~0#1 - main_~s~0#1 * main_~y~0#1 == main_~a~0#1 then 1 else 0)); {36820#false} is VALID [2022-02-20 17:23:29,519 INFO L290 TraceCheckUtils]: 57: Hoare triple {36820#false} ~cond := #in~cond; {36820#false} is VALID [2022-02-20 17:23:29,519 INFO L290 TraceCheckUtils]: 58: Hoare triple {36820#false} assume 0 == ~cond; {36820#false} is VALID [2022-02-20 17:23:29,519 INFO L290 TraceCheckUtils]: 59: Hoare triple {36820#false} assume !false; {36820#false} is VALID [2022-02-20 17:23:29,519 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-02-20 17:23:29,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:23:29,868 INFO L290 TraceCheckUtils]: 59: Hoare triple {36820#false} assume !false; {36820#false} is VALID [2022-02-20 17:23:29,868 INFO L290 TraceCheckUtils]: 58: Hoare triple {36820#false} assume 0 == ~cond; {36820#false} is VALID [2022-02-20 17:23:29,868 INFO L290 TraceCheckUtils]: 57: Hoare triple {36820#false} ~cond := #in~cond; {36820#false} is VALID [2022-02-20 17:23:29,868 INFO L272 TraceCheckUtils]: 56: Hoare triple {36820#false} call __VERIFIER_assert((if main_~p~0#1 * main_~x~0#1 - main_~q~0#1 * main_~x~0#1 + main_~r~0#1 * main_~y~0#1 - main_~s~0#1 * main_~y~0#1 == main_~a~0#1 then 1 else 0)); {36820#false} is VALID [2022-02-20 17:23:29,869 INFO L290 TraceCheckUtils]: 55: Hoare triple {37021#(< |ULTIMATE.start_main_#t~post6#1| 100)} assume !(main_#t~post6#1 < 100);havoc main_#t~post6#1; {36820#false} is VALID [2022-02-20 17:23:29,869 INFO L290 TraceCheckUtils]: 54: Hoare triple {37025#(< ~counter~0 100)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {37021#(< |ULTIMATE.start_main_#t~post6#1| 100)} is VALID [2022-02-20 17:23:29,869 INFO L290 TraceCheckUtils]: 53: Hoare triple {37025#(< ~counter~0 100)} main_~a~0#1 := main_~b~0#1;main_~b~0#1 := main_~c~0#1;havoc main_~temp~0#1;main_~temp~0#1 := main_~p~0#1;main_~p~0#1 := main_~q~0#1;main_~q~0#1 := main_~temp~0#1 - main_~q~0#1 * main_~k~0#1;main_~temp~0#1 := main_~r~0#1;main_~r~0#1 := main_~s~0#1;main_~s~0#1 := main_~temp~0#1 - main_~s~0#1 * main_~k~0#1; {37025#(< ~counter~0 100)} is VALID [2022-02-20 17:23:29,870 INFO L290 TraceCheckUtils]: 52: Hoare triple {37025#(< ~counter~0 100)} assume !(main_~c~0#1 >= main_~b~0#1); {37025#(< ~counter~0 100)} is VALID [2022-02-20 17:23:29,870 INFO L290 TraceCheckUtils]: 51: Hoare triple {37025#(< ~counter~0 100)} assume !!(main_#t~post7#1 < 100);havoc main_#t~post7#1; {37025#(< ~counter~0 100)} is VALID [2022-02-20 17:23:29,871 INFO L290 TraceCheckUtils]: 50: Hoare triple {37038#(< ~counter~0 99)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {37025#(< ~counter~0 100)} is VALID [2022-02-20 17:23:29,871 INFO L290 TraceCheckUtils]: 49: Hoare triple {37038#(< ~counter~0 99)} main_~c~0#1 := main_~c~0#1 - main_~v~0#1;main_~k~0#1 := main_~k~0#1 + main_~d~0#1; {37038#(< ~counter~0 99)} is VALID [2022-02-20 17:23:29,872 INFO L290 TraceCheckUtils]: 48: Hoare triple {37038#(< ~counter~0 99)} assume !(main_~c~0#1 >= 2 * main_~v~0#1); {37038#(< ~counter~0 99)} is VALID [2022-02-20 17:23:29,872 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {36819#true} {37038#(< ~counter~0 99)} #101#return; {37038#(< ~counter~0 99)} is VALID [2022-02-20 17:23:29,872 INFO L290 TraceCheckUtils]: 46: Hoare triple {36819#true} assume true; {36819#true} is VALID [2022-02-20 17:23:29,872 INFO L290 TraceCheckUtils]: 45: Hoare triple {36819#true} assume !(0 == ~cond); {36819#true} is VALID [2022-02-20 17:23:29,872 INFO L290 TraceCheckUtils]: 44: Hoare triple {36819#true} ~cond := #in~cond; {36819#true} is VALID [2022-02-20 17:23:29,872 INFO L272 TraceCheckUtils]: 43: Hoare triple {37038#(< ~counter~0 99)} call __VERIFIER_assert((if main_~v~0#1 == main_~b~0#1 * main_~d~0#1 then 1 else 0)); {36819#true} is VALID [2022-02-20 17:23:29,873 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {36819#true} {37038#(< ~counter~0 99)} #99#return; {37038#(< ~counter~0 99)} is VALID [2022-02-20 17:23:29,873 INFO L290 TraceCheckUtils]: 41: Hoare triple {36819#true} assume true; {36819#true} is VALID [2022-02-20 17:23:29,873 INFO L290 TraceCheckUtils]: 40: Hoare triple {36819#true} assume !(0 == ~cond); {36819#true} is VALID [2022-02-20 17:23:29,873 INFO L290 TraceCheckUtils]: 39: Hoare triple {36819#true} ~cond := #in~cond; {36819#true} is VALID [2022-02-20 17:23:29,873 INFO L272 TraceCheckUtils]: 38: Hoare triple {37038#(< ~counter~0 99)} call __VERIFIER_assert((if main_~a~0#1 == main_~k~0#1 * main_~b~0#1 + main_~c~0#1 then 1 else 0)); {36819#true} is VALID [2022-02-20 17:23:29,874 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {36819#true} {37038#(< ~counter~0 99)} #97#return; {37038#(< ~counter~0 99)} is VALID [2022-02-20 17:23:29,874 INFO L290 TraceCheckUtils]: 36: Hoare triple {36819#true} assume true; {36819#true} is VALID [2022-02-20 17:23:29,874 INFO L290 TraceCheckUtils]: 35: Hoare triple {36819#true} assume !(0 == ~cond); {36819#true} is VALID [2022-02-20 17:23:29,874 INFO L290 TraceCheckUtils]: 34: Hoare triple {36819#true} ~cond := #in~cond; {36819#true} is VALID [2022-02-20 17:23:29,874 INFO L272 TraceCheckUtils]: 33: Hoare triple {37038#(< ~counter~0 99)} call __VERIFIER_assert((if main_~b~0#1 == main_~x~0#1 * main_~q~0#1 + main_~y~0#1 * main_~s~0#1 then 1 else 0)); {36819#true} is VALID [2022-02-20 17:23:29,875 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {36819#true} {37038#(< ~counter~0 99)} #95#return; {37038#(< ~counter~0 99)} is VALID [2022-02-20 17:23:29,875 INFO L290 TraceCheckUtils]: 31: Hoare triple {36819#true} assume true; {36819#true} is VALID [2022-02-20 17:23:29,875 INFO L290 TraceCheckUtils]: 30: Hoare triple {36819#true} assume !(0 == ~cond); {36819#true} is VALID [2022-02-20 17:23:29,875 INFO L290 TraceCheckUtils]: 29: Hoare triple {36819#true} ~cond := #in~cond; {36819#true} is VALID [2022-02-20 17:23:29,875 INFO L272 TraceCheckUtils]: 28: Hoare triple {37038#(< ~counter~0 99)} call __VERIFIER_assert((if main_~a~0#1 == main_~y~0#1 * main_~r~0#1 + main_~x~0#1 * main_~p~0#1 then 1 else 0)); {36819#true} is VALID [2022-02-20 17:23:29,875 INFO L290 TraceCheckUtils]: 27: Hoare triple {37038#(< ~counter~0 99)} assume !!(main_#t~post8#1 < 100);havoc main_#t~post8#1; {37038#(< ~counter~0 99)} is VALID [2022-02-20 17:23:29,876 INFO L290 TraceCheckUtils]: 26: Hoare triple {37111#(< ~counter~0 98)} main_#t~post8#1 := ~counter~0;~counter~0 := 1 + main_#t~post8#1; {37038#(< ~counter~0 99)} is VALID [2022-02-20 17:23:29,876 INFO L290 TraceCheckUtils]: 25: Hoare triple {37111#(< ~counter~0 98)} assume !!(main_~c~0#1 >= main_~b~0#1);havoc main_~d~0#1;havoc main_~v~0#1;main_~d~0#1 := 1;main_~v~0#1 := main_~b~0#1; {37111#(< ~counter~0 98)} is VALID [2022-02-20 17:23:29,876 INFO L290 TraceCheckUtils]: 24: Hoare triple {37111#(< ~counter~0 98)} assume !!(main_#t~post7#1 < 100);havoc main_#t~post7#1; {37111#(< ~counter~0 98)} is VALID [2022-02-20 17:23:29,877 INFO L290 TraceCheckUtils]: 23: Hoare triple {37121#(< ~counter~0 97)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {37111#(< ~counter~0 98)} is VALID [2022-02-20 17:23:29,877 INFO L290 TraceCheckUtils]: 22: Hoare triple {37121#(< ~counter~0 97)} assume !!(0 != main_~b~0#1);havoc main_~c~0#1;havoc main_~k~0#1;main_~c~0#1 := main_~a~0#1;main_~k~0#1 := 0; {37121#(< ~counter~0 97)} is VALID [2022-02-20 17:23:29,878 INFO L290 TraceCheckUtils]: 21: Hoare triple {37121#(< ~counter~0 97)} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1; {37121#(< ~counter~0 97)} is VALID [2022-02-20 17:23:29,878 INFO L290 TraceCheckUtils]: 20: Hoare triple {37131#(< ~counter~0 96)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {37121#(< ~counter~0 97)} is VALID [2022-02-20 17:23:29,878 INFO L290 TraceCheckUtils]: 19: Hoare triple {37131#(< ~counter~0 96)} main_~a~0#1 := main_~b~0#1;main_~b~0#1 := main_~c~0#1;havoc main_~temp~0#1;main_~temp~0#1 := main_~p~0#1;main_~p~0#1 := main_~q~0#1;main_~q~0#1 := main_~temp~0#1 - main_~q~0#1 * main_~k~0#1;main_~temp~0#1 := main_~r~0#1;main_~r~0#1 := main_~s~0#1;main_~s~0#1 := main_~temp~0#1 - main_~s~0#1 * main_~k~0#1; {37131#(< ~counter~0 96)} is VALID [2022-02-20 17:23:29,879 INFO L290 TraceCheckUtils]: 18: Hoare triple {37131#(< ~counter~0 96)} assume !(main_~c~0#1 >= main_~b~0#1); {37131#(< ~counter~0 96)} is VALID [2022-02-20 17:23:29,879 INFO L290 TraceCheckUtils]: 17: Hoare triple {37131#(< ~counter~0 96)} assume !!(main_#t~post7#1 < 100);havoc main_#t~post7#1; {37131#(< ~counter~0 96)} is VALID [2022-02-20 17:23:29,880 INFO L290 TraceCheckUtils]: 16: Hoare triple {37144#(< ~counter~0 95)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {37131#(< ~counter~0 96)} is VALID [2022-02-20 17:23:29,880 INFO L290 TraceCheckUtils]: 15: Hoare triple {37144#(< ~counter~0 95)} assume !!(0 != main_~b~0#1);havoc main_~c~0#1;havoc main_~k~0#1;main_~c~0#1 := main_~a~0#1;main_~k~0#1 := 0; {37144#(< ~counter~0 95)} is VALID [2022-02-20 17:23:29,880 INFO L290 TraceCheckUtils]: 14: Hoare triple {37144#(< ~counter~0 95)} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1; {37144#(< ~counter~0 95)} is VALID [2022-02-20 17:23:29,881 INFO L290 TraceCheckUtils]: 13: Hoare triple {37154#(< ~counter~0 94)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {37144#(< ~counter~0 95)} is VALID [2022-02-20 17:23:29,881 INFO L290 TraceCheckUtils]: 12: Hoare triple {37154#(< ~counter~0 94)} main_~a~0#1 := main_~x~0#1;main_~b~0#1 := main_~y~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0;main_~r~0#1 := 0;main_~s~0#1 := 1; {37154#(< ~counter~0 94)} is VALID [2022-02-20 17:23:29,881 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {36819#true} {37154#(< ~counter~0 94)} #93#return; {37154#(< ~counter~0 94)} is VALID [2022-02-20 17:23:29,881 INFO L290 TraceCheckUtils]: 10: Hoare triple {36819#true} assume true; {36819#true} is VALID [2022-02-20 17:23:29,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {36819#true} assume !(0 == ~cond); {36819#true} is VALID [2022-02-20 17:23:29,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {36819#true} ~cond := #in~cond; {36819#true} is VALID [2022-02-20 17:23:29,882 INFO L272 TraceCheckUtils]: 7: Hoare triple {37154#(< ~counter~0 94)} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {36819#true} is VALID [2022-02-20 17:23:29,882 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {36819#true} {37154#(< ~counter~0 94)} #91#return; {37154#(< ~counter~0 94)} is VALID [2022-02-20 17:23:29,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {36819#true} assume true; {36819#true} is VALID [2022-02-20 17:23:29,882 INFO L290 TraceCheckUtils]: 4: Hoare triple {36819#true} assume !(0 == ~cond); {36819#true} is VALID [2022-02-20 17:23:29,882 INFO L290 TraceCheckUtils]: 3: Hoare triple {36819#true} ~cond := #in~cond; {36819#true} is VALID [2022-02-20 17:23:29,882 INFO L272 TraceCheckUtils]: 2: Hoare triple {37154#(< ~counter~0 94)} call assume_abort_if_not((if main_~x~0#1 >= 1 then 1 else 0)); {36819#true} is VALID [2022-02-20 17:23:29,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {37154#(< ~counter~0 94)} 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~post8#1, main_~d~0#1, main_~v~0#1, main_#t~post7#1, main_~c~0#1, main_~k~0#1, main_~temp~0#1, main_#t~post6#1, main_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~s~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~s~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {37154#(< ~counter~0 94)} is VALID [2022-02-20 17:23:29,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {36819#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {37154#(< ~counter~0 94)} is VALID [2022-02-20 17:23:29,883 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-02-20 17:23:29,884 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:23:29,884 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67810611] [2022-02-20 17:23:29,884 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:23:29,884 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645517541] [2022-02-20 17:23:29,884 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645517541] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:23:29,884 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:23:29,884 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2022-02-20 17:23:29,884 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950355469] [2022-02-20 17:23:29,884 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:23:29,885 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 5 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 60 [2022-02-20 17:23:29,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:23:29,885 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 5 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-20 17:23:29,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:23:29,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-20 17:23:29,953 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:23:29,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-20 17:23:29,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-02-20 17:23:29,953 INFO L87 Difference]: Start difference. First operand 1194 states and 1666 transitions. Second operand has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 5 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12)