./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b 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_unwindbound100.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 86018b7f3e582b94d83913c12d8eaea893434e1e96da49ea035805521496eb67 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 13:59:02,593 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 13:59:02,599 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 13:59:02,635 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 13:59:02,635 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 13:59:02,638 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 13:59:02,639 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 13:59:02,641 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 13:59:02,642 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 13:59:02,648 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 13:59:02,648 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 13:59:02,649 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 13:59:02,649 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 13:59:02,650 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 13:59:02,650 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 13:59:02,651 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 13:59:02,652 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 13:59:02,652 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 13:59:02,653 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 13:59:02,656 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 13:59:02,657 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 13:59:02,657 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 13:59:02,659 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 13:59:02,659 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 13:59:02,663 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 13:59:02,663 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 13:59:02,663 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 13:59:02,664 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 13:59:02,664 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 13:59:02,665 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 13:59:02,665 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 13:59:02,665 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 13:59:02,666 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 13:59:02,666 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 13:59:02,667 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 13:59:02,667 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 13:59:02,671 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 13:59:02,671 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 13:59:02,671 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 13:59:02,672 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 13:59:02,672 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 13:59:02,673 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 13:59:02,706 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 13:59:02,706 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 13:59:02,706 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 13:59:02,706 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 13:59:02,707 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 13:59:02,707 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 13:59:02,707 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 13:59:02,707 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 13:59:02,708 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 13:59:02,708 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 13:59:02,708 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 13:59:02,708 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 13:59:02,708 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 13:59:02,708 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 13:59:02,708 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 13:59:02,708 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 13:59:02,708 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 13:59:02,708 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 13:59:02,708 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 13:59:02,708 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 13:59:02,708 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 13:59:02,709 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 13:59:02,709 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 13:59:02,709 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 13:59:02,709 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 13:59:02,709 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 13:59:02,709 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 13:59:02,709 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 13:59:02,709 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 13:59:02,709 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 13:59:02,709 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 13:59:02,709 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 13:59:02,710 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 13:59:02,710 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 13:59:02,710 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 86018b7f3e582b94d83913c12d8eaea893434e1e96da49ea035805521496eb67 [2021-12-14 13:59:02,948 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 13:59:02,970 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 13:59:02,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 13:59:02,972 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 13:59:02,973 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 13:59:02,974 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c [2021-12-14 13:59:03,028 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98e2658b9/d6b97fff60c2488fa5d0ecf08a7182c8/FLAG67ef09bbf [2021-12-14 13:59:03,374 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 13:59:03,374 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c [2021-12-14 13:59:03,379 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98e2658b9/d6b97fff60c2488fa5d0ecf08a7182c8/FLAG67ef09bbf [2021-12-14 13:59:03,388 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98e2658b9/d6b97fff60c2488fa5d0ecf08a7182c8 [2021-12-14 13:59:03,390 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 13:59:03,391 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 13:59:03,392 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 13:59:03,392 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 13:59:03,410 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 13:59:03,410 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:59:03" (1/1) ... [2021-12-14 13:59:03,411 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7696c6fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:59:03, skipping insertion in model container [2021-12-14 13:59:03,411 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:59:03" (1/1) ... [2021-12-14 13:59:03,415 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 13:59:03,424 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 13:59:03,542 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c[597,610] [2021-12-14 13:59:03,552 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 13:59:03,558 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 13:59:03,566 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c[597,610] [2021-12-14 13:59:03,570 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 13:59:03,579 INFO L208 MainTranslator]: Completed translation [2021-12-14 13:59:03,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:59:03 WrapperNode [2021-12-14 13:59:03,580 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 13:59:03,581 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 13:59:03,581 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 13:59:03,581 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 13:59:03,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:59:03" (1/1) ... [2021-12-14 13:59:03,590 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:59:03" (1/1) ... [2021-12-14 13:59:03,602 INFO L137 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2021-12-14 13:59:03,602 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 13:59:03,603 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 13:59:03,603 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 13:59:03,603 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 13:59:03,608 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:59:03" (1/1) ... [2021-12-14 13:59:03,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:59:03" (1/1) ... [2021-12-14 13:59:03,609 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:59:03" (1/1) ... [2021-12-14 13:59:03,609 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:59:03" (1/1) ... [2021-12-14 13:59:03,611 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:59:03" (1/1) ... [2021-12-14 13:59:03,614 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:59:03" (1/1) ... [2021-12-14 13:59:03,614 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:59:03" (1/1) ... [2021-12-14 13:59:03,615 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 13:59:03,616 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 13:59:03,616 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 13:59:03,616 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 13:59:03,617 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:59:03" (1/1) ... [2021-12-14 13:59:03,622 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 13:59:03,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:59:03,645 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) [2021-12-14 13:59:03,653 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 [2021-12-14 13:59:03,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 13:59:03,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 13:59:03,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 13:59:03,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 13:59:03,676 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-14 13:59:03,676 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-14 13:59:03,713 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 13:59:03,714 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 13:59:03,790 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 13:59:03,794 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 13:59:03,794 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-14 13:59:03,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:59:03 BoogieIcfgContainer [2021-12-14 13:59:03,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 13:59:03,797 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 13:59:03,797 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 13:59:03,800 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 13:59:03,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 01:59:03" (1/3) ... [2021-12-14 13:59:03,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f8e2088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:59:03, skipping insertion in model container [2021-12-14 13:59:03,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:59:03" (2/3) ... [2021-12-14 13:59:03,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f8e2088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:59:03, skipping insertion in model container [2021-12-14 13:59:03,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:59:03" (3/3) ... [2021-12-14 13:59:03,802 INFO L111 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound100.c [2021-12-14 13:59:03,806 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 13:59:03,806 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 13:59:03,836 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 13:59:03,841 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 13:59:03,841 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 13:59:03,852 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) [2021-12-14 13:59:03,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-14 13:59:03,855 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:59:03,855 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:59:03,856 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:59:03,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:59:03,860 INFO L85 PathProgramCache]: Analyzing trace with hash 180444447, now seen corresponding path program 1 times [2021-12-14 13:59:03,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:59:03,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264338402] [2021-12-14 13:59:03,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:03,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:59:03,994 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 13:59:03,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [756391356] [2021-12-14 13:59:03,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:03,996 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:03,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:59:03,997 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) [2021-12-14 13:59:04,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 13:59:04,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:59:04,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-14 13:59:04,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:59:04,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:59:04,209 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 13:59:04,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:59:04,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264338402] [2021-12-14 13:59:04,210 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 13:59:04,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756391356] [2021-12-14 13:59:04,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756391356] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:59:04,211 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:59:04,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 13:59:04,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169085260] [2021-12-14 13:59:04,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:59:04,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 13:59:04,218 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:59:04,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 13:59:04,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 13:59:04,265 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) [2021-12-14 13:59:04,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:59:04,379 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2021-12-14 13:59:04,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 13:59:04,381 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 [2021-12-14 13:59:04,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:59:04,387 INFO L225 Difference]: With dead ends: 54 [2021-12-14 13:59:04,387 INFO L226 Difference]: Without dead ends: 25 [2021-12-14 13:59:04,389 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-14 13:59:04,394 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 18 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:59:04,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 70 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:59:04,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-14 13:59:04,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2021-12-14 13:59:04,420 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) [2021-12-14 13:59:04,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2021-12-14 13:59:04,422 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 8 [2021-12-14 13:59:04,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:59:04,422 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2021-12-14 13:59:04,422 INFO L471 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) [2021-12-14 13:59:04,422 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2021-12-14 13:59:04,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-14 13:59:04,423 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:59:04,423 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:59:04,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-14 13:59:04,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2021-12-14 13:59:04,642 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:59:04,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:59:04,643 INFO L85 PathProgramCache]: Analyzing trace with hash 2080570626, now seen corresponding path program 1 times [2021-12-14 13:59:04,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:59:04,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850038794] [2021-12-14 13:59:04,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:04,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:59:04,655 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 13:59:04,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1588692265] [2021-12-14 13:59:04,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:04,656 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:04,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:59:04,657 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) [2021-12-14 13:59:04,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 13:59:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:59:04,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-14 13:59:04,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:59:04,916 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:59:04,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:59:05,015 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 13:59:05,016 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:59:05,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850038794] [2021-12-14 13:59:05,016 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 13:59:05,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588692265] [2021-12-14 13:59:05,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588692265] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:59:05,017 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 13:59:05,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2021-12-14 13:59:05,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864193115] [2021-12-14 13:59:05,017 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 13:59:05,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 13:59:05,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:59:05,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 13:59:05,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-12-14 13:59:05,019 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:59:05,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:59:05,353 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2021-12-14 13:59:05,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 13:59:05,354 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2021-12-14 13:59:05,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:59:05,355 INFO L225 Difference]: With dead ends: 41 [2021-12-14 13:59:05,355 INFO L226 Difference]: Without dead ends: 34 [2021-12-14 13:59:05,356 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-12-14 13:59:05,357 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 18 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 13:59:05,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 85 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 13:59:05,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-14 13:59:05,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2021-12-14 13:59:05,362 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) [2021-12-14 13:59:05,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2021-12-14 13:59:05,363 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 18 [2021-12-14 13:59:05,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:59:05,364 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2021-12-14 13:59:05,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:59:05,364 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2021-12-14 13:59:05,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-14 13:59:05,365 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:59:05,365 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:59:05,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-14 13:59:05,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2021-12-14 13:59:05,582 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:59:05,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:59:05,583 INFO L85 PathProgramCache]: Analyzing trace with hash 680664555, now seen corresponding path program 1 times [2021-12-14 13:59:05,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:59:05,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455573138] [2021-12-14 13:59:05,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:05,583 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:59:05,590 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 13:59:05,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2135458128] [2021-12-14 13:59:05,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:05,591 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:05,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:59:05,592 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) [2021-12-14 13:59:05,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-14 13:59:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:59:05,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 13:59:05,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:59:05,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:59:05,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:59:05,731 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:59:05,732 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:59:05,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455573138] [2021-12-14 13:59:05,732 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 13:59:05,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135458128] [2021-12-14 13:59:05,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135458128] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:59:05,733 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 13:59:05,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2021-12-14 13:59:05,733 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601779053] [2021-12-14 13:59:05,733 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 13:59:05,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 13:59:05,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:59:05,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 13:59:05,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-14 13:59:05,735 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) [2021-12-14 13:59:05,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:59:05,777 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2021-12-14 13:59:05,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 13:59:05,778 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 [2021-12-14 13:59:05,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:59:05,779 INFO L225 Difference]: With dead ends: 73 [2021-12-14 13:59:05,779 INFO L226 Difference]: Without dead ends: 67 [2021-12-14 13:59:05,779 INFO L932 BasicCegarLoop]: 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 [2021-12-14 13:59:05,780 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 45 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:59:05,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 100 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:59:05,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-12-14 13:59:05,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2021-12-14 13:59:05,787 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) [2021-12-14 13:59:05,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2021-12-14 13:59:05,788 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 19 [2021-12-14 13:59:05,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:59:05,788 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2021-12-14 13:59:05,788 INFO L471 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) [2021-12-14 13:59:05,788 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2021-12-14 13:59:05,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-14 13:59:05,789 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:59:05,789 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:59:05,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-14 13:59:06,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:06,003 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:59:06,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:59:06,004 INFO L85 PathProgramCache]: Analyzing trace with hash 713886481, now seen corresponding path program 1 times [2021-12-14 13:59:06,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:59:06,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147230839] [2021-12-14 13:59:06,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:06,004 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:59:06,011 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 13:59:06,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1326485409] [2021-12-14 13:59:06,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:06,012 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:06,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:59:06,021 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) [2021-12-14 13:59:06,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 13:59:06,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:59:06,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-14 13:59:06,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:59:06,340 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:59:06,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:59:06,620 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:59:06,621 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:59:06,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147230839] [2021-12-14 13:59:06,622 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 13:59:06,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326485409] [2021-12-14 13:59:06,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326485409] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:59:06,622 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 13:59:06,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2021-12-14 13:59:06,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142653545] [2021-12-14 13:59:06,623 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 13:59:06,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-14 13:59:06,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:59:06,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-14 13:59:06,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2021-12-14 13:59:06,625 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 22 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-14 13:59:07,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:59:07,273 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2021-12-14 13:59:07,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-14 13:59:07,274 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 6 states have call successors, (6), 2 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 [2021-12-14 13:59:07,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:59:07,275 INFO L225 Difference]: With dead ends: 65 [2021-12-14 13:59:07,275 INFO L226 Difference]: Without dead ends: 57 [2021-12-14 13:59:07,275 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=256, Invalid=1226, Unknown=0, NotChecked=0, Total=1482 [2021-12-14 13:59:07,276 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 52 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 13:59:07,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 125 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 13:59:07,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-12-14 13:59:07,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2021-12-14 13:59:07,281 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) [2021-12-14 13:59:07,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2021-12-14 13:59:07,282 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 25 [2021-12-14 13:59:07,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:59:07,282 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2021-12-14 13:59:07,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-14 13:59:07,283 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2021-12-14 13:59:07,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-14 13:59:07,283 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:59:07,283 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:59:07,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-14 13:59:07,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:07,505 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:59:07,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:59:07,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1582515168, now seen corresponding path program 1 times [2021-12-14 13:59:07,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:59:07,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656824574] [2021-12-14 13:59:07,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:07,507 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:59:07,522 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 13:59:07,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [93314656] [2021-12-14 13:59:07,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:07,533 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:07,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:59:07,534 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) [2021-12-14 13:59:07,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-14 13:59:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:59:07,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-14 13:59:07,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:59:07,664 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:59:07,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:59:07,766 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-14 13:59:07,767 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:59:07,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656824574] [2021-12-14 13:59:07,767 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 13:59:07,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93314656] [2021-12-14 13:59:07,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93314656] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:59:07,767 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 13:59:07,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2021-12-14 13:59:07,768 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046562358] [2021-12-14 13:59:07,768 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 13:59:07,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-14 13:59:07,768 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:59:07,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-14 13:59:07,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2021-12-14 13:59:07,769 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) [2021-12-14 13:59:07,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:59:07,894 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2021-12-14 13:59:07,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-14 13:59:07,895 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 [2021-12-14 13:59:07,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:59:07,896 INFO L225 Difference]: With dead ends: 116 [2021-12-14 13:59:07,896 INFO L226 Difference]: Without dead ends: 110 [2021-12-14 13:59:07,896 INFO L932 BasicCegarLoop]: 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 [2021-12-14 13:59:07,897 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 104 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:59:07,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 160 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:59:07,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-12-14 13:59:07,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2021-12-14 13:59:07,906 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) [2021-12-14 13:59:07,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2021-12-14 13:59:07,907 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 49 [2021-12-14 13:59:07,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:59:07,907 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2021-12-14 13:59:07,908 INFO L471 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) [2021-12-14 13:59:07,908 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2021-12-14 13:59:07,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-12-14 13:59:07,910 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:59:07,910 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:59:07,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-14 13:59:08,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:08,127 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:59:08,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:59:08,128 INFO L85 PathProgramCache]: Analyzing trace with hash 297311502, now seen corresponding path program 2 times [2021-12-14 13:59:08,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:59:08,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360070168] [2021-12-14 13:59:08,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:08,128 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:59:08,139 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 13:59:08,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [13755889] [2021-12-14 13:59:08,142 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 13:59:08,142 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:08,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:59:08,143 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) [2021-12-14 13:59:08,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-14 13:59:08,224 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 13:59:08,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:59:08,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-14 13:59:08,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:59:08,422 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 470 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:59:08,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:59:08,702 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 290 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2021-12-14 13:59:08,702 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:59:08,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360070168] [2021-12-14 13:59:08,703 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 13:59:08,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13755889] [2021-12-14 13:59:08,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13755889] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:59:08,703 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 13:59:08,703 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2021-12-14 13:59:08,703 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595599735] [2021-12-14 13:59:08,703 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 13:59:08,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-14 13:59:08,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:59:08,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-14 13:59:08,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2021-12-14 13:59:08,707 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) [2021-12-14 13:59:09,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:59:09,044 INFO L93 Difference]: Finished difference Result 236 states and 269 transitions. [2021-12-14 13:59:09,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-12-14 13:59:09,044 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 [2021-12-14 13:59:09,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:59:09,049 INFO L225 Difference]: With dead ends: 236 [2021-12-14 13:59:09,049 INFO L226 Difference]: Without dead ends: 230 [2021-12-14 13:59:09,050 INFO L932 BasicCegarLoop]: 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 [2021-12-14 13:59:09,053 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 257 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:59:09,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [257 Valid, 286 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:59:09,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-12-14 13:59:09,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2021-12-14 13:59:09,085 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) [2021-12-14 13:59:09,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 252 transitions. [2021-12-14 13:59:09,088 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 252 transitions. Word has length 109 [2021-12-14 13:59:09,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:59:09,090 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 252 transitions. [2021-12-14 13:59:09,091 INFO L471 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) [2021-12-14 13:59:09,092 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 252 transitions. [2021-12-14 13:59:09,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2021-12-14 13:59:09,097 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:59:09,098 INFO L514 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:59:09,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-14 13:59:09,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:09,315 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:59:09,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:59:09,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1294150550, now seen corresponding path program 3 times [2021-12-14 13:59:09,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:59:09,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701778891] [2021-12-14 13:59:09,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:09,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:59:09,325 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 13:59:09,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [795474441] [2021-12-14 13:59:09,325 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 13:59:09,326 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:09,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:59:09,333 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) [2021-12-14 13:59:09,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-14 13:59:09,383 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-12-14 13:59:09,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:59:09,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-14 13:59:09,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:59:10,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 234 proven. 1 refuted. 0 times theorem prover too weak. 2163 trivial. 0 not checked. [2021-12-14 13:59:10,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:59:10,517 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:59:10,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701778891] [2021-12-14 13:59:10,517 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 13:59:10,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795474441] [2021-12-14 13:59:10,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795474441] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:59:10,517 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-14 13:59:10,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2021-12-14 13:59:10,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073138707] [2021-12-14 13:59:10,518 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-14 13:59:10,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 13:59:10,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:59:10,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 13:59:10,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=254, Unknown=1, NotChecked=0, Total=306 [2021-12-14 13:59:10,519 INFO L87 Difference]: Start difference. First operand 230 states and 252 transitions. Second operand has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:59:12,548 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-14 13:59:16,584 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-14 13:59:18,592 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-14 13:59:20,601 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-14 13:59:24,625 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-14 13:59:29,242 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-14 13:59:29,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:59:29,273 INFO L93 Difference]: Finished difference Result 449 states and 492 transitions. [2021-12-14 13:59:29,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 13:59:29,274 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 229 [2021-12-14 13:59:29,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:59:29,276 INFO L225 Difference]: With dead ends: 449 [2021-12-14 13:59:29,276 INFO L226 Difference]: Without dead ends: 443 [2021-12-14 13:59:29,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 232 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=94, Invalid=409, Unknown=3, NotChecked=0, Total=506 [2021-12-14 13:59:29,277 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 15 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 6 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:59:29,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 59 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 88 Invalid, 6 Unknown, 0 Unchecked, 12.1s Time] [2021-12-14 13:59:29,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2021-12-14 13:59:29,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 440. [2021-12-14 13:59:29,311 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) [2021-12-14 13:59:29,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 483 transitions. [2021-12-14 13:59:29,313 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 483 transitions. Word has length 229 [2021-12-14 13:59:29,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:59:29,313 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 483 transitions. [2021-12-14 13:59:29,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:59:29,314 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 483 transitions. [2021-12-14 13:59:29,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2021-12-14 13:59:29,315 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:59:29,315 INFO L514 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:59:29,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-14 13:59:29,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:29,516 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:59:29,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:59:29,516 INFO L85 PathProgramCache]: Analyzing trace with hash -614092180, now seen corresponding path program 1 times [2021-12-14 13:59:29,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:59:29,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710244525] [2021-12-14 13:59:29,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:29,517 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:59:29,532 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 13:59:29,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [173820002] [2021-12-14 13:59:29,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:29,533 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:29,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:59:29,539 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) [2021-12-14 13:59:29,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-14 13:59:29,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:59:29,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 47 conjunts are in the unsatisfiable core [2021-12-14 13:59:29,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:59:30,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 44 proven. 2354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:59:30,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:59:31,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 44 proven. 1430 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2021-12-14 13:59:31,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:59:31,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710244525] [2021-12-14 13:59:31,140 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 13:59:31,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173820002] [2021-12-14 13:59:31,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173820002] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:59:31,140 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 13:59:31,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2021-12-14 13:59:31,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994411325] [2021-12-14 13:59:31,140 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 13:59:31,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-12-14 13:59:31,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:59:31,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-12-14 13:59:31,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2021-12-14 13:59:31,143 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) [2021-12-14 13:59:32,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:59:32,391 INFO L93 Difference]: Finished difference Result 929 states and 1043 transitions. [2021-12-14 13:59:32,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2021-12-14 13:59:32,393 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 [2021-12-14 13:59:32,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:59:32,396 INFO L225 Difference]: With dead ends: 929 [2021-12-14 13:59:32,396 INFO L226 Difference]: Without dead ends: 923 [2021-12-14 13:59:32,400 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2021-12-14 13:59:32,400 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 1008 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1008 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 13:59:32,401 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1008 Valid, 526 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 13:59:32,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2021-12-14 13:59:32,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 920. [2021-12-14 13:59:32,443 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) [2021-12-14 13:59:32,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1011 transitions. [2021-12-14 13:59:32,446 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1011 transitions. Word has length 229 [2021-12-14 13:59:32,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:59:32,447 INFO L470 AbstractCegarLoop]: Abstraction has 920 states and 1011 transitions. [2021-12-14 13:59:32,447 INFO L471 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) [2021-12-14 13:59:32,447 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1011 transitions. [2021-12-14 13:59:32,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2021-12-14 13:59:32,452 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:59:32,452 INFO L514 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 46, 45, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:59:32,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-14 13:59:32,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-12-14 13:59:32,670 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:59:32,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:59:32,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1651100380, now seen corresponding path program 2 times [2021-12-14 13:59:32,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:59:32,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159436261] [2021-12-14 13:59:32,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:32,671 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:59:32,683 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 13:59:32,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1188184528] [2021-12-14 13:59:32,683 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 13:59:32,684 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:32,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:59:32,697 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) [2021-12-14 13:59:32,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-14 13:59:32,874 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 13:59:32,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:59:32,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 1161 conjuncts, 95 conjunts are in the unsatisfiable core [2021-12-14 13:59:32,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:59:34,275 INFO L134 CoverageAnalysis]: Checked inductivity of 10534 backedges. 92 proven. 10442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:59:34,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:59:36,933 INFO L134 CoverageAnalysis]: Checked inductivity of 10534 backedges. 92 proven. 6302 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2021-12-14 13:59:36,934 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:59:36,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159436261] [2021-12-14 13:59:36,934 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 13:59:36,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188184528] [2021-12-14 13:59:36,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188184528] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:59:36,934 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 13:59:36,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 98 [2021-12-14 13:59:36,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057575706] [2021-12-14 13:59:36,937 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 13:59:36,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2021-12-14 13:59:36,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:59:36,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2021-12-14 13:59:36,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4565, Invalid=4941, Unknown=0, NotChecked=0, Total=9506 [2021-12-14 13:59:36,944 INFO L87 Difference]: Start difference. First operand 920 states and 1011 transitions. Second operand has 98 states, 98 states have (on average 6.255102040816326) internal successors, (613), 98 states have internal predecessors, (613), 93 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2021-12-14 13:59:40,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:59:40,707 INFO L93 Difference]: Finished difference Result 1889 states and 2123 transitions. [2021-12-14 13:59:40,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2021-12-14 13:59:40,708 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 6.255102040816326) internal successors, (613), 98 states have internal predecessors, (613), 93 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) Word has length 469 [2021-12-14 13:59:40,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:59:40,724 INFO L225 Difference]: With dead ends: 1889 [2021-12-14 13:59:40,724 INFO L226 Difference]: Without dead ends: 1883 [2021-12-14 13:59:40,730 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1029 GetRequests, 840 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5452 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=13540, Invalid=22750, Unknown=0, NotChecked=0, Total=36290 [2021-12-14 13:59:40,731 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 1464 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1464 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 381 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-14 13:59:40,731 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1464 Valid, 1030 Invalid, 1068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [381 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-14 13:59:40,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2021-12-14 13:59:40,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1880. [2021-12-14 13:59:40,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1880 states, 1504 states have (on average 1.125) internal successors, (1692), 1504 states have internal predecessors, (1692), 188 states have call successors, (188), 188 states have call predecessors, (188), 187 states have return successors, (187), 187 states have call predecessors, (187), 187 states have call successors, (187) [2021-12-14 13:59:40,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1880 states and 2067 transitions. [2021-12-14 13:59:40,788 INFO L78 Accepts]: Start accepts. Automaton has 1880 states and 2067 transitions. Word has length 469 [2021-12-14 13:59:40,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:59:40,789 INFO L470 AbstractCegarLoop]: Abstraction has 1880 states and 2067 transitions. [2021-12-14 13:59:40,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 6.255102040816326) internal successors, (613), 98 states have internal predecessors, (613), 93 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2021-12-14 13:59:40,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 2067 transitions. [2021-12-14 13:59:40,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 950 [2021-12-14 13:59:40,804 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:59:40,805 INFO L514 BasicCegarLoop]: trace histogram [95, 95, 94, 94, 94, 94, 94, 94, 94, 93, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:59:40,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-14 13:59:41,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:41,019 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:59:41,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:59:41,020 INFO L85 PathProgramCache]: Analyzing trace with hash 866618004, now seen corresponding path program 3 times [2021-12-14 13:59:41,020 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:59:41,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997378089] [2021-12-14 13:59:41,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:41,020 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:59:41,053 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 13:59:41,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [352457334] [2021-12-14 13:59:41,055 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 13:59:41,055 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:41,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:59:41,056 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) [2021-12-14 13:59:41,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-14 13:59:42,427 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 95 check-sat command(s) [2021-12-14 13:59:42,427 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:59:42,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 2313 conjuncts, 191 conjunts are in the unsatisfiable core [2021-12-14 13:59:42,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:59:45,395 INFO L134 CoverageAnalysis]: Checked inductivity of 44086 backedges. 188 proven. 43898 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:59:45,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:59:47,030 INFO L134 CoverageAnalysis]: Checked inductivity of 44086 backedges. 188 proven. 26414 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2021-12-14 13:59:47,031 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:59:47,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997378089] [2021-12-14 13:59:47,031 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 13:59:47,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352457334] [2021-12-14 13:59:47,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352457334] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:59:47,032 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 13:59:47,032 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 98] total 104 [2021-12-14 13:59:47,033 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753711391] [2021-12-14 13:59:47,033 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 13:59:47,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2021-12-14 13:59:47,036 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:59:47,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2021-12-14 13:59:47,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5156, Invalid=5556, Unknown=0, NotChecked=0, Total=10712 [2021-12-14 13:59:47,040 INFO L87 Difference]: Start difference. First operand 1880 states and 2067 transitions. Second operand has 104 states, 104 states have (on average 7.625) internal successors, (793), 104 states have internal predecessors, (793), 100 states have call successors, (189), 96 states have call predecessors, (189), 95 states have return successors, (188), 99 states have call predecessors, (188), 99 states have call successors, (188) [2021-12-14 13:59:50,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:59:50,746 INFO L93 Difference]: Finished difference Result 2009 states and 2213 transitions. [2021-12-14 13:59:50,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2021-12-14 13:59:50,747 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 7.625) internal successors, (793), 104 states have internal predecessors, (793), 100 states have call successors, (189), 96 states have call predecessors, (189), 95 states have return successors, (188), 99 states have call predecessors, (188), 99 states have call successors, (188) Word has length 949 [2021-12-14 13:59:50,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:59:50,771 INFO L225 Difference]: With dead ends: 2009 [2021-12-14 13:59:50,772 INFO L226 Difference]: Without dead ends: 2003 [2021-12-14 13:59:50,775 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1995 GetRequests, 1793 SyntacticMatches, 1 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5055 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=15349, Invalid=25657, Unknown=0, NotChecked=0, Total=41006 [2021-12-14 13:59:50,776 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 1043 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1043 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 13:59:50,776 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1043 Valid, 1108 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 13:59:50,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2021-12-14 13:59:50,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 2000. [2021-12-14 13:59:50,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2000 states, 1600 states have (on average 1.125) internal successors, (1800), 1600 states have internal predecessors, (1800), 200 states have call successors, (200), 200 states have call predecessors, (200), 199 states have return successors, (199), 199 states have call predecessors, (199), 199 states have call successors, (199) [2021-12-14 13:59:50,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2000 states to 2000 states and 2199 transitions. [2021-12-14 13:59:50,870 INFO L78 Accepts]: Start accepts. Automaton has 2000 states and 2199 transitions. Word has length 949 [2021-12-14 13:59:50,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:59:50,872 INFO L470 AbstractCegarLoop]: Abstraction has 2000 states and 2199 transitions. [2021-12-14 13:59:50,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 7.625) internal successors, (793), 104 states have internal predecessors, (793), 100 states have call successors, (189), 96 states have call predecessors, (189), 95 states have return successors, (188), 99 states have call predecessors, (188), 99 states have call successors, (188) [2021-12-14 13:59:50,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2000 states and 2199 transitions. [2021-12-14 13:59:50,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1010 [2021-12-14 13:59:50,886 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:59:50,886 INFO L514 BasicCegarLoop]: trace histogram [101, 101, 100, 100, 100, 100, 100, 100, 100, 99, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:59:50,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-14 13:59:51,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-14 13:59:51,096 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:59:51,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:59:51,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1685422910, now seen corresponding path program 4 times [2021-12-14 13:59:51,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:59:51,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689614520] [2021-12-14 13:59:51,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:51,097 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:59:51,123 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 13:59:51,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [137635549] [2021-12-14 13:59:51,123 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-14 13:59:51,124 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:51,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:59:51,125 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:59:51,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-14 13:59:51,762 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-14 13:59:51,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-12-14 13:59:51,762 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 13:59:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 13:59:52,694 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 13:59:52,694 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-14 13:59:52,695 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-14 13:59:52,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-14 13:59:52,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-12-14 13:59:52,908 INFO L732 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1] [2021-12-14 13:59:52,911 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 13:59:53,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 01:59:53 BoogieIcfgContainer [2021-12-14 13:59:53,108 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 13:59:53,108 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 13:59:53,108 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 13:59:53,109 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 13:59:53,109 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:59:03" (3/4) ... [2021-12-14 13:59:53,110 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-14 13:59:53,242 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-14 13:59:53,242 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 13:59:53,243 INFO L158 Benchmark]: Toolchain (without parser) took 49852.16ms. Allocated memory was 98.6MB in the beginning and 377.5MB in the end (delta: 278.9MB). Free memory was 62.2MB in the beginning and 240.7MB in the end (delta: -178.5MB). Peak memory consumption was 100.9MB. Max. memory is 16.1GB. [2021-12-14 13:59:53,243 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 98.6MB. Free memory was 78.4MB in the beginning and 78.3MB in the end (delta: 57.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 13:59:53,243 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.19ms. Allocated memory is still 98.6MB. Free memory was 62.0MB in the beginning and 74.3MB in the end (delta: -12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 13:59:53,244 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.70ms. Allocated memory is still 98.6MB. Free memory was 74.3MB in the beginning and 72.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 13:59:53,244 INFO L158 Benchmark]: Boogie Preprocessor took 12.79ms. Allocated memory is still 98.6MB. Free memory was 72.7MB in the beginning and 71.8MB in the end (delta: 892.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 13:59:53,244 INFO L158 Benchmark]: RCFGBuilder took 179.68ms. Allocated memory is still 98.6MB. Free memory was 71.5MB in the beginning and 62.2MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 13:59:53,244 INFO L158 Benchmark]: TraceAbstraction took 49311.44ms. Allocated memory was 98.6MB in the beginning and 377.5MB in the end (delta: 278.9MB). Free memory was 61.7MB in the beginning and 290.4MB in the end (delta: -228.7MB). Peak memory consumption was 231.6MB. Max. memory is 16.1GB. [2021-12-14 13:59:53,245 INFO L158 Benchmark]: Witness Printer took 134.18ms. Allocated memory is still 377.5MB. Free memory was 289.3MB in the beginning and 240.7MB in the end (delta: 48.6MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2021-12-14 13:59:53,246 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.17ms. Allocated memory is still 98.6MB. Free memory was 78.4MB in the beginning and 78.3MB in the end (delta: 57.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 188.19ms. Allocated memory is still 98.6MB. Free memory was 62.0MB in the beginning and 74.3MB in the end (delta: -12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.70ms. Allocated memory is still 98.6MB. Free memory was 74.3MB in the beginning and 72.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 12.79ms. Allocated memory is still 98.6MB. Free memory was 72.7MB in the beginning and 71.8MB in the end (delta: 892.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 179.68ms. Allocated memory is still 98.6MB. Free memory was 71.5MB in the beginning and 62.2MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 49311.44ms. Allocated memory was 98.6MB in the beginning and 377.5MB in the end (delta: 278.9MB). Free memory was 61.7MB in the beginning and 290.4MB in the end (delta: -228.7MB). Peak memory consumption was 231.6MB. Max. memory is 16.1GB. * Witness Printer took 134.18ms. Allocated memory is still 377.5MB. Free memory was 289.3MB in the beginning and 240.7MB in the end (delta: 48.6MB). Peak memory consumption was 50.3MB. 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=-393, x=0, X=397, y=0, Y=2] [L31] EXPR counter++ VAL [counter=1, counter++=0, v=-393, x=0, X=397, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=1, v=-393, x=0, X=397, x=0, 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=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=-393, x=0, x=0, x=0, X=397, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=1, v=-393, x=0, x=0, x=0, X=397, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=1, v=-389, x=0, x=0, x=0, X=397, y=0, Y=2] [L45] x++ VAL [counter=1, v=-389, x=0, X=397, x=1, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=2, counter++=1, v=-389, x=1, x=0, x=0, X=397, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=2, v=-389, x=1, x=2, x=0, X=397, 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=-389, x=1, x=2, X=397, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=2, v=-389, x=1, x=0, x=2, X=397, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=2, v=-385, X=397, x=2, x=1, x=0, y=0, Y=2] [L45] x++ VAL [counter=2, v=-385, X=397, x=2, x=0, x=2, y=0, Y=2] [L31] EXPR counter++ VAL [counter=3, counter++=2, v=-385, x=2, x=0, x=2, X=397, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=3, v=-385, x=2, X=397, x=0, x=4, y=0, Y=2] [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=-385, x=2, x=4, X=397, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=3, v=-385, x=4, X=397, x=2, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=3, v=-381, x=4, X=397, x=0, x=2, y=0, Y=2] [L45] x++ VAL [counter=3, v=-381, x=0, x=4, X=397, x=3, Y=2, y=0] [L31] EXPR counter++ VAL [counter=4, counter++=3, v=-381, x=4, x=3, x=0, X=397, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=4, v=-381, x=3, x=0, x=6, X=397, Y=2, y=0] [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=-381, x=0, X=397, x=3, x=6, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=4, v=-381, X=397, x=0, x=3, x=6, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=4, v=-377, x=0, x=3, X=397, x=6, Y=2, y=0] [L45] x++ VAL [counter=4, v=-377, x=0, X=397, x=4, x=6, Y=2, y=0] [L31] EXPR counter++ VAL [counter=5, counter++=4, v=-377, X=397, x=4, x=6, x=0, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=5, v=-377, x=0, x=8, x=4, X=397, y=0, Y=2] [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=-377, X=397, x=0, x=4, x=8, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=5, v=-377, x=8, x=4, x=0, X=397, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=5, v=-373, x=8, x=4, x=0, X=397, y=0, Y=2] [L45] x++ VAL [counter=5, v=-373, x=0, x=5, x=8, X=397, Y=2, y=0] [L31] EXPR counter++ VAL [counter=6, counter++=5, v=-373, x=8, X=397, x=0, x=5, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=6, v=-373, x=5, X=397, x=0, x=10, 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=-373, x=0, x=5, x=10, X=397, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=6, v=-373, x=10, x=5, x=0, X=397, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=6, v=-369, x=10, X=397, x=0, x=5, Y=2, y=0] [L45] x++ VAL [counter=6, v=-369, x=0, x=10, x=6, X=397, y=0, Y=2] [L31] EXPR counter++ VAL [counter=7, counter++=6, v=-369, x=0, x=6, X=397, x=10, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=7, v=-369, x=12, X=397, x=6, 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=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=-369, x=6, x=0, X=397, x=12, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=7, v=-369, x=0, x=6, x=12, X=397, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=7, v=-365, x=6, x=0, X=397, x=12, y=0, Y=2] [L45] x++ VAL [counter=7, v=-365, x=12, X=397, x=0, x=7, Y=2, y=0] [L31] EXPR counter++ VAL [counter=8, counter++=7, v=-365, X=397, x=7, x=12, x=0, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=8, v=-365, x=7, x=14, x=0, X=397, Y=2, y=0] [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=-365, x=14, X=397, x=7, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=8, v=-365, x=14, x=0, x=7, X=397, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=8, v=-361, x=7, x=0, x=14, X=397, Y=2, y=0] [L45] x++ VAL [counter=8, v=-361, x=14, x=8, x=0, X=397, Y=2, y=0] [L31] EXPR counter++ VAL [counter=9, counter++=8, v=-361, x=8, x=14, X=397, x=0, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=9, v=-361, X=397, x=8, x=16, 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=-361, x=0, x=8, X=397, x=16, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=9, v=-361, X=397, x=16, x=8, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=9, v=-357, x=8, X=397, x=16, x=0, Y=2, y=0] [L45] x++ VAL [counter=9, v=-357, x=0, X=397, x=9, x=16, Y=2, y=0] [L31] EXPR counter++ VAL [counter=10, counter++=9, v=-357, x=16, x=9, x=0, X=397, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=10, v=-357, x=18, X=397, x=0, x=9, y=0, Y=2] [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=-357, x=0, x=9, X=397, x=18, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=10, v=-357, x=18, x=0, x=9, X=397, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=10, v=-353, x=9, X=397, x=0, x=18, Y=2, y=0] [L45] x++ VAL [counter=10, v=-353, x=18, x=10, x=0, X=397, y=0, Y=2] [L31] EXPR counter++ VAL [counter=11, counter++=10, v=-353, x=0, x=18, x=10, X=397, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=11, v=-353, x=0, x=20, x=10, X=397, Y=2, y=0] [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=-353, x=20, x=10, X=397, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=11, v=-353, x=20, x=0, x=10, X=397, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=11, v=-349, x=20, x=0, X=397, x=10, y=0, Y=2] [L45] x++ VAL [counter=11, v=-349, x=11, X=397, x=20, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=12, counter++=11, v=-349, x=11, x=20, X=397, x=0, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=12, v=-349, x=0, x=11, X=397, x=22, 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=-349, x=11, X=397, x=0, x=22, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=12, v=-349, X=397, x=0, x=11, x=22, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=12, v=-345, x=11, X=397, x=22, x=0, y=0, Y=2] [L45] x++ VAL [counter=12, v=-345, x=12, X=397, x=22, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=13, counter++=12, v=-345, X=397, x=12, x=22, x=0, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=13, v=-345, x=24, x=0, X=397, x=12, 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=-345, x=24, X=397, x=12, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=13, v=-345, x=12, x=24, X=397, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=13, v=-341, X=397, x=0, x=12, x=24, Y=2, y=0] [L45] x++ VAL [counter=13, v=-341, x=0, x=13, X=397, x=24, y=0, Y=2] [L31] EXPR counter++ VAL [counter=14, counter++=13, v=-341, x=24, x=13, x=0, X=397, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=14, v=-341, x=0, x=26, X=397, x=13, y=0, Y=2] [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=-341, X=397, x=0, x=26, x=13, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=14, v=-341, X=397, x=26, x=13, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=14, v=-337, x=13, x=26, x=0, X=397, y=0, Y=2] [L45] x++ VAL [counter=14, v=-337, X=397, x=26, x=0, x=14, Y=2, y=0] [L31] EXPR counter++ VAL [counter=15, counter++=14, v=-337, x=26, x=0, x=14, X=397, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=15, v=-337, x=28, x=14, x=0, X=397, 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=-337, x=0, X=397, x=28, x=14, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=15, v=-337, x=14, x=0, x=28, X=397, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=15, v=-333, x=14, x=0, X=397, x=28, Y=2, y=0] [L45] x++ VAL [counter=15, v=-333, x=15, x=0, x=28, X=397, y=0, Y=2] [L31] EXPR counter++ VAL [counter=16, counter++=15, v=-333, x=28, x=0, X=397, x=15, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=16, v=-333, x=15, X=397, x=30, 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=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=-333, x=30, x=0, x=15, X=397, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=16, v=-333, x=0, x=15, X=397, x=30, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=16, v=-329, x=0, x=15, x=30, X=397, y=0, Y=2] [L45] x++ VAL [counter=16, v=-329, X=397, x=30, x=0, x=16, y=0, Y=2] [L31] EXPR counter++ VAL [counter=17, counter++=16, v=-329, x=16, x=0, X=397, x=30, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=17, v=-329, X=397, x=0, x=32, x=16, y=0, Y=2] [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=-329, x=0, x=32, x=16, X=397, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=17, v=-329, x=16, X=397, x=32, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=17, v=-325, x=0, x=16, X=397, x=32, Y=2, y=0] [L45] x++ VAL [counter=17, v=-325, x=17, x=0, X=397, x=32, Y=2, y=0] [L31] EXPR counter++ VAL [counter=18, counter++=17, v=-325, x=17, x=32, X=397, x=0, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=18, v=-325, x=0, x=17, X=397, x=34, 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=-325, x=34, X=397, x=17, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=18, v=-325, x=17, x=0, x=34, X=397, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=18, v=-321, X=397, x=34, x=17, x=0, Y=2, y=0] [L45] x++ VAL [counter=18, v=-321, x=0, x=18, x=34, X=397, y=0, Y=2] [L31] EXPR counter++ VAL [counter=19, counter++=18, v=-321, x=0, x=34, x=18, X=397, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=19, v=-321, x=18, x=36, X=397, 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=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=-321, x=18, x=0, x=36, X=397, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=19, v=-321, x=36, X=397, x=18, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=19, v=-317, X=397, x=0, x=18, x=36, y=0, Y=2] [L45] x++ VAL [counter=19, v=-317, x=36, x=19, X=397, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=20, counter++=19, v=-317, x=36, x=0, X=397, x=19, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=20, v=-317, X=397, x=38, x=0, x=19, 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=-317, X=397, x=0, x=38, x=19, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=20, v=-317, x=0, x=19, X=397, x=38, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=20, v=-313, x=19, x=38, x=0, X=397, y=0, Y=2] [L45] x++ VAL [counter=20, v=-313, x=38, x=0, X=397, x=20, y=0, Y=2] [L31] EXPR counter++ VAL [counter=21, counter++=20, v=-313, x=0, x=38, x=20, X=397, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=21, v=-313, x=0, x=40, X=397, x=20, y=0, Y=2] [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=-313, x=0, x=40, x=20, X=397, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=21, v=-313, x=0, X=397, x=20, x=40, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=21, v=-309, x=0, x=20, x=40, X=397, Y=2, y=0] [L45] x++ VAL [counter=21, v=-309, X=397, x=40, x=21, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=22, counter++=21, v=-309, x=21, x=40, X=397, x=0, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=22, v=-309, x=21, X=397, x=0, x=42, y=0, Y=2] [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=-309, x=0, x=21, X=397, x=42, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=22, v=-309, x=21, X=397, x=42, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=22, v=-305, x=42, X=397, x=21, x=0, y=0, Y=2] [L45] x++ VAL [counter=22, v=-305, x=22, x=0, X=397, x=42, y=0, Y=2] [L31] EXPR counter++ VAL [counter=23, counter++=22, v=-305, x=0, x=42, x=22, X=397, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=23, v=-305, X=397, x=44, x=0, x=22, y=0, Y=2] [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=-305, x=0, x=44, x=22, X=397, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=23, v=-305, x=22, X=397, x=0, x=44, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=23, v=-301, X=397, x=0, x=44, x=22, Y=2, y=0] [L45] x++ VAL [counter=23, v=-301, X=397, x=0, x=44, x=23, y=0, Y=2] [L31] EXPR counter++ VAL [counter=24, counter++=23, v=-301, x=23, x=0, x=44, X=397, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=24, v=-301, X=397, x=0, x=46, x=23, 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=-301, x=46, x=23, X=397, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=24, v=-301, x=23, X=397, x=46, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=24, v=-297, x=0, x=23, X=397, x=46, Y=2, y=0] [L45] x++ VAL [counter=24, v=-297, x=24, x=46, X=397, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=25, counter++=24, v=-297, X=397, x=46, x=24, x=0, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=25, v=-297, X=397, 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=-297, x=48, x=24, x=0, X=397, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=25, v=-297, X=397, x=0, x=24, x=48, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=25, v=-293, X=397, x=24, x=0, x=48, y=0, Y=2] [L45] x++ VAL [counter=25, v=-293, X=397, x=0, x=48, x=25, y=0, Y=2] [L31] EXPR counter++ VAL [counter=26, counter++=25, v=-293, x=0, x=25, x=48, X=397, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=26, v=-293, x=25, x=0, X=397, x=50, 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=-293, x=50, x=25, X=397, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=26, v=-293, x=25, X=397, x=0, x=50, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=26, v=-289, x=25, X=397, x=50, x=0, y=0, Y=2] [L45] x++ VAL [counter=26, v=-289, X=397, x=0, x=26, x=50, y=0, Y=2] [L31] EXPR counter++ VAL [counter=27, counter++=26, v=-289, X=397, x=26, x=0, x=50, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=27, v=-289, x=0, X=397, x=52, x=26, 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=-289, x=52, X=397, x=26, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=27, v=-289, x=26, x=52, x=0, X=397, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=27, v=-285, x=26, x=52, X=397, x=0, y=0, Y=2] [L45] x++ VAL [counter=27, v=-285, x=27, X=397, x=0, x=52, y=0, Y=2] [L31] EXPR counter++ VAL [counter=28, counter++=27, v=-285, x=0, X=397, x=52, x=27, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=28, v=-285, x=27, X=397, x=0, x=54, y=0, Y=2] [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=-285, x=54, X=397, x=27, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=28, v=-285, X=397, x=54, x=0, x=27, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=28, v=-281, x=0, x=54, X=397, x=27, Y=2, y=0] [L45] x++ VAL [counter=28, v=-281, x=0, x=28, x=54, X=397, y=0, Y=2] [L31] EXPR counter++ VAL [counter=29, counter++=28, v=-281, x=54, x=28, x=0, X=397, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=29, v=-281, x=28, X=397, x=56, 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=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=-281, x=0, x=28, X=397, x=56, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=29, v=-281, x=0, X=397, x=56, x=28, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=29, v=-277, X=397, x=28, x=56, x=0, Y=2, y=0] [L45] x++ VAL [counter=29, v=-277, x=56, X=397, x=0, x=29, y=0, Y=2] [L31] EXPR counter++ VAL [counter=30, counter++=29, v=-277, x=0, x=29, X=397, x=56, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=30, v=-277, x=0, x=58, x=29, X=397, 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=-277, x=29, x=0, x=58, X=397, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=30, v=-277, x=58, X=397, x=29, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=30, v=-273, x=29, X=397, x=0, x=58, y=0, Y=2] [L45] x++ VAL [counter=30, v=-273, x=58, x=0, x=30, X=397, y=0, Y=2] [L31] EXPR counter++ VAL [counter=31, counter++=30, v=-273, x=30, X=397, x=58, x=0, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=31, v=-273, x=30, X=397, x=0, x=60, 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=-273, x=60, x=30, X=397, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=31, v=-273, X=397, x=60, x=0, x=30, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=31, v=-269, x=0, X=397, x=60, x=30, Y=2, y=0] [L45] x++ VAL [counter=31, v=-269, x=60, X=397, x=0, x=31, Y=2, y=0] [L31] EXPR counter++ VAL [counter=32, counter++=31, v=-269, x=0, x=60, x=31, X=397, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=32, v=-269, x=62, X=397, x=31, 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=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=-269, X=397, x=0, x=62, x=31, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=32, v=-269, X=397, x=31, x=62, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=32, v=-265, X=397, x=0, x=31, x=62, Y=2, y=0] [L45] x++ VAL [counter=32, v=-265, x=32, X=397, x=62, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=33, counter++=32, v=-265, x=62, x=32, x=0, X=397, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=33, v=-265, X=397, x=64, x=0, x=32, 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=-265, x=64, x=0, x=32, X=397, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=33, v=-265, x=64, x=0, X=397, x=32, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=33, v=-261, x=64, X=397, x=0, x=32, Y=2, y=0] [L45] x++ VAL [counter=33, v=-261, x=33, x=64, X=397, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=34, counter++=33, v=-261, x=0, x=64, x=33, X=397, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=34, v=-261, x=66, X=397, x=0, x=33, 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=-261, X=397, x=66, x=33, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=34, v=-261, x=33, X=397, x=66, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=34, v=-257, x=0, x=33, X=397, x=66, y=0, Y=2] [L45] x++ VAL [counter=34, v=-257, x=34, x=0, X=397, x=66, Y=2, y=0] [L31] EXPR counter++ VAL [counter=35, counter++=34, v=-257, x=34, X=397, x=0, x=66, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=35, v=-257, x=34, x=68, X=397, 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=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=-257, x=0, x=34, X=397, x=68, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=35, v=-257, X=397, x=68, x=34, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=35, v=-253, X=397, x=0, x=34, x=68, Y=2, y=0] [L45] x++ VAL [counter=35, v=-253, x=35, X=397, x=0, x=68, Y=2, y=0] [L31] EXPR counter++ VAL [counter=36, counter++=35, v=-253, X=397, x=0, x=68, x=35, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=36, v=-253, x=70, x=35, X=397, 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=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=-253, x=70, X=397, x=0, x=35, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=36, v=-253, x=35, x=70, x=0, X=397, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=36, v=-249, x=70, X=397, x=0, x=35, y=0, Y=2] [L45] x++ VAL [counter=36, v=-249, x=70, X=397, x=0, x=36, y=0, Y=2] [L31] EXPR counter++ VAL [counter=37, counter++=36, v=-249, x=70, x=0, X=397, x=36, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=37, v=-249, x=0, x=72, X=397, x=36, 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=-249, x=0, X=397, x=72, x=36, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=37, v=-249, x=0, X=397, x=36, x=72, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=37, v=-245, x=72, x=36, x=0, X=397, Y=2, y=0] [L45] x++ VAL [counter=37, v=-245, x=37, X=397, x=0, x=72, y=0, Y=2] [L31] EXPR counter++ VAL [counter=38, counter++=37, v=-245, x=37, x=72, x=0, X=397, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=38, v=-245, x=0, x=37, x=74, X=397, y=0, Y=2] [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=-245, x=0, X=397, x=37, x=74, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=38, v=-245, x=0, x=37, x=74, X=397, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=38, v=-241, x=74, x=0, x=37, X=397, Y=2, y=0] [L45] x++ VAL [counter=38, v=-241, x=0, X=397, x=74, x=38, y=0, Y=2] [L31] EXPR counter++ VAL [counter=39, counter++=38, v=-241, x=0, x=74, x=38, X=397, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=39, v=-241, x=76, x=38, x=0, X=397, Y=2, y=0] [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=-241, x=76, x=0, x=38, X=397, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=39, v=-241, x=0, X=397, x=76, x=38, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=39, v=-237, X=397, x=76, x=0, x=38, Y=2, y=0] [L45] x++ VAL [counter=39, v=-237, x=0, x=39, x=76, X=397, y=0, Y=2] [L31] EXPR counter++ VAL [counter=40, counter++=39, v=-237, X=397, x=39, x=76, x=0, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=40, v=-237, x=78, x=39, X=397, 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=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=-237, x=0, x=78, X=397, x=39, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=40, v=-237, x=78, x=39, X=397, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=40, v=-233, x=0, x=39, X=397, x=78, y=0, Y=2] [L45] x++ VAL [counter=40, v=-233, X=397, x=0, x=40, x=78, Y=2, y=0] [L31] EXPR counter++ VAL [counter=41, counter++=40, v=-233, x=0, x=40, x=78, X=397, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=41, v=-233, x=0, x=80, x=40, X=397, 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=-233, X=397, x=80, x=0, x=40, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=41, v=-233, x=0, X=397, x=80, x=40, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=41, v=-229, x=40, X=397, x=0, x=80, y=0, Y=2] [L45] x++ VAL [counter=41, v=-229, x=80, x=0, X=397, x=41, y=0, Y=2] [L31] EXPR counter++ VAL [counter=42, counter++=41, v=-229, x=41, X=397, x=0, x=80, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=42, v=-229, X=397, x=41, x=82, 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=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=-229, x=0, X=397, x=82, x=41, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=42, v=-229, x=0, X=397, x=41, x=82, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=42, v=-225, x=41, X=397, x=0, x=82, Y=2, y=0] [L45] x++ VAL [counter=42, v=-225, x=42, x=82, x=0, X=397, y=0, Y=2] [L31] EXPR counter++ VAL [counter=43, counter++=42, v=-225, x=82, x=0, x=42, X=397, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=43, v=-225, x=42, X=397, x=84, 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=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=-225, x=84, x=42, X=397, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=43, v=-225, x=42, x=84, x=0, X=397, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=43, v=-221, x=42, X=397, x=0, x=84, Y=2, y=0] [L45] x++ VAL [counter=43, v=-221, X=397, x=84, x=0, x=43, y=0, Y=2] [L31] EXPR counter++ VAL [counter=44, counter++=43, v=-221, x=43, X=397, x=0, x=84, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=44, v=-221, X=397, x=86, x=0, x=43, 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=-221, x=0, x=43, X=397, x=86, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=44, v=-221, x=86, X=397, x=43, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=44, v=-217, x=43, X=397, x=86, x=0, y=0, Y=2] [L45] x++ VAL [counter=44, v=-217, x=0, x=86, X=397, x=44, Y=2, y=0] [L31] EXPR counter++ VAL [counter=45, counter++=44, v=-217, x=0, x=44, X=397, x=86, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=45, v=-217, x=44, X=397, x=88, 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=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=-217, x=44, x=88, X=397, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=45, v=-217, x=88, x=44, X=397, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=45, v=-213, x=88, x=0, x=44, X=397, y=0, Y=2] [L45] x++ VAL [counter=45, v=-213, x=0, x=45, x=88, X=397, Y=2, y=0] [L31] EXPR counter++ VAL [counter=46, counter++=45, v=-213, X=397, x=0, x=88, x=45, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=46, v=-213, X=397, x=0, x=90, x=45, 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=-213, x=90, x=45, X=397, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=46, v=-213, x=90, x=0, x=45, X=397, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=46, v=-209, X=397, x=45, x=0, x=90, y=0, Y=2] [L45] x++ VAL [counter=46, v=-209, x=46, x=0, x=90, X=397, Y=2, y=0] [L31] EXPR counter++ VAL [counter=47, counter++=46, v=-209, x=0, x=46, X=397, x=90, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=47, v=-209, X=397, x=0, x=46, x=92, 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=-209, X=397, x=92, x=0, x=46, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=47, v=-209, x=46, X=397, x=92, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=47, v=-205, x=0, X=397, x=46, x=92, Y=2, y=0] [L45] x++ VAL [counter=47, v=-205, x=92, x=47, x=0, X=397, Y=2, y=0] [L31] EXPR counter++ VAL [counter=48, counter++=47, v=-205, x=92, x=47, X=397, x=0, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=48, v=-205, X=397, x=47, x=94, 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=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=-205, X=397, x=47, x=0, x=94, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=48, v=-205, x=0, X=397, x=94, x=47, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=48, v=-201, X=397, x=47, x=94, x=0, Y=2, y=0] [L45] x++ VAL [counter=48, v=-201, x=94, X=397, x=48, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=49, counter++=48, v=-201, x=94, x=0, X=397, x=48, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=49, v=-201, X=397, x=0, x=96, 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=-201, x=0, x=96, x=48, X=397, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=49, v=-201, X=397, x=48, x=96, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=49, v=-197, x=48, x=0, x=96, X=397, Y=2, y=0] [L45] x++ VAL [counter=49, v=-197, X=397, x=96, x=0, x=49, y=0, Y=2] [L31] EXPR counter++ VAL [counter=50, counter++=49, v=-197, x=96, x=0, x=49, X=397, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=50, v=-197, x=49, X=397, x=98, 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=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=-197, x=0, X=397, x=98, x=49, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=50, v=-197, X=397, x=49, x=0, x=98, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=50, v=-193, X=397, x=0, x=49, x=98, y=0, Y=2] [L45] x++ VAL [counter=50, v=-193, x=98, x=50, x=0, X=397, y=0, Y=2] [L31] EXPR counter++ VAL [counter=51, counter++=50, v=-193, x=98, x=0, x=50, X=397, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=51, v=-193, X=397, x=100, 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=51] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=51] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=51, v=-193, x=100, x=0, X=397, x=50, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=51, v=-193, x=50, x=100, x=0, X=397, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=51, v=-189, x=0, x=50, x=100, X=397, Y=2, y=0] [L45] x++ VAL [counter=51, v=-189, x=100, X=397, x=51, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=52, counter++=51, v=-189, x=100, x=51, x=0, X=397, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=52, v=-189, x=51, x=102, X=397, 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=52] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=52] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=52, v=-189, x=0, X=397, x=51, x=102, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=52, v=-189, x=0, X=397, x=51, x=102, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=52, v=-185, X=397, x=102, x=0, x=51, y=0, Y=2] [L45] x++ VAL [counter=52, v=-185, x=0, x=102, x=52, X=397, y=0, Y=2] [L31] EXPR counter++ VAL [counter=53, counter++=52, v=-185, x=52, x=102, x=0, X=397, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=53, v=-185, x=52, X=397, x=0, x=104, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=53] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=53] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=53, v=-185, x=104, x=52, x=0, X=397, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=53, v=-185, X=397, x=52, x=0, x=104, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=53, v=-181, x=104, x=52, X=397, x=0, Y=2, y=0] [L45] x++ VAL [counter=53, v=-181, X=397, x=0, x=104, x=53, y=0, Y=2] [L31] EXPR counter++ VAL [counter=54, counter++=53, v=-181, X=397, x=53, x=0, x=104, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=54, v=-181, x=0, x=106, X=397, x=53, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=54] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=54] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=54, v=-181, X=397, x=0, x=53, x=106, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=54, v=-181, x=53, x=0, x=106, X=397, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=54, v=-177, x=53, X=397, x=106, x=0, Y=2, y=0] [L45] x++ VAL [counter=54, v=-177, x=106, x=54, X=397, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=55, counter++=54, v=-177, x=0, x=54, X=397, x=106, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=55, v=-177, x=0, X=397, x=108, x=54, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=55] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=55] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=55, v=-177, x=54, x=0, x=108, X=397, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=55, v=-177, x=54, X=397, x=108, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=55, v=-173, x=0, x=108, X=397, x=54, Y=2, y=0] [L45] x++ VAL [counter=55, v=-173, x=108, X=397, x=0, x=55, y=0, Y=2] [L31] EXPR counter++ VAL [counter=56, counter++=55, v=-173, x=0, X=397, x=55, x=108, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=56, v=-173, x=0, X=397, x=110, x=55, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=56] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=56] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=56, v=-173, x=0, X=397, x=55, x=110, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=56, v=-173, x=110, X=397, x=55, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=56, v=-169, x=110, X=397, x=55, x=0, Y=2, y=0] [L45] x++ VAL [counter=56, v=-169, X=397, x=56, x=0, x=110, y=0, Y=2] [L31] EXPR counter++ VAL [counter=57, counter++=56, v=-169, x=0, x=56, X=397, x=110, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=57, v=-169, X=397, x=112, x=0, x=56, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=57] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=57] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=57, v=-169, x=112, X=397, x=0, x=56, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=57, v=-169, x=56, x=112, x=0, X=397, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=57, v=-165, X=397, x=0, x=112, x=56, Y=2, y=0] [L45] x++ VAL [counter=57, v=-165, x=112, X=397, x=57, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=58, counter++=57, v=-165, x=0, x=112, x=57, X=397, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=58, v=-165, x=57, x=0, X=397, x=114, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=58] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=58] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=58, v=-165, x=57, x=114, X=397, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=58, v=-165, x=57, X=397, x=114, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=58, v=-161, x=114, x=0, X=397, x=57, Y=2, y=0] [L45] x++ VAL [counter=58, v=-161, x=0, X=397, x=114, x=58, y=0, Y=2] [L31] EXPR counter++ VAL [counter=59, counter++=58, v=-161, x=58, x=114, x=0, X=397, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=59, v=-161, x=58, x=0, x=116, X=397, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=59] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=59] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=59, v=-161, x=0, x=116, X=397, x=58, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=59, v=-161, x=116, X=397, x=0, x=58, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=59, v=-157, X=397, x=0, x=116, x=58, y=0, Y=2] [L45] x++ VAL [counter=59, v=-157, X=397, x=0, x=116, x=59, y=0, Y=2] [L31] EXPR counter++ VAL [counter=60, counter++=59, v=-157, X=397, x=0, x=59, x=116, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=60, v=-157, x=118, X=397, x=59, 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=60] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=60] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=60, v=-157, x=0, x=59, X=397, x=118, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=60, v=-157, x=0, x=118, x=59, X=397, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=60, v=-153, X=397, x=118, x=0, x=59, y=0, Y=2] [L45] x++ VAL [counter=60, v=-153, x=118, x=60, X=397, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=61, counter++=60, v=-153, x=0, x=60, x=118, X=397, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=61, v=-153, x=0, x=120, X=397, x=60, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=61] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=61] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=61, v=-153, x=120, x=0, x=60, X=397, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=61, v=-153, X=397, x=60, x=0, x=120, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=61, v=-149, x=60, x=0, x=120, X=397, Y=2, y=0] [L45] x++ VAL [counter=61, v=-149, x=120, x=0, X=397, x=61, y=0, Y=2] [L31] EXPR counter++ VAL [counter=62, counter++=61, v=-149, X=397, x=0, x=61, x=120, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=62, v=-149, X=397, x=61, x=122, 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=62] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=62] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=62, v=-149, X=397, x=0, x=61, x=122, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=62, v=-149, X=397, x=122, x=0, x=61, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=62, v=-145, x=122, X=397, x=61, x=0, y=0, Y=2] [L45] x++ VAL [counter=62, v=-145, x=62, X=397, x=0, x=122, y=0, Y=2] [L31] EXPR counter++ VAL [counter=63, counter++=62, v=-145, X=397, x=122, x=62, x=0, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=63, v=-145, x=124, x=0, x=62, X=397, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=63] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=63] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=63, v=-145, X=397, x=124, x=0, x=62, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=63, v=-145, x=62, x=124, X=397, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=63, v=-141, x=62, X=397, x=0, x=124, y=0, Y=2] [L45] x++ VAL [counter=63, v=-141, x=124, x=63, x=0, X=397, y=0, Y=2] [L31] EXPR counter++ VAL [counter=64, counter++=63, v=-141, x=124, x=63, x=0, X=397, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=64, v=-141, x=0, X=397, x=63, x=126, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=64] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=64] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=64, v=-141, x=126, x=0, x=63, X=397, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=64, v=-141, X=397, x=0, x=63, x=126, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=64, v=-137, x=126, x=0, X=397, x=63, Y=2, y=0] [L45] x++ VAL [counter=64, v=-137, x=0, x=64, x=126, X=397, Y=2, y=0] [L31] EXPR counter++ VAL [counter=65, counter++=64, v=-137, x=64, X=397, x=0, x=126, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=65, v=-137, x=0, x=128, X=397, x=64, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=65] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=65] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=65, v=-137, x=128, x=0, X=397, x=64, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=65, v=-137, x=64, x=0, x=128, X=397, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=65, v=-133, X=397, x=128, x=0, x=64, y=0, Y=2] [L45] x++ VAL [counter=65, v=-133, x=128, x=0, x=65, X=397, y=0, Y=2] [L31] EXPR counter++ VAL [counter=66, counter++=65, v=-133, x=128, x=65, x=0, X=397, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=66, v=-133, x=65, x=130, X=397, 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=66] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=66] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=66, v=-133, x=130, x=0, x=65, X=397, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=66, v=-133, X=397, x=130, x=0, x=65, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=66, v=-129, X=397, x=65, x=130, x=0, y=0, Y=2] [L45] x++ VAL [counter=66, v=-129, X=397, x=66, x=0, x=130, y=0, Y=2] [L31] EXPR counter++ VAL [counter=67, counter++=66, v=-129, x=66, x=0, x=130, X=397, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=67, v=-129, x=132, x=66, X=397, 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=67] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=67] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=67, v=-129, X=397, x=66, x=0, x=132, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=67, v=-129, x=132, x=0, X=397, x=66, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=67, v=-125, x=66, x=132, X=397, x=0, y=0, Y=2] [L45] x++ VAL [counter=67, v=-125, x=0, X=397, x=132, x=67, y=0, Y=2] [L31] EXPR counter++ VAL [counter=68, counter++=67, v=-125, x=0, x=132, X=397, x=67, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=68, v=-125, X=397, x=67, x=0, x=134, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=68] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=68] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=68, v=-125, x=0, x=67, x=134, X=397, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=68, v=-125, x=134, x=0, X=397, x=67, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=68, v=-121, x=134, X=397, x=0, x=67, y=0, Y=2] [L45] x++ VAL [counter=68, v=-121, x=0, X=397, x=134, x=68, Y=2, y=0] [L31] EXPR counter++ VAL [counter=69, counter++=68, v=-121, x=68, x=0, x=134, X=397, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=69, v=-121, x=136, x=0, X=397, x=68, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=69] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=69] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=69, v=-121, x=0, X=397, x=68, x=136, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=69, v=-121, x=136, x=68, x=0, X=397, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=69, v=-117, x=0, x=68, x=136, X=397, y=0, Y=2] [L45] x++ VAL [counter=69, v=-117, x=0, X=397, x=69, x=136, y=0, Y=2] [L31] EXPR counter++ VAL [counter=70, counter++=69, v=-117, x=69, X=397, x=136, x=0, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=70, v=-117, x=138, x=0, x=69, X=397, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=70] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=70] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=70, v=-117, x=138, x=0, X=397, x=69, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=70, v=-117, x=0, x=138, x=69, X=397, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=70, v=-113, x=0, X=397, x=138, x=69, y=0, Y=2] [L45] x++ VAL [counter=70, v=-113, x=0, X=397, x=138, x=70, Y=2, y=0] [L31] EXPR counter++ VAL [counter=71, counter++=70, v=-113, x=70, x=138, x=0, X=397, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=71, v=-113, x=140, x=70, x=0, X=397, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=71] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=71] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=71, v=-113, x=140, X=397, x=70, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=71, v=-113, x=0, x=140, X=397, x=70, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=71, v=-109, x=70, X=397, x=0, x=140, y=0, Y=2] [L45] x++ VAL [counter=71, v=-109, X=397, x=0, x=71, x=140, Y=2, y=0] [L31] EXPR counter++ VAL [counter=72, counter++=71, v=-109, x=71, x=140, x=0, X=397, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=72, v=-109, x=0, x=71, x=142, X=397, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=72] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=72] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=72, v=-109, X=397, x=71, x=142, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=72, v=-109, x=0, x=142, x=71, X=397, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=72, v=-105, X=397, x=71, x=142, x=0, Y=2, y=0] [L45] x++ VAL [counter=72, v=-105, X=397, x=142, x=0, x=72, y=0, Y=2] [L31] EXPR counter++ VAL [counter=73, counter++=72, v=-105, x=72, x=0, X=397, x=142, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=73, v=-105, x=144, x=0, x=72, X=397, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=73] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=73] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=73, v=-105, x=144, x=72, x=0, X=397, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=73, v=-105, x=72, x=0, x=144, X=397, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=73, v=-101, x=0, x=144, x=72, X=397, Y=2, y=0] [L45] x++ VAL [counter=73, v=-101, x=73, X=397, x=0, x=144, y=0, Y=2] [L31] EXPR counter++ VAL [counter=74, counter++=73, v=-101, x=73, x=144, x=0, X=397, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=74, v=-101, x=146, X=397, x=73, 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=74] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=74] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=74, v=-101, x=73, x=0, x=146, X=397, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=74, v=-101, x=73, x=0, x=146, X=397, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=74, v=-97, x=73, x=146, x=0, X=397, y=0, Y=2] [L45] x++ VAL [counter=74, v=-97, x=0, x=146, X=397, x=74, y=0, Y=2] [L31] EXPR counter++ VAL [counter=75, counter++=74, v=-97, x=0, x=146, X=397, x=74, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=75, v=-97, x=74, X=397, x=148, 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=75] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=75] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=75, v=-97, x=0, X=397, x=74, x=148, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=75, v=-97, x=74, x=0, X=397, x=148, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=75, v=-93, x=74, x=148, X=397, x=0, y=0, Y=2] [L45] x++ VAL [counter=75, v=-93, X=397, x=148, x=75, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=76, counter++=75, v=-93, x=148, x=0, X=397, x=75, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=76, v=-93, x=0, x=75, X=397, x=150, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=76] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=76] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=76, v=-93, X=397, x=75, x=150, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=76, v=-93, x=0, x=75, x=150, X=397, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=76, v=-89, x=75, x=150, X=397, x=0, y=0, Y=2] [L45] x++ VAL [counter=76, v=-89, x=76, x=0, x=150, X=397, Y=2, y=0] [L31] EXPR counter++ VAL [counter=77, counter++=76, v=-89, x=0, x=76, x=150, X=397, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=77, v=-89, X=397, x=0, x=76, x=152, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=77] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=77] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=77, v=-89, X=397, x=152, x=0, x=76, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=77, v=-89, x=0, x=152, x=76, X=397, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=77, v=-85, x=76, X=397, x=152, x=0, y=0, Y=2] [L45] x++ VAL [counter=77, v=-85, x=152, x=0, x=77, X=397, y=0, Y=2] [L31] EXPR counter++ VAL [counter=78, counter++=77, v=-85, x=0, X=397, x=152, x=77, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=78, v=-85, x=77, x=0, x=154, X=397, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=78] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=78] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=78, v=-85, x=0, x=77, X=397, x=154, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=78, v=-85, x=154, x=0, x=77, X=397, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=78, v=-81, X=397, x=0, x=154, x=77, Y=2, y=0] [L45] x++ VAL [counter=78, v=-81, X=397, x=78, x=0, x=154, y=0, Y=2] [L31] EXPR counter++ VAL [counter=79, counter++=78, v=-81, x=0, X=397, x=78, x=154, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=79, v=-81, x=78, x=156, X=397, 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=79] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=79] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=79, v=-81, x=78, x=0, x=156, X=397, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=79, v=-81, x=156, x=78, x=0, X=397, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=79, v=-77, X=397, x=78, x=156, x=0, Y=2, y=0] [L45] x++ VAL [counter=79, v=-77, X=397, x=0, x=79, x=156, y=0, Y=2] [L31] EXPR counter++ VAL [counter=80, counter++=79, v=-77, x=79, X=397, x=0, x=156, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=80, v=-77, x=158, x=79, X=397, 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=80] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=80] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=80, v=-77, x=158, x=0, X=397, x=79, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=80, v=-77, x=158, x=0, x=79, X=397, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=80, v=-73, x=0, x=79, X=397, x=158, Y=2, y=0] [L45] x++ VAL [counter=80, v=-73, x=0, X=397, x=80, x=158, y=0, Y=2] [L31] EXPR counter++ VAL [counter=81, counter++=80, v=-73, x=80, x=0, X=397, x=158, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=81, v=-73, X=397, x=0, x=160, x=80, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=81] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=81] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=81, v=-73, X=397, x=80, x=0, x=160, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=81, v=-73, x=0, x=160, x=80, X=397, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=81, v=-69, X=397, x=80, x=160, x=0, Y=2, y=0] [L45] x++ VAL [counter=81, v=-69, x=81, X=397, x=160, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=82, counter++=81, v=-69, x=160, X=397, x=0, x=81, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=82, v=-69, x=162, x=81, X=397, 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=82] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=82] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=82, v=-69, x=0, X=397, x=81, x=162, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=82, v=-69, X=397, x=0, x=162, x=81, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=82, v=-65, x=162, X=397, x=0, x=81, Y=2, y=0] [L45] x++ VAL [counter=82, v=-65, x=162, X=397, x=82, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=83, counter++=82, v=-65, x=82, x=162, X=397, x=0, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=83, v=-65, x=82, x=0, X=397, x=164, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=83] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=83] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=83, v=-65, x=164, X=397, x=0, x=82, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=83, v=-65, X=397, x=82, x=0, x=164, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=83, v=-61, x=164, x=0, x=82, X=397, Y=2, y=0] [L45] x++ VAL [counter=83, v=-61, x=164, X=397, x=0, x=83, Y=2, y=0] [L31] EXPR counter++ VAL [counter=84, counter++=83, v=-61, x=164, x=0, x=83, X=397, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=84, v=-61, x=0, x=166, x=83, X=397, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=84] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=84] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=84, v=-61, x=83, X=397, x=0, x=166, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=84, v=-61, X=397, x=166, x=83, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=84, v=-57, x=83, X=397, x=0, x=166, y=0, Y=2] [L45] x++ VAL [counter=84, v=-57, x=166, x=84, X=397, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=85, counter++=84, v=-57, x=166, X=397, x=84, x=0, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=85, v=-57, X=397, x=0, x=168, x=84, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=85] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=85] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=85, v=-57, x=0, x=168, x=84, X=397, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=85, v=-57, x=84, x=168, X=397, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=85, v=-53, x=84, X=397, x=168, x=0, y=0, Y=2] [L45] x++ VAL [counter=85, v=-53, x=168, X=397, x=0, x=85, Y=2, y=0] [L31] EXPR counter++ VAL [counter=86, counter++=85, v=-53, x=85, x=0, X=397, x=168, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=86, v=-53, x=170, x=85, X=397, 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=86] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=86] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=86, v=-53, x=85, x=0, x=170, X=397, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=86, v=-53, x=85, x=0, x=170, X=397, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=86, v=-49, x=85, X=397, x=170, x=0, y=0, Y=2] [L45] x++ VAL [counter=86, v=-49, X=397, x=86, x=0, x=170, Y=2, y=0] [L31] EXPR counter++ VAL [counter=87, counter++=86, v=-49, x=0, x=170, x=86, X=397, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=87, v=-49, X=397, x=0, x=172, 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=87] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=87] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=87, v=-49, x=0, x=86, X=397, x=172, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=87, v=-49, X=397, x=86, x=0, x=172, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=87, v=-45, x=172, x=0, X=397, x=86, Y=2, y=0] [L45] x++ VAL [counter=87, v=-45, x=0, x=87, X=397, x=172, y=0, Y=2] [L31] EXPR counter++ VAL [counter=88, counter++=87, v=-45, x=172, x=0, X=397, x=87, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=88, v=-45, x=174, x=0, X=397, x=87, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=88] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=88] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=88, v=-45, x=174, x=0, x=87, X=397, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=88, v=-45, x=0, X=397, x=174, x=87, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=88, v=-41, x=174, X=397, x=87, x=0, Y=2, y=0] [L45] x++ VAL [counter=88, v=-41, X=397, x=88, x=174, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=89, counter++=88, v=-41, X=397, x=88, x=0, x=174, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=89, v=-41, X=397, x=0, x=88, x=176, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=89] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=89] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=89, v=-41, x=176, X=397, x=88, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=89, v=-41, x=0, x=88, X=397, x=176, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=89, v=-37, x=176, X=397, x=0, x=88, y=0, Y=2] [L45] x++ VAL [counter=89, v=-37, x=176, x=0, x=89, X=397, y=0, Y=2] [L31] EXPR counter++ VAL [counter=90, counter++=89, v=-37, x=176, X=397, x=89, x=0, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=90, v=-37, X=397, x=0, x=89, x=178, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=90] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=90] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=90, v=-37, x=0, x=178, x=89, X=397, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=90, v=-37, X=397, x=0, x=89, x=178, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=90, v=-33, x=178, x=89, X=397, x=0, y=0, Y=2] [L45] x++ VAL [counter=90, v=-33, x=90, X=397, x=0, x=178, Y=2, y=0] [L31] EXPR counter++ VAL [counter=91, counter++=90, v=-33, X=397, x=90, x=0, x=178, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=91, v=-33, x=0, x=180, X=397, x=90, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=91] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=91] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=91, v=-33, x=180, x=90, X=397, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=91, v=-33, x=90, x=180, X=397, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=91, v=-29, x=0, x=90, X=397, x=180, Y=2, y=0] [L45] x++ VAL [counter=91, v=-29, x=91, X=397, x=180, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=92, counter++=91, v=-29, x=91, x=0, X=397, x=180, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=92, v=-29, X=397, x=0, x=182, x=91, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=92] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=92] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=92, v=-29, x=0, x=91, X=397, x=182, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=92, v=-29, x=182, x=0, X=397, x=91, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=92, v=-25, x=91, X=397, x=182, x=0, y=0, Y=2] [L45] x++ VAL [counter=92, v=-25, X=397, x=0, x=182, x=92, Y=2, y=0] [L31] EXPR counter++ VAL [counter=93, counter++=92, v=-25, x=92, x=182, x=0, X=397, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=93, v=-25, x=0, X=397, x=92, x=184, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=93] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=93] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=93, v=-25, X=397, x=184, x=92, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=93, v=-25, X=397, x=184, x=92, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=93, v=-21, x=0, x=92, x=184, X=397, Y=2, y=0] [L45] x++ VAL [counter=93, v=-21, x=0, x=93, X=397, x=184, y=0, Y=2] [L31] EXPR counter++ VAL [counter=94, counter++=93, v=-21, x=184, X=397, x=93, x=0, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=94, v=-21, x=93, X=397, x=0, x=186, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=94] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=94] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=94, v=-21, x=93, x=186, x=0, X=397, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=94, v=-21, X=397, x=186, x=0, x=93, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=94, v=-17, x=0, x=186, x=93, X=397, Y=2, y=0] [L45] x++ VAL [counter=94, v=-17, X=397, x=0, x=94, x=186, Y=2, y=0] [L31] EXPR counter++ VAL [counter=95, counter++=94, v=-17, x=186, x=94, X=397, x=0, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=95, v=-17, x=0, x=188, X=397, x=94, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=95] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=95] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=95, v=-17, x=188, x=94, X=397, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=95, v=-17, x=94, x=0, X=397, x=188, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=95, v=-13, x=188, X=397, x=0, x=94, Y=2, y=0] [L45] x++ VAL [counter=95, v=-13, X=397, x=188, x=95, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=96, counter++=95, v=-13, X=397, x=95, x=188, x=0, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=96, v=-13, x=95, x=190, X=397, 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=96] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=96] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=96, v=-13, x=0, x=190, X=397, x=95, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=96, v=-13, x=95, x=190, X=397, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=96, v=-9, X=397, x=0, x=190, x=95, Y=2, y=0] [L45] x++ VAL [counter=96, v=-9, x=0, X=397, x=96, x=190, y=0, Y=2] [L31] EXPR counter++ VAL [counter=97, counter++=96, v=-9, x=96, x=190, X=397, x=0, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=97, v=-9, x=0, x=96, X=397, x=192, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=97] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=97] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=97, v=-9, X=397, x=192, x=0, x=96, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=97, v=-9, x=96, x=192, X=397, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=97, v=-5, X=397, x=0, x=192, x=96, Y=2, y=0] [L45] x++ VAL [counter=97, v=-5, x=97, X=397, x=0, x=192, y=0, Y=2] [L31] EXPR counter++ VAL [counter=98, counter++=97, v=-5, X=397, x=0, x=192, x=97, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=98, v=-5, x=194, x=0, x=97, X=397, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=98] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=98] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=98, v=-5, x=97, x=0, x=194, X=397, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=98, v=-5, X=397, x=0, x=97, x=194, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=98, v=-1, x=194, X=397, x=0, x=97, y=0, Y=2] [L45] x++ VAL [counter=98, v=-1, x=194, X=397, x=98, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=99, counter++=98, v=-1, x=98, x=194, x=0, X=397, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=99, v=-1, x=0, x=196, x=98, X=397, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=99] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=99] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=99, v=-1, x=0, x=196, x=98, X=397, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=99, v=-1, x=98, x=0, X=397, x=196, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=99, v=3, X=397, x=196, x=98, x=0, Y=2, y=0] [L45] x++ VAL [counter=99, v=3, x=99, x=0, x=196, X=397, y=0, Y=2] [L31] EXPR counter++ VAL [counter=100, counter++=99, v=3, x=196, X=397, x=0, x=99, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=100, v=3, X=397, x=99, x=198, 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=100] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=100] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=100, v=3, X=397, x=0, x=99, x=198, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=100, v=3, X=397, x=99, x=0, x=198, y=0, Y=2] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=100, v=-787, x=0, x=198, x=99, X=397, y=1, Y=2] [L45] x++ VAL [counter=100, v=-787, X=397, x=100, x=0, x=198, y=1, Y=2] [L31] EXPR counter++ VAL [counter=101, counter++=100, v=-787, X=397, x=100, x=198, x=0, Y=2, y=1] [L31] COND FALSE !(counter++<100) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [counter=101, v=-787, x=100, X=397, x=100, x=200, 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=101] [L14] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=101] [L16] reach_error() VAL [\old(cond)=0, cond=0, counter=101] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 49.1s, OverallIterations: 11, TraceHistogramMax: 101, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 29.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 4025 SdHoareTripleChecker+Valid, 14.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4024 mSDsluCounter, 3549 SdHoareTripleChecker+Invalid, 13.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3138 mSDsCounter, 1031 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2558 IncrementalHoareTripleChecker+Invalid, 3595 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1031 mSolverCounterUnsat, 411 mSDtfsCounter, 2558 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4272 GetRequests, 3633 SyntacticMatches, 4 SemanticMatches, 635 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12545 ImplicationChecksByTransitivity, 19.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2000occurred in iteration=10, InterpolantAutomatonStates: 619, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 34 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 13.0s InterpolantComputationTime, 3113 NumberOfCodeBlocks, 2903 NumberOfCodeBlocksAsserted, 109 NumberOfCheckSat, 3953 ConstructedInterpolants, 0 QuantifiedInterpolants, 10839 SizeOfPredicates, 197 NumberOfNonLiveVariables, 4894 ConjunctsInSsa, 452 ConjunctsInUnsatCore, 18 InterpolantComputations, 1 PerfectInterpolantSequences, 25881/117608 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! [2021-12-14 13:59:53,270 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