./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/prod4br-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/prod4br-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 7f0424dbafec10d34a77570c428224cb0ba56b8b9f5906b463f2dcbc550354ee --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:38:09,308 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:38:09,310 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:38:09,336 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:38:09,336 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:38:09,337 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:38:09,339 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:38:09,340 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:38:09,341 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:38:09,342 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:38:09,343 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:38:09,344 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:38:09,344 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:38:09,345 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:38:09,346 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:38:09,347 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:38:09,347 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:38:09,348 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:38:09,350 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:38:09,351 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:38:09,352 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:38:09,353 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:38:09,354 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:38:09,355 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:38:09,358 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:38:09,358 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:38:09,358 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:38:09,359 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:38:09,360 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:38:09,361 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:38:09,361 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:38:09,362 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:38:09,362 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:38:09,363 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:38:09,364 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:38:09,364 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:38:09,365 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:38:09,365 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:38:09,365 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:38:09,366 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:38:09,366 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:38:09,367 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:38:09,386 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:38:09,386 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:38:09,386 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:38:09,387 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:38:09,387 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:38:09,387 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:38:09,388 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:38:09,388 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:38:09,388 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:38:09,389 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:38:09,389 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:38:09,389 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:38:09,389 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:38:09,389 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:38:09,390 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:38:09,390 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:38:09,390 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:38:09,390 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:38:09,390 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:38:09,390 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:38:09,391 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:38:09,391 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:38:09,391 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:38:09,391 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:38:09,391 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:38:09,392 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:38:09,392 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:38:09,392 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:38:09,392 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:38:09,392 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:38:09,393 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:38:09,393 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:38:09,393 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:38:09,393 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 -> 7f0424dbafec10d34a77570c428224cb0ba56b8b9f5906b463f2dcbc550354ee [2022-02-20 17:38:09,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:38:09,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:38:09,629 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:38:09,630 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:38:09,631 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:38:09,632 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_unwindbound2.c [2022-02-20 17:38:09,698 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46d74ae0b/c371cc4404c24adfa817f620c45353db/FLAG70709229e [2022-02-20 17:38:09,989 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:38:09,990 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_unwindbound2.c [2022-02-20 17:38:09,995 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46d74ae0b/c371cc4404c24adfa817f620c45353db/FLAG70709229e [2022-02-20 17:38:10,433 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46d74ae0b/c371cc4404c24adfa817f620c45353db [2022-02-20 17:38:10,435 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:38:10,436 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:38:10,437 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:38:10,437 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:38:10,442 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:38:10,443 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:38:10" (1/1) ... [2022-02-20 17:38:10,444 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a559c56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:10, skipping insertion in model container [2022-02-20 17:38:10,445 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:38:10" (1/1) ... [2022-02-20 17:38:10,451 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:38:10,464 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:38:10,586 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/prod4br-ll_unwindbound2.c[524,537] [2022-02-20 17:38:10,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:38:10,612 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:38:10,622 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/prod4br-ll_unwindbound2.c[524,537] [2022-02-20 17:38:10,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:38:10,647 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:38:10,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:10 WrapperNode [2022-02-20 17:38:10,647 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:38:10,648 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:38:10,648 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:38:10,648 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:38:10,654 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:38:10" (1/1) ... [2022-02-20 17:38:10,659 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:38:10" (1/1) ... [2022-02-20 17:38:10,680 INFO L137 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 59 [2022-02-20 17:38:10,681 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:38:10,681 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:38:10,682 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:38:10,682 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:38:10,689 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:10" (1/1) ... [2022-02-20 17:38:10,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:10" (1/1) ... [2022-02-20 17:38:10,690 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:10" (1/1) ... [2022-02-20 17:38:10,691 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:10" (1/1) ... [2022-02-20 17:38:10,695 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:10" (1/1) ... [2022-02-20 17:38:10,698 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:10" (1/1) ... [2022-02-20 17:38:10,699 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:10" (1/1) ... [2022-02-20 17:38:10,701 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:38:10,701 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:38:10,702 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:38:10,702 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:38:10,703 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:10" (1/1) ... [2022-02-20 17:38:10,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:38:10,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:38:10,728 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:38:10,741 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:38:10,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:38:10,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:38:10,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:38:10,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:38:10,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:38:10,775 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:38:10,822 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:38:10,823 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:38:11,005 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:38:11,010 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:38:11,011 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:38:11,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:38:11 BoogieIcfgContainer [2022-02-20 17:38:11,012 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:38:11,013 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:38:11,013 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:38:11,034 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:38:11,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:38:10" (1/3) ... [2022-02-20 17:38:11,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cb8dbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:38:11, skipping insertion in model container [2022-02-20 17:38:11,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:10" (2/3) ... [2022-02-20 17:38:11,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cb8dbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:38:11, skipping insertion in model container [2022-02-20 17:38:11,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:38:11" (3/3) ... [2022-02-20 17:38:11,036 INFO L111 eAbstractionObserver]: Analyzing ICFG prod4br-ll_unwindbound2.c [2022-02-20 17:38:11,040 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:38:11,040 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:38:11,102 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:38:11,117 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:38:11,121 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:38:11,143 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:38:11,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:38:11,147 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:38:11,148 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:38:11,149 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:38:11,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:38:11,165 INFO L85 PathProgramCache]: Analyzing trace with hash -563977895, now seen corresponding path program 1 times [2022-02-20 17:38:11,177 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:38:11,178 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153502788] [2022-02-20 17:38:11,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:38:11,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:38:11,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:38:11,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#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; {26#true} is VALID [2022-02-20 17:38:11,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#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_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~y~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; {26#true} is VALID [2022-02-20 17:38:11,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {27#false} is VALID [2022-02-20 17:38:11,340 INFO L290 TraceCheckUtils]: 3: Hoare triple {27#false} assume { :end_inline_assume_abort_if_not } true;main_~a~0#1 := main_~x~0#1;main_~b~0#1 := main_~y~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {27#false} is VALID [2022-02-20 17:38:11,341 INFO L290 TraceCheckUtils]: 4: Hoare triple {27#false} assume !true; {27#false} is VALID [2022-02-20 17:38:11,341 INFO L272 TraceCheckUtils]: 5: Hoare triple {27#false} call __VERIFIER_assert((if main_~q~0#1 == main_~x~0#1 * main_~y~0#1 then 1 else 0)); {27#false} is VALID [2022-02-20 17:38:11,341 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-02-20 17:38:11,342 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-02-20 17:38:11,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-02-20 17:38:11,345 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:38:11,345 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:38:11,346 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153502788] [2022-02-20 17:38:11,347 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153502788] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:38:11,347 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:38:11,348 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:38:11,349 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375372479] [2022-02-20 17:38:11,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:38:11,354 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:38:11,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:38:11,360 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:38:11,391 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:38:11,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:38:11,391 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:38:11,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:38:11,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:38:11,426 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) 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:38:11,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:38:11,505 INFO L93 Difference]: Finished difference Result 43 states and 63 transitions. [2022-02-20 17:38:11,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:38:11,505 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:38:11,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:38:11,507 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:38:11,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 63 transitions. [2022-02-20 17:38:11,517 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:38:11,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 63 transitions. [2022-02-20 17:38:11,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 63 transitions. [2022-02-20 17:38:11,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:38:11,635 INFO L225 Difference]: With dead ends: 43 [2022-02-20 17:38:11,635 INFO L226 Difference]: Without dead ends: 19 [2022-02-20 17:38:11,638 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:38:11,643 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:38:11,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:38:11,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-02-20 17:38:11,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-02-20 17:38:11,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:38:11,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:38:11,670 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:38:11,670 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:38:11,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:38:11,696 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2022-02-20 17:38:11,696 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2022-02-20 17:38:11,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:38:11,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:38:11,697 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-02-20 17:38:11,697 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-02-20 17:38:11,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:38:11,704 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2022-02-20 17:38:11,704 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2022-02-20 17:38:11,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:38:11,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:38:11,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:38:11,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:38:11,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:38:11,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2022-02-20 17:38:11,710 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 9 [2022-02-20 17:38:11,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:38:11,730 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2022-02-20 17:38:11,730 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:38:11,730 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2022-02-20 17:38:11,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:38:11,731 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:38:11,731 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:38:11,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:38:11,732 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:38:11,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:38:11,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1986058659, now seen corresponding path program 1 times [2022-02-20 17:38:11,732 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:38:11,733 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924731414] [2022-02-20 17:38:11,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:38:11,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:38:11,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:38:11,818 INFO L290 TraceCheckUtils]: 0: Hoare triple {147#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; {149#(= ~counter~0 0)} is VALID [2022-02-20 17:38:11,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {149#(= ~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_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~y~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; {149#(= ~counter~0 0)} is VALID [2022-02-20 17:38:11,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {149#(= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {149#(= ~counter~0 0)} is VALID [2022-02-20 17:38:11,821 INFO L290 TraceCheckUtils]: 3: Hoare triple {149#(= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;main_~a~0#1 := main_~x~0#1;main_~b~0#1 := main_~y~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {149#(= ~counter~0 0)} is VALID [2022-02-20 17:38:11,821 INFO L290 TraceCheckUtils]: 4: Hoare triple {149#(= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {150#(= |ULTIMATE.start_main_#t~post6#1| 0)} is VALID [2022-02-20 17:38:11,822 INFO L290 TraceCheckUtils]: 5: Hoare triple {150#(= |ULTIMATE.start_main_#t~post6#1| 0)} assume !(main_#t~post6#1 < 2);havoc main_#t~post6#1; {148#false} is VALID [2022-02-20 17:38:11,827 INFO L272 TraceCheckUtils]: 6: Hoare triple {148#false} call __VERIFIER_assert((if main_~q~0#1 == main_~x~0#1 * main_~y~0#1 then 1 else 0)); {148#false} is VALID [2022-02-20 17:38:11,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {148#false} ~cond := #in~cond; {148#false} is VALID [2022-02-20 17:38:11,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {148#false} assume 0 == ~cond; {148#false} is VALID [2022-02-20 17:38:11,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {148#false} assume !false; {148#false} is VALID [2022-02-20 17:38:11,828 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:38:11,829 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:38:11,829 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924731414] [2022-02-20 17:38:11,829 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924731414] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:38:11,829 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:38:11,830 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:38:11,830 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607890696] [2022-02-20 17:38:11,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:38:11,831 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:38:11,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:38:11,832 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:38:11,844 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:38:11,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:38:11,844 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:38:11,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:38:11,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:38:11,846 INFO L87 Difference]: Start difference. First operand 19 states and 25 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:38:11,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:38:11,919 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-02-20 17:38:11,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:38:11,920 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:38:11,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:38:11,920 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:38:11,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-02-20 17:38:11,922 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:38:11,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-02-20 17:38:11,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 36 transitions. [2022-02-20 17:38:11,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:38:11,959 INFO L225 Difference]: With dead ends: 29 [2022-02-20 17:38:11,959 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 17:38:11,959 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:38:11,961 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 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:38:11,961 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:38:11,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 17:38:11,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-20 17:38:11,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:38:11,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:38:11,965 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:38:11,966 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:38:11,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:38:11,967 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2022-02-20 17:38:11,968 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-02-20 17:38:11,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:38:11,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:38:11,969 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 21 states. [2022-02-20 17:38:11,969 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 21 states. [2022-02-20 17:38:11,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:38:11,971 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2022-02-20 17:38:11,971 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-02-20 17:38:11,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:38:11,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:38:11,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:38:11,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:38:11,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:38:11,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-02-20 17:38:11,974 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 10 [2022-02-20 17:38:11,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:38:11,974 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-02-20 17:38:11,975 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:38:11,975 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-02-20 17:38:11,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:38:11,975 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:38:11,976 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:38:11,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:38:11,976 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:38:11,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:38:11,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1984271199, now seen corresponding path program 1 times [2022-02-20 17:38:11,980 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:38:11,980 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203947215] [2022-02-20 17:38:11,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:38:11,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:38:12,001 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:38:12,004 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [875958214] [2022-02-20 17:38:12,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:38:12,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:38:12,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:38:12,007 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:38:12,047 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:38:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:38:12,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 17:38:12,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:38:12,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:38:12,272 INFO L290 TraceCheckUtils]: 0: Hoare triple {260#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; {260#true} is VALID [2022-02-20 17:38:12,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {260#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_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~y~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; {260#true} is VALID [2022-02-20 17:38:12,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {260#true} assume !(0 == assume_abort_if_not_~cond#1); {260#true} is VALID [2022-02-20 17:38:12,273 INFO L290 TraceCheckUtils]: 3: Hoare triple {260#true} assume { :end_inline_assume_abort_if_not } true;main_~a~0#1 := main_~x~0#1;main_~b~0#1 := main_~y~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {274#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:38:12,274 INFO L290 TraceCheckUtils]: 4: Hoare triple {274#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {274#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:38:12,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {274#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} assume !!(main_#t~post6#1 < 2);havoc main_#t~post6#1; {274#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:38:12,275 INFO L272 TraceCheckUtils]: 6: Hoare triple {274#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} call __VERIFIER_assert((if main_~q~0#1 + main_~a~0#1 * main_~b~0#1 * main_~p~0#1 == main_~x~0#1 * main_~y~0#1 then 1 else 0)); {284#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:38:12,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {284#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {288#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:38:12,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {288#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {261#false} is VALID [2022-02-20 17:38:12,277 INFO L290 TraceCheckUtils]: 9: Hoare triple {261#false} assume !false; {261#false} is VALID [2022-02-20 17:38:12,278 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:38:12,278 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:38:12,278 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:38:12,278 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203947215] [2022-02-20 17:38:12,279 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:38:12,279 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875958214] [2022-02-20 17:38:12,279 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875958214] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:38:12,279 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:38:12,280 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:38:12,282 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079817756] [2022-02-20 17:38:12,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:38:12,283 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:38:12,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:38:12,283 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:38:12,292 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:38:12,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:38:12,293 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:38:12,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:38:12,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:38:12,294 INFO L87 Difference]: Start difference. First operand 21 states and 27 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:38:12,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:38:12,504 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-02-20 17:38:12,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:38:12,507 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:38:12,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:38:12,508 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:38:12,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-02-20 17:38:12,511 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:38:12,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-02-20 17:38:12,516 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 45 transitions. [2022-02-20 17:38:12,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:38:12,565 INFO L225 Difference]: With dead ends: 34 [2022-02-20 17:38:12,565 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 17:38:12,566 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:38:12,568 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:38:12,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 58 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:38:12,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 17:38:12,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2022-02-20 17:38:12,577 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:38:12,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 26 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:38:12,578 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 26 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:38:12,578 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 26 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:38:12,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:38:12,587 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-02-20 17:38:12,588 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-02-20 17:38:12,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:38:12,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:38:12,590 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-02-20 17:38:12,591 INFO L87 Difference]: Start difference. First operand has 26 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-02-20 17:38:12,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:38:12,597 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-02-20 17:38:12,598 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-02-20 17:38:12,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:38:12,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:38:12,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:38:12,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:38:12,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:38:12,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-02-20 17:38:12,605 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 10 [2022-02-20 17:38:12,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:38:12,606 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-02-20 17:38:12,606 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:38:12,606 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-02-20 17:38:12,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 17:38:12,607 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:38:12,608 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:38:12,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 17:38:12,830 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:38:12,831 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:38:12,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:38:12,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1194524114, now seen corresponding path program 1 times [2022-02-20 17:38:12,832 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:38:12,832 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890481371] [2022-02-20 17:38:12,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:38:12,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:38:12,848 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:38:12,849 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [158314497] [2022-02-20 17:38:12,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:38:12,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:38:12,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:38:12,850 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:38:12,861 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:38:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:38:12,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 17:38:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:38:12,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:38:23,373 INFO L290 TraceCheckUtils]: 0: Hoare triple {438#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; {438#true} is VALID [2022-02-20 17:38:23,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {438#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_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~y~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; {446#(or (and (not (<= 1 |ULTIMATE.start_main_~y~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_~y~0#1|)))} is VALID [2022-02-20 17:38:23,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {446#(or (and (not (<= 1 |ULTIMATE.start_main_~y~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_~y~0#1|)))} assume !(0 == assume_abort_if_not_~cond#1); {450#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-20 17:38:23,375 INFO L290 TraceCheckUtils]: 3: Hoare triple {450#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume { :end_inline_assume_abort_if_not } true;main_~a~0#1 := main_~x~0#1;main_~b~0#1 := main_~y~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {454#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|))} is VALID [2022-02-20 17:38:23,376 INFO L290 TraceCheckUtils]: 4: Hoare triple {454#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {454#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|))} is VALID [2022-02-20 17:38:23,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {454#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|))} assume !!(main_#t~post6#1 < 2);havoc main_#t~post6#1; {454#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|))} is VALID [2022-02-20 17:38:23,377 INFO L272 TraceCheckUtils]: 6: Hoare triple {454#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|))} call __VERIFIER_assert((if main_~q~0#1 + main_~a~0#1 * main_~b~0#1 * main_~p~0#1 == main_~x~0#1 * main_~y~0#1 then 1 else 0)); {438#true} is VALID [2022-02-20 17:38:23,377 INFO L290 TraceCheckUtils]: 7: Hoare triple {438#true} ~cond := #in~cond; {467#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:38:23,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {467#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {471#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:38:23,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {471#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {471#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:38:25,381 WARN L284 TraceCheckUtils]: 10: Hoare quadruple {471#(not (= |__VERIFIER_assert_#in~cond| 0))} {454#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|))} #63#return; {478#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|) (or (= (+ (* (- 1) |ULTIMATE.start_main_~q~0#1|) (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) 0) (and (not (= |ULTIMATE.start_main_~a~0#1| 0)) (= (mod (+ (* (- 1) |ULTIMATE.start_main_~q~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|)) 0))))} is UNKNOWN [2022-02-20 17:38:25,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {478#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|) (or (= (+ (* (- 1) |ULTIMATE.start_main_~q~0#1|) (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) 0) (and (not (= |ULTIMATE.start_main_~a~0#1| 0)) (= (mod (+ (* (- 1) |ULTIMATE.start_main_~q~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|)) 0))))} assume !(0 != main_~a~0#1 && 0 != main_~b~0#1); {482#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (= (+ (* (- 1) |ULTIMATE.start_main_~q~0#1|) (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) 0))} is VALID [2022-02-20 17:38:25,383 INFO L272 TraceCheckUtils]: 12: Hoare triple {482#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (= (+ (* (- 1) |ULTIMATE.start_main_~q~0#1|) (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) 0))} call __VERIFIER_assert((if main_~q~0#1 == main_~x~0#1 * main_~y~0#1 then 1 else 0)); {486#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:38:25,383 INFO L290 TraceCheckUtils]: 13: Hoare triple {486#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {490#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:38:25,384 INFO L290 TraceCheckUtils]: 14: Hoare triple {490#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {439#false} is VALID [2022-02-20 17:38:25,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {439#false} assume !false; {439#false} is VALID [2022-02-20 17:38:25,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:38:25,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:38:39,558 INFO L290 TraceCheckUtils]: 15: Hoare triple {439#false} assume !false; {439#false} is VALID [2022-02-20 17:38:39,558 INFO L290 TraceCheckUtils]: 14: Hoare triple {490#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {439#false} is VALID [2022-02-20 17:38:39,559 INFO L290 TraceCheckUtils]: 13: Hoare triple {486#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {490#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:38:39,560 INFO L272 TraceCheckUtils]: 12: Hoare triple {506#(= |ULTIMATE.start_main_~q~0#1| (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))} call __VERIFIER_assert((if main_~q~0#1 == main_~x~0#1 * main_~y~0#1 then 1 else 0)); {486#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:38:39,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {510#(or (= |ULTIMATE.start_main_~q~0#1| (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (and (not (= |ULTIMATE.start_main_~b~0#1| 0)) (not (= |ULTIMATE.start_main_~a~0#1| 0))))} assume !(0 != main_~a~0#1 && 0 != main_~b~0#1); {506#(= |ULTIMATE.start_main_~q~0#1| (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:38:39,563 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {471#(not (= |__VERIFIER_assert_#in~cond| 0))} {438#true} #63#return; {510#(or (= |ULTIMATE.start_main_~q~0#1| (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (and (not (= |ULTIMATE.start_main_~b~0#1| 0)) (not (= |ULTIMATE.start_main_~a~0#1| 0))))} is VALID [2022-02-20 17:38:39,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {471#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {471#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:38:39,567 INFO L290 TraceCheckUtils]: 8: Hoare triple {523#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {471#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:38:39,567 INFO L290 TraceCheckUtils]: 7: Hoare triple {438#true} ~cond := #in~cond; {523#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:38:39,568 INFO L272 TraceCheckUtils]: 6: Hoare triple {438#true} call __VERIFIER_assert((if main_~q~0#1 + main_~a~0#1 * main_~b~0#1 * main_~p~0#1 == main_~x~0#1 * main_~y~0#1 then 1 else 0)); {438#true} is VALID [2022-02-20 17:38:39,568 INFO L290 TraceCheckUtils]: 5: Hoare triple {438#true} assume !!(main_#t~post6#1 < 2);havoc main_#t~post6#1; {438#true} is VALID [2022-02-20 17:38:39,568 INFO L290 TraceCheckUtils]: 4: Hoare triple {438#true} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {438#true} is VALID [2022-02-20 17:38:39,568 INFO L290 TraceCheckUtils]: 3: Hoare triple {438#true} assume { :end_inline_assume_abort_if_not } true;main_~a~0#1 := main_~x~0#1;main_~b~0#1 := main_~y~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {438#true} is VALID [2022-02-20 17:38:39,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {438#true} assume !(0 == assume_abort_if_not_~cond#1); {438#true} is VALID [2022-02-20 17:38:39,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {438#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_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~y~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; {438#true} is VALID [2022-02-20 17:38:39,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {438#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; {438#true} is VALID [2022-02-20 17:38:39,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:38:39,569 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:38:39,569 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890481371] [2022-02-20 17:38:39,569 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:38:39,569 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158314497] [2022-02-20 17:38:39,569 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158314497] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:38:39,569 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:38:39,570 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2022-02-20 17:38:39,570 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511366632] [2022-02-20 17:38:39,570 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:38:39,570 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 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 16 [2022-02-20 17:38:39,571 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:38:39,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 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:38:41,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 26 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 17:38:41,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 17:38:41,596 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:38:41,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 17:38:41,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-02-20 17:38:41,597 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 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:38:43,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:38:43,689 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-02-20 17:38:43,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 17:38:43,689 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 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 16 [2022-02-20 17:38:43,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:38:43,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 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:38:43,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 61 transitions. [2022-02-20 17:38:43,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 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:38:43,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 61 transitions. [2022-02-20 17:38:43,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 61 transitions. [2022-02-20 17:38:45,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 60 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 17:38:45,766 INFO L225 Difference]: With dead ends: 47 [2022-02-20 17:38:45,767 INFO L226 Difference]: Without dead ends: 45 [2022-02-20 17:38:45,767 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2022-02-20 17:38:45,768 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 67 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:38:45,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 87 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 17:38:45,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-20 17:38:45,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2022-02-20 17:38:45,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:38:45,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 31 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:38:45,784 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 31 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:38:45,785 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 31 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:38:45,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:38:45,787 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-02-20 17:38:45,788 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-02-20 17:38:45,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:38:45,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:38:45,789 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Second operand 45 states. [2022-02-20 17:38:45,789 INFO L87 Difference]: Start difference. First operand has 31 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Second operand 45 states. [2022-02-20 17:38:45,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:38:45,791 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-02-20 17:38:45,792 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-02-20 17:38:45,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:38:45,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:38:45,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:38:45,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:38:45,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:38:45,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-02-20 17:38:45,794 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 16 [2022-02-20 17:38:45,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:38:45,795 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-02-20 17:38:45,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 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:38:45,795 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-02-20 17:38:45,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:38:45,796 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:38:45,796 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:38:45,815 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:38:46,007 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:38:46,008 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:38:46,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:38:46,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1756733383, now seen corresponding path program 1 times [2022-02-20 17:38:46,009 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:38:46,009 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652082613] [2022-02-20 17:38:46,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:38:46,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:38:46,045 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:38:46,045 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [607281204] [2022-02-20 17:38:46,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:38:46,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:38:46,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:38:46,047 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:38:46,049 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:38:46,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:38:46,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:38:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:38:46,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:38:46,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {760#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; {765#(<= ~counter~0 0)} is VALID [2022-02-20 17:38:46,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {765#(<= ~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_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~y~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; {765#(<= ~counter~0 0)} is VALID [2022-02-20 17:38:46,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {765#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {765#(<= ~counter~0 0)} is VALID [2022-02-20 17:38:46,178 INFO L290 TraceCheckUtils]: 3: Hoare triple {765#(<= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;main_~a~0#1 := main_~x~0#1;main_~b~0#1 := main_~y~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {765#(<= ~counter~0 0)} is VALID [2022-02-20 17:38:46,178 INFO L290 TraceCheckUtils]: 4: Hoare triple {765#(<= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {778#(<= ~counter~0 1)} is VALID [2022-02-20 17:38:46,179 INFO L290 TraceCheckUtils]: 5: Hoare triple {778#(<= ~counter~0 1)} assume !!(main_#t~post6#1 < 2);havoc main_#t~post6#1; {778#(<= ~counter~0 1)} is VALID [2022-02-20 17:38:46,180 INFO L272 TraceCheckUtils]: 6: Hoare triple {778#(<= ~counter~0 1)} call __VERIFIER_assert((if main_~q~0#1 + main_~a~0#1 * main_~b~0#1 * main_~p~0#1 == main_~x~0#1 * main_~y~0#1 then 1 else 0)); {778#(<= ~counter~0 1)} is VALID [2022-02-20 17:38:46,180 INFO L290 TraceCheckUtils]: 7: Hoare triple {778#(<= ~counter~0 1)} ~cond := #in~cond; {778#(<= ~counter~0 1)} is VALID [2022-02-20 17:38:46,181 INFO L290 TraceCheckUtils]: 8: Hoare triple {778#(<= ~counter~0 1)} assume !(0 == ~cond); {778#(<= ~counter~0 1)} is VALID [2022-02-20 17:38:46,181 INFO L290 TraceCheckUtils]: 9: Hoare triple {778#(<= ~counter~0 1)} assume true; {778#(<= ~counter~0 1)} is VALID [2022-02-20 17:38:46,182 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {778#(<= ~counter~0 1)} {778#(<= ~counter~0 1)} #63#return; {778#(<= ~counter~0 1)} is VALID [2022-02-20 17:38:46,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {778#(<= ~counter~0 1)} assume !!(0 != main_~a~0#1 && 0 != main_~b~0#1); {778#(<= ~counter~0 1)} is VALID [2022-02-20 17:38:46,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {778#(<= ~counter~0 1)} assume 0 == (if main_~a~0#1 < 0 && 0 != main_~a~0#1 % 2 then main_~a~0#1 % 2 - 2 else main_~a~0#1 % 2) && 0 == (if main_~b~0#1 < 0 && 0 != main_~b~0#1 % 2 then main_~b~0#1 % 2 - 2 else main_~b~0#1 % 2);main_~a~0#1 := (if main_~a~0#1 < 0 && 0 != main_~a~0#1 % 2 then 1 + main_~a~0#1 / 2 else main_~a~0#1 / 2);main_~b~0#1 := (if main_~b~0#1 < 0 && 0 != main_~b~0#1 % 2 then 1 + main_~b~0#1 / 2 else main_~b~0#1 / 2);main_~p~0#1 := 4 * main_~p~0#1; {778#(<= ~counter~0 1)} is VALID [2022-02-20 17:38:46,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {778#(<= ~counter~0 1)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {806#(<= |ULTIMATE.start_main_#t~post6#1| 1)} is VALID [2022-02-20 17:38:46,185 INFO L290 TraceCheckUtils]: 14: Hoare triple {806#(<= |ULTIMATE.start_main_#t~post6#1| 1)} assume !(main_#t~post6#1 < 2);havoc main_#t~post6#1; {761#false} is VALID [2022-02-20 17:38:46,185 INFO L272 TraceCheckUtils]: 15: Hoare triple {761#false} call __VERIFIER_assert((if main_~q~0#1 == main_~x~0#1 * main_~y~0#1 then 1 else 0)); {761#false} is VALID [2022-02-20 17:38:46,185 INFO L290 TraceCheckUtils]: 16: Hoare triple {761#false} ~cond := #in~cond; {761#false} is VALID [2022-02-20 17:38:46,185 INFO L290 TraceCheckUtils]: 17: Hoare triple {761#false} assume 0 == ~cond; {761#false} is VALID [2022-02-20 17:38:46,186 INFO L290 TraceCheckUtils]: 18: Hoare triple {761#false} assume !false; {761#false} is VALID [2022-02-20 17:38:46,186 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:38:46,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:38:46,285 INFO L290 TraceCheckUtils]: 18: Hoare triple {761#false} assume !false; {761#false} is VALID [2022-02-20 17:38:46,286 INFO L290 TraceCheckUtils]: 17: Hoare triple {761#false} assume 0 == ~cond; {761#false} is VALID [2022-02-20 17:38:46,286 INFO L290 TraceCheckUtils]: 16: Hoare triple {761#false} ~cond := #in~cond; {761#false} is VALID [2022-02-20 17:38:46,286 INFO L272 TraceCheckUtils]: 15: Hoare triple {761#false} call __VERIFIER_assert((if main_~q~0#1 == main_~x~0#1 * main_~y~0#1 then 1 else 0)); {761#false} is VALID [2022-02-20 17:38:46,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {806#(<= |ULTIMATE.start_main_#t~post6#1| 1)} assume !(main_#t~post6#1 < 2);havoc main_#t~post6#1; {761#false} is VALID [2022-02-20 17:38:46,288 INFO L290 TraceCheckUtils]: 13: Hoare triple {778#(<= ~counter~0 1)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {806#(<= |ULTIMATE.start_main_#t~post6#1| 1)} is VALID [2022-02-20 17:38:46,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {778#(<= ~counter~0 1)} assume 0 == (if main_~a~0#1 < 0 && 0 != main_~a~0#1 % 2 then main_~a~0#1 % 2 - 2 else main_~a~0#1 % 2) && 0 == (if main_~b~0#1 < 0 && 0 != main_~b~0#1 % 2 then main_~b~0#1 % 2 - 2 else main_~b~0#1 % 2);main_~a~0#1 := (if main_~a~0#1 < 0 && 0 != main_~a~0#1 % 2 then 1 + main_~a~0#1 / 2 else main_~a~0#1 / 2);main_~b~0#1 := (if main_~b~0#1 < 0 && 0 != main_~b~0#1 % 2 then 1 + main_~b~0#1 / 2 else main_~b~0#1 / 2);main_~p~0#1 := 4 * main_~p~0#1; {778#(<= ~counter~0 1)} is VALID [2022-02-20 17:38:46,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {778#(<= ~counter~0 1)} assume !!(0 != main_~a~0#1 && 0 != main_~b~0#1); {778#(<= ~counter~0 1)} is VALID [2022-02-20 17:38:46,290 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {760#true} {778#(<= ~counter~0 1)} #63#return; {778#(<= ~counter~0 1)} is VALID [2022-02-20 17:38:46,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {760#true} assume true; {760#true} is VALID [2022-02-20 17:38:46,290 INFO L290 TraceCheckUtils]: 8: Hoare triple {760#true} assume !(0 == ~cond); {760#true} is VALID [2022-02-20 17:38:46,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {760#true} ~cond := #in~cond; {760#true} is VALID [2022-02-20 17:38:46,290 INFO L272 TraceCheckUtils]: 6: Hoare triple {778#(<= ~counter~0 1)} call __VERIFIER_assert((if main_~q~0#1 + main_~a~0#1 * main_~b~0#1 * main_~p~0#1 == main_~x~0#1 * main_~y~0#1 then 1 else 0)); {760#true} is VALID [2022-02-20 17:38:46,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {778#(<= ~counter~0 1)} assume !!(main_#t~post6#1 < 2);havoc main_#t~post6#1; {778#(<= ~counter~0 1)} is VALID [2022-02-20 17:38:46,291 INFO L290 TraceCheckUtils]: 4: Hoare triple {765#(<= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {778#(<= ~counter~0 1)} is VALID [2022-02-20 17:38:46,292 INFO L290 TraceCheckUtils]: 3: Hoare triple {765#(<= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;main_~a~0#1 := main_~x~0#1;main_~b~0#1 := main_~y~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {765#(<= ~counter~0 0)} is VALID [2022-02-20 17:38:46,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {765#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {765#(<= ~counter~0 0)} is VALID [2022-02-20 17:38:46,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {765#(<= ~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_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~y~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; {765#(<= ~counter~0 0)} is VALID [2022-02-20 17:38:46,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {760#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; {765#(<= ~counter~0 0)} is VALID [2022-02-20 17:38:46,294 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:38:46,294 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:38:46,294 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652082613] [2022-02-20 17:38:46,294 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:38:46,294 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607281204] [2022-02-20 17:38:46,295 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607281204] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:38:46,295 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:38:46,295 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 5 [2022-02-20 17:38:46,295 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845961073] [2022-02-20 17:38:46,295 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:38:46,296 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 19 [2022-02-20 17:38:46,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:38:46,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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:38:46,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:38:46,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:38:46,318 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:38:46,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:38:46,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:38:46,319 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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:38:46,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:38:46,438 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-02-20 17:38:46,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:38:46,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 19 [2022-02-20 17:38:46,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:38:46,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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:38:46,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-02-20 17:38:46,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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:38:46,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-02-20 17:38:46,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2022-02-20 17:38:46,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:38:46,487 INFO L225 Difference]: With dead ends: 57 [2022-02-20 17:38:46,487 INFO L226 Difference]: Without dead ends: 47 [2022-02-20 17:38:46,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 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:38:46,488 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 14 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:38:46,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 84 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:38:46,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-02-20 17:38:46,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2022-02-20 17:38:46,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:38:46,515 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 45 states, 33 states have (on average 1.303030303030303) internal successors, (43), 35 states have internal predecessors, (43), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:38:46,516 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 45 states, 33 states have (on average 1.303030303030303) internal successors, (43), 35 states have internal predecessors, (43), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:38:46,516 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 45 states, 33 states have (on average 1.303030303030303) internal successors, (43), 35 states have internal predecessors, (43), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:38:46,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:38:46,518 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2022-02-20 17:38:46,518 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-02-20 17:38:46,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:38:46,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:38:46,519 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 33 states have (on average 1.303030303030303) internal successors, (43), 35 states have internal predecessors, (43), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 47 states. [2022-02-20 17:38:46,519 INFO L87 Difference]: Start difference. First operand has 45 states, 33 states have (on average 1.303030303030303) internal successors, (43), 35 states have internal predecessors, (43), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 47 states. [2022-02-20 17:38:46,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:38:46,521 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2022-02-20 17:38:46,522 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-02-20 17:38:46,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:38:46,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:38:46,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:38:46,522 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:38:46,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 33 states have (on average 1.303030303030303) internal successors, (43), 35 states have internal predecessors, (43), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:38:46,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2022-02-20 17:38:46,532 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 19 [2022-02-20 17:38:46,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:38:46,533 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2022-02-20 17:38:46,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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:38:46,533 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2022-02-20 17:38:46,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:38:46,533 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:38:46,533 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:38:46,555 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:38:46,734 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:38:46,734 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:38:46,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:38:46,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1754945923, now seen corresponding path program 1 times [2022-02-20 17:38:46,735 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:38:46,735 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943890787] [2022-02-20 17:38:46,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:38:46,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:38:46,748 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:38:46,748 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1592002058] [2022-02-20 17:38:46,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:38:46,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:38:46,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:38:46,751 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:38:46,757 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:38:46,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:38:46,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-20 17:38:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:38:46,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:38:48,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {1106#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; {1106#true} is VALID [2022-02-20 17:38:48,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {1106#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_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~y~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; {1114#(or (and (not (<= 1 |ULTIMATE.start_main_~y~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_~y~0#1|)))} is VALID [2022-02-20 17:38:48,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {1114#(or (and (not (<= 1 |ULTIMATE.start_main_~y~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_~y~0#1|)))} assume !(0 == assume_abort_if_not_~cond#1); {1118#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-20 17:38:48,052 INFO L290 TraceCheckUtils]: 3: Hoare triple {1118#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume { :end_inline_assume_abort_if_not } true;main_~a~0#1 := main_~x~0#1;main_~b~0#1 := main_~y~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {1122#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:38:48,053 INFO L290 TraceCheckUtils]: 4: Hoare triple {1122#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1122#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:38:48,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {1122#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} assume !!(main_#t~post6#1 < 2);havoc main_#t~post6#1; {1122#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:38:48,054 INFO L272 TraceCheckUtils]: 6: Hoare triple {1122#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} call __VERIFIER_assert((if main_~q~0#1 + main_~a~0#1 * main_~b~0#1 * main_~p~0#1 == main_~x~0#1 * main_~y~0#1 then 1 else 0)); {1106#true} is VALID [2022-02-20 17:38:48,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {1106#true} ~cond := #in~cond; {1106#true} is VALID [2022-02-20 17:38:48,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {1106#true} assume !(0 == ~cond); {1106#true} is VALID [2022-02-20 17:38:48,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {1106#true} assume true; {1106#true} is VALID [2022-02-20 17:38:48,056 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1106#true} {1122#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} #63#return; {1122#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:38:48,057 INFO L290 TraceCheckUtils]: 11: Hoare triple {1122#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} assume !!(0 != main_~a~0#1 && 0 != main_~b~0#1); {1122#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:38:48,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {1122#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} assume 0 == (if main_~a~0#1 < 0 && 0 != main_~a~0#1 % 2 then main_~a~0#1 % 2 - 2 else main_~a~0#1 % 2) && 0 == (if main_~b~0#1 < 0 && 0 != main_~b~0#1 % 2 then main_~b~0#1 % 2 - 2 else main_~b~0#1 % 2);main_~a~0#1 := (if main_~a~0#1 < 0 && 0 != main_~a~0#1 % 2 then 1 + main_~a~0#1 / 2 else main_~a~0#1 / 2);main_~b~0#1 := (if main_~b~0#1 < 0 && 0 != main_~b~0#1 % 2 then 1 + main_~b~0#1 / 2 else main_~b~0#1 / 2);main_~p~0#1 := 4 * main_~p~0#1; {1150#(and (= |ULTIMATE.start_main_~p~0#1| 4) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= (div |ULTIMATE.start_main_~x~0#1| 2) |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~b~0#1| (div |ULTIMATE.start_main_~y~0#1| 2)) (= |ULTIMATE.start_main_~q~0#1| 0) (= (mod |ULTIMATE.start_main_~x~0#1| 2) 0) (<= (mod |ULTIMATE.start_main_~y~0#1| 2) 0))} is VALID [2022-02-20 17:38:48,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {1150#(and (= |ULTIMATE.start_main_~p~0#1| 4) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= (div |ULTIMATE.start_main_~x~0#1| 2) |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~b~0#1| (div |ULTIMATE.start_main_~y~0#1| 2)) (= |ULTIMATE.start_main_~q~0#1| 0) (= (mod |ULTIMATE.start_main_~x~0#1| 2) 0) (<= (mod |ULTIMATE.start_main_~y~0#1| 2) 0))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1150#(and (= |ULTIMATE.start_main_~p~0#1| 4) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= (div |ULTIMATE.start_main_~x~0#1| 2) |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~b~0#1| (div |ULTIMATE.start_main_~y~0#1| 2)) (= |ULTIMATE.start_main_~q~0#1| 0) (= (mod |ULTIMATE.start_main_~x~0#1| 2) 0) (<= (mod |ULTIMATE.start_main_~y~0#1| 2) 0))} is VALID [2022-02-20 17:38:48,059 INFO L290 TraceCheckUtils]: 14: Hoare triple {1150#(and (= |ULTIMATE.start_main_~p~0#1| 4) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= (div |ULTIMATE.start_main_~x~0#1| 2) |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~b~0#1| (div |ULTIMATE.start_main_~y~0#1| 2)) (= |ULTIMATE.start_main_~q~0#1| 0) (= (mod |ULTIMATE.start_main_~x~0#1| 2) 0) (<= (mod |ULTIMATE.start_main_~y~0#1| 2) 0))} assume !!(main_#t~post6#1 < 2);havoc main_#t~post6#1; {1150#(and (= |ULTIMATE.start_main_~p~0#1| 4) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= (div |ULTIMATE.start_main_~x~0#1| 2) |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~b~0#1| (div |ULTIMATE.start_main_~y~0#1| 2)) (= |ULTIMATE.start_main_~q~0#1| 0) (= (mod |ULTIMATE.start_main_~x~0#1| 2) 0) (<= (mod |ULTIMATE.start_main_~y~0#1| 2) 0))} is VALID [2022-02-20 17:38:48,062 INFO L272 TraceCheckUtils]: 15: Hoare triple {1150#(and (= |ULTIMATE.start_main_~p~0#1| 4) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= (div |ULTIMATE.start_main_~x~0#1| 2) |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~b~0#1| (div |ULTIMATE.start_main_~y~0#1| 2)) (= |ULTIMATE.start_main_~q~0#1| 0) (= (mod |ULTIMATE.start_main_~x~0#1| 2) 0) (<= (mod |ULTIMATE.start_main_~y~0#1| 2) 0))} call __VERIFIER_assert((if main_~q~0#1 + main_~a~0#1 * main_~b~0#1 * main_~p~0#1 == main_~x~0#1 * main_~y~0#1 then 1 else 0)); {1160#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:38:48,063 INFO L290 TraceCheckUtils]: 16: Hoare triple {1160#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1164#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:38:48,063 INFO L290 TraceCheckUtils]: 17: Hoare triple {1164#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1107#false} is VALID [2022-02-20 17:38:48,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {1107#false} assume !false; {1107#false} is VALID [2022-02-20 17:38:48,064 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:38:48,064 INFO L328 TraceCheckSpWp]: Computing backward predicates...