./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_unwindbound2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_unwindbound2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b8de068d3fcf052deeb5e32fe868ca4e216251d5e7d95b0bfb671288b38bb68d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:39:32,704 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:39:32,705 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:39:32,725 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:39:32,726 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:39:32,728 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:39:32,731 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:39:32,734 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:39:32,736 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:39:32,737 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:39:32,738 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:39:32,739 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:39:32,739 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:39:32,743 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:39:32,743 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:39:32,744 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:39:32,744 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:39:32,745 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:39:32,746 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:39:32,747 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:39:32,748 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:39:32,750 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:39:32,751 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:39:32,752 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:39:32,761 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:39:32,761 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:39:32,761 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:39:32,762 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:39:32,763 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:39:32,763 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:39:32,764 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:39:32,764 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:39:32,765 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:39:32,766 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:39:32,767 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:39:32,767 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:39:32,767 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:39:32,768 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:39:32,768 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:39:32,768 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:39:32,769 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:39:32,769 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:39:32,799 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:39:32,799 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:39:32,800 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:39:32,800 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:39:32,800 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:39:32,800 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:39:32,801 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:39:32,801 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:39:32,801 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:39:32,801 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:39:32,802 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:39:32,802 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:39:32,802 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:39:32,802 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:39:32,802 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:39:32,803 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:39:32,803 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:39:32,803 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:39:32,803 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:39:32,804 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:39:32,804 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:39:32,804 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:39:32,804 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:39:32,805 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:39:32,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:39:32,805 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:39:32,805 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:39:32,805 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:39:32,805 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:39:32,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:39:32,806 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:39:32,806 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:39:32,806 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:39:32,806 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 -> b8de068d3fcf052deeb5e32fe868ca4e216251d5e7d95b0bfb671288b38bb68d [2022-02-20 17:39:32,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:39:32,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:39:33,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:39:33,001 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:39:33,002 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:39:33,003 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_unwindbound2.c [2022-02-20 17:39:33,065 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18c8b640f/004292b07db7438a98e35e44cfe6d717/FLAG439a17c21 [2022-02-20 17:39:33,414 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:39:33,415 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_unwindbound2.c [2022-02-20 17:39:33,422 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18c8b640f/004292b07db7438a98e35e44cfe6d717/FLAG439a17c21 [2022-02-20 17:39:33,434 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18c8b640f/004292b07db7438a98e35e44cfe6d717 [2022-02-20 17:39:33,436 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:39:33,438 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:39:33,440 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:39:33,440 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:39:33,442 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:39:33,446 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:39:33" (1/1) ... [2022-02-20 17:39:33,447 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1491b405 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:33, skipping insertion in model container [2022-02-20 17:39:33,447 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:39:33" (1/1) ... [2022-02-20 17:39:33,451 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:39:33,463 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:39:33,580 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/prodbin-ll_unwindbound2.c[537,550] [2022-02-20 17:39:33,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:39:33,595 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:39:33,603 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/prodbin-ll_unwindbound2.c[537,550] [2022-02-20 17:39:33,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:39:33,616 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:39:33,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:33 WrapperNode [2022-02-20 17:39:33,617 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:39:33,617 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:39:33,618 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:39:33,618 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:39:33,622 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:39:33" (1/1) ... [2022-02-20 17:39:33,625 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:39:33" (1/1) ... [2022-02-20 17:39:33,638 INFO L137 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2022-02-20 17:39:33,639 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:39:33,640 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:39:33,640 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:39:33,640 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:39:33,645 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:33" (1/1) ... [2022-02-20 17:39:33,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:33" (1/1) ... [2022-02-20 17:39:33,655 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:33" (1/1) ... [2022-02-20 17:39:33,655 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:33" (1/1) ... [2022-02-20 17:39:33,658 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:33" (1/1) ... [2022-02-20 17:39:33,665 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:33" (1/1) ... [2022-02-20 17:39:33,669 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:33" (1/1) ... [2022-02-20 17:39:33,670 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:39:33,674 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:39:33,675 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:39:33,675 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:39:33,676 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:33" (1/1) ... [2022-02-20 17:39:33,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:39:33,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:39:33,702 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:39:33,707 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:39:33,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:39:33,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:39:33,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:39:33,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:39:33,725 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:39:33,725 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:39:33,767 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:39:33,768 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:39:33,883 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:39:33,897 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:39:33,897 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:39:33,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:39:33 BoogieIcfgContainer [2022-02-20 17:39:33,898 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:39:33,899 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:39:33,899 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:39:33,902 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:39:33,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:39:33" (1/3) ... [2022-02-20 17:39:33,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d465385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:39:33, skipping insertion in model container [2022-02-20 17:39:33,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:33" (2/3) ... [2022-02-20 17:39:33,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d465385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:39:33, skipping insertion in model container [2022-02-20 17:39:33,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:39:33" (3/3) ... [2022-02-20 17:39:33,904 INFO L111 eAbstractionObserver]: Analyzing ICFG prodbin-ll_unwindbound2.c [2022-02-20 17:39:33,907 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:39:33,907 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:39:33,934 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:39:33,939 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:39:33,939 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:39:33,951 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:39:33,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:39:33,954 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:39:33,955 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:39:33,955 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:39:33,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:39:33,959 INFO L85 PathProgramCache]: Analyzing trace with hash -572597424, now seen corresponding path program 1 times [2022-02-20 17:39:33,965 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:39:33,966 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163979765] [2022-02-20 17:39:33,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:39:33,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:39:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:34,116 INFO L290 TraceCheckUtils]: 0: Hoare triple {24#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {24#true} is VALID [2022-02-20 17:39:34,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_~a~0#1, main_~b~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~b~0#1 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {24#true} is VALID [2022-02-20 17:39:34,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {25#false} is VALID [2022-02-20 17:39:34,118 INFO L290 TraceCheckUtils]: 3: Hoare triple {25#false} assume { :end_inline_assume_abort_if_not } true;main_~x~0#1 := main_~a~0#1;main_~y~0#1 := main_~b~0#1;main_~z~0#1 := 0; {25#false} is VALID [2022-02-20 17:39:34,118 INFO L290 TraceCheckUtils]: 4: Hoare triple {25#false} assume !true; {25#false} is VALID [2022-02-20 17:39:34,119 INFO L272 TraceCheckUtils]: 5: Hoare triple {25#false} call __VERIFIER_assert((if main_~z~0#1 == main_~a~0#1 * main_~b~0#1 then 1 else 0)); {25#false} is VALID [2022-02-20 17:39:34,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-02-20 17:39:34,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-02-20 17:39:34,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-02-20 17:39:34,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:39:34,133 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:39:34,134 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163979765] [2022-02-20 17:39:34,134 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163979765] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:39:34,135 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:39:34,135 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:39:34,136 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820890679] [2022-02-20 17:39:34,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:39:34,141 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:39:34,142 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:39:34,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:39:34,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:39:34,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:39:34,164 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:39:34,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:39:34,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:39:34,189 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:39:34,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:34,239 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2022-02-20 17:39:34,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:39:34,240 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:39:34,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:39:34,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:39:34,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2022-02-20 17:39:34,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:39:34,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2022-02-20 17:39:34,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 52 transitions. [2022-02-20 17:39:34,315 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:39:34,323 INFO L225 Difference]: With dead ends: 39 [2022-02-20 17:39:34,323 INFO L226 Difference]: Without dead ends: 17 [2022-02-20 17:39:34,325 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:39:34,329 INFO L933 BasicCegarLoop]: 24 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, 24 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:39:34,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:39:34,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-02-20 17:39:34,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-02-20 17:39:34,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:39:34,350 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:39:34,351 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:39:34,351 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:39:34,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:34,361 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-02-20 17:39:34,361 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-20 17:39:34,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:39:34,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:39:34,362 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-02-20 17:39:34,364 INFO L87 Difference]: Start difference. First operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-02-20 17:39:34,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:34,367 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-02-20 17:39:34,367 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-20 17:39:34,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:39:34,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:39:34,368 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:39:34,368 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:39:34,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:39:34,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-02-20 17:39:34,371 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 9 [2022-02-20 17:39:34,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:39:34,371 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-02-20 17:39:34,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:39:34,372 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-20 17:39:34,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:39:34,373 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:39:34,373 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:39:34,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:39:34,374 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:39:34,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:39:34,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1986366499, now seen corresponding path program 1 times [2022-02-20 17:39:34,378 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:39:34,378 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120851592] [2022-02-20 17:39:34,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:39:34,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:39:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:34,462 INFO L290 TraceCheckUtils]: 0: Hoare triple {132#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {134#(= ~counter~0 0)} is VALID [2022-02-20 17:39:34,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {134#(= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_~a~0#1, main_~b~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~b~0#1 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {134#(= ~counter~0 0)} is VALID [2022-02-20 17:39:34,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {134#(= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {134#(= ~counter~0 0)} is VALID [2022-02-20 17:39:34,464 INFO L290 TraceCheckUtils]: 3: Hoare triple {134#(= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;main_~x~0#1 := main_~a~0#1;main_~y~0#1 := main_~b~0#1;main_~z~0#1 := 0; {134#(= ~counter~0 0)} is VALID [2022-02-20 17:39:34,465 INFO L290 TraceCheckUtils]: 4: Hoare triple {134#(= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {135#(= |ULTIMATE.start_main_#t~post6#1| 0)} is VALID [2022-02-20 17:39:34,466 INFO L290 TraceCheckUtils]: 5: Hoare triple {135#(= |ULTIMATE.start_main_#t~post6#1| 0)} assume !(main_#t~post6#1 < 2);havoc main_#t~post6#1; {133#false} is VALID [2022-02-20 17:39:34,466 INFO L272 TraceCheckUtils]: 6: Hoare triple {133#false} call __VERIFIER_assert((if main_~z~0#1 == main_~a~0#1 * main_~b~0#1 then 1 else 0)); {133#false} is VALID [2022-02-20 17:39:34,466 INFO L290 TraceCheckUtils]: 7: Hoare triple {133#false} ~cond := #in~cond; {133#false} is VALID [2022-02-20 17:39:34,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {133#false} assume 0 == ~cond; {133#false} is VALID [2022-02-20 17:39:34,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {133#false} assume !false; {133#false} is VALID [2022-02-20 17:39:34,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:39:34,468 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:39:34,468 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120851592] [2022-02-20 17:39:34,468 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120851592] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:39:34,469 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:39:34,469 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:39:34,469 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007394455] [2022-02-20 17:39:34,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:39:34,470 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 17:39:34,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:39:34,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:39:34,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:39:34,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:39:34,483 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:39:34,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:39:34,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:39:34,484 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:39:34,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:34,528 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-02-20 17:39:34,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:39:34,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 17:39:34,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:39:34,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:39:34,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-02-20 17:39:34,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:39:34,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-02-20 17:39:34,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 29 transitions. [2022-02-20 17:39:34,557 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:39:34,558 INFO L225 Difference]: With dead ends: 26 [2022-02-20 17:39:34,558 INFO L226 Difference]: Without dead ends: 19 [2022-02-20 17:39:34,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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:39:34,561 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:39:34,562 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:39:34,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-02-20 17:39:34,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-02-20 17:39:34,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:39:34,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:39:34,567 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:39:34,567 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:39:34,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:34,570 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-02-20 17:39:34,570 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-02-20 17:39:34,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:39:34,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:39:34,572 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-02-20 17:39:34,572 INFO L87 Difference]: Start difference. First operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-02-20 17:39:34,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:34,575 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-02-20 17:39:34,575 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-02-20 17:39:34,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:39:34,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:39:34,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:39:34,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:39:34,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:39:34,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-02-20 17:39:34,577 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 10 [2022-02-20 17:39:34,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:39:34,578 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-02-20 17:39:34,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:39:34,578 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-02-20 17:39:34,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:39:34,579 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:39:34,580 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:39:34,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:39:34,580 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:39:34,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:39:34,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1984579039, now seen corresponding path program 1 times [2022-02-20 17:39:34,581 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:39:34,581 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240254811] [2022-02-20 17:39:34,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:39:34,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:39:34,609 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:39:34,611 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [287702028] [2022-02-20 17:39:34,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:39:34,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:39:34,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:39:34,613 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:39:34,615 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:39:34,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:34,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 17:39:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:34,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:39:34,810 INFO L290 TraceCheckUtils]: 0: Hoare triple {233#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {233#true} is VALID [2022-02-20 17:39:34,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {233#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_~a~0#1, main_~b~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~b~0#1 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {233#true} is VALID [2022-02-20 17:39:34,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {233#true} assume !(0 == assume_abort_if_not_~cond#1); {233#true} is VALID [2022-02-20 17:39:34,812 INFO L290 TraceCheckUtils]: 3: Hoare triple {233#true} assume { :end_inline_assume_abort_if_not } true;main_~x~0#1 := main_~a~0#1;main_~y~0#1 := main_~b~0#1;main_~z~0#1 := 0; {247#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:39:34,812 INFO L290 TraceCheckUtils]: 4: Hoare triple {247#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {247#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:39:34,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {247#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} assume !!(main_#t~post6#1 < 2);havoc main_#t~post6#1; {247#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:39:34,814 INFO L272 TraceCheckUtils]: 6: Hoare triple {247#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} call __VERIFIER_assert((if main_~z~0#1 + main_~x~0#1 * main_~y~0#1 == main_~a~0#1 * main_~b~0#1 then 1 else 0)); {257#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:39:34,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {257#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {261#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:39:34,815 INFO L290 TraceCheckUtils]: 8: Hoare triple {261#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {234#false} is VALID [2022-02-20 17:39:34,815 INFO L290 TraceCheckUtils]: 9: Hoare triple {234#false} assume !false; {234#false} is VALID [2022-02-20 17:39:34,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:39:34,816 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:39:34,816 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:39:34,816 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240254811] [2022-02-20 17:39:34,816 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:39:34,816 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287702028] [2022-02-20 17:39:34,816 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287702028] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:39:34,817 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:39:34,817 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:39:34,817 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634733110] [2022-02-20 17:39:34,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:39:34,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 17:39:34,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:39:34,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:39:34,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:39:34,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:39:34,825 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:39:34,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:39:34,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:39:34,826 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:39:34,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:34,928 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-02-20 17:39:34,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:39:34,928 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 17:39:34,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:39:34,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:39:34,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-02-20 17:39:34,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:39:34,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-02-20 17:39:34,931 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2022-02-20 17:39:34,959 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:39:34,961 INFO L225 Difference]: With dead ends: 30 [2022-02-20 17:39:34,965 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 17:39:34,965 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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:39:34,969 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 8 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:39:34,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 51 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:39:34,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 17:39:34,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2022-02-20 17:39:34,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:39:34,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 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:39:34,976 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 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:39:34,976 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 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:39:34,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:34,977 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-02-20 17:39:34,977 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-02-20 17:39:34,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:39:34,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:39:34,978 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 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) Second operand 28 states. [2022-02-20 17:39:34,978 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 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) Second operand 28 states. [2022-02-20 17:39:34,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:34,983 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-02-20 17:39:34,983 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-02-20 17:39:34,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:39:34,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:39:34,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:39:34,984 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:39:34,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 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:39:34,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-02-20 17:39:34,985 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 10 [2022-02-20 17:39:34,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:39:34,986 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-02-20 17:39:34,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:39:34,987 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-02-20 17:39:34,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 17:39:34,992 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:39:34,992 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:39:35,014 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:39:35,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:39:35,208 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:39:35,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:39:35,208 INFO L85 PathProgramCache]: Analyzing trace with hash 845350648, now seen corresponding path program 1 times [2022-02-20 17:39:35,208 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:39:35,208 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142534305] [2022-02-20 17:39:35,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:39:35,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:39:35,222 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:39:35,223 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [286376066] [2022-02-20 17:39:35,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:39:35,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:39:35,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:39:35,224 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:39:35,225 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:39:35,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:35,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:39:35,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:35,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:39:35,360 INFO L290 TraceCheckUtils]: 0: Hoare triple {394#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {394#true} is VALID [2022-02-20 17:39:35,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {394#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_~a~0#1, main_~b~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~b~0#1 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {402#(or (and (not (<= 1 |ULTIMATE.start_main_~b~0#1|)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= 1 |ULTIMATE.start_main_~b~0#1|)))} is VALID [2022-02-20 17:39:35,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {402#(or (and (not (<= 1 |ULTIMATE.start_main_~b~0#1|)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= 1 |ULTIMATE.start_main_~b~0#1|)))} assume !(0 == assume_abort_if_not_~cond#1); {406#(<= 1 |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:39:35,362 INFO L290 TraceCheckUtils]: 3: Hoare triple {406#(<= 1 |ULTIMATE.start_main_~b~0#1|)} assume { :end_inline_assume_abort_if_not } true;main_~x~0#1 := main_~a~0#1;main_~y~0#1 := main_~b~0#1;main_~z~0#1 := 0; {410#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-20 17:39:35,362 INFO L290 TraceCheckUtils]: 4: Hoare triple {410#(<= 1 |ULTIMATE.start_main_~y~0#1|)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {410#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-20 17:39:35,363 INFO L290 TraceCheckUtils]: 5: Hoare triple {410#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume !!(main_#t~post6#1 < 2);havoc main_#t~post6#1; {410#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-20 17:39:35,363 INFO L272 TraceCheckUtils]: 6: Hoare triple {410#(<= 1 |ULTIMATE.start_main_~y~0#1|)} call __VERIFIER_assert((if main_~z~0#1 + main_~x~0#1 * main_~y~0#1 == main_~a~0#1 * main_~b~0#1 then 1 else 0)); {394#true} is VALID [2022-02-20 17:39:35,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {394#true} ~cond := #in~cond; {394#true} is VALID [2022-02-20 17:39:35,364 INFO L290 TraceCheckUtils]: 8: Hoare triple {394#true} assume !(0 == ~cond); {394#true} is VALID [2022-02-20 17:39:35,364 INFO L290 TraceCheckUtils]: 9: Hoare triple {394#true} assume true; {394#true} is VALID [2022-02-20 17:39:35,365 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {394#true} {410#(<= 1 |ULTIMATE.start_main_~y~0#1|)} #53#return; {410#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-20 17:39:35,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {410#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume !(0 != main_~y~0#1); {395#false} is VALID [2022-02-20 17:39:35,365 INFO L272 TraceCheckUtils]: 12: Hoare triple {395#false} call __VERIFIER_assert((if main_~z~0#1 == main_~a~0#1 * main_~b~0#1 then 1 else 0)); {395#false} is VALID [2022-02-20 17:39:35,365 INFO L290 TraceCheckUtils]: 13: Hoare triple {395#false} ~cond := #in~cond; {395#false} is VALID [2022-02-20 17:39:35,365 INFO L290 TraceCheckUtils]: 14: Hoare triple {395#false} assume 0 == ~cond; {395#false} is VALID [2022-02-20 17:39:35,366 INFO L290 TraceCheckUtils]: 15: Hoare triple {395#false} assume !false; {395#false} is VALID [2022-02-20 17:39:35,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:39:35,366 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:39:35,366 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:39:35,367 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142534305] [2022-02-20 17:39:35,367 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:39:35,367 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286376066] [2022-02-20 17:39:35,367 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286376066] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:39:35,367 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:39:35,367 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:39:35,368 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091560575] [2022-02-20 17:39:35,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:39:35,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 17:39:35,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:39:35,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:39:35,380 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:39:35,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:39:35,381 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:39:35,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:39:35,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:39:35,382 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:39:35,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:35,496 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-02-20 17:39:35,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:39:35,496 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 17:39:35,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:39:35,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:39:35,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-02-20 17:39:35,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:39:35,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-02-20 17:39:35,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2022-02-20 17:39:35,529 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:39:35,530 INFO L225 Difference]: With dead ends: 34 [2022-02-20 17:39:35,530 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 17:39:35,531 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:39:35,531 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 29 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:39:35,532 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 44 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:39:35,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 17:39:35,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-02-20 17:39:35,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:39:35,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:39:35,538 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:39:35,538 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:39:35,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:35,540 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-02-20 17:39:35,540 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-02-20 17:39:35,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:39:35,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:39:35,540 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 27 states. [2022-02-20 17:39:35,541 INFO L87 Difference]: Start difference. First operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 27 states. [2022-02-20 17:39:35,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:35,542 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-02-20 17:39:35,542 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-02-20 17:39:35,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:39:35,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:39:35,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:39:35,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:39:35,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:39:35,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-02-20 17:39:35,543 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2022-02-20 17:39:35,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:39:35,547 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-02-20 17:39:35,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:39:35,547 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-02-20 17:39:35,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 17:39:35,548 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:39:35,548 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:39:35,564 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:39:35,748 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,SelfDestructingSolverStorable3 [2022-02-20 17:39:35,749 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:39:35,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:39:35,749 INFO L85 PathProgramCache]: Analyzing trace with hash 905454657, now seen corresponding path program 1 times [2022-02-20 17:39:35,749 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:39:35,749 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051983352] [2022-02-20 17:39:35,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:39:35,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:39:35,760 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:39:35,760 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2090531804] [2022-02-20 17:39:35,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:39:35,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:39:35,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:39:35,764 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:39:35,765 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:39:35,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:35,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:39:35,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:35,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:39:35,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {579#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {584#(<= ~counter~0 0)} is VALID [2022-02-20 17:39:35,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {584#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_~a~0#1, main_~b~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~b~0#1 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {584#(<= ~counter~0 0)} is VALID [2022-02-20 17:39:35,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {584#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {584#(<= ~counter~0 0)} is VALID [2022-02-20 17:39:35,880 INFO L290 TraceCheckUtils]: 3: Hoare triple {584#(<= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;main_~x~0#1 := main_~a~0#1;main_~y~0#1 := main_~b~0#1;main_~z~0#1 := 0; {584#(<= ~counter~0 0)} is VALID [2022-02-20 17:39:35,880 INFO L290 TraceCheckUtils]: 4: Hoare triple {584#(<= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {597#(<= ~counter~0 1)} is VALID [2022-02-20 17:39:35,880 INFO L290 TraceCheckUtils]: 5: Hoare triple {597#(<= ~counter~0 1)} assume !!(main_#t~post6#1 < 2);havoc main_#t~post6#1; {597#(<= ~counter~0 1)} is VALID [2022-02-20 17:39:35,884 INFO L272 TraceCheckUtils]: 6: Hoare triple {597#(<= ~counter~0 1)} call __VERIFIER_assert((if main_~z~0#1 + main_~x~0#1 * main_~y~0#1 == main_~a~0#1 * main_~b~0#1 then 1 else 0)); {597#(<= ~counter~0 1)} is VALID [2022-02-20 17:39:35,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {597#(<= ~counter~0 1)} ~cond := #in~cond; {597#(<= ~counter~0 1)} is VALID [2022-02-20 17:39:35,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {597#(<= ~counter~0 1)} assume !(0 == ~cond); {597#(<= ~counter~0 1)} is VALID [2022-02-20 17:39:35,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {597#(<= ~counter~0 1)} assume true; {597#(<= ~counter~0 1)} is VALID [2022-02-20 17:39:35,887 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {597#(<= ~counter~0 1)} {597#(<= ~counter~0 1)} #53#return; {597#(<= ~counter~0 1)} is VALID [2022-02-20 17:39:35,888 INFO L290 TraceCheckUtils]: 11: Hoare triple {597#(<= ~counter~0 1)} assume !!(0 != main_~y~0#1); {597#(<= ~counter~0 1)} is VALID [2022-02-20 17:39:35,888 INFO L290 TraceCheckUtils]: 12: Hoare triple {597#(<= ~counter~0 1)} assume 1 == (if main_~y~0#1 < 0 && 0 != main_~y~0#1 % 2 then main_~y~0#1 % 2 - 2 else main_~y~0#1 % 2);main_~z~0#1 := main_~z~0#1 + main_~x~0#1;main_~y~0#1 := main_~y~0#1 - 1; {597#(<= ~counter~0 1)} is VALID [2022-02-20 17:39:35,889 INFO L290 TraceCheckUtils]: 13: Hoare triple {597#(<= ~counter~0 1)} main_~x~0#1 := 2 * main_~x~0#1;main_~y~0#1 := (if main_~y~0#1 < 0 && 0 != main_~y~0#1 % 2 then 1 + main_~y~0#1 / 2 else main_~y~0#1 / 2); {597#(<= ~counter~0 1)} is VALID [2022-02-20 17:39:35,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {597#(<= ~counter~0 1)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {628#(<= |ULTIMATE.start_main_#t~post6#1| 1)} is VALID [2022-02-20 17:39:35,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {628#(<= |ULTIMATE.start_main_#t~post6#1| 1)} assume !(main_#t~post6#1 < 2);havoc main_#t~post6#1; {580#false} is VALID [2022-02-20 17:39:35,893 INFO L272 TraceCheckUtils]: 16: Hoare triple {580#false} call __VERIFIER_assert((if main_~z~0#1 == main_~a~0#1 * main_~b~0#1 then 1 else 0)); {580#false} is VALID [2022-02-20 17:39:35,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {580#false} ~cond := #in~cond; {580#false} is VALID [2022-02-20 17:39:35,894 INFO L290 TraceCheckUtils]: 18: Hoare triple {580#false} assume 0 == ~cond; {580#false} is VALID [2022-02-20 17:39:35,894 INFO L290 TraceCheckUtils]: 19: Hoare triple {580#false} assume !false; {580#false} is VALID [2022-02-20 17:39:35,894 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:39:35,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:39:35,990 INFO L290 TraceCheckUtils]: 19: Hoare triple {580#false} assume !false; {580#false} is VALID [2022-02-20 17:39:35,990 INFO L290 TraceCheckUtils]: 18: Hoare triple {580#false} assume 0 == ~cond; {580#false} is VALID [2022-02-20 17:39:35,990 INFO L290 TraceCheckUtils]: 17: Hoare triple {580#false} ~cond := #in~cond; {580#false} is VALID [2022-02-20 17:39:35,990 INFO L272 TraceCheckUtils]: 16: Hoare triple {580#false} call __VERIFIER_assert((if main_~z~0#1 == main_~a~0#1 * main_~b~0#1 then 1 else 0)); {580#false} is VALID [2022-02-20 17:39:35,991 INFO L290 TraceCheckUtils]: 15: Hoare triple {628#(<= |ULTIMATE.start_main_#t~post6#1| 1)} assume !(main_#t~post6#1 < 2);havoc main_#t~post6#1; {580#false} is VALID [2022-02-20 17:39:35,991 INFO L290 TraceCheckUtils]: 14: Hoare triple {597#(<= ~counter~0 1)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {628#(<= |ULTIMATE.start_main_#t~post6#1| 1)} is VALID [2022-02-20 17:39:35,991 INFO L290 TraceCheckUtils]: 13: Hoare triple {597#(<= ~counter~0 1)} main_~x~0#1 := 2 * main_~x~0#1;main_~y~0#1 := (if main_~y~0#1 < 0 && 0 != main_~y~0#1 % 2 then 1 + main_~y~0#1 / 2 else main_~y~0#1 / 2); {597#(<= ~counter~0 1)} is VALID [2022-02-20 17:39:35,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {597#(<= ~counter~0 1)} assume 1 == (if main_~y~0#1 < 0 && 0 != main_~y~0#1 % 2 then main_~y~0#1 % 2 - 2 else main_~y~0#1 % 2);main_~z~0#1 := main_~z~0#1 + main_~x~0#1;main_~y~0#1 := main_~y~0#1 - 1; {597#(<= ~counter~0 1)} is VALID [2022-02-20 17:39:35,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {597#(<= ~counter~0 1)} assume !!(0 != main_~y~0#1); {597#(<= ~counter~0 1)} is VALID [2022-02-20 17:39:35,993 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {579#true} {597#(<= ~counter~0 1)} #53#return; {597#(<= ~counter~0 1)} is VALID [2022-02-20 17:39:35,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {579#true} assume true; {579#true} is VALID [2022-02-20 17:39:35,993 INFO L290 TraceCheckUtils]: 8: Hoare triple {579#true} assume !(0 == ~cond); {579#true} is VALID [2022-02-20 17:39:35,994 INFO L290 TraceCheckUtils]: 7: Hoare triple {579#true} ~cond := #in~cond; {579#true} is VALID [2022-02-20 17:39:35,994 INFO L272 TraceCheckUtils]: 6: Hoare triple {597#(<= ~counter~0 1)} call __VERIFIER_assert((if main_~z~0#1 + main_~x~0#1 * main_~y~0#1 == main_~a~0#1 * main_~b~0#1 then 1 else 0)); {579#true} is VALID [2022-02-20 17:39:35,994 INFO L290 TraceCheckUtils]: 5: Hoare triple {597#(<= ~counter~0 1)} assume !!(main_#t~post6#1 < 2);havoc main_#t~post6#1; {597#(<= ~counter~0 1)} is VALID [2022-02-20 17:39:35,995 INFO L290 TraceCheckUtils]: 4: Hoare triple {584#(<= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {597#(<= ~counter~0 1)} is VALID [2022-02-20 17:39:35,995 INFO L290 TraceCheckUtils]: 3: Hoare triple {584#(<= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;main_~x~0#1 := main_~a~0#1;main_~y~0#1 := main_~b~0#1;main_~z~0#1 := 0; {584#(<= ~counter~0 0)} is VALID [2022-02-20 17:39:35,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {584#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {584#(<= ~counter~0 0)} is VALID [2022-02-20 17:39:35,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {584#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_~a~0#1, main_~b~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~b~0#1 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {584#(<= ~counter~0 0)} is VALID [2022-02-20 17:39:35,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {579#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {584#(<= ~counter~0 0)} is VALID [2022-02-20 17:39:35,997 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:39:35,997 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:39:35,997 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051983352] [2022-02-20 17:39:35,997 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:39:35,997 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090531804] [2022-02-20 17:39:35,997 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090531804] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:39:35,997 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:39:35,998 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 5 [2022-02-20 17:39:35,998 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029387703] [2022-02-20 17:39:35,998 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:39:35,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-02-20 17:39:35,998 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:39:35,999 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), 5 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:39:36,017 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:39:36,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:39:36,017 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:39:36,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:39:36,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:39:36,018 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:39:36,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:36,081 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-02-20 17:39:36,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:39:36,081 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-02-20 17:39:36,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:39:36,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:39:36,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-02-20 17:39:36,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:39:36,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-02-20 17:39:36,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-02-20 17:39:36,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:39:36,112 INFO L225 Difference]: With dead ends: 36 [2022-02-20 17:39:36,112 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 17:39:36,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:39:36,112 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:39:36,113 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 63 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:39:36,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 17:39:36,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-02-20 17:39:36,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:39:36,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:39:36,121 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:39:36,121 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:39:36,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:36,122 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-02-20 17:39:36,122 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-02-20 17:39:36,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:39:36,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:39:36,123 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 29 states. [2022-02-20 17:39:36,123 INFO L87 Difference]: Start difference. First operand has 29 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 29 states. [2022-02-20 17:39:36,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:36,124 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-02-20 17:39:36,124 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-02-20 17:39:36,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:39:36,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:39:36,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:39:36,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:39:36,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:39:36,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-02-20 17:39:36,125 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 20 [2022-02-20 17:39:36,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:39:36,125 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-02-20 17:39:36,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:39:36,125 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-02-20 17:39:36,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 17:39:36,125 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:39:36,126 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:39:36,142 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:39:36,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:39:36,326 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:39:36,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:39:36,327 INFO L85 PathProgramCache]: Analyzing trace with hash 907242117, now seen corresponding path program 1 times [2022-02-20 17:39:36,327 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:39:36,327 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689772456] [2022-02-20 17:39:36,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:39:36,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:39:36,342 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:39:36,342 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1872533344] [2022-02-20 17:39:36,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:39:36,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:39:36,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:39:36,343 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:39:36,344 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:39:36,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:36,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-20 17:39:36,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:36,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:39:37,906 INFO L290 TraceCheckUtils]: 0: Hoare triple {843#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {843#true} is VALID [2022-02-20 17:39:37,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {843#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_~a~0#1, main_~b~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~b~0#1 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {843#true} is VALID [2022-02-20 17:39:37,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {843#true} assume !(0 == assume_abort_if_not_~cond#1); {843#true} is VALID [2022-02-20 17:39:37,917 INFO L290 TraceCheckUtils]: 3: Hoare triple {843#true} assume { :end_inline_assume_abort_if_not } true;main_~x~0#1 := main_~a~0#1;main_~y~0#1 := main_~b~0#1;main_~z~0#1 := 0; {857#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:39:37,917 INFO L290 TraceCheckUtils]: 4: Hoare triple {857#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {857#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:39:37,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {857#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} assume !!(main_#t~post6#1 < 2);havoc main_#t~post6#1; {857#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:39:37,918 INFO L272 TraceCheckUtils]: 6: Hoare triple {857#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} call __VERIFIER_assert((if main_~z~0#1 + main_~x~0#1 * main_~y~0#1 == main_~a~0#1 * main_~b~0#1 then 1 else 0)); {843#true} is VALID [2022-02-20 17:39:37,919 INFO L290 TraceCheckUtils]: 7: Hoare triple {843#true} ~cond := #in~cond; {870#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:39:37,919 INFO L290 TraceCheckUtils]: 8: Hoare triple {870#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {874#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:39:37,920 INFO L290 TraceCheckUtils]: 9: Hoare triple {874#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {874#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:39:37,920 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {874#(not (= |__VERIFIER_assert_#in~cond| 0))} {857#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} #53#return; {881#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= (+ |ULTIMATE.start_main_~z~0#1| (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:39:37,921 INFO L290 TraceCheckUtils]: 11: Hoare triple {881#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= (+ |ULTIMATE.start_main_~z~0#1| (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} assume !!(0 != main_~y~0#1); {885#(and (not (= |ULTIMATE.start_main_~y~0#1| 0)) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= (+ |ULTIMATE.start_main_~z~0#1| (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:39:37,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {885#(and (not (= |ULTIMATE.start_main_~y~0#1| 0)) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= (+ |ULTIMATE.start_main_~z~0#1| (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} assume 1 == (if main_~y~0#1 < 0 && 0 != main_~y~0#1 % 2 then main_~y~0#1 % 2 - 2 else main_~y~0#1 % 2);main_~z~0#1 := main_~z~0#1 + main_~x~0#1;main_~y~0#1 := main_~y~0#1 - 1; {889#(and (<= 1 (mod (+ |ULTIMATE.start_main_~y~0#1| 1) 2)) (= (+ |ULTIMATE.start_main_~y~0#1| 1) |ULTIMATE.start_main_~b~0#1|) (= (+ |ULTIMATE.start_main_~z~0#1| (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1)))} is VALID [2022-02-20 17:39:37,926 INFO L290 TraceCheckUtils]: 13: Hoare triple {889#(and (<= 1 (mod (+ |ULTIMATE.start_main_~y~0#1| 1) 2)) (= (+ |ULTIMATE.start_main_~y~0#1| 1) |ULTIMATE.start_main_~b~0#1|) (= (+ |ULTIMATE.start_main_~z~0#1| (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1)))} main_~x~0#1 := 2 * main_~x~0#1;main_~y~0#1 := (if main_~y~0#1 < 0 && 0 != main_~y~0#1 % 2 then 1 + main_~y~0#1 / 2 else main_~y~0#1 / 2); {893#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (= (+ (* |ULTIMATE.start_main_~a~0#1| (+ (- 1) |ULTIMATE.start_main_~b~0#1|)) |ULTIMATE.start_main_~z~0#1|) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~b~0#1| 2)) (= (div (+ (- 1) |ULTIMATE.start_main_~b~0#1|) 2) |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:39:37,927 INFO L290 TraceCheckUtils]: 14: Hoare triple {893#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (= (+ (* |ULTIMATE.start_main_~a~0#1| (+ (- 1) |ULTIMATE.start_main_~b~0#1|)) |ULTIMATE.start_main_~z~0#1|) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~b~0#1| 2)) (= (div (+ (- 1) |ULTIMATE.start_main_~b~0#1|) 2) |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|)))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {893#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (= (+ (* |ULTIMATE.start_main_~a~0#1| (+ (- 1) |ULTIMATE.start_main_~b~0#1|)) |ULTIMATE.start_main_~z~0#1|) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~b~0#1| 2)) (= (div (+ (- 1) |ULTIMATE.start_main_~b~0#1|) 2) |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:39:37,927 INFO L290 TraceCheckUtils]: 15: Hoare triple {893#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (= (+ (* |ULTIMATE.start_main_~a~0#1| (+ (- 1) |ULTIMATE.start_main_~b~0#1|)) |ULTIMATE.start_main_~z~0#1|) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~b~0#1| 2)) (= (div (+ (- 1) |ULTIMATE.start_main_~b~0#1|) 2) |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|)))} assume !!(main_#t~post6#1 < 2);havoc main_#t~post6#1; {893#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (= (+ (* |ULTIMATE.start_main_~a~0#1| (+ (- 1) |ULTIMATE.start_main_~b~0#1|)) |ULTIMATE.start_main_~z~0#1|) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~b~0#1| 2)) (= (div (+ (- 1) |ULTIMATE.start_main_~b~0#1|) 2) |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:39:38,660 INFO L272 TraceCheckUtils]: 16: Hoare triple {893#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (= (+ (* |ULTIMATE.start_main_~a~0#1| (+ (- 1) |ULTIMATE.start_main_~b~0#1|)) |ULTIMATE.start_main_~z~0#1|) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~b~0#1| 2)) (= (div (+ (- 1) |ULTIMATE.start_main_~b~0#1|) 2) |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|)))} call __VERIFIER_assert((if main_~z~0#1 + main_~x~0#1 * main_~y~0#1 == main_~a~0#1 * main_~b~0#1 then 1 else 0)); {903#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:39:38,661 INFO L290 TraceCheckUtils]: 17: Hoare triple {903#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {907#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:39:38,661 INFO L290 TraceCheckUtils]: 18: Hoare triple {907#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {844#false} is VALID [2022-02-20 17:39:38,661 INFO L290 TraceCheckUtils]: 19: Hoare triple {844#false} assume !false; {844#false} is VALID [2022-02-20 17:39:38,662 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:39:38,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:40:26,504 INFO L290 TraceCheckUtils]: 19: Hoare triple {844#false} assume !false; {844#false} is VALID [2022-02-20 17:40:26,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {907#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {844#false} is VALID [2022-02-20 17:40:26,506 INFO L290 TraceCheckUtils]: 17: Hoare triple {903#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {907#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:40:26,506 INFO L272 TraceCheckUtils]: 16: Hoare triple {923#(= (+ |ULTIMATE.start_main_~z~0#1| (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|))} call __VERIFIER_assert((if main_~z~0#1 + main_~x~0#1 * main_~y~0#1 == main_~a~0#1 * main_~b~0#1 then 1 else 0)); {903#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:40:26,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {923#(= (+ |ULTIMATE.start_main_~z~0#1| (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|))} assume !!(main_#t~post6#1 < 2);havoc main_#t~post6#1; {923#(= (+ |ULTIMATE.start_main_~z~0#1| (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|))} is VALID [2022-02-20 17:40:26,509 INFO L290 TraceCheckUtils]: 14: Hoare triple {923#(= (+ |ULTIMATE.start_main_~z~0#1| (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~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; {923#(= (+ |ULTIMATE.start_main_~z~0#1| (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|))} is VALID [2022-02-20 17:40:26,514 INFO L290 TraceCheckUtils]: 13: Hoare triple {933#(and (or (= (+ (* (* 2 |ULTIMATE.start_main_~x~0#1|) (div |ULTIMATE.start_main_~y~0#1| 2)) |ULTIMATE.start_main_~z~0#1|) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (and (< |ULTIMATE.start_main_~y~0#1| 0) (not (= (mod |ULTIMATE.start_main_~y~0#1| 2) 0)))) (or (= (+ |ULTIMATE.start_main_~z~0#1| (* (* 2 |ULTIMATE.start_main_~x~0#1|) (+ 1 (div |ULTIMATE.start_main_~y~0#1| 2)))) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (= (mod |ULTIMATE.start_main_~y~0#1| 2) 0) (not (< |ULTIMATE.start_main_~y~0#1| 0))))} main_~x~0#1 := 2 * main_~x~0#1;main_~y~0#1 := (if main_~y~0#1 < 0 && 0 != main_~y~0#1 % 2 then 1 + main_~y~0#1 / 2 else main_~y~0#1 / 2); {923#(= (+ |ULTIMATE.start_main_~z~0#1| (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|))} is VALID [2022-02-20 17:40:26,516 INFO L290 TraceCheckUtils]: 12: Hoare triple {937#(or (not (<= 1 (mod |ULTIMATE.start_main_~y~0#1| 2))) (< |ULTIMATE.start_main_~y~0#1| 0) (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (* (* 2 |ULTIMATE.start_main_~x~0#1|) (div (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)))} assume 1 == (if main_~y~0#1 < 0 && 0 != main_~y~0#1 % 2 then main_~y~0#1 % 2 - 2 else main_~y~0#1 % 2);main_~z~0#1 := main_~z~0#1 + main_~x~0#1;main_~y~0#1 := main_~y~0#1 - 1; {933#(and (or (= (+ (* (* 2 |ULTIMATE.start_main_~x~0#1|) (div |ULTIMATE.start_main_~y~0#1| 2)) |ULTIMATE.start_main_~z~0#1|) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (and (< |ULTIMATE.start_main_~y~0#1| 0) (not (= (mod |ULTIMATE.start_main_~y~0#1| 2) 0)))) (or (= (+ |ULTIMATE.start_main_~z~0#1| (* (* 2 |ULTIMATE.start_main_~x~0#1|) (+ 1 (div |ULTIMATE.start_main_~y~0#1| 2)))) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (= (mod |ULTIMATE.start_main_~y~0#1| 2) 0) (not (< |ULTIMATE.start_main_~y~0#1| 0))))} is VALID [2022-02-20 17:40:26,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {937#(or (not (<= 1 (mod |ULTIMATE.start_main_~y~0#1| 2))) (< |ULTIMATE.start_main_~y~0#1| 0) (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (* (* 2 |ULTIMATE.start_main_~x~0#1|) (div (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)))} assume !!(0 != main_~y~0#1); {937#(or (not (<= 1 (mod |ULTIMATE.start_main_~y~0#1| 2))) (< |ULTIMATE.start_main_~y~0#1| 0) (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (* (* 2 |ULTIMATE.start_main_~x~0#1|) (div (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)))} is VALID [2022-02-20 17:40:28,176 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {874#(not (= |__VERIFIER_assert_#in~cond| 0))} {843#true} #53#return; {937#(or (not (<= 1 (mod |ULTIMATE.start_main_~y~0#1| 2))) (< |ULTIMATE.start_main_~y~0#1| 0) (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (* (* 2 |ULTIMATE.start_main_~x~0#1|) (div (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)))} is VALID [2022-02-20 17:40:28,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {874#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {874#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:40:28,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {953#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {874#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:40:28,178 INFO L290 TraceCheckUtils]: 7: Hoare triple {843#true} ~cond := #in~cond; {953#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:40:28,179 INFO L272 TraceCheckUtils]: 6: Hoare triple {843#true} call __VERIFIER_assert((if main_~z~0#1 + main_~x~0#1 * main_~y~0#1 == main_~a~0#1 * main_~b~0#1 then 1 else 0)); {843#true} is VALID [2022-02-20 17:40:28,179 INFO L290 TraceCheckUtils]: 5: Hoare triple {843#true} assume !!(main_#t~post6#1 < 2);havoc main_#t~post6#1; {843#true} is VALID [2022-02-20 17:40:28,179 INFO L290 TraceCheckUtils]: 4: Hoare triple {843#true} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {843#true} is VALID [2022-02-20 17:40:28,179 INFO L290 TraceCheckUtils]: 3: Hoare triple {843#true} assume { :end_inline_assume_abort_if_not } true;main_~x~0#1 := main_~a~0#1;main_~y~0#1 := main_~b~0#1;main_~z~0#1 := 0; {843#true} is VALID [2022-02-20 17:40:28,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {843#true} assume !(0 == assume_abort_if_not_~cond#1); {843#true} is VALID [2022-02-20 17:40:28,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {843#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_~a~0#1, main_~b~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~b~0#1 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {843#true} is VALID [2022-02-20 17:40:28,179 INFO L290 TraceCheckUtils]: 0: Hoare triple {843#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {843#true} is VALID [2022-02-20 17:40:28,179 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:40:28,179 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:40:28,179 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689772456] [2022-02-20 17:40:28,179 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:40:28,179 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872533344] [2022-02-20 17:40:28,179 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872533344] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:40:28,180 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:40:28,180 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 15 [2022-02-20 17:40:28,180 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907201175] [2022-02-20 17:40:28,180 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:40:28,180 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-02-20 17:40:28,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:40:28,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:40:30,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 32 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 17:40:30,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 17:40:30,698 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:40:30,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 17:40:30,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-02-20 17:40:30,699 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:40:51,388 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []