./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a31fd051 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/bresenham-ll_unwindbound50.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 0bb6ea6333d2c4e133ad252fe2bcbc17b832f383e2bb5defb402851de157204c --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 11:24:13,675 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 11:24:13,677 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 11:24:13,706 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 11:24:13,706 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 11:24:13,709 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 11:24:13,710 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 11:24:13,712 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 11:24:13,713 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 11:24:13,718 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 11:24:13,718 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 11:24:13,720 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 11:24:13,720 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 11:24:13,721 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 11:24:13,722 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 11:24:13,723 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 11:24:13,724 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 11:24:13,725 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 11:24:13,727 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 11:24:13,729 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 11:24:13,731 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 11:24:13,732 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 11:24:13,733 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 11:24:13,733 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 11:24:13,737 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 11:24:13,737 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 11:24:13,738 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 11:24:13,739 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 11:24:13,739 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 11:24:13,739 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 11:24:13,740 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 11:24:13,740 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 11:24:13,742 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 11:24:13,743 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 11:24:13,743 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 11:24:13,743 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 11:24:13,744 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 11:24:13,744 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 11:24:13,744 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 11:24:13,745 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 11:24:13,746 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 11:24:13,748 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 11:24:13,766 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 11:24:13,772 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 11:24:13,772 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 11:24:13,772 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 11:24:13,773 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 11:24:13,773 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 11:24:13,773 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 11:24:13,774 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 11:24:13,774 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 11:24:13,774 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 11:24:13,774 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 11:24:13,775 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 11:24:13,775 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 11:24:13,775 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 11:24:13,775 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 11:24:13,775 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 11:24:13,775 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 11:24:13,775 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 11:24:13,776 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 11:24:13,776 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 11:24:13,776 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 11:24:13,776 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 11:24:13,776 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 11:24:13,776 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 11:24:13,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 11:24:13,777 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 11:24:13,777 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 11:24:13,777 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 11:24:13,777 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 11:24:13,777 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 11:24:13,777 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 11:24:13,778 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 11:24:13,778 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 11:24:13,778 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 11:24:13,778 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 11:24:13,778 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 0bb6ea6333d2c4e133ad252fe2bcbc17b832f383e2bb5defb402851de157204c [2023-02-15 11:24:13,923 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 11:24:13,935 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 11:24:13,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 11:24:13,938 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 11:24:13,938 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 11:24:13,938 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c [2023-02-15 11:24:14,828 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 11:24:14,998 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 11:24:14,998 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c [2023-02-15 11:24:15,004 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c36df2ad5/dfb76126529f4a5f8badf784c4be51ac/FLAGdd2958b65 [2023-02-15 11:24:15,409 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c36df2ad5/dfb76126529f4a5f8badf784c4be51ac [2023-02-15 11:24:15,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 11:24:15,411 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 11:24:15,412 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 11:24:15,412 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 11:24:15,414 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 11:24:15,414 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 11:24:15" (1/1) ... [2023-02-15 11:24:15,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@457b07ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:24:15, skipping insertion in model container [2023-02-15 11:24:15,415 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 11:24:15" (1/1) ... [2023-02-15 11:24:15,419 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 11:24:15,428 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 11:24:15,503 WARN L237 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/bresenham-ll_unwindbound50.c[597,610] [2023-02-15 11:24:15,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 11:24:15,518 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 11:24:15,525 WARN L237 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/bresenham-ll_unwindbound50.c[597,610] [2023-02-15 11:24:15,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 11:24:15,537 INFO L208 MainTranslator]: Completed translation [2023-02-15 11:24:15,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:24:15 WrapperNode [2023-02-15 11:24:15,537 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 11:24:15,538 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 11:24:15,538 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 11:24:15,538 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 11:24:15,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:24:15" (1/1) ... [2023-02-15 11:24:15,546 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:24:15" (1/1) ... [2023-02-15 11:24:15,556 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2023-02-15 11:24:15,556 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 11:24:15,557 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 11:24:15,557 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 11:24:15,557 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 11:24:15,561 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:24:15" (1/1) ... [2023-02-15 11:24:15,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:24:15" (1/1) ... [2023-02-15 11:24:15,562 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:24:15" (1/1) ... [2023-02-15 11:24:15,563 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:24:15" (1/1) ... [2023-02-15 11:24:15,564 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:24:15" (1/1) ... [2023-02-15 11:24:15,566 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:24:15" (1/1) ... [2023-02-15 11:24:15,566 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:24:15" (1/1) ... [2023-02-15 11:24:15,567 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:24:15" (1/1) ... [2023-02-15 11:24:15,568 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 11:24:15,568 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 11:24:15,568 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 11:24:15,568 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 11:24:15,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:24:15" (1/1) ... [2023-02-15 11:24:15,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 11:24:15,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 11:24:15,588 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) [2023-02-15 11:24:15,594 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 [2023-02-15 11:24:15,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 11:24:15,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 11:24:15,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 11:24:15,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 11:24:15,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-15 11:24:15,619 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-15 11:24:15,661 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 11:24:15,662 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 11:24:15,748 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 11:24:15,751 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 11:24:15,762 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-15 11:24:15,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:24:15 BoogieIcfgContainer [2023-02-15 11:24:15,769 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 11:24:15,771 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 11:24:15,771 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 11:24:15,773 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 11:24:15,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 11:24:15" (1/3) ... [2023-02-15 11:24:15,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@296deb3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 11:24:15, skipping insertion in model container [2023-02-15 11:24:15,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:24:15" (2/3) ... [2023-02-15 11:24:15,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@296deb3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 11:24:15, skipping insertion in model container [2023-02-15 11:24:15,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:24:15" (3/3) ... [2023-02-15 11:24:15,776 INFO L112 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound50.c [2023-02-15 11:24:15,788 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 11:24:15,788 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 11:24:15,824 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 11:24:15,829 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@215a990d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 11:24:15,829 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 11:24:15,832 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 11:24:15,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-15 11:24:15,836 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:24:15,837 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:24:15,837 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:24:15,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:24:15,842 INFO L85 PathProgramCache]: Analyzing trace with hash 180444447, now seen corresponding path program 1 times [2023-02-15 11:24:15,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:24:15,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644288706] [2023-02-15 11:24:15,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:24:15,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:24:15,933 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 11:24:15,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [108780285] [2023-02-15 11:24:15,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:24:15,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:24:15,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 11:24:15,936 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) [2023-02-15 11:24:16,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 11:24:16,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:24:16,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 11:24:16,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 11:24:16,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 11:24:16,192 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 11:24:16,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:24:16,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644288706] [2023-02-15 11:24:16,193 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 11:24:16,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108780285] [2023-02-15 11:24:16,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108780285] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 11:24:16,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 11:24:16,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 11:24:16,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425576051] [2023-02-15 11:24:16,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 11:24:16,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 11:24:16,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:24:16,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 11:24:16,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 11:24:16,223 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 11:24:16,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:24:16,351 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2023-02-15 11:24:16,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 11:24:16,353 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-15 11:24:16,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:24:16,358 INFO L225 Difference]: With dead ends: 54 [2023-02-15 11:24:16,358 INFO L226 Difference]: Without dead ends: 25 [2023-02-15 11:24:16,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-15 11:24:16,364 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 18 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 11:24:16,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 64 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 11:24:16,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-15 11:24:16,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2023-02-15 11:24:16,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 11:24:16,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2023-02-15 11:24:16,396 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 8 [2023-02-15 11:24:16,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:24:16,396 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2023-02-15 11:24:16,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 11:24:16,397 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2023-02-15 11:24:16,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 11:24:16,397 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:24:16,397 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:24:16,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 11:24:16,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-02-15 11:24:16,603 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:24:16,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:24:16,603 INFO L85 PathProgramCache]: Analyzing trace with hash 2080570626, now seen corresponding path program 1 times [2023-02-15 11:24:16,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:24:16,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290511765] [2023-02-15 11:24:16,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:24:16,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:24:16,618 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 11:24:16,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1029720529] [2023-02-15 11:24:16,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:24:16,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:24:16,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 11:24:16,628 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) [2023-02-15 11:24:16,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 11:24:16,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:24:16,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-15 11:24:16,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 11:24:16,865 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 11:24:16,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 11:24:17,031 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 11:24:17,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:24:17,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290511765] [2023-02-15 11:24:17,032 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 11:24:17,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029720529] [2023-02-15 11:24:17,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029720529] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 11:24:17,032 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 11:24:17,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2023-02-15 11:24:17,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106488341] [2023-02-15 11:24:17,032 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 11:24:17,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-15 11:24:17,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:24:17,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-15 11:24:17,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2023-02-15 11:24:17,034 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 16 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 11:24:17,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:24:17,230 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2023-02-15 11:24:17,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 11:24:17,230 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (4), 3 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 18 [2023-02-15 11:24:17,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:24:17,231 INFO L225 Difference]: With dead ends: 41 [2023-02-15 11:24:17,231 INFO L226 Difference]: Without dead ends: 34 [2023-02-15 11:24:17,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2023-02-15 11:24:17,232 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 34 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 11:24:17,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 64 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 11:24:17,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-02-15 11:24:17,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2023-02-15 11:24:17,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 11:24:17,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2023-02-15 11:24:17,237 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 18 [2023-02-15 11:24:17,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:24:17,237 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2023-02-15 11:24:17,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 11:24:17,237 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2023-02-15 11:24:17,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 11:24:17,238 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:24:17,238 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:24:17,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-15 11:24:17,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-02-15 11:24:17,443 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:24:17,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:24:17,443 INFO L85 PathProgramCache]: Analyzing trace with hash 680664555, now seen corresponding path program 1 times [2023-02-15 11:24:17,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:24:17,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274964143] [2023-02-15 11:24:17,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:24:17,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:24:17,450 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 11:24:17,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [154369149] [2023-02-15 11:24:17,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:24:17,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:24:17,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 11:24:17,451 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) [2023-02-15 11:24:17,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 11:24:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:24:17,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 11:24:17,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 11:24:17,502 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 11:24:17,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 11:24:17,525 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 11:24:17,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:24:17,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274964143] [2023-02-15 11:24:17,525 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 11:24:17,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154369149] [2023-02-15 11:24:17,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154369149] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 11:24:17,526 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 11:24:17,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-02-15 11:24:17,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380169332] [2023-02-15 11:24:17,526 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 11:24:17,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 11:24:17,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:24:17,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 11:24:17,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-15 11:24:17,527 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 11:24:17,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:24:17,566 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2023-02-15 11:24:17,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 11:24:17,567 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2023-02-15 11:24:17,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:24:17,567 INFO L225 Difference]: With dead ends: 73 [2023-02-15 11:24:17,568 INFO L226 Difference]: Without dead ends: 67 [2023-02-15 11:24:17,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-02-15 11:24:17,569 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 11:24:17,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 106 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 11:24:17,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-02-15 11:24:17,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2023-02-15 11:24:17,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 11:24:17,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2023-02-15 11:24:17,576 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 19 [2023-02-15 11:24:17,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:24:17,577 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2023-02-15 11:24:17,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 11:24:17,577 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2023-02-15 11:24:17,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 11:24:17,577 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:24:17,578 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:24:17,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 11:24:17,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:24:17,782 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:24:17,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:24:17,783 INFO L85 PathProgramCache]: Analyzing trace with hash 713886481, now seen corresponding path program 1 times [2023-02-15 11:24:17,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:24:17,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851747117] [2023-02-15 11:24:17,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:24:17,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:24:17,809 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 11:24:17,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [677454213] [2023-02-15 11:24:17,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:24:17,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:24:17,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 11:24:17,811 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) [2023-02-15 11:24:17,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 11:24:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:24:17,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-15 11:24:17,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 11:24:18,070 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 11:24:18,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 11:24:18,342 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 11:24:18,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:24:18,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851747117] [2023-02-15 11:24:18,343 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 11:24:18,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677454213] [2023-02-15 11:24:18,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677454213] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 11:24:18,343 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 11:24:18,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2023-02-15 11:24:18,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447158499] [2023-02-15 11:24:18,343 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 11:24:18,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-15 11:24:18,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:24:18,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-15 11:24:18,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2023-02-15 11:24:18,344 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 23 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 11:24:18,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:24:18,850 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2023-02-15 11:24:18,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-15 11:24:18,851 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 25 [2023-02-15 11:24:18,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:24:18,851 INFO L225 Difference]: With dead ends: 65 [2023-02-15 11:24:18,851 INFO L226 Difference]: Without dead ends: 57 [2023-02-15 11:24:18,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=261, Invalid=1299, Unknown=0, NotChecked=0, Total=1560 [2023-02-15 11:24:18,852 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 57 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 11:24:18,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 78 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 11:24:18,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-02-15 11:24:18,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2023-02-15 11:24:18,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 11:24:18,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2023-02-15 11:24:18,860 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 25 [2023-02-15 11:24:18,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:24:18,861 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2023-02-15 11:24:18,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 11:24:18,861 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2023-02-15 11:24:18,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 11:24:18,862 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:24:18,862 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:24:18,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 11:24:19,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:24:19,066 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:24:19,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:24:19,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1582515168, now seen corresponding path program 1 times [2023-02-15 11:24:19,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:24:19,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752918665] [2023-02-15 11:24:19,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:24:19,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:24:19,085 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 11:24:19,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1453653838] [2023-02-15 11:24:19,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:24:19,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:24:19,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 11:24:19,100 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 11:24:19,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 11:24:19,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:24:19,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 11:24:19,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 11:24:19,209 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 11:24:19,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 11:24:19,290 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-15 11:24:19,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:24:19,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752918665] [2023-02-15 11:24:19,291 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 11:24:19,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453653838] [2023-02-15 11:24:19,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453653838] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 11:24:19,291 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 11:24:19,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-02-15 11:24:19,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325288153] [2023-02-15 11:24:19,291 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 11:24:19,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 11:24:19,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:24:19,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 11:24:19,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-02-15 11:24:19,293 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-15 11:24:19,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:24:19,427 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2023-02-15 11:24:19,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 11:24:19,427 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 49 [2023-02-15 11:24:19,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:24:19,428 INFO L225 Difference]: With dead ends: 116 [2023-02-15 11:24:19,428 INFO L226 Difference]: Without dead ends: 110 [2023-02-15 11:24:19,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2023-02-15 11:24:19,429 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 45 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 11:24:19,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 166 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 11:24:19,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-02-15 11:24:19,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2023-02-15 11:24:19,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 88 states have (on average 1.125) internal successors, (99), 88 states have internal predecessors, (99), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-15 11:24:19,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2023-02-15 11:24:19,444 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 49 [2023-02-15 11:24:19,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:24:19,444 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2023-02-15 11:24:19,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-15 11:24:19,444 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2023-02-15 11:24:19,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-02-15 11:24:19,446 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:24:19,446 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:24:19,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-15 11:24:19,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:24:19,651 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:24:19,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:24:19,651 INFO L85 PathProgramCache]: Analyzing trace with hash 297311502, now seen corresponding path program 2 times [2023-02-15 11:24:19,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:24:19,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668716952] [2023-02-15 11:24:19,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:24:19,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:24:19,662 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 11:24:19,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2097370354] [2023-02-15 11:24:19,662 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 11:24:19,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:24:19,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 11:24:19,663 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 11:24:19,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 11:24:19,722 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 11:24:19,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 11:24:19,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-15 11:24:19,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 11:24:19,893 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 470 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 11:24:19,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 11:24:20,108 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 290 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-02-15 11:24:20,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:24:20,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668716952] [2023-02-15 11:24:20,108 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 11:24:20,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097370354] [2023-02-15 11:24:20,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097370354] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 11:24:20,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 11:24:20,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2023-02-15 11:24:20,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824976983] [2023-02-15 11:24:20,109 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 11:24:20,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-15 11:24:20,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:24:20,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-15 11:24:20,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2023-02-15 11:24:20,110 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand has 26 states, 26 states have (on average 5.576923076923077) internal successors, (145), 26 states have internal predecessors, (145), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-15 11:24:20,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:24:20,424 INFO L93 Difference]: Finished difference Result 236 states and 269 transitions. [2023-02-15 11:24:20,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-02-15 11:24:20,425 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.576923076923077) internal successors, (145), 26 states have internal predecessors, (145), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Word has length 109 [2023-02-15 11:24:20,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:24:20,427 INFO L225 Difference]: With dead ends: 236 [2023-02-15 11:24:20,427 INFO L226 Difference]: Without dead ends: 230 [2023-02-15 11:24:20,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2023-02-15 11:24:20,428 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 127 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 11:24:20,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 286 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 11:24:20,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-02-15 11:24:20,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2023-02-15 11:24:20,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 184 states have (on average 1.125) internal successors, (207), 184 states have internal predecessors, (207), 23 states have call successors, (23), 23 states have call predecessors, (23), 22 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-02-15 11:24:20,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 252 transitions. [2023-02-15 11:24:20,450 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 252 transitions. Word has length 109 [2023-02-15 11:24:20,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:24:20,450 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 252 transitions. [2023-02-15 11:24:20,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.576923076923077) internal successors, (145), 26 states have internal predecessors, (145), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-15 11:24:20,451 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 252 transitions. [2023-02-15 11:24:20,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-02-15 11:24:20,453 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:24:20,453 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:24:20,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-15 11:24:20,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:24:20,658 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:24:20,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:24:20,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1294150550, now seen corresponding path program 3 times [2023-02-15 11:24:20,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:24:20,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664711426] [2023-02-15 11:24:20,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:24:20,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:24:20,670 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 11:24:20,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [282408243] [2023-02-15 11:24:20,670 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 11:24:20,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:24:20,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 11:24:20,672 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 11:24:20,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 11:24:20,758 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-02-15 11:24:20,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 11:24:20,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-15 11:24:20,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 11:24:21,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 234 proven. 1 refuted. 0 times theorem prover too weak. 2163 trivial. 0 not checked. [2023-02-15 11:24:21,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 11:24:21,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 106 proven. 129 refuted. 0 times theorem prover too weak. 2163 trivial. 0 not checked. [2023-02-15 11:24:21,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:24:21,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664711426] [2023-02-15 11:24:21,280 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 11:24:21,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282408243] [2023-02-15 11:24:21,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282408243] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 11:24:21,281 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 11:24:21,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-02-15 11:24:21,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139586781] [2023-02-15 11:24:21,281 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 11:24:21,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 11:24:21,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:24:21,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 11:24:21,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2023-02-15 11:24:21,282 INFO L87 Difference]: Start difference. First operand 230 states and 252 transitions. Second operand has 18 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 17 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 11:24:21,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:24:21,452 INFO L93 Difference]: Finished difference Result 449 states and 492 transitions. [2023-02-15 11:24:21,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 11:24:21,452 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 17 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 229 [2023-02-15 11:24:21,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:24:21,454 INFO L225 Difference]: With dead ends: 449 [2023-02-15 11:24:21,454 INFO L226 Difference]: Without dead ends: 443 [2023-02-15 11:24:21,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 439 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2023-02-15 11:24:21,455 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 22 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 11:24:21,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 77 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 11:24:21,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2023-02-15 11:24:21,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 440. [2023-02-15 11:24:21,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 352 states have (on average 1.125) internal successors, (396), 352 states have internal predecessors, (396), 44 states have call successors, (44), 44 states have call predecessors, (44), 43 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2023-02-15 11:24:21,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 483 transitions. [2023-02-15 11:24:21,494 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 483 transitions. Word has length 229 [2023-02-15 11:24:21,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:24:21,495 INFO L495 AbstractCegarLoop]: Abstraction has 440 states and 483 transitions. [2023-02-15 11:24:21,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 17 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 11:24:21,495 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 483 transitions. [2023-02-15 11:24:21,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-02-15 11:24:21,498 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:24:21,498 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:24:21,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 11:24:21,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:24:21,703 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:24:21,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:24:21,703 INFO L85 PathProgramCache]: Analyzing trace with hash -614092180, now seen corresponding path program 1 times [2023-02-15 11:24:21,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:24:21,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035068244] [2023-02-15 11:24:21,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:24:21,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:24:21,715 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 11:24:21,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1486214418] [2023-02-15 11:24:21,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:24:21,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:24:21,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 11:24:21,725 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 11:24:21,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 11:24:21,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:24:21,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 47 conjunts are in the unsatisfiable core [2023-02-15 11:24:21,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 11:24:22,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 44 proven. 2354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 11:24:22,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 11:24:22,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 44 proven. 1430 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-02-15 11:24:22,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:24:22,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035068244] [2023-02-15 11:24:22,908 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 11:24:22,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486214418] [2023-02-15 11:24:22,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486214418] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 11:24:22,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 11:24:22,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2023-02-15 11:24:22,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469723474] [2023-02-15 11:24:22,908 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 11:24:22,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-02-15 11:24:22,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:24:22,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-02-15 11:24:22,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2023-02-15 11:24:22,912 INFO L87 Difference]: Start difference. First operand 440 states and 483 transitions. Second operand has 50 states, 50 states have (on average 6.02) internal successors, (301), 50 states have internal predecessors, (301), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-02-15 11:24:23,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:24:23,926 INFO L93 Difference]: Finished difference Result 929 states and 1043 transitions. [2023-02-15 11:24:23,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2023-02-15 11:24:23,927 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 6.02) internal successors, (301), 50 states have internal predecessors, (301), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Word has length 229 [2023-02-15 11:24:23,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:24:23,930 INFO L225 Difference]: With dead ends: 929 [2023-02-15 11:24:23,930 INFO L226 Difference]: Without dead ends: 923 [2023-02-15 11:24:23,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2023-02-15 11:24:23,933 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 354 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 11:24:23,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 544 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 11:24:23,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2023-02-15 11:24:24,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 920. [2023-02-15 11:24:24,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 736 states have (on average 1.125) internal successors, (828), 736 states have internal predecessors, (828), 92 states have call successors, (92), 92 states have call predecessors, (92), 91 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2023-02-15 11:24:24,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1011 transitions. [2023-02-15 11:24:24,013 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1011 transitions. Word has length 229 [2023-02-15 11:24:24,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:24:24,014 INFO L495 AbstractCegarLoop]: Abstraction has 920 states and 1011 transitions. [2023-02-15 11:24:24,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 6.02) internal successors, (301), 50 states have internal predecessors, (301), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-02-15 11:24:24,014 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1011 transitions. [2023-02-15 11:24:24,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2023-02-15 11:24:24,020 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:24:24,020 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 46, 45, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:24:24,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-02-15 11:24:24,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-02-15 11:24:24,225 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:24:24,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:24:24,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1651100380, now seen corresponding path program 2 times [2023-02-15 11:24:24,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:24:24,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931354022] [2023-02-15 11:24:24,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:24:24,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:24:24,257 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 11:24:24,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1664570355] [2023-02-15 11:24:24,258 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 11:24:24,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:24:24,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 11:24:24,260 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 11:24:24,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 11:24:24,454 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 11:24:24,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 11:24:24,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 1161 conjuncts, 95 conjunts are in the unsatisfiable core [2023-02-15 11:24:24,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 11:24:25,611 INFO L134 CoverageAnalysis]: Checked inductivity of 10534 backedges. 92 proven. 10442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 11:24:25,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 11:24:26,781 INFO L134 CoverageAnalysis]: Checked inductivity of 10534 backedges. 92 proven. 6302 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2023-02-15 11:24:26,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:24:26,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931354022] [2023-02-15 11:24:26,781 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 11:24:26,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664570355] [2023-02-15 11:24:26,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664570355] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 11:24:26,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 11:24:26,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 54 [2023-02-15 11:24:26,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191467209] [2023-02-15 11:24:26,782 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 11:24:26,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-02-15 11:24:26,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:24:26,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-02-15 11:24:26,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2023-02-15 11:24:26,785 INFO L87 Difference]: Start difference. First operand 920 states and 1011 transitions. Second operand has 54 states, 54 states have (on average 7.388888888888889) internal successors, (399), 54 states have internal predecessors, (399), 50 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 49 states have call predecessors, (92), 49 states have call successors, (92) [2023-02-15 11:24:27,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:24:27,934 INFO L93 Difference]: Finished difference Result 1009 states and 1111 transitions. [2023-02-15 11:24:27,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2023-02-15 11:24:27,935 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 7.388888888888889) internal successors, (399), 54 states have internal predecessors, (399), 50 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 49 states have call predecessors, (92), 49 states have call successors, (92) Word has length 469 [2023-02-15 11:24:27,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:24:27,939 INFO L225 Difference]: With dead ends: 1009 [2023-02-15 11:24:27,939 INFO L226 Difference]: Without dead ends: 1003 [2023-02-15 11:24:27,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 985 GetRequests, 840 SyntacticMatches, 44 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2350 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3926, Invalid=6580, Unknown=0, NotChecked=0, Total=10506 [2023-02-15 11:24:27,941 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 143 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 11:24:27,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 521 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 11:24:27,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2023-02-15 11:24:27,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 1000. [2023-02-15 11:24:27,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 800 states have (on average 1.125) internal successors, (900), 800 states have internal predecessors, (900), 100 states have call successors, (100), 100 states have call predecessors, (100), 99 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2023-02-15 11:24:27,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1099 transitions. [2023-02-15 11:24:27,993 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1099 transitions. Word has length 469 [2023-02-15 11:24:27,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:24:27,993 INFO L495 AbstractCegarLoop]: Abstraction has 1000 states and 1099 transitions. [2023-02-15 11:24:27,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 7.388888888888889) internal successors, (399), 54 states have internal predecessors, (399), 50 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 49 states have call predecessors, (92), 49 states have call successors, (92) [2023-02-15 11:24:27,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1099 transitions. [2023-02-15 11:24:27,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2023-02-15 11:24:27,999 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:24:27,999 INFO L195 NwaCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 50, 49, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:24:28,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-15 11:24:28,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:24:28,206 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:24:28,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:24:28,206 INFO L85 PathProgramCache]: Analyzing trace with hash -234739816, now seen corresponding path program 3 times [2023-02-15 11:24:28,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:24:28,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285557001] [2023-02-15 11:24:28,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:24:28,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:24:28,222 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 11:24:28,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [588368555] [2023-02-15 11:24:28,222 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 11:24:28,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:24:28,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 11:24:28,224 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 11:24:28,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 11:24:28,541 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2023-02-15 11:24:28,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-15 11:24:28,542 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 11:24:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 11:24:28,835 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 11:24:28,835 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 11:24:28,836 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-15 11:24:28,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-15 11:24:29,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-15 11:24:29,047 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1] [2023-02-15 11:24:29,049 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 11:24:29,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 11:24:29 BoogieIcfgContainer [2023-02-15 11:24:29,214 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 11:24:29,214 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 11:24:29,214 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 11:24:29,214 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 11:24:29,214 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:24:15" (3/4) ... [2023-02-15 11:24:29,216 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-15 11:24:29,319 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 11:24:29,319 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 11:24:29,320 INFO L158 Benchmark]: Toolchain (without parser) took 13908.88ms. Allocated memory was 142.6MB in the beginning and 249.6MB in the end (delta: 107.0MB). Free memory was 106.2MB in the beginning and 151.9MB in the end (delta: -45.6MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. [2023-02-15 11:24:29,320 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 107.0MB. Free memory was 55.5MB in the beginning and 55.4MB in the end (delta: 134.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 11:24:29,321 INFO L158 Benchmark]: CACSL2BoogieTranslator took 125.70ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 95.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 11:24:29,321 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.26ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 94.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 11:24:29,321 INFO L158 Benchmark]: Boogie Preprocessor took 11.24ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 93.2MB in the end (delta: 717.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 11:24:29,321 INFO L158 Benchmark]: RCFGBuilder took 200.97ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 82.8MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 11:24:29,322 INFO L158 Benchmark]: TraceAbstraction took 13443.04ms. Allocated memory was 142.6MB in the beginning and 249.6MB in the end (delta: 107.0MB). Free memory was 82.0MB in the beginning and 171.8MB in the end (delta: -89.8MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2023-02-15 11:24:29,322 INFO L158 Benchmark]: Witness Printer took 105.63ms. Allocated memory is still 249.6MB. Free memory was 171.8MB in the beginning and 151.9MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-02-15 11:24:29,323 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 107.0MB. Free memory was 55.5MB in the beginning and 55.4MB in the end (delta: 134.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 125.70ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 95.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.26ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 94.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 11.24ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 93.2MB in the end (delta: 717.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 200.97ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 82.8MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 13443.04ms. Allocated memory was 142.6MB in the beginning and 249.6MB in the end (delta: 107.0MB). Free memory was 82.0MB in the beginning and 171.8MB in the end (delta: -89.8MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * Witness Printer took 105.63ms. Allocated memory is still 249.6MB. Free memory was 171.8MB in the beginning and 151.9MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L21] int counter = 0; VAL [counter=0] [L23] int X, Y; [L24] long long x, y, v, xy, yx; [L25] X = __VERIFIER_nondet_int() [L26] Y = __VERIFIER_nondet_int() [L27] v = ((long long) 2 * Y) - X [L28] y = 0 [L29] x = 0 VAL [counter=0, v=-193, X=197, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=1, counter++=0, v=-193, x=0, X=197, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=1, v=-193, X=197, x=0, x=0, x=0, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=1, v=-193, x=0, X=197, x=0, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=1, v=-193, x=0, x=0, x=0, X=197, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=1, v=-189, x=0, X=197, x=0, x=0, Y=2, y=0] [L45] x++ VAL [counter=1, v=-189, x=0, x=1, X=197, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=2, counter++=1, v=-189, x=0, x=1, x=0, X=197, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=2, v=-189, x=1, x=2, x=0, X=197, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=2] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=2, v=-189, x=2, x=0, x=1, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=2, v=-189, x=2, x=0, x=1, X=197, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=2, v=-185, x=1, x=0, x=2, X=197, Y=2, y=0] [L45] x++ VAL [counter=2, v=-185, x=2, X=197, x=0, x=2, y=0, Y=2] [L31] EXPR counter++ VAL [counter=3, counter++=2, v=-185, x=2, x=0, X=197, x=2, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=3, v=-185, x=2, x=4, x=0, X=197, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=3] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=3, v=-185, x=2, x=0, x=4, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=3, v=-185, x=4, X=197, x=0, x=2, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=3, v=-181, x=0, X=197, x=2, x=4, y=0, Y=2] [L45] x++ VAL [counter=3, v=-181, X=197, x=0, x=4, x=3, Y=2, y=0] [L31] EXPR counter++ VAL [counter=4, counter++=3, v=-181, x=0, x=3, X=197, x=4, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=4, v=-181, X=197, x=3, x=0, x=6, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=4] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=4, v=-181, X=197, x=0, x=6, x=3, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=4, v=-181, x=0, x=3, X=197, x=6, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=4, v=-177, x=0, X=197, x=6, x=3, Y=2, y=0] [L45] x++ VAL [counter=4, v=-177, x=6, x=0, x=4, X=197, Y=2, y=0] [L31] EXPR counter++ VAL [counter=5, counter++=4, v=-177, x=4, x=6, x=0, X=197, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=5, v=-177, x=0, X=197, x=4, x=8, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=5] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=5, v=-177, x=8, X=197, x=4, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=5, v=-177, x=0, x=8, x=4, X=197, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=5, v=-173, x=0, x=4, x=8, X=197, y=0, Y=2] [L45] x++ VAL [counter=5, v=-173, x=0, x=8, X=197, x=5, y=0, Y=2] [L31] EXPR counter++ VAL [counter=6, counter++=5, v=-173, x=5, x=0, x=8, X=197, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=6, v=-173, x=10, x=5, x=0, X=197, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=6] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=6, v=-173, X=197, x=0, x=5, x=10, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=6, v=-173, X=197, x=5, x=10, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=6, v=-169, x=5, X=197, x=10, x=0, y=0, Y=2] [L45] x++ VAL [counter=6, v=-169, x=0, x=6, X=197, x=10, y=0, Y=2] [L31] EXPR counter++ VAL [counter=7, counter++=6, v=-169, x=6, X=197, x=10, x=0, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=7, v=-169, x=0, x=12, x=6, X=197, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=7] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=7, v=-169, x=12, X=197, x=6, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=7, v=-169, X=197, x=12, x=0, x=6, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=7, v=-165, x=6, x=12, X=197, x=0, y=0, Y=2] [L45] x++ VAL [counter=7, v=-165, x=7, x=0, x=12, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=8, counter++=7, v=-165, x=12, x=7, X=197, x=0, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=8, v=-165, x=0, x=14, x=7, X=197, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=8] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=8, v=-165, X=197, x=7, x=14, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=8, v=-165, x=14, x=7, X=197, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=8, v=-161, x=14, X=197, x=0, x=7, Y=2, y=0] [L45] x++ VAL [counter=8, v=-161, x=8, X=197, x=0, x=14, Y=2, y=0] [L31] EXPR counter++ VAL [counter=9, counter++=8, v=-161, x=14, x=8, X=197, x=0, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=9, v=-161, x=16, x=8, X=197, x=0, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=9] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=9, v=-161, x=0, x=16, x=8, X=197, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=9, v=-161, x=8, x=16, x=0, X=197, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=9, v=-157, x=16, x=0, x=8, X=197, y=0, Y=2] [L45] x++ VAL [counter=9, v=-157, X=197, x=16, x=9, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=10, counter++=9, v=-157, x=16, x=0, X=197, x=9, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=10, v=-157, x=0, X=197, x=9, x=18, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=10] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=10, v=-157, x=9, x=18, x=0, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=10, v=-157, x=9, x=0, X=197, x=18, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=10, v=-153, x=0, x=18, x=9, X=197, Y=2, y=0] [L45] x++ VAL [counter=10, v=-153, x=0, X=197, x=10, x=18, y=0, Y=2] [L31] EXPR counter++ VAL [counter=11, counter++=10, v=-153, x=10, X=197, x=18, x=0, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=11, v=-153, X=197, x=0, x=20, x=10, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=11] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=11, v=-153, x=20, x=0, X=197, x=10, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=11, v=-153, x=20, X=197, x=0, x=10, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=11, v=-149, X=197, x=10, x=0, x=20, y=0, Y=2] [L45] x++ VAL [counter=11, v=-149, x=11, x=0, X=197, x=20, Y=2, y=0] [L31] EXPR counter++ VAL [counter=12, counter++=11, v=-149, x=0, x=11, x=20, X=197, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=12, v=-149, x=22, x=11, X=197, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=12] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=12, v=-149, x=22, x=0, X=197, x=11, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=12, v=-149, X=197, x=0, x=22, x=11, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=12, v=-145, x=0, x=22, X=197, x=11, y=0, Y=2] [L45] x++ VAL [counter=12, v=-145, X=197, x=12, x=22, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=13, counter++=12, v=-145, x=12, X=197, x=22, x=0, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=13, v=-145, x=0, X=197, x=12, x=24, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=13] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=13, v=-145, x=12, x=24, X=197, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=13, v=-145, x=24, x=0, x=12, X=197, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=13, v=-141, X=197, x=0, x=24, x=12, Y=2, y=0] [L45] x++ VAL [counter=13, v=-141, x=13, X=197, x=24, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=14, counter++=13, v=-141, x=0, X=197, x=24, x=13, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=14, v=-141, x=13, x=26, x=0, X=197, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=14] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=14, v=-141, X=197, x=26, x=13, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=14, v=-141, x=13, x=0, X=197, x=26, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=14, v=-137, x=0, x=13, x=26, X=197, Y=2, y=0] [L45] x++ VAL [counter=14, v=-137, X=197, x=14, x=0, x=26, y=0, Y=2] [L31] EXPR counter++ VAL [counter=15, counter++=14, v=-137, x=0, x=26, X=197, x=14, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=15, v=-137, x=14, x=28, X=197, x=0, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=15] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=15, v=-137, x=0, X=197, x=14, x=28, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=15, v=-137, x=14, x=28, x=0, X=197, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=15, v=-133, X=197, x=28, x=14, x=0, y=0, Y=2] [L45] x++ VAL [counter=15, v=-133, x=28, x=15, x=0, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=16, counter++=15, v=-133, x=28, x=0, X=197, x=15, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=16, v=-133, x=30, X=197, x=0, x=15, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=16] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=16, v=-133, x=15, x=0, x=30, X=197, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=16, v=-133, x=30, x=15, X=197, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=16, v=-129, x=0, X=197, x=30, x=15, y=0, Y=2] [L45] x++ VAL [counter=16, v=-129, x=0, x=30, X=197, x=16, y=0, Y=2] [L31] EXPR counter++ VAL [counter=17, counter++=16, v=-129, x=0, x=30, X=197, x=16, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=17, v=-129, x=32, x=16, x=0, X=197, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=17] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=17, v=-129, x=16, x=32, X=197, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=17, v=-129, x=32, x=0, x=16, X=197, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=17, v=-125, x=0, X=197, x=16, x=32, Y=2, y=0] [L45] x++ VAL [counter=17, v=-125, x=0, X=197, x=17, x=32, Y=2, y=0] [L31] EXPR counter++ VAL [counter=18, counter++=17, v=-125, x=17, x=32, X=197, x=0, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=18, v=-125, x=0, x=17, x=34, X=197, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=18] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=18, v=-125, x=17, x=0, X=197, x=34, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=18, v=-125, x=17, x=0, X=197, x=34, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=18, v=-121, x=34, x=0, x=17, X=197, Y=2, y=0] [L45] x++ VAL [counter=18, v=-121, x=34, X=197, x=0, x=18, Y=2, y=0] [L31] EXPR counter++ VAL [counter=19, counter++=18, v=-121, x=0, x=34, x=18, X=197, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=19, v=-121, x=36, X=197, x=18, x=0, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=19] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=19, v=-121, x=0, X=197, x=36, x=18, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=19, v=-121, x=0, x=36, x=18, X=197, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=19, v=-117, x=0, x=18, x=36, X=197, Y=2, y=0] [L45] x++ VAL [counter=19, v=-117, x=0, x=19, X=197, x=36, Y=2, y=0] [L31] EXPR counter++ VAL [counter=20, counter++=19, v=-117, X=197, x=0, x=36, x=19, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=20, v=-117, x=0, X=197, x=19, x=38, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=20] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=20, v=-117, x=38, x=19, X=197, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=20, v=-117, x=0, x=19, x=38, X=197, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=20, v=-113, x=0, X=197, x=38, x=19, Y=2, y=0] [L45] x++ VAL [counter=20, v=-113, x=0, x=38, x=20, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=21, counter++=20, v=-113, x=20, X=197, x=38, x=0, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=21, v=-113, x=20, x=40, x=0, X=197, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=21] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=21, v=-113, x=0, x=20, X=197, x=40, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=21, v=-113, x=0, x=20, x=40, X=197, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=21, v=-109, x=40, x=0, X=197, x=20, Y=2, y=0] [L45] x++ VAL [counter=21, v=-109, x=0, x=40, X=197, x=21, y=0, Y=2] [L31] EXPR counter++ VAL [counter=22, counter++=21, v=-109, x=21, x=0, X=197, x=40, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=22, v=-109, x=21, x=42, x=0, X=197, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=22] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=22, v=-109, x=42, x=0, x=21, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=22, v=-109, x=0, x=21, x=42, X=197, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=22, v=-105, x=42, X=197, x=21, x=0, Y=2, y=0] [L45] x++ VAL [counter=22, v=-105, X=197, x=0, x=22, x=42, Y=2, y=0] [L31] EXPR counter++ VAL [counter=23, counter++=22, v=-105, x=0, x=22, X=197, x=42, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=23, v=-105, X=197, x=0, x=44, x=22, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=23] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=23, v=-105, x=44, x=22, X=197, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=23, v=-105, X=197, x=0, x=22, x=44, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=23, v=-101, x=22, X=197, x=44, x=0, y=0, Y=2] [L45] x++ VAL [counter=23, v=-101, x=44, x=0, X=197, x=23, Y=2, y=0] [L31] EXPR counter++ VAL [counter=24, counter++=23, v=-101, x=44, x=23, x=0, X=197, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=24, v=-101, x=46, X=197, x=23, x=0, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=24] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=24, v=-101, x=23, X=197, x=0, x=46, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=24, v=-101, x=23, X=197, x=0, x=46, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=24, v=-97, X=197, x=46, x=0, x=23, y=0, Y=2] [L45] x++ VAL [counter=24, v=-97, x=0, X=197, x=24, x=46, Y=2, y=0] [L31] EXPR counter++ VAL [counter=25, counter++=24, v=-97, x=46, x=0, X=197, x=24, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=25, v=-97, X=197, x=24, x=48, x=0, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=25] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=25, v=-97, X=197, x=0, x=48, x=24, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=25, v=-97, x=24, x=0, X=197, x=48, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=25, v=-93, x=48, x=24, X=197, x=0, y=0, Y=2] [L45] x++ VAL [counter=25, v=-93, x=25, x=48, x=0, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=26, counter++=25, v=-93, x=48, X=197, x=0, x=25, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=26, v=-93, X=197, x=25, x=50, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=26] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=26, v=-93, x=25, x=0, X=197, x=50, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=26, v=-93, X=197, x=0, x=50, x=25, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=26, v=-89, x=50, x=25, X=197, x=0, Y=2, y=0] [L45] x++ VAL [counter=26, v=-89, x=50, x=26, X=197, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=27, counter++=26, v=-89, x=0, X=197, x=50, x=26, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=27, v=-89, x=52, x=0, x=26, X=197, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=27] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=27, v=-89, X=197, x=0, x=26, x=52, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=27, v=-89, x=52, x=0, x=26, X=197, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=27, v=-85, x=26, x=0, X=197, x=52, y=0, Y=2] [L45] x++ VAL [counter=27, v=-85, X=197, x=0, x=52, x=27, Y=2, y=0] [L31] EXPR counter++ VAL [counter=28, counter++=27, v=-85, x=27, x=52, x=0, X=197, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=28, v=-85, x=0, X=197, x=54, x=27, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=28] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=28, v=-85, x=0, X=197, x=54, x=27, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=28, v=-85, x=0, X=197, x=27, x=54, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=28, v=-81, X=197, x=54, x=27, x=0, Y=2, y=0] [L45] x++ VAL [counter=28, v=-81, x=28, x=54, X=197, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=29, counter++=28, v=-81, X=197, x=0, x=28, x=54, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=29, v=-81, x=0, x=28, x=56, X=197, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=29] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=29, v=-81, x=56, x=28, x=0, X=197, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=29, v=-81, x=0, x=28, X=197, x=56, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=29, v=-77, X=197, x=28, x=0, x=56, Y=2, y=0] [L45] x++ VAL [counter=29, v=-77, x=29, x=0, X=197, x=56, Y=2, y=0] [L31] EXPR counter++ VAL [counter=30, counter++=29, v=-77, x=0, x=56, X=197, x=29, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=30, v=-77, x=0, X=197, x=29, x=58, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=30] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=30, v=-77, x=58, X=197, x=29, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=30, v=-77, x=29, x=58, X=197, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=30, v=-73, X=197, x=58, x=29, x=0, y=0, Y=2] [L45] x++ VAL [counter=30, v=-73, x=58, x=30, X=197, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=31, counter++=30, v=-73, x=58, x=0, x=30, X=197, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=31, v=-73, x=30, x=0, x=60, X=197, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=31] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=31, v=-73, x=60, x=0, x=30, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=31, v=-73, x=30, X=197, x=0, x=60, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=31, v=-69, x=0, X=197, x=30, x=60, y=0, Y=2] [L45] x++ VAL [counter=31, v=-69, x=31, x=0, x=60, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=32, counter++=31, v=-69, x=31, x=60, x=0, X=197, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=32, v=-69, x=62, X=197, x=31, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=32] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=32, v=-69, x=0, x=62, x=31, X=197, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=32, v=-69, x=0, x=62, X=197, x=31, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=32, v=-65, x=31, x=62, x=0, X=197, Y=2, y=0] [L45] x++ VAL [counter=32, v=-65, X=197, x=0, x=62, x=32, y=0, Y=2] [L31] EXPR counter++ VAL [counter=33, counter++=32, v=-65, X=197, x=0, x=62, x=32, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=33, v=-65, x=0, x=32, x=64, X=197, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=33] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=33, v=-65, x=0, x=32, X=197, x=64, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=33, v=-65, x=64, x=0, x=32, X=197, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=33, v=-61, x=32, x=64, x=0, X=197, Y=2, y=0] [L45] x++ VAL [counter=33, v=-61, X=197, x=0, x=33, x=64, Y=2, y=0] [L31] EXPR counter++ VAL [counter=34, counter++=33, v=-61, x=64, X=197, x=33, x=0, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=34, v=-61, X=197, x=33, x=66, x=0, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=34] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=34, v=-61, x=33, x=0, x=66, X=197, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=34, v=-61, x=33, x=66, x=0, X=197, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=34, v=-57, x=66, x=0, X=197, x=33, Y=2, y=0] [L45] x++ VAL [counter=34, v=-57, x=66, x=34, x=0, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=35, counter++=34, v=-57, x=34, x=0, X=197, x=66, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=35, v=-57, x=34, x=68, x=0, X=197, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=35] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=35, v=-57, x=68, x=0, X=197, x=34, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=35, v=-57, X=197, x=68, x=0, x=34, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=35, v=-53, x=68, X=197, x=34, x=0, Y=2, y=0] [L45] x++ VAL [counter=35, v=-53, X=197, x=35, x=0, x=68, y=0, Y=2] [L31] EXPR counter++ VAL [counter=36, counter++=35, v=-53, X=197, x=35, x=0, x=68, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=36, v=-53, x=0, x=70, x=35, X=197, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=36] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=36, v=-53, X=197, x=0, x=35, x=70, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=36, v=-53, x=0, X=197, x=70, x=35, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=36, v=-49, x=70, X=197, x=0, x=35, Y=2, y=0] [L45] x++ VAL [counter=36, v=-49, x=36, x=0, X=197, x=70, y=0, Y=2] [L31] EXPR counter++ VAL [counter=37, counter++=36, v=-49, x=36, x=70, X=197, x=0, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=37, v=-49, x=36, x=0, X=197, x=72, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=37] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=37, v=-49, x=72, X=197, x=36, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=37, v=-49, x=72, x=0, X=197, x=36, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=37, v=-45, X=197, x=72, x=0, x=36, y=0, Y=2] [L45] x++ VAL [counter=37, v=-45, x=37, X=197, x=0, x=72, Y=2, y=0] [L31] EXPR counter++ VAL [counter=38, counter++=37, v=-45, x=72, x=0, x=37, X=197, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=38, v=-45, x=0, x=37, x=74, X=197, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=38] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=38, v=-45, X=197, x=74, x=37, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=38, v=-45, X=197, x=0, x=74, x=37, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=38, v=-41, X=197, x=74, x=0, x=37, y=0, Y=2] [L45] x++ VAL [counter=38, v=-41, x=0, X=197, x=38, x=74, Y=2, y=0] [L31] EXPR counter++ VAL [counter=39, counter++=38, v=-41, x=74, x=0, x=38, X=197, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=39, v=-41, x=38, x=0, X=197, x=76, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=39] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=39, v=-41, x=38, x=76, x=0, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=39, v=-41, x=0, x=38, X=197, x=76, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=39, v=-37, x=76, x=38, x=0, X=197, y=0, Y=2] [L45] x++ VAL [counter=39, v=-37, x=76, X=197, x=39, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=40, counter++=39, v=-37, x=0, x=76, x=39, X=197, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=40, v=-37, x=78, X=197, x=0, x=39, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=40] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=40, v=-37, x=78, X=197, x=39, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=40, v=-37, x=39, X=197, x=0, x=78, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=40, v=-33, x=39, X=197, x=78, x=0, y=0, Y=2] [L45] x++ VAL [counter=40, v=-33, X=197, x=0, x=78, x=40, Y=2, y=0] [L31] EXPR counter++ VAL [counter=41, counter++=40, v=-33, x=40, x=0, x=78, X=197, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=41, v=-33, x=40, x=0, X=197, x=80, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=41] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=41, v=-33, x=80, x=0, x=40, X=197, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=41, v=-33, X=197, x=40, x=80, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=41, v=-29, x=0, X=197, x=40, x=80, y=0, Y=2] [L45] x++ VAL [counter=41, v=-29, x=0, x=80, x=41, X=197, Y=2, y=0] [L31] EXPR counter++ VAL [counter=42, counter++=41, v=-29, x=0, X=197, x=80, x=41, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=42, v=-29, X=197, x=41, x=0, x=82, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=42] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=42, v=-29, x=0, x=41, X=197, x=82, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=42, v=-29, x=0, x=41, x=82, X=197, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=42, v=-25, x=82, x=41, x=0, X=197, Y=2, y=0] [L45] x++ VAL [counter=42, v=-25, x=0, X=197, x=82, x=42, y=0, Y=2] [L31] EXPR counter++ VAL [counter=43, counter++=42, v=-25, X=197, x=82, x=42, x=0, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=43, v=-25, x=0, X=197, x=42, x=84, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=43] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=43, v=-25, x=0, x=84, X=197, x=42, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=43, v=-25, x=0, x=84, X=197, x=42, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=43, v=-21, x=0, X=197, x=42, x=84, y=0, Y=2] [L45] x++ VAL [counter=43, v=-21, X=197, x=0, x=43, x=84, y=0, Y=2] [L31] EXPR counter++ VAL [counter=44, counter++=43, v=-21, x=84, X=197, x=43, x=0, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=44, v=-21, x=0, X=197, x=43, x=86, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=44] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=44, v=-21, x=86, x=0, x=43, X=197, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=44, v=-21, x=0, X=197, x=43, x=86, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=44, v=-17, X=197, x=0, x=43, x=86, y=0, Y=2] [L45] x++ VAL [counter=44, v=-17, x=0, X=197, x=86, x=44, y=0, Y=2] [L31] EXPR counter++ VAL [counter=45, counter++=44, v=-17, x=44, x=86, X=197, x=0, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=45, v=-17, X=197, x=44, x=0, x=88, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=45] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=45, v=-17, x=44, x=0, x=88, X=197, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=45, v=-17, x=88, X=197, x=0, x=44, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=45, v=-13, x=0, x=88, X=197, x=44, Y=2, y=0] [L45] x++ VAL [counter=45, v=-13, x=0, x=45, x=88, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=46, counter++=45, v=-13, x=88, x=0, x=45, X=197, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=46, v=-13, x=90, x=45, x=0, X=197, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=46] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=46, v=-13, x=0, X=197, x=90, x=45, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=46, v=-13, x=45, x=0, x=90, X=197, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=46, v=-9, x=45, x=0, x=90, X=197, y=0, Y=2] [L45] x++ VAL [counter=46, v=-9, x=0, x=46, x=90, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=47, counter++=46, v=-9, X=197, x=90, x=0, x=46, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=47, v=-9, x=92, x=46, X=197, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=47] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=47, v=-9, X=197, x=0, x=46, x=92, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=47, v=-9, x=92, X=197, x=0, x=46, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=47, v=-5, x=0, X=197, x=92, x=46, Y=2, y=0] [L45] x++ VAL [counter=47, v=-5, x=92, x=47, x=0, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=48, counter++=47, v=-5, x=47, X=197, x=0, x=92, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=48, v=-5, X=197, x=47, x=94, x=0, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=48] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=48, v=-5, X=197, x=94, x=0, x=47, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=48, v=-5, x=0, x=94, x=47, X=197, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=48, v=-1, X=197, x=47, x=0, x=94, Y=2, y=0] [L45] x++ VAL [counter=48, v=-1, x=94, x=0, X=197, x=48, Y=2, y=0] [L31] EXPR counter++ VAL [counter=49, counter++=48, v=-1, x=48, x=0, x=94, X=197, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=49, v=-1, x=96, x=0, X=197, x=48, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=49] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=49, v=-1, X=197, x=0, x=48, x=96, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=49, v=-1, x=0, x=48, x=96, X=197, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=49, v=3, x=96, x=0, X=197, x=48, Y=2, y=0] [L45] x++ VAL [counter=49, v=3, x=0, x=49, X=197, x=96, y=0, Y=2] [L31] EXPR counter++ VAL [counter=50, counter++=49, v=3, x=49, x=96, X=197, x=0, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=50, v=3, X=197, x=98, x=0, x=49, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=50] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=50, v=3, x=98, x=49, X=197, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=50, v=3, x=98, X=197, x=49, x=0, y=0, Y=2] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=50, v=-387, x=49, X=197, x=0, x=98, Y=2, y=1] [L45] x++ VAL [counter=50, v=-387, x=98, X=197, x=0, x=50, Y=2, y=1] [L31] EXPR counter++ VAL [counter=51, counter++=50, v=-387, X=197, x=50, x=98, x=0, Y=2, y=1] [L31] COND FALSE !(counter++<50) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [counter=51, v=-387, x=50, x=100, x=50, X=197, y=1, Y=2] [L49] CALL __VERIFIER_assert(2*yx - 2*xy - X + (long long) 2*Y - v + 2*y == 0) VAL [\old(cond)=0, counter=51] [L14] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=51] [L16] reach_error() VAL [\old(cond)=0, cond=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.2s, OverallIterations: 10, TraceHistogramMax: 51, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 828 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 827 mSDsluCounter, 1906 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1655 mSDsCounter, 123 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1642 IncrementalHoareTripleChecker+Invalid, 1765 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 123 mSolverCounterUnsat, 251 mSDtfsCounter, 1642 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2440 GetRequests, 2043 SyntacticMatches, 45 SemanticMatches, 352 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4422 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1000occurred in iteration=9, InterpolantAutomatonStates: 331, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 31 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 1664 NumberOfCodeBlocks, 1454 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 2285 ConstructedInterpolants, 1 QuantifiedInterpolants, 6595 SizeOfPredicates, 113 NumberOfNonLiveVariables, 2581 ConjunctsInSsa, 276 ConjunctsInUnsatCore, 17 InterpolantComputations, 1 PerfectInterpolantSequences, 10288/31834 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-02-15 11:24:29,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE