./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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_unwindbound50.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0bb6ea6333d2c4e133ad252fe2bcbc17b832f383e2bb5defb402851de157204c --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 13:59:17,362 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 13:59:17,364 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 13:59:17,425 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 13:59:17,425 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 13:59:17,428 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 13:59:17,429 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 13:59:17,432 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 13:59:17,433 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 13:59:17,437 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 13:59:17,438 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 13:59:17,439 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 13:59:17,439 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 13:59:17,441 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 13:59:17,442 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 13:59:17,448 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 13:59:17,448 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 13:59:17,449 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 13:59:17,451 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 13:59:17,453 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 13:59:17,456 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 13:59:17,457 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 13:59:17,458 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 13:59:17,459 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 13:59:17,466 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 13:59:17,466 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 13:59:17,467 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 13:59:17,468 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 13:59:17,469 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 13:59:17,469 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 13:59:17,470 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 13:59:17,471 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 13:59:17,472 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 13:59:17,473 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 13:59:17,474 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 13:59:17,474 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 13:59:17,475 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 13:59:17,475 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 13:59:17,475 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 13:59:17,476 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 13:59:17,476 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 13:59:17,477 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:17,503 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 13:59:17,503 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 13:59:17,504 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 13:59:17,504 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 13:59:17,505 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 13:59:17,505 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 13:59:17,505 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 13:59:17,505 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 13:59:17,506 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 13:59:17,506 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 13:59:17,507 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 13:59:17,507 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 13:59:17,507 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 13:59:17,507 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 13:59:17,507 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 13:59:17,507 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 13:59:17,508 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 13:59:17,508 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 13:59:17,508 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 13:59:17,508 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 13:59:17,508 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 13:59:17,508 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 13:59:17,509 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 13:59:17,509 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 13:59:17,509 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 13:59:17,509 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 13:59:17,509 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 13:59:17,510 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 13:59:17,511 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 13:59:17,511 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 13:59:17,511 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 13:59:17,511 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 13:59:17,511 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 13:59:17,512 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 13:59:17,512 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 -> 0bb6ea6333d2c4e133ad252fe2bcbc17b832f383e2bb5defb402851de157204c [2021-12-14 13:59:17,758 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 13:59:17,777 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 13:59:17,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 13:59:17,781 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 13:59:17,782 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 13:59:17,782 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c [2021-12-14 13:59:17,841 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cfdf58e9/4bc72d6141fd49c1aa87f223669e3000/FLAG92b1623a5 [2021-12-14 13:59:18,187 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 13:59:18,188 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c [2021-12-14 13:59:18,197 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cfdf58e9/4bc72d6141fd49c1aa87f223669e3000/FLAG92b1623a5 [2021-12-14 13:59:18,595 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cfdf58e9/4bc72d6141fd49c1aa87f223669e3000 [2021-12-14 13:59:18,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 13:59:18,598 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 13:59:18,599 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 13:59:18,599 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 13:59:18,605 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 13:59:18,605 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:59:18" (1/1) ... [2021-12-14 13:59:18,606 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@368c049a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:59:18, skipping insertion in model container [2021-12-14 13:59:18,606 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:59:18" (1/1) ... [2021-12-14 13:59:18,611 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 13:59:18,622 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 13:59:18,740 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_unwindbound50.c[597,610] [2021-12-14 13:59:18,751 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 13:59:18,757 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 13:59:18,765 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_unwindbound50.c[597,610] [2021-12-14 13:59:18,771 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 13:59:18,780 INFO L208 MainTranslator]: Completed translation [2021-12-14 13:59:18,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:59:18 WrapperNode [2021-12-14 13:59:18,780 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 13:59:18,781 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 13:59:18,781 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 13:59:18,781 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 13:59:18,786 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:18" (1/1) ... [2021-12-14 13:59:18,791 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:18" (1/1) ... [2021-12-14 13:59:18,811 INFO L137 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2021-12-14 13:59:18,812 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 13:59:18,812 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 13:59:18,812 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 13:59:18,813 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 13:59:18,819 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:18" (1/1) ... [2021-12-14 13:59:18,819 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:18" (1/1) ... [2021-12-14 13:59:18,829 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:18" (1/1) ... [2021-12-14 13:59:18,830 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:18" (1/1) ... [2021-12-14 13:59:18,837 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:18" (1/1) ... [2021-12-14 13:59:18,841 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:18" (1/1) ... [2021-12-14 13:59:18,845 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:18" (1/1) ... [2021-12-14 13:59:18,847 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 13:59:18,853 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 13:59:18,853 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 13:59:18,853 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 13:59:18,854 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:59:18" (1/1) ... [2021-12-14 13:59:18,861 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 13:59:18,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:59:18,885 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:18,889 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:18,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 13:59:18,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 13:59:18,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 13:59:18,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 13:59:18,917 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-14 13:59:18,918 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-14 13:59:18,963 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 13:59:18,964 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 13:59:19,068 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 13:59:19,073 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 13:59:19,074 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-14 13:59:19,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:59:19 BoogieIcfgContainer [2021-12-14 13:59:19,075 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 13:59:19,077 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 13:59:19,077 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 13:59:19,080 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 13:59:19,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 01:59:18" (1/3) ... [2021-12-14 13:59:19,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fe6cf30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:59:19, skipping insertion in model container [2021-12-14 13:59:19,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:59:18" (2/3) ... [2021-12-14 13:59:19,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fe6cf30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:59:19, skipping insertion in model container [2021-12-14 13:59:19,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:59:19" (3/3) ... [2021-12-14 13:59:19,082 INFO L111 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound50.c [2021-12-14 13:59:19,086 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 13:59:19,087 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 13:59:19,129 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 13:59:19,153 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:19,159 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 13:59:19,174 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:19,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-14 13:59:19,177 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:59:19,178 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:59:19,178 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:59:19,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:59:19,183 INFO L85 PathProgramCache]: Analyzing trace with hash 180444447, now seen corresponding path program 1 times [2021-12-14 13:59:19,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:59:19,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818940593] [2021-12-14 13:59:19,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:19,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:59:19,273 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 13:59:19,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1097229116] [2021-12-14 13:59:19,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:19,275 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:19,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:59:19,279 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:19,284 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:19,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:59:19,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-14 13:59:19,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:59:19,524 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:19,524 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 13:59:19,525 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:59:19,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818940593] [2021-12-14 13:59:19,525 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 13:59:19,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097229116] [2021-12-14 13:59:19,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097229116] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:59:19,528 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:59:19,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 13:59:19,531 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85327589] [2021-12-14 13:59:19,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:59:19,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 13:59:19,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:59:19,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 13:59:19,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 13:59:19,563 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:19,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:59:19,665 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2021-12-14 13:59:19,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 13:59:19,668 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:19,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:59:19,674 INFO L225 Difference]: With dead ends: 54 [2021-12-14 13:59:19,674 INFO L226 Difference]: Without dead ends: 25 [2021-12-14 13:59:19,677 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-14 13:59:19,680 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:19,686 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:19,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-14 13:59:19,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2021-12-14 13:59:19,720 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:19,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2021-12-14 13:59:19,721 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 8 [2021-12-14 13:59:19,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:59:19,722 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2021-12-14 13:59:19,722 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:19,722 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2021-12-14 13:59:19,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-14 13:59:19,723 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:59:19,723 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:59:19,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-14 13:59:19,927 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:19,928 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:59:19,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:59:19,929 INFO L85 PathProgramCache]: Analyzing trace with hash 2080570626, now seen corresponding path program 1 times [2021-12-14 13:59:19,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:59:19,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765753728] [2021-12-14 13:59:19,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:19,930 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:59:19,940 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 13:59:19,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [713568416] [2021-12-14 13:59:19,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:19,941 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:19,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:59:19,942 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:19,945 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:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:59:20,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-14 13:59:20,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:59:20,238 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:20,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:59:20,375 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:20,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:59:20,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765753728] [2021-12-14 13:59:20,376 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 13:59:20,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713568416] [2021-12-14 13:59:20,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713568416] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:59:20,378 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 13:59:20,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2021-12-14 13:59:20,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640668832] [2021-12-14 13:59:20,381 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 13:59:20,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 13:59:20,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:59:20,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 13:59:20,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-12-14 13:59:20,385 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:20,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:59:20,756 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2021-12-14 13:59:20,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 13:59:20,758 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:20,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:59:20,758 INFO L225 Difference]: With dead ends: 41 [2021-12-14 13:59:20,759 INFO L226 Difference]: Without dead ends: 34 [2021-12-14 13:59:20,759 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:20,760 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 18 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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:20,761 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:20,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-14 13:59:20,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2021-12-14 13:59:20,765 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:20,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2021-12-14 13:59:20,766 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 18 [2021-12-14 13:59:20,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:59:20,766 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2021-12-14 13:59:20,766 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:20,767 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2021-12-14 13:59:20,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-14 13:59:20,768 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:59:20,768 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:20,786 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:20,968 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:20,969 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:59:20,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:59:20,970 INFO L85 PathProgramCache]: Analyzing trace with hash 680664555, now seen corresponding path program 1 times [2021-12-14 13:59:20,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:59:20,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69084844] [2021-12-14 13:59:20,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:20,970 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:59:20,981 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 13:59:20,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1979789284] [2021-12-14 13:59:20,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:20,982 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:20,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:59:20,983 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:20,985 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:21,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:59:21,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 13:59:21,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:59:21,060 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:21,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:59:21,107 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:21,107 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:59:21,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69084844] [2021-12-14 13:59:21,108 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 13:59:21,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979789284] [2021-12-14 13:59:21,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979789284] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:59:21,108 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 13:59:21,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2021-12-14 13:59:21,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222259930] [2021-12-14 13:59:21,109 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 13:59:21,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 13:59:21,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:59:21,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 13:59:21,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-14 13:59:21,110 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:21,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:59:21,162 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2021-12-14 13:59:21,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 13:59:21,162 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:21,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:59:21,163 INFO L225 Difference]: With dead ends: 73 [2021-12-14 13:59:21,163 INFO L226 Difference]: Without dead ends: 67 [2021-12-14 13:59:21,164 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:21,165 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:21,165 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:21,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-12-14 13:59:21,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2021-12-14 13:59:21,174 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:21,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2021-12-14 13:59:21,175 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 19 [2021-12-14 13:59:21,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:59:21,175 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2021-12-14 13:59:21,175 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:21,176 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2021-12-14 13:59:21,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-14 13:59:21,176 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:59:21,177 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:21,197 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:21,391 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:21,392 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:59:21,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:59:21,392 INFO L85 PathProgramCache]: Analyzing trace with hash 713886481, now seen corresponding path program 1 times [2021-12-14 13:59:21,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:59:21,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198545040] [2021-12-14 13:59:21,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:21,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:59:21,401 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 13:59:21,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2084879901] [2021-12-14 13:59:21,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:21,402 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:21,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:59:21,406 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:21,407 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:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:59:21,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-14 13:59:21,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:59:21,753 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:21,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:59:22,101 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:22,101 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:59:22,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198545040] [2021-12-14 13:59:22,102 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 13:59:22,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084879901] [2021-12-14 13:59:22,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084879901] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:59:22,103 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 13:59:22,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2021-12-14 13:59:22,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241601574] [2021-12-14 13:59:22,104 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 13:59:22,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-14 13:59:22,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:59:22,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-14 13:59:22,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2021-12-14 13:59:22,106 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:22,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:59:22,856 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2021-12-14 13:59:22,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-14 13:59:22,857 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:22,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:59:22,858 INFO L225 Difference]: With dead ends: 65 [2021-12-14 13:59:22,859 INFO L226 Difference]: Without dead ends: 57 [2021-12-14 13:59:22,860 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=256, Invalid=1226, Unknown=0, NotChecked=0, Total=1482 [2021-12-14 13:59:22,860 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.3s IncrementalHoareTripleChecker+Time [2021-12-14 13:59:22,861 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.3s Time] [2021-12-14 13:59:22,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-12-14 13:59:22,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2021-12-14 13:59:22,868 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:22,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2021-12-14 13:59:22,869 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 25 [2021-12-14 13:59:22,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:59:22,870 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2021-12-14 13:59:22,870 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:22,870 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2021-12-14 13:59:22,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-14 13:59:22,871 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:59:22,871 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:22,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-14 13:59:23,095 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:23,095 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:59:23,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:59:23,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1582515168, now seen corresponding path program 1 times [2021-12-14 13:59:23,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:59:23,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265282324] [2021-12-14 13:59:23,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:23,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:59:23,110 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 13:59:23,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1229685312] [2021-12-14 13:59:23,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:23,110 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:23,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:59:23,111 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:23,113 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:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:59:23,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-14 13:59:23,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:59:23,279 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:23,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:59:23,420 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:23,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:59:23,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265282324] [2021-12-14 13:59:23,421 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 13:59:23,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229685312] [2021-12-14 13:59:23,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229685312] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:59:23,421 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 13:59:23,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2021-12-14 13:59:23,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124051537] [2021-12-14 13:59:23,421 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 13:59:23,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-14 13:59:23,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:59:23,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-14 13:59:23,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2021-12-14 13:59:23,422 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:23,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:59:23,571 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2021-12-14 13:59:23,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-14 13:59:23,571 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:23,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:59:23,573 INFO L225 Difference]: With dead ends: 116 [2021-12-14 13:59:23,573 INFO L226 Difference]: Without dead ends: 110 [2021-12-14 13:59:23,573 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:23,574 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:23,574 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:23,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-12-14 13:59:23,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2021-12-14 13:59:23,586 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:23,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2021-12-14 13:59:23,588 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 49 [2021-12-14 13:59:23,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:59:23,588 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2021-12-14 13:59:23,588 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:23,589 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2021-12-14 13:59:23,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-12-14 13:59:23,591 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:59:23,591 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:23,617 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:23,814 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:23,814 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:59:23,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:59:23,815 INFO L85 PathProgramCache]: Analyzing trace with hash 297311502, now seen corresponding path program 2 times [2021-12-14 13:59:23,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:59:23,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857382244] [2021-12-14 13:59:23,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:23,815 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:59:23,827 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 13:59:23,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1410152657] [2021-12-14 13:59:23,829 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 13:59:23,829 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:23,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:59:23,830 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:23,832 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:23,892 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 13:59:23,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:59:23,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-14 13:59:23,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:59:24,181 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:24,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:59:24,520 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:24,520 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:59:24,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857382244] [2021-12-14 13:59:24,520 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 13:59:24,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410152657] [2021-12-14 13:59:24,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410152657] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:59:24,520 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 13:59:24,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2021-12-14 13:59:24,521 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315505039] [2021-12-14 13:59:24,521 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 13:59:24,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-14 13:59:24,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:59:24,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-14 13:59:24,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2021-12-14 13:59:24,523 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:24,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:59:24,974 INFO L93 Difference]: Finished difference Result 236 states and 269 transitions. [2021-12-14 13:59:24,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-12-14 13:59:24,975 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:24,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:59:24,977 INFO L225 Difference]: With dead ends: 236 [2021-12-14 13:59:24,977 INFO L226 Difference]: Without dead ends: 230 [2021-12-14 13:59:24,979 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:24,979 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.2s IncrementalHoareTripleChecker+Time [2021-12-14 13:59:24,980 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.2s Time] [2021-12-14 13:59:24,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-12-14 13:59:24,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2021-12-14 13:59:25,000 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:25,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 252 transitions. [2021-12-14 13:59:25,002 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 252 transitions. Word has length 109 [2021-12-14 13:59:25,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:59:25,003 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 252 transitions. [2021-12-14 13:59:25,003 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:25,003 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 252 transitions. [2021-12-14 13:59:25,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2021-12-14 13:59:25,007 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:59:25,008 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:25,033 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:25,223 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:25,223 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:59:25,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:59:25,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1294150550, now seen corresponding path program 3 times [2021-12-14 13:59:25,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:59:25,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985550422] [2021-12-14 13:59:25,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:25,224 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:59:25,237 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 13:59:25,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [596456729] [2021-12-14 13:59:25,237 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 13:59:25,238 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:25,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:59:25,239 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:25,251 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:25,299 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-12-14 13:59:25,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:59:25,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-14 13:59:25,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:59:26,188 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:26,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:59:26,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:59:26,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985550422] [2021-12-14 13:59:26,970 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 13:59:26,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596456729] [2021-12-14 13:59:26,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596456729] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:59:26,970 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-14 13:59:26,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2021-12-14 13:59:26,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090726445] [2021-12-14 13:59:26,971 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-14 13:59:26,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 13:59:26,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:59:26,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 13:59:26,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=254, Unknown=1, NotChecked=0, Total=306 [2021-12-14 13:59:26,973 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:28,994 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:33,036 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:35,048 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:37,055 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:41,079 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:45,382 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:45,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:59:45,405 INFO L93 Difference]: Finished difference Result 449 states and 492 transitions. [2021-12-14 13:59:45,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 13:59:45,405 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:45,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:59:45,408 INFO L225 Difference]: With dead ends: 449 [2021-12-14 13:59:45,408 INFO L226 Difference]: Without dead ends: 443 [2021-12-14 13:59:45,409 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:45,409 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:45,409 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:45,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2021-12-14 13:59:45,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 440. [2021-12-14 13:59:45,448 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:45,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 483 transitions. [2021-12-14 13:59:45,454 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 483 transitions. Word has length 229 [2021-12-14 13:59:45,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:59:45,455 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 483 transitions. [2021-12-14 13:59:45,455 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:45,456 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 483 transitions. [2021-12-14 13:59:45,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2021-12-14 13:59:45,466 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:59:45,466 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:45,492 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:45,666 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:45,667 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:59:45,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:59:45,667 INFO L85 PathProgramCache]: Analyzing trace with hash -614092180, now seen corresponding path program 1 times [2021-12-14 13:59:45,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:59:45,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495430359] [2021-12-14 13:59:45,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:45,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:59:45,687 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 13:59:45,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2060575383] [2021-12-14 13:59:45,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:45,688 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:45,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:59:45,689 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:45,691 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:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:59:45,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 47 conjunts are in the unsatisfiable core [2021-12-14 13:59:45,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:59:46,570 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:46,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:59:47,563 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:47,564 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:59:47,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495430359] [2021-12-14 13:59:47,584 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 13:59:47,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060575383] [2021-12-14 13:59:47,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060575383] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:59:47,584 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 13:59:47,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2021-12-14 13:59:47,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112086299] [2021-12-14 13:59:47,585 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 13:59:47,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-12-14 13:59:47,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:59:47,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-12-14 13:59:47,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2021-12-14 13:59:47,588 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:49,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:59:49,030 INFO L93 Difference]: Finished difference Result 929 states and 1043 transitions. [2021-12-14 13:59:49,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2021-12-14 13:59:49,030 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:49,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:59:49,035 INFO L225 Difference]: With dead ends: 929 [2021-12-14 13:59:49,036 INFO L226 Difference]: Without dead ends: 923 [2021-12-14 13:59:49,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2021-12-14 13:59:49,040 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 1008 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2021-12-14 13:59:49,040 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.4s Time] [2021-12-14 13:59:49,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2021-12-14 13:59:49,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 920. [2021-12-14 13:59:49,088 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:49,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1011 transitions. [2021-12-14 13:59:49,092 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1011 transitions. Word has length 229 [2021-12-14 13:59:49,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:59:49,093 INFO L470 AbstractCegarLoop]: Abstraction has 920 states and 1011 transitions. [2021-12-14 13:59:49,094 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:49,094 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1011 transitions. [2021-12-14 13:59:49,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2021-12-14 13:59:49,101 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:59:49,101 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:49,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-14 13:59:49,327 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:49,328 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:59:49,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:59:49,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1651100380, now seen corresponding path program 2 times [2021-12-14 13:59:49,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:59:49,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964756132] [2021-12-14 13:59:49,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:49,328 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:59:49,349 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 13:59:49,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [35543010] [2021-12-14 13:59:49,350 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 13:59:49,350 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:49,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:59:49,351 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:49,352 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:49,549 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 13:59:49,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:59:49,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 1161 conjuncts, 95 conjunts are in the unsatisfiable core [2021-12-14 13:59:49,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:59:51,200 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:51,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:59:52,095 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:52,096 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:59:52,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964756132] [2021-12-14 13:59:52,096 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 13:59:52,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35543010] [2021-12-14 13:59:52,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35543010] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:59:52,096 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 13:59:52,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 54 [2021-12-14 13:59:52,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764461350] [2021-12-14 13:59:52,097 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 13:59:52,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2021-12-14 13:59:52,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:59:52,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2021-12-14 13:59:52,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2021-12-14 13:59:52,100 INFO L87 Difference]: Start difference. First operand 920 states and 1011 transitions. Second operand has 54 states, 54 states have (on average 7.388888888888889) internal successors, (399), 54 states have internal predecessors, (399), 50 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 49 states have call predecessors, (92), 49 states have call successors, (92) [2021-12-14 13:59:53,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:59:53,511 INFO L93 Difference]: Finished difference Result 1009 states and 1111 transitions. [2021-12-14 13:59:53,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2021-12-14 13:59:53,512 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 7.388888888888889) internal successors, (399), 54 states have internal predecessors, (399), 50 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 49 states have call predecessors, (92), 49 states have call successors, (92) Word has length 469 [2021-12-14 13:59:53,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:59:53,516 INFO L225 Difference]: With dead ends: 1009 [2021-12-14 13:59:53,517 INFO L226 Difference]: Without dead ends: 1003 [2021-12-14 13:59:53,521 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 985 GetRequests, 883 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3926, Invalid=6580, Unknown=0, NotChecked=0, Total=10506 [2021-12-14 13:59:53,523 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 653 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 13:59:53,523 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [653 Valid, 566 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 13:59:53,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2021-12-14 13:59:53,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 1000. [2021-12-14 13:59:53,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 800 states have (on average 1.125) internal successors, (900), 800 states have internal predecessors, (900), 100 states have call successors, (100), 100 states have call predecessors, (100), 99 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2021-12-14 13:59:53,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1099 transitions. [2021-12-14 13:59:53,580 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1099 transitions. Word has length 469 [2021-12-14 13:59:53,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:59:53,581 INFO L470 AbstractCegarLoop]: Abstraction has 1000 states and 1099 transitions. [2021-12-14 13:59:53,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 7.388888888888889) internal successors, (399), 54 states have internal predecessors, (399), 50 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 49 states have call predecessors, (92), 49 states have call successors, (92) [2021-12-14 13:59:53,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1099 transitions. [2021-12-14 13:59:53,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2021-12-14 13:59:53,590 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:59:53,590 INFO L514 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 50, 49, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:59:53,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-14 13:59:53,809 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:53,809 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:59:53,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:59:53,809 INFO L85 PathProgramCache]: Analyzing trace with hash -234739816, now seen corresponding path program 3 times [2021-12-14 13:59:53,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:59:53,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437042059] [2021-12-14 13:59:53,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:53,810 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:59:53,829 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 13:59:53,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1910005068] [2021-12-14 13:59:53,830 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 13:59:53,830 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:53,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:59:53,831 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:53,853 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:54,230 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2021-12-14 13:59:54,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-12-14 13:59:54,231 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 13:59:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 13:59:54,618 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 13:59:54,618 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-14 13:59:54,619 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-14 13:59:54,635 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:54,829 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:54,832 INFO L732 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1] [2021-12-14 13:59:54,835 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 13:59:54,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 01:59:54 BoogieIcfgContainer [2021-12-14 13:59:54,997 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 13:59:54,998 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 13:59:54,998 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 13:59:54,998 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 13:59:54,998 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:19" (3/4) ... [2021-12-14 13:59:55,000 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-14 13:59:55,150 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-14 13:59:55,151 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 13:59:55,151 INFO L158 Benchmark]: Toolchain (without parser) took 36553.29ms. Allocated memory was 88.1MB in the beginning and 136.3MB in the end (delta: 48.2MB). Free memory was 57.0MB in the beginning and 70.4MB in the end (delta: -13.4MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. [2021-12-14 13:59:55,152 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 88.1MB. Free memory is still 47.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 13:59:55,152 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.05ms. Allocated memory was 88.1MB in the beginning and 113.2MB in the end (delta: 25.2MB). Free memory was 56.8MB in the beginning and 89.5MB in the end (delta: -32.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 13:59:55,152 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.82ms. Allocated memory is still 113.2MB. Free memory was 89.1MB in the beginning and 87.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 13:59:55,153 INFO L158 Benchmark]: Boogie Preprocessor took 39.94ms. Allocated memory is still 113.2MB. Free memory was 87.8MB in the beginning and 86.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 13:59:55,153 INFO L158 Benchmark]: RCFGBuilder took 222.59ms. Allocated memory is still 113.2MB. Free memory was 86.6MB in the beginning and 77.4MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 13:59:55,154 INFO L158 Benchmark]: TraceAbstraction took 35920.53ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 77.0MB in the beginning and 95.6MB in the end (delta: -18.6MB). Peak memory consumption was 73.2MB. Max. memory is 16.1GB. [2021-12-14 13:59:55,154 INFO L158 Benchmark]: Witness Printer took 153.21ms. Allocated memory is still 136.3MB. Free memory was 95.6MB in the beginning and 70.4MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2021-12-14 13:59:55,156 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.19ms. Allocated memory is still 88.1MB. Free memory is still 47.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 181.05ms. Allocated memory was 88.1MB in the beginning and 113.2MB in the end (delta: 25.2MB). Free memory was 56.8MB in the beginning and 89.5MB in the end (delta: -32.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.82ms. Allocated memory is still 113.2MB. Free memory was 89.1MB in the beginning and 87.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.94ms. Allocated memory is still 113.2MB. Free memory was 87.8MB in the beginning and 86.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 222.59ms. Allocated memory is still 113.2MB. Free memory was 86.6MB in the beginning and 77.4MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 35920.53ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 77.0MB in the beginning and 95.6MB in the end (delta: -18.6MB). Peak memory consumption was 73.2MB. Max. memory is 16.1GB. * Witness Printer took 153.21ms. Allocated memory is still 136.3MB. Free memory was 95.6MB in the beginning and 70.4MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. 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=-97, X=99, x=0, Y=1, y=0] [L31] EXPR counter++ VAL [counter=1, counter++=0, v=-97, x=0, X=99, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=1, v=-97, X=99, x=0, x=0, x=0, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=1, v=-97, x=0, X=99, x=0, x=0, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=1, v=-97, x=0, x=0, x=0, X=99, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=1, v=-95, x=0, X=99, x=0, x=0, Y=1, y=0] [L45] x++ VAL [counter=1, v=-95, X=99, x=0, x=1, x=0, Y=1, y=0] [L31] EXPR counter++ VAL [counter=2, counter++=1, v=-95, X=99, x=0, x=1, x=0, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=2, v=-95, x=1, x=1, x=0, X=99, Y=1, y=0] [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=-95, x=0, X=99, x=1, x=1, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=2, v=-95, X=99, x=0, x=1, x=1, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=2, v=-93, x=1, X=99, x=1, x=0, y=0, Y=1] [L45] x++ VAL [counter=2, v=-93, x=2, X=99, x=0, x=1, Y=1, y=0] [L31] EXPR counter++ VAL [counter=3, counter++=2, v=-93, X=99, x=1, x=2, x=0, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=3, v=-93, x=0, x=2, X=99, x=2, y=0, Y=1] [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=-93, x=0, x=2, X=99, x=2, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=3, v=-93, x=0, x=2, x=2, X=99, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=3, v=-91, x=2, x=2, x=0, X=99, Y=1, y=0] [L45] x++ VAL [counter=3, v=-91, x=3, x=2, X=99, x=0, y=0, Y=1] [L31] EXPR counter++ VAL [counter=4, counter++=3, v=-91, x=2, X=99, x=0, x=3, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=4, v=-91, x=3, X=99, x=0, x=3, y=0, Y=1] [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=-91, x=0, x=3, x=3, X=99, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=4, v=-91, X=99, x=3, x=3, x=0, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=4, v=-89, x=3, X=99, x=0, x=3, y=0, Y=1] [L45] x++ VAL [counter=4, v=-89, x=3, X=99, x=0, x=4, y=0, Y=1] [L31] EXPR counter++ VAL [counter=5, counter++=4, v=-89, X=99, x=4, x=0, x=3, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=5, v=-89, x=0, X=99, x=4, x=4, y=0, Y=1] [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=-89, x=0, x=4, X=99, x=4, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=5, v=-89, x=0, X=99, x=4, x=4, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=5, v=-87, x=4, x=0, x=4, X=99, y=0, Y=1] [L45] x++ VAL [counter=5, v=-87, x=4, X=99, x=0, x=5, Y=1, y=0] [L31] EXPR counter++ VAL [counter=6, counter++=5, v=-87, x=0, x=4, x=5, X=99, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=6, v=-87, x=5, X=99, x=0, x=5, Y=1, 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=-87, x=5, x=0, X=99, x=5, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=6, v=-87, x=5, x=0, x=5, X=99, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=6, v=-85, x=0, x=5, x=5, X=99, Y=1, y=0] [L45] x++ VAL [counter=6, v=-85, x=5, x=0, X=99, x=6, Y=1, y=0] [L31] EXPR counter++ VAL [counter=7, counter++=6, v=-85, x=5, x=0, x=6, X=99, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=7, v=-85, X=99, x=0, x=6, x=6, Y=1, y=0] [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=-85, x=6, X=99, x=6, x=0, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=7, v=-85, x=6, x=6, x=0, X=99, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=7, v=-83, x=6, x=6, x=0, X=99, Y=1, y=0] [L45] x++ VAL [counter=7, v=-83, x=7, x=0, X=99, x=6, Y=1, y=0] [L31] EXPR counter++ VAL [counter=8, counter++=7, v=-83, x=7, x=6, X=99, x=0, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=8, v=-83, X=99, x=7, x=7, x=0, Y=1, 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=-83, x=7, x=7, x=0, X=99, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=8, v=-83, x=7, x=7, x=0, X=99, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=8, v=-81, x=0, X=99, x=7, x=7, y=0, Y=1] [L45] x++ VAL [counter=8, v=-81, x=7, x=0, X=99, x=8, y=0, Y=1] [L31] EXPR counter++ VAL [counter=9, counter++=8, v=-81, x=8, x=7, x=0, X=99, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=9, v=-81, x=8, x=0, x=8, X=99, Y=1, 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=-81, x=0, x=8, X=99, x=8, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=9, v=-81, X=99, x=0, x=8, x=8, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=9, v=-79, X=99, x=0, x=8, x=8, Y=1, y=0] [L45] x++ VAL [counter=9, v=-79, X=99, x=0, x=9, x=8, y=0, Y=1] [L31] EXPR counter++ VAL [counter=10, counter++=9, v=-79, x=0, x=8, X=99, x=9, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=10, v=-79, X=99, x=9, x=0, x=9, y=0, Y=1] [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=-79, x=9, x=0, x=9, X=99, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=10, v=-79, x=9, x=9, x=0, X=99, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=10, v=-77, x=9, x=9, X=99, x=0, Y=1, y=0] [L45] x++ VAL [counter=10, v=-77, x=10, x=0, x=9, X=99, Y=1, y=0] [L31] EXPR counter++ VAL [counter=11, counter++=10, v=-77, x=9, x=10, X=99, x=0, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=11, v=-77, X=99, x=0, x=10, x=10, Y=1, 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=-77, x=0, x=10, x=10, X=99, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=11, v=-77, x=0, x=10, x=10, X=99, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=11, v=-75, x=0, x=10, X=99, x=10, Y=1, y=0] [L45] x++ VAL [counter=11, v=-75, x=10, x=11, X=99, x=0, Y=1, y=0] [L31] EXPR counter++ VAL [counter=12, counter++=11, v=-75, x=0, x=10, x=11, X=99, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=12, v=-75, x=11, X=99, x=0, x=11, Y=1, y=0] [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=-75, x=11, X=99, x=11, x=0, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=12, v=-75, x=11, x=11, x=0, X=99, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=12, v=-73, x=11, X=99, x=11, x=0, Y=1, y=0] [L45] x++ VAL [counter=12, v=-73, x=11, x=12, X=99, x=0, y=0, Y=1] [L31] EXPR counter++ VAL [counter=13, counter++=12, v=-73, x=12, x=0, X=99, x=11, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=13, v=-73, X=99, x=0, x=12, x=12, Y=1, y=0] [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=-73, x=0, x=12, X=99, x=12, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=13, v=-73, x=0, x=12, X=99, x=12, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=13, v=-71, X=99, x=12, x=0, x=12, y=0, Y=1] [L45] x++ VAL [counter=13, v=-71, x=12, X=99, x=13, x=0, y=0, Y=1] [L31] EXPR counter++ VAL [counter=14, counter++=13, v=-71, X=99, x=0, x=13, x=12, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=14, v=-71, x=0, x=13, X=99, x=13, y=0, Y=1] [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=-71, x=0, X=99, x=13, x=13, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=14, v=-71, X=99, x=13, x=13, x=0, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=14, v=-69, x=13, x=0, X=99, x=13, y=0, Y=1] [L45] x++ VAL [counter=14, v=-69, x=0, X=99, x=14, x=13, Y=1, y=0] [L31] EXPR counter++ VAL [counter=15, counter++=14, v=-69, x=13, X=99, x=0, x=14, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=15, v=-69, x=0, X=99, x=14, x=14, y=0, Y=1] [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=-69, X=99, x=14, x=14, x=0, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=15, v=-69, x=14, X=99, x=0, x=14, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=15, v=-67, X=99, x=14, x=0, x=14, Y=1, y=0] [L45] x++ VAL [counter=15, v=-67, x=0, x=15, x=14, X=99, y=0, Y=1] [L31] EXPR counter++ VAL [counter=16, counter++=15, v=-67, X=99, x=0, x=14, x=15, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=16, v=-67, x=0, x=15, X=99, x=15, Y=1, 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=-67, x=0, x=15, X=99, x=15, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=16, v=-67, x=0, x=15, x=15, X=99, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=16, v=-65, x=15, X=99, x=0, x=15, Y=1, y=0] [L45] x++ VAL [counter=16, v=-65, x=16, X=99, x=0, x=15, Y=1, y=0] [L31] EXPR counter++ VAL [counter=17, counter++=16, v=-65, x=15, x=0, X=99, x=16, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=17, v=-65, x=16, X=99, x=16, x=0, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=17] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=17, v=-65, x=16, x=16, x=0, X=99, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=17, v=-65, x=16, x=16, x=0, X=99, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=17, v=-63, X=99, x=0, x=16, x=16, y=0, Y=1] [L45] x++ VAL [counter=17, v=-63, x=0, x=16, x=17, X=99, y=0, Y=1] [L31] EXPR counter++ VAL [counter=18, counter++=17, v=-63, X=99, x=17, x=16, x=0, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=18, v=-63, x=17, x=17, X=99, x=0, Y=1, y=0] [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=-63, x=0, X=99, x=17, x=17, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=18, v=-63, x=0, x=17, x=17, X=99, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=18, v=-61, X=99, x=17, x=0, x=17, y=0, Y=1] [L45] x++ VAL [counter=18, v=-61, X=99, x=17, x=0, x=18, Y=1, y=0] [L31] EXPR counter++ VAL [counter=19, counter++=18, v=-61, x=18, x=0, X=99, x=17, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=19, v=-61, X=99, x=0, x=18, x=18, y=0, Y=1] [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=-61, x=0, x=18, X=99, x=18, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=19, v=-61, X=99, x=18, x=18, x=0, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=19, v=-59, X=99, x=18, x=0, x=18, Y=1, y=0] [L45] x++ VAL [counter=19, v=-59, x=18, X=99, x=0, x=19, y=0, Y=1] [L31] EXPR counter++ VAL [counter=20, counter++=19, v=-59, x=18, X=99, x=0, x=19, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=20, v=-59, x=0, x=19, X=99, x=19, y=0, Y=1] [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=-59, X=99, x=19, x=19, x=0, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=20, v=-59, X=99, x=19, x=0, x=19, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=20, v=-57, x=0, x=19, X=99, x=19, y=0, Y=1] [L45] x++ VAL [counter=20, v=-57, x=0, X=99, x=19, x=20, y=0, Y=1] [L31] EXPR counter++ VAL [counter=21, counter++=20, v=-57, x=20, X=99, x=0, x=19, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=21, v=-57, x=20, x=20, x=0, X=99, y=0, Y=1] [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=-57, X=99, x=20, x=20, x=0, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=21, v=-57, x=20, X=99, x=20, x=0, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=21, v=-55, x=20, X=99, x=0, x=20, y=0, Y=1] [L45] x++ VAL [counter=21, v=-55, x=20, X=99, x=21, x=0, Y=1, y=0] [L31] EXPR counter++ VAL [counter=22, counter++=21, v=-55, X=99, x=20, x=21, x=0, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=22, v=-55, x=0, x=21, x=21, X=99, y=0, Y=1] [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=-55, x=21, x=21, X=99, x=0, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=22, v=-55, x=0, x=21, X=99, x=21, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=22, v=-53, X=99, x=21, x=0, x=21, y=0, Y=1] [L45] x++ VAL [counter=22, v=-53, x=22, x=0, X=99, x=21, Y=1, y=0] [L31] EXPR counter++ VAL [counter=23, counter++=22, v=-53, x=21, x=0, X=99, x=22, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=23, v=-53, X=99, x=22, x=0, x=22, y=0, Y=1] [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=-53, x=0, x=22, x=22, X=99, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=23, v=-53, x=0, X=99, x=22, x=22, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=23, v=-51, x=22, x=22, X=99, x=0, y=0, Y=1] [L45] x++ VAL [counter=23, v=-51, x=22, X=99, x=0, x=23, y=0, Y=1] [L31] EXPR counter++ VAL [counter=24, counter++=23, v=-51, X=99, x=22, x=23, x=0, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=24, v=-51, x=23, x=23, X=99, x=0, y=0, Y=1] [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=-51, x=23, x=0, X=99, x=23, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=24, v=-51, X=99, x=23, x=23, x=0, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=24, v=-49, x=0, x=23, X=99, x=23, Y=1, y=0] [L45] x++ VAL [counter=24, v=-49, x=23, x=0, x=24, X=99, Y=1, y=0] [L31] EXPR counter++ VAL [counter=25, counter++=24, v=-49, X=99, x=0, x=24, x=23, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=25, v=-49, x=24, x=24, X=99, x=0, Y=1, 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=-49, X=99, x=0, x=24, x=24, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=25, v=-49, X=99, x=24, x=24, x=0, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=25, v=-47, x=24, x=24, X=99, x=0, y=0, Y=1] [L45] x++ VAL [counter=25, v=-47, X=99, x=0, x=24, x=25, Y=1, y=0] [L31] EXPR counter++ VAL [counter=26, counter++=25, v=-47, x=24, x=0, X=99, x=25, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=26, v=-47, x=0, X=99, x=25, x=25, Y=1, y=0] [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=-47, x=25, x=0, X=99, x=25, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=26, v=-47, X=99, x=25, x=0, x=25, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=26, v=-45, X=99, x=25, x=25, x=0, Y=1, y=0] [L45] x++ VAL [counter=26, v=-45, x=26, x=25, X=99, x=0, y=0, Y=1] [L31] EXPR counter++ VAL [counter=27, counter++=26, v=-45, x=25, X=99, x=0, x=26, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=27, v=-45, X=99, x=0, x=26, x=26, Y=1, y=0] [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=-45, x=0, x=26, x=26, X=99, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=27, v=-45, x=26, x=26, X=99, x=0, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=27, v=-43, x=26, x=26, x=0, X=99, Y=1, y=0] [L45] x++ VAL [counter=27, v=-43, X=99, x=26, x=27, x=0, y=0, Y=1] [L31] EXPR counter++ VAL [counter=28, counter++=27, v=-43, X=99, x=0, x=27, x=26, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=28, v=-43, X=99, x=27, x=0, x=27, y=0, Y=1] [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=-43, X=99, x=27, x=27, x=0, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=28, v=-43, x=27, x=27, X=99, x=0, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=28, v=-41, X=99, x=27, x=0, x=27, Y=1, y=0] [L45] x++ VAL [counter=28, v=-41, x=27, x=28, x=0, X=99, y=0, Y=1] [L31] EXPR counter++ VAL [counter=29, counter++=28, v=-41, X=99, x=27, x=0, x=28, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=29, v=-41, x=28, x=0, x=28, X=99, Y=1, y=0] [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=-41, x=28, X=99, x=0, x=28, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=29, v=-41, x=28, x=0, X=99, x=28, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=29, v=-39, x=0, X=99, x=28, x=28, Y=1, y=0] [L45] x++ VAL [counter=29, v=-39, x=0, x=28, x=29, X=99, Y=1, y=0] [L31] EXPR counter++ VAL [counter=30, counter++=29, v=-39, x=28, x=29, X=99, x=0, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=30, v=-39, x=29, X=99, x=0, x=29, y=0, Y=1] [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=-39, x=0, X=99, x=29, x=29, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=30, v=-39, X=99, x=29, x=0, x=29, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=30, v=-37, x=29, x=0, X=99, x=29, Y=1, y=0] [L45] x++ VAL [counter=30, v=-37, X=99, x=0, x=29, x=30, y=0, Y=1] [L31] EXPR counter++ VAL [counter=31, counter++=30, v=-37, x=29, X=99, x=0, x=30, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=31, v=-37, x=0, x=30, X=99, x=30, Y=1, 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=-37, x=30, X=99, x=30, x=0, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=31, v=-37, x=0, X=99, x=30, x=30, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=31, v=-35, x=30, x=30, x=0, X=99, Y=1, y=0] [L45] x++ VAL [counter=31, v=-35, X=99, x=30, x=0, x=31, y=0, Y=1] [L31] EXPR counter++ VAL [counter=32, counter++=31, v=-35, x=31, x=0, X=99, x=30, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=32, v=-35, X=99, x=31, x=31, x=0, y=0, Y=1] [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=-35, x=31, X=99, x=31, x=0, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=32, v=-35, x=31, x=0, x=31, X=99, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=32, v=-33, x=31, X=99, x=0, x=31, y=0, Y=1] [L45] x++ VAL [counter=32, v=-33, x=0, x=31, x=32, X=99, y=0, Y=1] [L31] EXPR counter++ VAL [counter=33, counter++=32, v=-33, x=32, X=99, x=31, x=0, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=33, v=-33, x=32, x=0, x=32, X=99, y=0, Y=1] [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=-33, x=0, x=32, x=32, X=99, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=33, v=-33, x=32, x=32, x=0, X=99, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=33, v=-31, x=32, X=99, x=32, x=0, Y=1, y=0] [L45] x++ VAL [counter=33, v=-31, x=33, x=32, x=0, X=99, y=0, Y=1] [L31] EXPR counter++ VAL [counter=34, counter++=33, v=-31, x=0, X=99, x=32, x=33, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=34, v=-31, x=0, X=99, x=33, x=33, Y=1, 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=-31, X=99, x=0, x=33, x=33, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=34, v=-31, x=33, x=0, X=99, x=33, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=34, v=-29, X=99, x=0, x=33, x=33, y=0, Y=1] [L45] x++ VAL [counter=34, v=-29, x=0, x=34, X=99, x=33, Y=1, y=0] [L31] EXPR counter++ VAL [counter=35, counter++=34, v=-29, x=33, x=34, x=0, X=99, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=35, v=-29, X=99, x=0, x=34, x=34, y=0, Y=1] [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=-29, X=99, x=0, x=34, x=34, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=35, v=-29, x=0, x=34, X=99, x=34, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=35, v=-27, x=34, x=34, X=99, x=0, Y=1, y=0] [L45] x++ VAL [counter=35, v=-27, x=35, x=0, x=34, X=99, y=0, Y=1] [L31] EXPR counter++ VAL [counter=36, counter++=35, v=-27, X=99, x=35, x=0, x=34, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=36, v=-27, x=35, x=35, x=0, X=99, Y=1, 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=-27, x=35, x=35, X=99, x=0, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=36, v=-27, x=35, X=99, x=0, x=35, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=36, v=-25, x=35, x=0, x=35, X=99, Y=1, y=0] [L45] x++ VAL [counter=36, v=-25, x=36, x=0, x=35, X=99, Y=1, y=0] [L31] EXPR counter++ VAL [counter=37, counter++=36, v=-25, x=35, x=36, x=0, X=99, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=37, v=-25, x=36, x=0, x=36, X=99, Y=1, y=0] [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=-25, X=99, x=0, x=36, x=36, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=37, v=-25, x=0, X=99, x=36, x=36, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=37, v=-23, x=36, X=99, x=36, x=0, Y=1, y=0] [L45] x++ VAL [counter=37, v=-23, x=36, x=0, X=99, x=37, y=0, Y=1] [L31] EXPR counter++ VAL [counter=38, counter++=37, v=-23, x=0, x=36, x=37, X=99, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=38, v=-23, x=0, x=37, X=99, x=37, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=38] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=38, v=-23, x=37, X=99, x=0, x=37, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=38, v=-23, x=0, X=99, x=37, x=37, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=38, v=-21, X=99, x=0, x=37, x=37, Y=1, y=0] [L45] x++ VAL [counter=38, v=-21, X=99, x=38, x=37, x=0, y=0, Y=1] [L31] EXPR counter++ VAL [counter=39, counter++=38, v=-21, X=99, x=38, x=37, x=0, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=39, v=-21, x=38, X=99, x=38, x=0, Y=1, 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=-21, x=0, X=99, x=38, x=38, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=39, v=-21, X=99, x=38, x=0, x=38, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=39, v=-19, x=38, x=38, X=99, x=0, y=0, Y=1] [L45] x++ VAL [counter=39, v=-19, x=39, x=0, X=99, x=38, y=0, Y=1] [L31] EXPR counter++ VAL [counter=40, counter++=39, v=-19, x=0, x=38, x=39, X=99, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=40, v=-19, X=99, x=39, x=0, x=39, Y=1, 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=-19, x=39, X=99, x=0, x=39, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=40, v=-19, x=0, X=99, x=39, x=39, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=40, v=-17, X=99, x=0, x=39, x=39, Y=1, y=0] [L45] x++ VAL [counter=40, v=-17, x=40, x=0, x=39, X=99, y=0, Y=1] [L31] EXPR counter++ VAL [counter=41, counter++=40, v=-17, X=99, x=40, x=0, x=39, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=41, v=-17, x=40, x=40, x=0, X=99, y=0, Y=1] [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=-17, X=99, x=40, x=0, x=40, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=41, v=-17, x=40, x=40, X=99, x=0, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=41, v=-15, x=40, x=40, x=0, X=99, Y=1, y=0] [L45] x++ VAL [counter=41, v=-15, X=99, x=0, x=41, x=40, y=0, Y=1] [L31] EXPR counter++ VAL [counter=42, counter++=41, v=-15, x=41, x=40, X=99, x=0, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=42, v=-15, X=99, x=0, x=41, x=41, Y=1, 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=-15, X=99, x=41, x=41, x=0, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=42, v=-15, x=41, X=99, x=41, x=0, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=42, v=-13, X=99, x=41, x=0, x=41, Y=1, y=0] [L45] x++ VAL [counter=42, v=-13, x=42, X=99, x=0, x=41, y=0, Y=1] [L31] EXPR counter++ VAL [counter=43, counter++=42, v=-13, x=0, x=42, X=99, x=41, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=43, v=-13, X=99, x=0, x=42, x=42, Y=1, 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=-13, x=0, x=42, x=42, X=99, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=43, v=-13, x=42, x=0, x=42, X=99, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=43, v=-11, X=99, x=42, x=0, x=42, y=0, Y=1] [L45] x++ VAL [counter=43, v=-11, x=0, X=99, x=42, x=43, y=0, Y=1] [L31] EXPR counter++ VAL [counter=44, counter++=43, v=-11, x=0, X=99, x=42, x=43, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=44, v=-11, x=0, x=43, x=43, X=99, Y=1, 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=-11, X=99, x=0, x=43, x=43, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=44, v=-11, x=0, x=43, X=99, x=43, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=44, v=-9, x=43, x=0, x=43, X=99, Y=1, y=0] [L45] x++ VAL [counter=44, v=-9, X=99, x=44, x=0, x=43, y=0, Y=1] [L31] EXPR counter++ VAL [counter=45, counter++=44, v=-9, x=43, x=44, X=99, x=0, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=45, v=-9, x=44, x=44, x=0, X=99, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=45] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=45, v=-9, x=44, X=99, x=44, x=0, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=45, v=-9, X=99, x=44, x=44, x=0, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=45, v=-7, x=44, x=44, X=99, x=0, Y=1, y=0] [L45] x++ VAL [counter=45, v=-7, x=45, x=0, x=44, X=99, Y=1, y=0] [L31] EXPR counter++ VAL [counter=46, counter++=45, v=-7, x=45, x=0, X=99, x=44, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=46, v=-7, x=45, X=99, x=0, x=45, Y=1, y=0] [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=-7, x=0, x=45, x=45, X=99, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=46, v=-7, x=45, x=0, x=45, X=99, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=46, v=-5, x=45, x=0, X=99, x=45, y=0, Y=1] [L45] x++ VAL [counter=46, v=-5, x=45, x=0, X=99, x=46, y=0, Y=1] [L31] EXPR counter++ VAL [counter=47, counter++=46, v=-5, x=45, x=0, X=99, x=46, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=47, v=-5, X=99, x=46, x=0, x=46, Y=1, y=0] [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=-5, x=46, x=0, x=46, X=99, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=47, v=-5, X=99, x=46, x=46, x=0, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=47, v=-3, x=46, X=99, x=0, x=46, y=0, Y=1] [L45] x++ VAL [counter=47, v=-3, x=0, x=47, X=99, x=46, y=0, Y=1] [L31] EXPR counter++ VAL [counter=48, counter++=47, v=-3, X=99, x=47, x=0, x=46, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=48, v=-3, x=0, x=47, X=99, x=47, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=48] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=48, v=-3, X=99, x=47, x=47, x=0, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=48, v=-3, X=99, x=47, x=47, x=0, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=48, v=-1, x=47, x=0, x=47, X=99, Y=1, y=0] [L45] x++ VAL [counter=48, v=-1, x=0, X=99, x=47, x=48, y=0, Y=1] [L31] EXPR counter++ VAL [counter=49, counter++=48, v=-1, X=99, x=0, x=47, x=48, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=49, v=-1, X=99, x=48, x=48, x=0, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=49] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=49, v=-1, x=48, X=99, x=48, x=0, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=49, v=-1, X=99, x=48, x=48, x=0, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=49, v=1, x=0, x=48, x=48, X=99, y=0, Y=1] [L45] x++ VAL [counter=49, v=1, x=48, x=49, X=99, x=0, Y=1, y=0] [L31] EXPR counter++ VAL [counter=50, counter++=49, v=1, x=49, X=99, x=48, x=0, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=50, v=1, x=49, x=0, x=49, X=99, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=50] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=50, v=1, x=49, x=0, x=49, X=99, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=50, v=1, x=0, x=49, x=49, X=99, y=0, Y=1] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=50, v=-195, x=49, x=0, X=99, x=49, y=1, Y=1] [L45] x++ VAL [counter=50, v=-195, x=49, x=50, x=0, X=99, y=1, Y=1] [L31] EXPR counter++ VAL [counter=51, counter++=50, v=-195, x=0, x=50, X=99, x=49, Y=1, y=1] [L31] COND FALSE !(counter++<50) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [counter=51, v=-195, x=50, x=50, x=50, X=99, y=1, Y=1] [L49] CALL __VERIFIER_assert(2*yx - 2*xy - X + (long long) 2*Y - v + 2*y == 0) VAL [\old(cond)=0, counter=51] [L14] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=51] [L16] reach_error() VAL [\old(cond)=0, cond=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.7s, OverallIterations: 10, TraceHistogramMax: 51, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 23.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 2171 SdHoareTripleChecker+Valid, 13.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2170 mSDsluCounter, 1977 SdHoareTripleChecker+Invalid, 13.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1725 mSDsCounter, 601 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1406 IncrementalHoareTripleChecker+Invalid, 2013 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 601 mSolverCounterUnsat, 252 mSDtfsCounter, 1406 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2233 GetRequests, 1883 SyntacticMatches, 4 SemanticMatches, 346 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3313 ImplicationChecksByTransitivity, 12.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1000occurred in iteration=9, InterpolantAutomatonStates: 329, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 31 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 1664 NumberOfCodeBlocks, 1454 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 2057 ConstructedInterpolants, 0 QuantifiedInterpolants, 5923 SizeOfPredicates, 103 NumberOfNonLiveVariables, 2581 ConjunctsInSsa, 261 ConjunctsInUnsatCore, 16 InterpolantComputations, 1 PerfectInterpolantSequences, 8021/29436 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:55,187 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