./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 86018b7f3e582b94d83913c12d8eaea893434e1e96da49ea035805521496eb67 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 04:22:50,886 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 04:22:50,888 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 04:22:50,907 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 04:22:50,907 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 04:22:50,908 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 04:22:50,909 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 04:22:50,910 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 04:22:50,911 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 04:22:50,912 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 04:22:50,913 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 04:22:50,913 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 04:22:50,914 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 04:22:50,914 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 04:22:50,915 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 04:22:50,916 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 04:22:50,916 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 04:22:50,917 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 04:22:50,918 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 04:22:50,919 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 04:22:50,927 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 04:22:50,931 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 04:22:50,932 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 04:22:50,933 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 04:22:50,933 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 04:22:50,935 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 04:22:50,935 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 04:22:50,936 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 04:22:50,936 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 04:22:50,937 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 04:22:50,937 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 04:22:50,938 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 04:22:50,938 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 04:22:50,939 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 04:22:50,940 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 04:22:50,941 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 04:22:50,941 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 04:22:50,942 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 04:22:50,942 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 04:22:50,942 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 04:22:50,943 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 04:22:50,945 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 04:22:50,945 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 04:22:50,968 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 04:22:50,970 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 04:22:50,971 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 04:22:50,971 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 04:22:50,972 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 04:22:50,972 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 04:22:50,972 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 04:22:50,973 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 04:22:50,973 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 04:22:50,973 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 04:22:50,974 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 04:22:50,974 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 04:22:50,974 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 04:22:50,974 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 04:22:50,974 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 04:22:50,974 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 04:22:50,974 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 04:22:50,975 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 04:22:50,975 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 04:22:50,975 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 04:22:50,975 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 04:22:50,975 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 04:22:50,976 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 04:22:50,976 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 04:22:50,976 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 04:22:50,976 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 04:22:50,976 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 04:22:50,976 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 04:22:50,977 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 04:22:50,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 04:22:50,977 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 04:22:50,978 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 04:22:50,978 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 04:22:50,978 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 86018b7f3e582b94d83913c12d8eaea893434e1e96da49ea035805521496eb67 [2022-07-12 04:22:51,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 04:22:51,205 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 04:22:51,208 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 04:22:51,209 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 04:22:51,209 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 04:22:51,210 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c [2022-07-12 04:22:51,263 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7215080c9/1682b8e29ca54681afd351c10bb8baeb/FLAG1740e74a0 [2022-07-12 04:22:51,606 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 04:22:51,607 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c [2022-07-12 04:22:51,622 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7215080c9/1682b8e29ca54681afd351c10bb8baeb/FLAG1740e74a0 [2022-07-12 04:22:51,636 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7215080c9/1682b8e29ca54681afd351c10bb8baeb [2022-07-12 04:22:51,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 04:22:51,640 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 04:22:51,642 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 04:22:51,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 04:22:51,645 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 04:22:51,645 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 04:22:51" (1/1) ... [2022-07-12 04:22:51,647 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f608575 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:22:51, skipping insertion in model container [2022-07-12 04:22:51,647 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 04:22:51" (1/1) ... [2022-07-12 04:22:51,652 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 04:22:51,669 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 04:22:51,799 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c[597,610] [2022-07-12 04:22:51,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 04:22:51,815 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 04:22:51,823 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c[597,610] [2022-07-12 04:22:51,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 04:22:51,835 INFO L208 MainTranslator]: Completed translation [2022-07-12 04:22:51,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:22:51 WrapperNode [2022-07-12 04:22:51,836 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 04:22:51,837 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 04:22:51,837 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 04:22:51,837 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 04:22:51,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:22:51" (1/1) ... [2022-07-12 04:22:51,848 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:22:51" (1/1) ... [2022-07-12 04:22:51,859 INFO L137 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2022-07-12 04:22:51,860 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 04:22:51,860 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 04:22:51,860 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 04:22:51,861 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 04:22:51,865 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:22:51" (1/1) ... [2022-07-12 04:22:51,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:22:51" (1/1) ... [2022-07-12 04:22:51,866 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:22:51" (1/1) ... [2022-07-12 04:22:51,866 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:22:51" (1/1) ... [2022-07-12 04:22:51,868 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:22:51" (1/1) ... [2022-07-12 04:22:51,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:22:51" (1/1) ... [2022-07-12 04:22:51,870 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:22:51" (1/1) ... [2022-07-12 04:22:51,871 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 04:22:51,872 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 04:22:51,872 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 04:22:51,872 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 04:22:51,873 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:22:51" (1/1) ... [2022-07-12 04:22:51,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 04:22:51,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:22:51,900 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 04:22:51,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 04:22:51,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 04:22:51,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 04:22:51,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 04:22:51,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 04:22:51,936 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-12 04:22:51,936 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-12 04:22:51,988 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 04:22:51,989 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 04:22:52,106 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 04:22:52,111 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 04:22:52,111 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 04:22:52,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 04:22:52 BoogieIcfgContainer [2022-07-12 04:22:52,113 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 04:22:52,114 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 04:22:52,114 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 04:22:52,117 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 04:22:52,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 04:22:51" (1/3) ... [2022-07-12 04:22:52,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d071b72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 04:22:52, skipping insertion in model container [2022-07-12 04:22:52,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:22:51" (2/3) ... [2022-07-12 04:22:52,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d071b72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 04:22:52, skipping insertion in model container [2022-07-12 04:22:52,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 04:22:52" (3/3) ... [2022-07-12 04:22:52,120 INFO L111 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound100.c [2022-07-12 04:22:52,135 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 04:22:52,135 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 04:22:52,186 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 04:22:52,194 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3f9ac339, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7da3a60e [2022-07-12 04:22:52,194 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 04:22:52,205 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) [2022-07-12 04:22:52,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 04:22:52,214 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:22:52,214 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:22:52,215 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:22:52,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:22:52,221 INFO L85 PathProgramCache]: Analyzing trace with hash 180444447, now seen corresponding path program 1 times [2022-07-12 04:22:52,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:22:52,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089836383] [2022-07-12 04:22:52,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:22:52,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:22:52,315 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 04:22:52,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [598754141] [2022-07-12 04:22:52,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:22:52,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:22:52,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:22:52,321 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 04:22:52,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 04:22:52,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:22:52,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 04:22:52,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:22:52,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:22:52,580 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 04:22:52,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:22:52,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089836383] [2022-07-12 04:22:52,581 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 04:22:52,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598754141] [2022-07-12 04:22:52,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598754141] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 04:22:52,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 04:22:52,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 04:22:52,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565094527] [2022-07-12 04:22:52,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 04:22:52,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 04:22:52,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:22:52,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 04:22:52,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 04:22:52,609 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) [2022-07-12 04:22:52,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:22:52,736 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-07-12 04:22:52,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 04:22:52,738 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 [2022-07-12 04:22:52,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:22:52,743 INFO L225 Difference]: With dead ends: 54 [2022-07-12 04:22:52,743 INFO L226 Difference]: Without dead ends: 25 [2022-07-12 04:22:52,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 04:22:52,750 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 18 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 04:22:52,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 64 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 04:22:52,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-12 04:22:52,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-07-12 04:22:52,781 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) [2022-07-12 04:22:52,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-07-12 04:22:52,783 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 8 [2022-07-12 04:22:52,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:22:52,784 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-07-12 04:22:52,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:22:52,785 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-07-12 04:22:52,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 04:22:52,786 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:22:52,786 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:22:52,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 04:22:52,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-07-12 04:22:52,994 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:22:52,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:22:52,995 INFO L85 PathProgramCache]: Analyzing trace with hash 2080570626, now seen corresponding path program 1 times [2022-07-12 04:22:52,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:22:52,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096184584] [2022-07-12 04:22:52,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:22:52,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:22:53,022 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 04:22:53,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [704768691] [2022-07-12 04:22:53,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:22:53,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:22:53,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:22:53,027 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 04:22:53,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 04:22:53,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:22:53,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-12 04:22:53,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:22:53,221 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:22:53,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 04:22:53,307 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 04:22:53,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:22:53,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096184584] [2022-07-12 04:22:53,308 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 04:22:53,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704768691] [2022-07-12 04:22:53,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704768691] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 04:22:53,308 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 04:22:53,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2022-07-12 04:22:53,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667699979] [2022-07-12 04:22:53,309 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 04:22:53,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 04:22:53,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:22:53,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 04:22:53,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-12 04:22:53,311 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) [2022-07-12 04:22:53,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:22:53,583 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-07-12 04:22:53,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 04:22:53,584 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 [2022-07-12 04:22:53,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:22:53,585 INFO L225 Difference]: With dead ends: 41 [2022-07-12 04:22:53,585 INFO L226 Difference]: Without dead ends: 34 [2022-07-12 04:22:53,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-07-12 04:22:53,587 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 18 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 04:22:53,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 64 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 04:22:53,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-12 04:22:53,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-07-12 04:22:53,593 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) [2022-07-12 04:22:53,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-07-12 04:22:53,593 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 18 [2022-07-12 04:22:53,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:22:53,594 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-07-12 04:22:53,594 INFO L496 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) [2022-07-12 04:22:53,594 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-07-12 04:22:53,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 04:22:53,595 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:22:53,595 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:22:53,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-12 04:22:53,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-07-12 04:22:53,796 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:22:53,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:22:53,797 INFO L85 PathProgramCache]: Analyzing trace with hash 680664555, now seen corresponding path program 1 times [2022-07-12 04:22:53,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:22:53,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927715452] [2022-07-12 04:22:53,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:22:53,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:22:53,805 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 04:22:53,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [523572238] [2022-07-12 04:22:53,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:22:53,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:22:53,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:22:53,807 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 04:22:53,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 04:22:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:22:53,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 04:22:53,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:22:53,860 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:22:53,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 04:22:53,883 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:22:53,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:22:53,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927715452] [2022-07-12 04:22:53,884 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 04:22:53,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523572238] [2022-07-12 04:22:53,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523572238] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 04:22:53,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 04:22:53,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-07-12 04:22:53,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208379674] [2022-07-12 04:22:53,885 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 04:22:53,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 04:22:53,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:22:53,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 04:22:53,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-12 04:22:53,886 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) [2022-07-12 04:22:53,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:22:53,929 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2022-07-12 04:22:53,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 04:22:53,929 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 [2022-07-12 04:22:53,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:22:53,930 INFO L225 Difference]: With dead ends: 73 [2022-07-12 04:22:53,930 INFO L226 Difference]: Without dead ends: 67 [2022-07-12 04:22:53,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-12 04:22:53,931 INFO L413 NwaCegarLoop]: 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 [2022-07-12 04:22:53,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 100 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 04:22:53,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-12 04:22:53,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2022-07-12 04:22:53,937 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) [2022-07-12 04:22:53,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2022-07-12 04:22:53,938 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 19 [2022-07-12 04:22:53,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:22:53,939 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2022-07-12 04:22:53,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 04:22:53,939 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-07-12 04:22:53,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 04:22:53,939 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:22:53,940 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:22:53,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 04:22:54,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:22:54,156 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:22:54,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:22:54,156 INFO L85 PathProgramCache]: Analyzing trace with hash 713886481, now seen corresponding path program 1 times [2022-07-12 04:22:54,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:22:54,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772249117] [2022-07-12 04:22:54,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:22:54,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:22:54,163 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 04:22:54,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1686336694] [2022-07-12 04:22:54,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:22:54,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:22:54,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:22:54,168 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 04:22:54,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 04:22:54,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:22:54,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-12 04:22:54,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:22:54,444 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 04:22:54,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 04:22:54,772 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 04:22:54,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:22:54,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772249117] [2022-07-12 04:22:54,773 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 04:22:54,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686336694] [2022-07-12 04:22:54,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686336694] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 04:22:54,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 04:22:54,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2022-07-12 04:22:54,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119666648] [2022-07-12 04:22:54,779 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 04:22:54,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-12 04:22:54,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:22:54,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-12 04:22:54,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-07-12 04:22:54,780 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) [2022-07-12 04:22:55,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:22:55,331 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2022-07-12 04:22:55,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-12 04:22:55,331 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 [2022-07-12 04:22:55,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:22:55,332 INFO L225 Difference]: With dead ends: 81 [2022-07-12 04:22:55,332 INFO L226 Difference]: Without dead ends: 73 [2022-07-12 04:22:55,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=216, Invalid=1116, Unknown=0, NotChecked=0, Total=1332 [2022-07-12 04:22:55,333 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 39 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 04:22:55,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 106 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 271 Invalid, 0 Unknown, 90 Unchecked, 0.1s Time] [2022-07-12 04:22:55,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-12 04:22:55,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 63. [2022-07-12 04:22:55,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 states have internal predecessors, (59), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 04:22:55,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2022-07-12 04:22:55,342 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 25 [2022-07-12 04:22:55,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:22:55,342 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2022-07-12 04:22:55,343 INFO L496 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) [2022-07-12 04:22:55,343 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2022-07-12 04:22:55,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 04:22:55,344 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:22:55,344 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:22:55,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 04:22:55,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:22:55,560 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:22:55,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:22:55,561 INFO L85 PathProgramCache]: Analyzing trace with hash 2021783820, now seen corresponding path program 1 times [2022-07-12 04:22:55,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:22:55,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576952627] [2022-07-12 04:22:55,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:22:55,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:22:55,568 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 04:22:55,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [583888343] [2022-07-12 04:22:55,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:22:55,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:22:55,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:22:55,573 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) [2022-07-12 04:22:55,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 04:22:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:22:55,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-12 04:22:55,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:22:59,859 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-12 04:22:59,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 04:22:59,976 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-12 04:22:59,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:22:59,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576952627] [2022-07-12 04:22:59,977 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 04:22:59,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583888343] [2022-07-12 04:22:59,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583888343] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 04:22:59,977 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 04:22:59,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-07-12 04:22:59,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768058688] [2022-07-12 04:22:59,978 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 04:22:59,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 04:22:59,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:22:59,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 04:22:59,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=146, Unknown=1, NotChecked=0, Total=182 [2022-07-12 04:22:59,979 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 04:23:01,986 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 [] [2022-07-12 04:23:06,061 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 [] [2022-07-12 04:23:08,065 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 [] [2022-07-12 04:23:10,105 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 [] [2022-07-12 04:23:12,120 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 [] [2022-07-12 04:23:14,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:23:14,296 INFO L93 Difference]: Finished difference Result 92 states and 109 transitions. [2022-07-12 04:23:14,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 04:23:14,296 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 35 [2022-07-12 04:23:14,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:23:14,297 INFO L225 Difference]: With dead ends: 92 [2022-07-12 04:23:14,297 INFO L226 Difference]: Without dead ends: 86 [2022-07-12 04:23:14,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=66, Invalid=237, Unknown=3, NotChecked=0, Total=306 [2022-07-12 04:23:14,298 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 27 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 13 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2022-07-12 04:23:14,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 59 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 116 Invalid, 5 Unknown, 0 Unchecked, 10.1s Time] [2022-07-12 04:23:14,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-12 04:23:14,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2022-07-12 04:23:14,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.173913043478261) internal successors, (81), 69 states have internal predecessors, (81), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-12 04:23:14,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 100 transitions. [2022-07-12 04:23:14,324 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 100 transitions. Word has length 35 [2022-07-12 04:23:14,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:23:14,325 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 100 transitions. [2022-07-12 04:23:14,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 04:23:14,326 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 100 transitions. [2022-07-12 04:23:14,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 04:23:14,328 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:23:14,328 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:23:14,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 04:23:14,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:23:14,543 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:23:14,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:23:14,544 INFO L85 PathProgramCache]: Analyzing trace with hash -2132634866, now seen corresponding path program 1 times [2022-07-12 04:23:14,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:23:14,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324639574] [2022-07-12 04:23:14,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:23:14,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:23:14,552 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 04:23:14,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [325009358] [2022-07-12 04:23:14,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:23:14,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:23:14,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:23:14,554 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) [2022-07-12 04:23:14,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 04:23:14,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:23:14,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 04:23:14,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:23:14,694 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 04:23:14,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 04:23:14,803 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 04:23:14,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:23:14,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324639574] [2022-07-12 04:23:14,803 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 04:23:14,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325009358] [2022-07-12 04:23:14,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325009358] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 04:23:14,804 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 04:23:14,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-07-12 04:23:14,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459222430] [2022-07-12 04:23:14,804 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 04:23:14,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 04:23:14,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:23:14,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 04:23:14,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-07-12 04:23:14,805 INFO L87 Difference]: Start difference. First operand 84 states and 100 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 04:23:14,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:23:14,933 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2022-07-12 04:23:14,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 04:23:14,934 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 35 [2022-07-12 04:23:14,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:23:14,934 INFO L225 Difference]: With dead ends: 93 [2022-07-12 04:23:14,935 INFO L226 Difference]: Without dead ends: 87 [2022-07-12 04:23:14,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-07-12 04:23:14,935 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 04:23:14,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 77 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 04:23:14,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-12 04:23:14,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 79. [2022-07-12 04:23:14,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 65 states have internal predecessors, (76), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-12 04:23:14,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 93 transitions. [2022-07-12 04:23:14,950 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 93 transitions. Word has length 35 [2022-07-12 04:23:14,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:23:14,950 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 93 transitions. [2022-07-12 04:23:14,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 04:23:14,950 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 93 transitions. [2022-07-12 04:23:14,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 04:23:14,951 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:23:14,951 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:23:14,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 04:23:15,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:23:15,159 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:23:15,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:23:15,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1410392757, now seen corresponding path program 2 times [2022-07-12 04:23:15,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:23:15,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250781930] [2022-07-12 04:23:15,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:23:15,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:23:15,166 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 04:23:15,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [129928862] [2022-07-12 04:23:15,167 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 04:23:15,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:23:15,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:23:15,168 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) [2022-07-12 04:23:15,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 04:23:15,212 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 04:23:15,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 04:23:15,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 04:23:15,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:23:15,326 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-12 04:23:15,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 04:23:15,427 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-12 04:23:15,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:23:15,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250781930] [2022-07-12 04:23:15,428 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 04:23:15,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129928862] [2022-07-12 04:23:15,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129928862] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 04:23:15,428 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 04:23:15,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-12 04:23:15,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329932571] [2022-07-12 04:23:15,428 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 04:23:15,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 04:23:15,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:23:15,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 04:23:15,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-07-12 04:23:15,429 INFO L87 Difference]: Start difference. First operand 79 states and 93 transitions. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-12 04:23:15,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:23:15,564 INFO L93 Difference]: Finished difference Result 104 states and 123 transitions. [2022-07-12 04:23:15,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 04:23:15,564 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 45 [2022-07-12 04:23:15,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:23:15,565 INFO L225 Difference]: With dead ends: 104 [2022-07-12 04:23:15,565 INFO L226 Difference]: Without dead ends: 98 [2022-07-12 04:23:15,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-07-12 04:23:15,566 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 9 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 04:23:15,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 79 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 04:23:15,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-12 04:23:15,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 85. [2022-07-12 04:23:15,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 70 states have (on average 1.1714285714285715) internal successors, (82), 70 states have internal predecessors, (82), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-12 04:23:15,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 101 transitions. [2022-07-12 04:23:15,594 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 101 transitions. Word has length 45 [2022-07-12 04:23:15,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:23:15,594 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 101 transitions. [2022-07-12 04:23:15,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-12 04:23:15,594 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 101 transitions. [2022-07-12 04:23:15,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 04:23:15,595 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:23:15,595 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:23:15,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 04:23:15,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:23:15,796 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:23:15,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:23:15,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1900020427, now seen corresponding path program 3 times [2022-07-12 04:23:15,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:23:15,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610287212] [2022-07-12 04:23:15,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:23:15,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:23:15,803 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 04:23:15,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1596436683] [2022-07-12 04:23:15,803 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 04:23:15,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:23:15,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:23:15,804 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) [2022-07-12 04:23:15,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 04:23:17,256 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-12 04:23:17,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 04:23:17,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-12 04:23:17,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:23:21,394 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~X~0#1| 1)) (.cse5 (= |c_ULTIMATE.start_main_~Y~0#1| 0)) (.cse4 (= (mod (+ |c_ULTIMATE.start_main_~X~0#1| |c_ULTIMATE.start_main_~v~0#1| (* |c_ULTIMATE.start_main_~y~0#1| (- 2) |c_ULTIMATE.start_main_~X~0#1|)) 2) 0)) (.cse3 (+ (* (- 1) |c_ULTIMATE.start_main_~Y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~X~0#1|) (div (+ (* (- 1) |c_ULTIMATE.start_main_~v~0#1|) (* (- 1) |c_ULTIMATE.start_main_~X~0#1|)) (- 2))))) (or (and (let ((.cse2 (= |c_ULTIMATE.start_main_~y~0#1| 0))) (or (let ((.cse0 (div |c_ULTIMATE.start_main_~xy~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (and (= |c_ULTIMATE.start_main_~yx~0#1| (* |c_ULTIMATE.start_main_~Y~0#1| .cse0)) (= (mod |c_ULTIMATE.start_main_~xy~0#1| |c_ULTIMATE.start_main_~y~0#1|) 0) (<= .cse0 .cse1) (not (<= .cse0 |c_ULTIMATE.start_main_~X~0#1|)) (not .cse2))) (and (= |c_ULTIMATE.start_main_~xy~0#1| 0) (= |c_ULTIMATE.start_main_~yx~0#1| 0) .cse2))) (= .cse3 0) .cse4 .cse5) (let ((.cse6 (div .cse3 |c_ULTIMATE.start_main_~Y~0#1|))) (and (<= .cse6 .cse1) (not .cse5) (= |c_ULTIMATE.start_main_~xy~0#1| (* |c_ULTIMATE.start_main_~y~0#1| .cse6)) (= |c_ULTIMATE.start_main_~yx~0#1| (* |c_ULTIMATE.start_main_~Y~0#1| .cse6)) (not (<= .cse6 |c_ULTIMATE.start_main_~X~0#1|)) .cse4 (= (mod .cse3 |c_ULTIMATE.start_main_~Y~0#1|) 0))))) is different from false [2022-07-12 04:23:22,939 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-12 04:23:22,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 04:23:23,097 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-12 04:23:23,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:23:23,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610287212] [2022-07-12 04:23:23,098 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 04:23:23,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596436683] [2022-07-12 04:23:23,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596436683] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 04:23:23,098 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 04:23:23,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2022-07-12 04:23:23,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64506220] [2022-07-12 04:23:23,098 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 04:23:23,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-12 04:23:23,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:23:23,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-12 04:23:23,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=196, Unknown=1, NotChecked=28, Total=272 [2022-07-12 04:23:23,100 INFO L87 Difference]: Start difference. First operand 85 states and 101 transitions. Second operand has 17 states, 13 states have (on average 2.230769230769231) internal successors, (29), 14 states have internal predecessors, (29), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 04:23:25,364 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~X~0#1| 1)) (.cse7 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~X~0#1|)) (.cse8 (* |c_ULTIMATE.start_main_~Y~0#1| 2))) (and (let ((.cse5 (= |c_ULTIMATE.start_main_~Y~0#1| 0)) (.cse4 (= (mod (+ |c_ULTIMATE.start_main_~X~0#1| |c_ULTIMATE.start_main_~v~0#1| (* |c_ULTIMATE.start_main_~y~0#1| (- 2) |c_ULTIMATE.start_main_~X~0#1|)) 2) 0)) (.cse3 (+ (* (- 1) |c_ULTIMATE.start_main_~Y~0#1|) .cse7 (div (+ (* (- 1) |c_ULTIMATE.start_main_~v~0#1|) (* (- 1) |c_ULTIMATE.start_main_~X~0#1|)) (- 2))))) (or (and (let ((.cse2 (= |c_ULTIMATE.start_main_~y~0#1| 0))) (or (let ((.cse0 (div |c_ULTIMATE.start_main_~xy~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (and (= |c_ULTIMATE.start_main_~yx~0#1| (* |c_ULTIMATE.start_main_~Y~0#1| .cse0)) (= (mod |c_ULTIMATE.start_main_~xy~0#1| |c_ULTIMATE.start_main_~y~0#1|) 0) (<= .cse0 .cse1) (not (<= .cse0 |c_ULTIMATE.start_main_~X~0#1|)) (not .cse2))) (and (= |c_ULTIMATE.start_main_~xy~0#1| 0) (= |c_ULTIMATE.start_main_~yx~0#1| 0) .cse2))) (= .cse3 0) .cse4 .cse5) (let ((.cse6 (div .cse3 |c_ULTIMATE.start_main_~Y~0#1|))) (and (<= .cse6 .cse1) (not .cse5) (= |c_ULTIMATE.start_main_~xy~0#1| (* |c_ULTIMATE.start_main_~y~0#1| .cse6)) (= |c_ULTIMATE.start_main_~yx~0#1| (* |c_ULTIMATE.start_main_~Y~0#1| .cse6)) (not (<= .cse6 |c_ULTIMATE.start_main_~X~0#1|)) .cse4 (= (mod .cse3 |c_ULTIMATE.start_main_~Y~0#1|) 0))))) (<= |c_ULTIMATE.start_main_~x~0#1| .cse1) (not (<= |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~X~0#1|)) (= (+ |c_ULTIMATE.start_main_~X~0#1| (* 2 .cse7) |c_ULTIMATE.start_main_~v~0#1|) (+ .cse8 (* 2 (* |c_ULTIMATE.start_main_~Y~0#1| |c_ULTIMATE.start_main_~x~0#1|)))) (= (+ |c_ULTIMATE.start_main_~X~0#1| |c_ULTIMATE.start_main_~v~0#1| (* |c_ULTIMATE.start_main_~xy~0#1| 2)) (+ (* |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~yx~0#1| 2) .cse8)))) is different from false [2022-07-12 04:23:25,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:23:25,398 INFO L93 Difference]: Finished difference Result 93 states and 108 transitions. [2022-07-12 04:23:25,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 04:23:25,398 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.230769230769231) internal successors, (29), 14 states have internal predecessors, (29), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 45 [2022-07-12 04:23:25,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:23:25,399 INFO L225 Difference]: With dead ends: 93 [2022-07-12 04:23:25,399 INFO L226 Difference]: Without dead ends: 87 [2022-07-12 04:23:25,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=110, Invalid=448, Unknown=2, NotChecked=90, Total=650 [2022-07-12 04:23:25,400 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 22 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 04:23:25,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 78 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 180 Invalid, 0 Unknown, 27 Unchecked, 0.2s Time] [2022-07-12 04:23:25,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-12 04:23:25,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 50. [2022-07-12 04:23:25,406 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) [2022-07-12 04:23:25,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-07-12 04:23:25,407 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 45 [2022-07-12 04:23:25,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:23:25,407 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-07-12 04:23:25,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.230769230769231) internal successors, (29), 14 states have internal predecessors, (29), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 04:23:25,408 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-07-12 04:23:25,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-12 04:23:25,408 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:23:25,409 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:23:25,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-12 04:23:25,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-07-12 04:23:25,617 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:23:25,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:23:25,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1582515168, now seen corresponding path program 1 times [2022-07-12 04:23:25,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:23:25,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464020528] [2022-07-12 04:23:25,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:23:25,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:23:25,636 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 04:23:25,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [61708533] [2022-07-12 04:23:25,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:23:25,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:23:25,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:23:25,648 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) [2022-07-12 04:23:25,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 04:23:25,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:23:25,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 04:23:25,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:23:25,743 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:23:25,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 04:23:25,811 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-12 04:23:25,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:23:25,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464020528] [2022-07-12 04:23:25,812 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 04:23:25,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61708533] [2022-07-12 04:23:25,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61708533] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 04:23:25,812 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 04:23:25,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-07-12 04:23:25,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876404236] [2022-07-12 04:23:25,813 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 04:23:25,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 04:23:25,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:23:25,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 04:23:25,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-07-12 04:23:25,814 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) [2022-07-12 04:23:25,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:23:25,955 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2022-07-12 04:23:25,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 04:23:25,955 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 [2022-07-12 04:23:25,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:23:25,957 INFO L225 Difference]: With dead ends: 116 [2022-07-12 04:23:25,957 INFO L226 Difference]: Without dead ends: 110 [2022-07-12 04:23:25,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-07-12 04:23:25,959 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 111 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 04:23:25,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 154 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 04:23:25,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-07-12 04:23:25,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-07-12 04:23:25,980 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) [2022-07-12 04:23:25,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2022-07-12 04:23:25,981 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 49 [2022-07-12 04:23:25,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:23:25,981 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2022-07-12 04:23:25,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-12 04:23:25,981 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2022-07-12 04:23:25,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-12 04:23:25,985 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:23:25,985 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:23:26,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-12 04:23:26,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:23:26,192 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:23:26,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:23:26,193 INFO L85 PathProgramCache]: Analyzing trace with hash 297311502, now seen corresponding path program 2 times [2022-07-12 04:23:26,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:23:26,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129377051] [2022-07-12 04:23:26,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:23:26,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:23:26,213 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 04:23:26,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1232349928] [2022-07-12 04:23:26,213 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 04:23:26,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:23:26,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:23:26,219 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) [2022-07-12 04:23:26,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 04:23:26,278 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 04:23:26,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 04:23:26,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-12 04:23:26,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:23:26,436 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 470 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:23:26,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 04:23:26,666 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 290 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-12 04:23:26,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:23:26,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129377051] [2022-07-12 04:23:26,666 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 04:23:26,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232349928] [2022-07-12 04:23:26,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232349928] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 04:23:26,667 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 04:23:26,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2022-07-12 04:23:26,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396689195] [2022-07-12 04:23:26,667 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 04:23:26,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-12 04:23:26,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:23:26,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-12 04:23:26,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-07-12 04:23:26,668 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) [2022-07-12 04:23:27,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:23:27,039 INFO L93 Difference]: Finished difference Result 236 states and 269 transitions. [2022-07-12 04:23:27,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-07-12 04:23:27,040 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 [2022-07-12 04:23:27,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:23:27,041 INFO L225 Difference]: With dead ends: 236 [2022-07-12 04:23:27,041 INFO L226 Difference]: Without dead ends: 230 [2022-07-12 04:23:27,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2022-07-12 04:23:27,042 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 329 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 04:23:27,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 298 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 04:23:27,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-07-12 04:23:27,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2022-07-12 04:23:27,059 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) [2022-07-12 04:23:27,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 252 transitions. [2022-07-12 04:23:27,061 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 252 transitions. Word has length 109 [2022-07-12 04:23:27,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:23:27,062 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 252 transitions. [2022-07-12 04:23:27,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.576923076923077) internal successors, (145), 26 states have internal predecessors, (145), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-07-12 04:23:27,062 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 252 transitions. [2022-07-12 04:23:27,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2022-07-12 04:23:27,065 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:23:27,065 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:23:27,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-12 04:23:27,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-12 04:23:27,277 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:23:27,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:23:27,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1294150550, now seen corresponding path program 3 times [2022-07-12 04:23:27,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:23:27,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176581410] [2022-07-12 04:23:27,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:23:27,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:23:27,289 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 04:23:27,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1472028359] [2022-07-12 04:23:27,289 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 04:23:27,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:23:27,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:23:27,291 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 04:23:27,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-12 04:23:27,351 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-12 04:23:27,351 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 04:23:27,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 04:23:27,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:23:28,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 234 proven. 1 refuted. 0 times theorem prover too weak. 2163 trivial. 0 not checked. [2022-07-12 04:23:28,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 04:23:29,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:23:29,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176581410] [2022-07-12 04:23:29,167 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 04:23:29,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472028359] [2022-07-12 04:23:29,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472028359] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 04:23:29,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-07-12 04:23:29,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-07-12 04:23:29,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100308605] [2022-07-12 04:23:29,168 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-07-12 04:23:29,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 04:23:29,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:23:29,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 04:23:29,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=254, Unknown=1, NotChecked=0, Total=306 [2022-07-12 04:23:29,169 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) [2022-07-12 04:23:31,178 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 [] [2022-07-12 04:23:35,210 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 [] [2022-07-12 04:23:37,214 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 [] [2022-07-12 04:23:39,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:23:39,518 INFO L93 Difference]: Finished difference Result 449 states and 492 transitions. [2022-07-12 04:23:39,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 04:23:39,519 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 [2022-07-12 04:23:39,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:23:39,521 INFO L225 Difference]: With dead ends: 449 [2022-07-12 04:23:39,521 INFO L226 Difference]: Without dead ends: 443 [2022-07-12 04:23:39,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 231 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=94, Invalid=409, Unknown=3, NotChecked=0, Total=506 [2022-07-12 04:23:39,522 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 16 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 7 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-07-12 04:23:39,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 43 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 79 Invalid, 3 Unknown, 0 Unchecked, 6.2s Time] [2022-07-12 04:23:39,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-07-12 04:23:39,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 440. [2022-07-12 04:23:39,555 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) [2022-07-12 04:23:39,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 483 transitions. [2022-07-12 04:23:39,556 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 483 transitions. Word has length 229 [2022-07-12 04:23:39,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:23:39,557 INFO L495 AbstractCegarLoop]: Abstraction has 440 states and 483 transitions. [2022-07-12 04:23:39,557 INFO L496 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) [2022-07-12 04:23:39,557 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 483 transitions. [2022-07-12 04:23:39,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2022-07-12 04:23:39,559 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:23:39,559 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:23:39,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-12 04:23:39,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-12 04:23:39,774 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:23:39,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:23:39,774 INFO L85 PathProgramCache]: Analyzing trace with hash -614092180, now seen corresponding path program 1 times [2022-07-12 04:23:39,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:23:39,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232026763] [2022-07-12 04:23:39,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:23:39,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:23:39,792 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 04:23:39,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [56012248] [2022-07-12 04:23:39,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:23:39,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:23:39,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:23:39,794 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 04:23:39,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-12 04:23:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:23:39,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-12 04:23:39,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:23:40,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 44 proven. 2354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:23:40,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 04:23:41,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 44 proven. 1430 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2022-07-12 04:23:41,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:23:41,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232026763] [2022-07-12 04:23:41,001 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 04:23:41,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56012248] [2022-07-12 04:23:41,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56012248] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 04:23:41,001 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 04:23:41,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2022-07-12 04:23:41,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029788048] [2022-07-12 04:23:41,001 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 04:23:41,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-12 04:23:41,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:23:41,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-12 04:23:41,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2022-07-12 04:23:41,003 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) [2022-07-12 04:23:42,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:23:42,184 INFO L93 Difference]: Finished difference Result 929 states and 1043 transitions. [2022-07-12 04:23:42,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-07-12 04:23:42,184 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 [2022-07-12 04:23:42,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:23:42,188 INFO L225 Difference]: With dead ends: 929 [2022-07-12 04:23:42,189 INFO L226 Difference]: Without dead ends: 923 [2022-07-12 04:23:42,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2022-07-12 04:23:42,192 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 658 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 04:23:42,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 532 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 04:23:42,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2022-07-12 04:23:42,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 920. [2022-07-12 04:23:42,256 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) [2022-07-12 04:23:42,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1011 transitions. [2022-07-12 04:23:42,259 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1011 transitions. Word has length 229 [2022-07-12 04:23:42,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:23:42,260 INFO L495 AbstractCegarLoop]: Abstraction has 920 states and 1011 transitions. [2022-07-12 04:23:42,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 6.02) internal successors, (301), 50 states have internal predecessors, (301), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-07-12 04:23:42,260 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1011 transitions. [2022-07-12 04:23:42,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2022-07-12 04:23:42,268 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:23:42,269 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 46, 45, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:23:42,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-12 04:23:42,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-12 04:23:42,483 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:23:42,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:23:42,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1651100380, now seen corresponding path program 2 times [2022-07-12 04:23:42,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:23:42,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425909619] [2022-07-12 04:23:42,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:23:42,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:23:42,512 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 04:23:42,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [302294858] [2022-07-12 04:23:42,512 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 04:23:42,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:23:42,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:23:42,513 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 04:23:42,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-12 04:23:42,711 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 04:23:42,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 04:23:42,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 1161 conjuncts, 95 conjunts are in the unsatisfiable core [2022-07-12 04:23:42,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:23:43,850 INFO L134 CoverageAnalysis]: Checked inductivity of 10534 backedges. 92 proven. 10442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:23:43,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 04:23:46,051 INFO L134 CoverageAnalysis]: Checked inductivity of 10534 backedges. 92 proven. 6302 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2022-07-12 04:23:46,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:23:46,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425909619] [2022-07-12 04:23:46,052 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 04:23:46,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302294858] [2022-07-12 04:23:46,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302294858] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 04:23:46,052 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 04:23:46,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 98 [2022-07-12 04:23:46,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430513227] [2022-07-12 04:23:46,052 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 04:23:46,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2022-07-12 04:23:46,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:23:46,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2022-07-12 04:23:46,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4565, Invalid=4941, Unknown=0, NotChecked=0, Total=9506 [2022-07-12 04:23:46,057 INFO L87 Difference]: Start difference. First operand 920 states and 1011 transitions. Second operand has 98 states, 98 states have (on average 6.255102040816326) internal successors, (613), 98 states have internal predecessors, (613), 93 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2022-07-12 04:23:50,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:23:50,274 INFO L93 Difference]: Finished difference Result 1889 states and 2123 transitions. [2022-07-12 04:23:50,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2022-07-12 04:23:50,274 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 6.255102040816326) internal successors, (613), 98 states have internal predecessors, (613), 93 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) Word has length 469 [2022-07-12 04:23:50,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:23:50,280 INFO L225 Difference]: With dead ends: 1889 [2022-07-12 04:23:50,280 INFO L226 Difference]: Without dead ends: 1883 [2022-07-12 04:23:50,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1029 GetRequests, 840 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5452 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=13540, Invalid=22750, Unknown=0, NotChecked=0, Total=36290 [2022-07-12 04:23:50,286 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 1951 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 513 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1951 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 513 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 04:23:50,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1951 Valid, 893 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [513 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 04:23:50,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2022-07-12 04:23:50,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1880. [2022-07-12 04:23:50,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1880 states, 1504 states have (on average 1.125) internal successors, (1692), 1504 states have internal predecessors, (1692), 188 states have call successors, (188), 188 states have call predecessors, (188), 187 states have return successors, (187), 187 states have call predecessors, (187), 187 states have call successors, (187) [2022-07-12 04:23:50,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1880 states and 2067 transitions. [2022-07-12 04:23:50,403 INFO L78 Accepts]: Start accepts. Automaton has 1880 states and 2067 transitions. Word has length 469 [2022-07-12 04:23:50,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:23:50,403 INFO L495 AbstractCegarLoop]: Abstraction has 1880 states and 2067 transitions. [2022-07-12 04:23:50,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 6.255102040816326) internal successors, (613), 98 states have internal predecessors, (613), 93 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2022-07-12 04:23:50,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 2067 transitions. [2022-07-12 04:23:50,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 950 [2022-07-12 04:23:50,426 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:23:50,426 INFO L195 NwaCegarLoop]: trace histogram [95, 95, 94, 94, 94, 94, 94, 94, 94, 93, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:23:50,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-12 04:23:50,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-12 04:23:50,642 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:23:50,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:23:50,642 INFO L85 PathProgramCache]: Analyzing trace with hash 866618004, now seen corresponding path program 3 times [2022-07-12 04:23:50,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:23:50,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181993203] [2022-07-12 04:23:50,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:23:50,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:23:50,678 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 04:23:50,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [898326372] [2022-07-12 04:23:50,679 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 04:23:50,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:23:50,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:23:50,680 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 04:23:50,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-12 04:23:51,770 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 95 check-sat command(s) [2022-07-12 04:23:51,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 04:23:51,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 2313 conjuncts, 191 conjunts are in the unsatisfiable core [2022-07-12 04:23:51,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:23:55,286 INFO L134 CoverageAnalysis]: Checked inductivity of 44086 backedges. 188 proven. 43898 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:23:55,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 04:23:56,408 INFO L134 CoverageAnalysis]: Checked inductivity of 44086 backedges. 188 proven. 26414 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2022-07-12 04:23:56,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:23:56,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181993203] [2022-07-12 04:23:56,408 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 04:23:56,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898326372] [2022-07-12 04:23:56,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898326372] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 04:23:56,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 04:23:56,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 98] total 104 [2022-07-12 04:23:56,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836023010] [2022-07-12 04:23:56,409 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 04:23:56,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2022-07-12 04:23:56,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:23:56,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2022-07-12 04:23:56,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5156, Invalid=5556, Unknown=0, NotChecked=0, Total=10712 [2022-07-12 04:23:56,413 INFO L87 Difference]: Start difference. First operand 1880 states and 2067 transitions. Second operand has 104 states, 104 states have (on average 7.625) internal successors, (793), 104 states have internal predecessors, (793), 100 states have call successors, (189), 96 states have call predecessors, (189), 95 states have return successors, (188), 99 states have call predecessors, (188), 99 states have call successors, (188) [2022-07-12 04:24:00,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:24:00,826 INFO L93 Difference]: Finished difference Result 2009 states and 2213 transitions. [2022-07-12 04:24:00,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2022-07-12 04:24:00,827 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 7.625) internal successors, (793), 104 states have internal predecessors, (793), 100 states have call successors, (189), 96 states have call predecessors, (189), 95 states have return successors, (188), 99 states have call predecessors, (188), 99 states have call successors, (188) Word has length 949 [2022-07-12 04:24:00,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:24:00,833 INFO L225 Difference]: With dead ends: 2009 [2022-07-12 04:24:00,833 INFO L226 Difference]: Without dead ends: 2003 [2022-07-12 04:24:00,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1995 GetRequests, 1793 SyntacticMatches, 1 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5055 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=15349, Invalid=25657, Unknown=0, NotChecked=0, Total=41006 [2022-07-12 04:24:00,839 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 1046 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1046 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 04:24:00,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1046 Valid, 1060 Invalid, 967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 04:24:00,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2022-07-12 04:24:00,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 2000. [2022-07-12 04:24:00,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2000 states, 1600 states have (on average 1.125) internal successors, (1800), 1600 states have internal predecessors, (1800), 200 states have call successors, (200), 200 states have call predecessors, (200), 199 states have return successors, (199), 199 states have call predecessors, (199), 199 states have call successors, (199) [2022-07-12 04:24:00,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2000 states to 2000 states and 2199 transitions. [2022-07-12 04:24:00,950 INFO L78 Accepts]: Start accepts. Automaton has 2000 states and 2199 transitions. Word has length 949 [2022-07-12 04:24:00,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:24:00,951 INFO L495 AbstractCegarLoop]: Abstraction has 2000 states and 2199 transitions. [2022-07-12 04:24:00,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 7.625) internal successors, (793), 104 states have internal predecessors, (793), 100 states have call successors, (189), 96 states have call predecessors, (189), 95 states have return successors, (188), 99 states have call predecessors, (188), 99 states have call successors, (188) [2022-07-12 04:24:00,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2000 states and 2199 transitions. [2022-07-12 04:24:00,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1010 [2022-07-12 04:24:00,961 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:24:00,961 INFO L195 NwaCegarLoop]: trace histogram [101, 101, 100, 100, 100, 100, 100, 100, 100, 99, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:24:00,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-12 04:24:01,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:24:01,179 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:24:01,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:24:01,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1685422910, now seen corresponding path program 4 times [2022-07-12 04:24:01,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:24:01,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903444450] [2022-07-12 04:24:01,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:24:01,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:24:01,201 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 04:24:01,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1943511939] [2022-07-12 04:24:01,202 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 04:24:01,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:24:01,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:24:01,203 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 04:24:01,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-12 04:24:01,825 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 04:24:01,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-07-12 04:24:01,826 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 04:24:02,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 04:24:02,811 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 04:24:02,811 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 04:24:02,812 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 04:24:02,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-12 04:24:03,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-12 04:24:03,031 INFO L356 BasicCegarLoop]: Path program histogram: [4, 3, 3, 1, 1, 1, 1, 1] [2022-07-12 04:24:03,034 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 04:24:03,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 04:24:03 BoogieIcfgContainer [2022-07-12 04:24:03,206 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 04:24:03,206 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 04:24:03,207 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 04:24:03,207 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 04:24:03,207 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 04:22:52" (3/4) ... [2022-07-12 04:24:03,208 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-12 04:24:03,375 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 04:24:03,375 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 04:24:03,376 INFO L158 Benchmark]: Toolchain (without parser) took 71736.02ms. Allocated memory was 86.0MB in the beginning and 272.6MB in the end (delta: 186.6MB). Free memory was 65.2MB in the beginning and 90.1MB in the end (delta: -24.9MB). Peak memory consumption was 161.7MB. Max. memory is 16.1GB. [2022-07-12 04:24:03,376 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 86.0MB. Free memory was 62.5MB in the beginning and 62.4MB in the end (delta: 44.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 04:24:03,376 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.11ms. Allocated memory was 86.0MB in the beginning and 115.3MB in the end (delta: 29.4MB). Free memory was 65.0MB in the beginning and 88.7MB in the end (delta: -23.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-12 04:24:03,377 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.89ms. Allocated memory is still 115.3MB. Free memory was 88.7MB in the beginning and 87.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 04:24:03,377 INFO L158 Benchmark]: Boogie Preprocessor took 11.33ms. Allocated memory is still 115.3MB. Free memory was 87.2MB in the beginning and 86.2MB in the end (delta: 946.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 04:24:03,378 INFO L158 Benchmark]: RCFGBuilder took 240.61ms. Allocated memory is still 115.3MB. Free memory was 86.2MB in the beginning and 75.8MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 04:24:03,378 INFO L158 Benchmark]: TraceAbstraction took 71091.61ms. Allocated memory was 115.3MB in the beginning and 272.6MB in the end (delta: 157.3MB). Free memory was 75.4MB in the beginning and 128.9MB in the end (delta: -53.4MB). Peak memory consumption was 172.1MB. Max. memory is 16.1GB. [2022-07-12 04:24:03,378 INFO L158 Benchmark]: Witness Printer took 168.72ms. Allocated memory is still 272.6MB. Free memory was 128.9MB in the beginning and 90.1MB in the end (delta: 38.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2022-07-12 04:24:03,383 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 86.0MB. Free memory was 62.5MB in the beginning and 62.4MB in the end (delta: 44.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 194.11ms. Allocated memory was 86.0MB in the beginning and 115.3MB in the end (delta: 29.4MB). Free memory was 65.0MB in the beginning and 88.7MB in the end (delta: -23.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.89ms. Allocated memory is still 115.3MB. Free memory was 88.7MB in the beginning and 87.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 11.33ms. Allocated memory is still 115.3MB. Free memory was 87.2MB in the beginning and 86.2MB in the end (delta: 946.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 240.61ms. Allocated memory is still 115.3MB. Free memory was 86.2MB in the beginning and 75.8MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 71091.61ms. Allocated memory was 115.3MB in the beginning and 272.6MB in the end (delta: 157.3MB). Free memory was 75.4MB in the beginning and 128.9MB in the end (delta: -53.4MB). Peak memory consumption was 172.1MB. Max. memory is 16.1GB. * Witness Printer took 168.72ms. Allocated memory is still 272.6MB. Free memory was 128.9MB in the beginning and 90.1MB in the end (delta: 38.8MB). Peak memory consumption was 39.8MB. 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=-197, x=0, X=199, Y=1, y=0] [L31] EXPR counter++ VAL [counter=1, counter++=0, v=-197, x=0, X=199, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=1, v=-197, X=199, 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=-197, x=0, x=0, X=199, x=0, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=1, v=-197, x=0, x=0, X=199, x=0, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=1, v=-195, x=0, x=0, x=0, X=199, Y=1, y=0] [L45] x++ VAL [counter=1, v=-195, X=199, x=0, x=0, x=1, Y=1, y=0] [L31] EXPR counter++ VAL [counter=2, counter++=1, v=-195, X=199, x=0, x=0, x=1, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=2, v=-195, x=1, x=1, X=199, 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=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=-195, x=1, x=0, x=1, X=199, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=2, v=-195, x=1, x=1, x=0, X=199, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=2, v=-193, x=0, x=1, X=199, x=1, Y=1, y=0] [L45] x++ VAL [counter=2, v=-193, x=2, x=1, x=0, X=199, y=0, Y=1] [L31] EXPR counter++ VAL [counter=3, counter++=2, v=-193, x=2, X=199, x=0, x=1, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=3, v=-193, x=0, x=2, x=2, X=199, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=3] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=3, v=-193, X=199, x=2, x=0, x=2, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=3, v=-193, x=0, x=2, x=2, X=199, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=3, v=-191, x=2, x=2, x=0, X=199, y=0, Y=1] [L45] x++ VAL [counter=3, v=-191, X=199, x=3, x=0, x=2, Y=1, y=0] [L31] EXPR counter++ VAL [counter=4, counter++=3, v=-191, x=2, X=199, x=3, x=0, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=4, v=-191, x=0, X=199, x=3, x=3, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=4] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=4, v=-191, x=3, X=199, x=0, x=3, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=4, v=-191, X=199, x=0, x=3, x=3, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=4, v=-189, x=3, X=199, x=0, x=3, Y=1, y=0] [L45] x++ VAL [counter=4, v=-189, x=3, x=4, x=0, X=199, Y=1, y=0] [L31] EXPR counter++ VAL [counter=5, counter++=4, v=-189, x=4, x=0, x=3, X=199, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=5, v=-189, x=4, x=0, X=199, x=4, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=5] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=5, v=-189, x=0, X=199, x=4, x=4, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=5, v=-189, x=4, x=0, X=199, x=4, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=5, v=-187, x=4, X=199, x=4, x=0, Y=1, y=0] [L45] x++ VAL [counter=5, v=-187, x=4, X=199, x=0, x=5, Y=1, y=0] [L31] EXPR counter++ VAL [counter=6, counter++=5, v=-187, x=4, x=0, x=5, X=199, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=6, v=-187, x=0, x=5, X=199, 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=-187, x=5, x=0, X=199, x=5, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=6, v=-187, x=5, x=5, x=0, X=199, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=6, v=-185, X=199, x=0, x=5, x=5, y=0, Y=1] [L45] x++ VAL [counter=6, v=-185, x=5, x=6, X=199, x=0, y=0, Y=1] [L31] EXPR counter++ VAL [counter=7, counter++=6, v=-185, x=0, X=199, x=6, x=5, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=7, v=-185, x=6, x=6, x=0, X=199, y=0, Y=1] [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=-185, X=199, x=0, x=6, x=6, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=7, v=-185, x=0, x=6, X=199, x=6, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=7, v=-183, X=199, x=0, x=6, x=6, y=0, Y=1] [L45] x++ VAL [counter=7, v=-183, x=7, X=199, x=6, x=0, Y=1, y=0] [L31] EXPR counter++ VAL [counter=8, counter++=7, v=-183, x=0, X=199, x=6, x=7, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=8, v=-183, x=0, X=199, x=7, x=7, 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=-183, x=7, X=199, x=0, x=7, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=8, v=-183, x=7, x=0, x=7, X=199, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=8, v=-181, x=0, x=7, X=199, x=7, y=0, Y=1] [L45] x++ VAL [counter=8, v=-181, X=199, x=7, x=8, x=0, Y=1, y=0] [L31] EXPR counter++ VAL [counter=9, counter++=8, v=-181, x=8, X=199, x=7, x=0, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=9, v=-181, x=0, x=8, X=199, x=8, 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=-181, x=0, X=199, x=8, x=8, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=9, v=-181, x=8, x=0, X=199, x=8, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=9, v=-179, X=199, x=8, x=8, x=0, Y=1, y=0] [L45] x++ VAL [counter=9, v=-179, x=0, X=199, x=9, x=8, y=0, Y=1] [L31] EXPR counter++ VAL [counter=10, counter++=9, v=-179, x=8, X=199, x=0, x=9, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=10, v=-179, x=9, X=199, 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=-179, X=199, x=0, x=9, x=9, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=10, v=-179, x=9, x=9, x=0, X=199, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=10, v=-177, x=9, x=0, x=9, X=199, Y=1, y=0] [L45] x++ VAL [counter=10, v=-177, x=0, x=10, X=199, x=9, Y=1, y=0] [L31] EXPR counter++ VAL [counter=11, counter++=10, v=-177, x=9, x=10, x=0, X=199, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=11, v=-177, x=10, x=0, x=10, X=199, 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=-177, x=10, X=199, x=0, x=10, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=11, v=-177, X=199, x=10, x=10, x=0, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=11, v=-175, x=0, x=10, X=199, x=10, y=0, Y=1] [L45] x++ VAL [counter=11, v=-175, x=11, x=0, X=199, x=10, Y=1, y=0] [L31] EXPR counter++ VAL [counter=12, counter++=11, v=-175, x=10, x=11, X=199, x=0, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=12, v=-175, X=199, x=11, x=0, x=11, y=0, Y=1] [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=-175, x=0, x=11, x=11, X=199, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=12, v=-175, x=11, X=199, x=0, x=11, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=12, v=-173, x=11, x=0, x=11, X=199, y=0, Y=1] [L45] x++ VAL [counter=12, v=-173, x=11, x=0, X=199, x=12, Y=1, y=0] [L31] EXPR counter++ VAL [counter=13, counter++=12, v=-173, x=11, X=199, x=0, x=12, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=13, v=-173, x=0, x=12, x=12, X=199, 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=-173, x=12, X=199, x=12, x=0, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=13, v=-173, x=12, x=12, X=199, x=0, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=13, v=-171, x=12, X=199, x=0, x=12, y=0, Y=1] [L45] x++ VAL [counter=13, v=-171, X=199, x=13, x=0, x=12, Y=1, y=0] [L31] EXPR counter++ VAL [counter=14, counter++=13, v=-171, X=199, x=0, x=13, x=12, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=14, v=-171, x=13, x=0, X=199, x=13, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=14] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=14, v=-171, x=13, x=13, X=199, x=0, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=14, v=-171, x=0, x=13, x=13, X=199, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=14, v=-169, x=13, x=13, x=0, X=199, Y=1, y=0] [L45] x++ VAL [counter=14, v=-169, x=13, X=199, x=14, x=0, y=0, Y=1] [L31] EXPR counter++ VAL [counter=15, counter++=14, v=-169, X=199, x=13, x=14, x=0, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=15, v=-169, X=199, x=14, x=0, 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=-169, x=14, x=14, x=0, X=199, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=15, v=-169, x=0, x=14, X=199, x=14, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=15, v=-167, x=0, x=14, x=14, X=199, y=0, Y=1] [L45] x++ VAL [counter=15, v=-167, x=15, x=0, x=14, X=199, y=0, Y=1] [L31] EXPR counter++ VAL [counter=16, counter++=15, v=-167, x=14, x=0, x=15, X=199, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=16, v=-167, x=15, x=0, X=199, 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=-167, x=15, X=199, x=15, x=0, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=16, v=-167, x=15, x=0, x=15, X=199, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=16, v=-165, x=15, x=15, X=199, x=0, Y=1, y=0] [L45] x++ VAL [counter=16, v=-165, X=199, x=16, x=0, x=15, Y=1, y=0] [L31] EXPR counter++ VAL [counter=17, counter++=16, v=-165, X=199, x=15, x=16, x=0, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=17, v=-165, x=16, x=0, X=199, x=16, 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=-165, x=16, x=0, X=199, x=16, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=17, v=-165, X=199, x=16, x=0, x=16, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=17, v=-163, x=16, x=16, X=199, x=0, y=0, Y=1] [L45] x++ VAL [counter=17, v=-163, x=16, X=199, x=17, x=0, Y=1, y=0] [L31] EXPR counter++ VAL [counter=18, counter++=17, v=-163, x=17, x=16, X=199, x=0, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=18, v=-163, x=17, x=17, x=0, X=199, y=0, Y=1] [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=-163, X=199, x=17, x=0, x=17, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=18, v=-163, x=17, x=17, X=199, x=0, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=18, v=-161, X=199, x=17, x=0, x=17, y=0, Y=1] [L45] x++ VAL [counter=18, v=-161, x=0, x=18, X=199, x=17, y=0, Y=1] [L31] EXPR counter++ VAL [counter=19, counter++=18, v=-161, x=17, x=18, X=199, x=0, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=19, v=-161, x=18, x=0, X=199, 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=-161, x=18, x=18, X=199, x=0, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=19, v=-161, x=18, x=18, x=0, X=199, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=19, v=-159, x=18, x=18, X=199, x=0, y=0, Y=1] [L45] x++ VAL [counter=19, v=-159, X=199, x=19, x=0, x=18, y=0, Y=1] [L31] EXPR counter++ VAL [counter=20, counter++=19, v=-159, x=19, X=199, x=18, x=0, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=20, v=-159, x=19, x=19, x=0, X=199, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=20] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=20, v=-159, x=0, X=199, x=19, x=19, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=20, v=-159, x=19, x=19, x=0, X=199, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=20, v=-157, x=19, x=0, X=199, x=19, Y=1, y=0] [L45] x++ VAL [counter=20, v=-157, X=199, x=0, x=20, x=19, y=0, Y=1] [L31] EXPR counter++ VAL [counter=21, counter++=20, v=-157, x=0, x=20, X=199, x=19, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=21, v=-157, x=20, X=199, x=0, x=20, 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=-157, X=199, x=20, x=20, x=0, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=21, v=-157, x=20, x=20, X=199, x=0, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=21, v=-155, x=0, x=20, x=20, X=199, y=0, Y=1] [L45] x++ VAL [counter=21, v=-155, X=199, x=0, x=20, x=21, y=0, Y=1] [L31] EXPR counter++ VAL [counter=22, counter++=21, v=-155, x=20, X=199, x=21, x=0, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=22, v=-155, x=0, x=21, X=199, x=21, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=22] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=22, v=-155, x=21, X=199, x=0, x=21, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=22, v=-155, x=21, x=0, x=21, X=199, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=22, v=-153, x=0, x=21, x=21, X=199, y=0, Y=1] [L45] x++ VAL [counter=22, v=-153, x=22, x=21, X=199, x=0, Y=1, y=0] [L31] EXPR counter++ VAL [counter=23, counter++=22, v=-153, x=21, x=0, x=22, X=199, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=23, v=-153, x=22, x=0, X=199, x=22, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=23] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=23, v=-153, x=0, x=22, X=199, x=22, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=23, v=-153, x=22, X=199, x=0, x=22, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=23, v=-151, x=22, x=22, X=199, x=0, Y=1, y=0] [L45] x++ VAL [counter=23, v=-151, x=23, x=22, X=199, x=0, Y=1, y=0] [L31] EXPR counter++ VAL [counter=24, counter++=23, v=-151, X=199, x=0, x=23, x=22, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=24, v=-151, x=0, x=23, X=199, x=23, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=24] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=24, v=-151, X=199, x=23, x=23, x=0, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=24, v=-151, x=23, x=23, x=0, X=199, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=24, v=-149, x=23, X=199, x=0, x=23, Y=1, y=0] [L45] x++ VAL [counter=24, v=-149, x=24, x=0, X=199, x=23, Y=1, y=0] [L31] EXPR counter++ VAL [counter=25, counter++=24, v=-149, x=24, x=23, x=0, X=199, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=25, v=-149, x=24, x=0, X=199, x=24, 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=-149, X=199, x=0, x=24, x=24, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=25, v=-149, X=199, x=24, x=0, x=24, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=25, v=-147, x=0, x=24, X=199, x=24, y=0, Y=1] [L45] x++ VAL [counter=25, v=-147, x=0, x=24, x=25, X=199, Y=1, y=0] [L31] EXPR counter++ VAL [counter=26, counter++=25, v=-147, x=0, x=25, X=199, x=24, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=26, v=-147, x=25, x=25, X=199, 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=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=-147, X=199, x=25, x=25, x=0, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=26, v=-147, x=0, x=25, x=25, X=199, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=26, v=-145, X=199, x=25, x=25, x=0, Y=1, y=0] [L45] x++ VAL [counter=26, v=-145, x=25, X=199, x=26, x=0, y=0, Y=1] [L31] EXPR counter++ VAL [counter=27, counter++=26, v=-145, x=26, x=0, x=25, X=199, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=27, v=-145, x=26, X=199, x=0, 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=-145, x=26, X=199, x=0, x=26, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=27, v=-145, x=0, X=199, x=26, x=26, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=27, v=-143, x=0, X=199, x=26, x=26, y=0, Y=1] [L45] x++ VAL [counter=27, v=-143, x=27, x=0, x=26, X=199, y=0, Y=1] [L31] EXPR counter++ VAL [counter=28, counter++=27, v=-143, X=199, x=27, x=0, x=26, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=28, v=-143, x=0, X=199, x=27, 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=-143, x=0, x=27, X=199, x=27, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=28, v=-143, x=27, x=0, x=27, X=199, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=28, v=-141, x=27, x=0, x=27, X=199, y=0, Y=1] [L45] x++ VAL [counter=28, v=-141, X=199, x=0, x=27, x=28, y=0, Y=1] [L31] EXPR counter++ VAL [counter=29, counter++=28, v=-141, X=199, x=28, x=0, x=27, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=29, v=-141, x=28, X=199, x=28, 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=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=-141, x=28, X=199, x=28, x=0, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=29, v=-141, x=28, x=0, x=28, X=199, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=29, v=-139, X=199, x=0, x=28, x=28, Y=1, y=0] [L45] x++ VAL [counter=29, v=-139, X=199, x=28, x=0, x=29, y=0, Y=1] [L31] EXPR counter++ VAL [counter=30, counter++=29, v=-139, x=28, x=29, x=0, X=199, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=30, v=-139, x=0, x=29, X=199, 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=-139, x=0, x=29, x=29, X=199, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=30, v=-139, x=0, x=29, X=199, x=29, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=30, v=-137, X=199, x=29, x=0, x=29, y=0, Y=1] [L45] x++ VAL [counter=30, v=-137, x=29, x=0, X=199, x=30, Y=1, y=0] [L31] EXPR counter++ VAL [counter=31, counter++=30, v=-137, x=29, x=0, x=30, X=199, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=31, v=-137, X=199, x=30, x=0, 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=-137, X=199, x=30, x=30, x=0, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=31, v=-137, x=0, x=30, X=199, x=30, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=31, v=-135, X=199, x=0, x=30, x=30, Y=1, y=0] [L45] x++ VAL [counter=31, v=-135, x=31, x=0, X=199, x=30, y=0, Y=1] [L31] EXPR counter++ VAL [counter=32, counter++=31, v=-135, x=0, x=31, X=199, x=30, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=32, v=-135, x=31, X=199, x=0, x=31, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=32] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=32, v=-135, x=0, x=31, X=199, x=31, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=32, v=-135, x=31, x=0, x=31, X=199, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=32, v=-133, X=199, x=31, x=0, x=31, y=0, Y=1] [L45] x++ VAL [counter=32, v=-133, X=199, x=32, x=0, x=31, Y=1, y=0] [L31] EXPR counter++ VAL [counter=33, counter++=32, v=-133, x=32, x=31, x=0, X=199, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=33, v=-133, x=0, X=199, x=32, x=32, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=33] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=33, v=-133, x=0, X=199, x=32, x=32, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=33, v=-133, X=199, x=32, x=0, x=32, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=33, v=-131, X=199, x=32, x=32, x=0, Y=1, y=0] [L45] x++ VAL [counter=33, v=-131, x=33, x=32, x=0, X=199, y=0, Y=1] [L31] EXPR counter++ VAL [counter=34, counter++=33, v=-131, x=33, X=199, x=32, x=0, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=34, v=-131, x=0, x=33, X=199, 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=-131, x=33, x=33, X=199, x=0, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=34, v=-131, x=0, x=33, x=33, X=199, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=34, v=-129, x=33, X=199, x=0, x=33, y=0, Y=1] [L45] x++ VAL [counter=34, v=-129, X=199, x=34, x=0, x=33, y=0, Y=1] [L31] EXPR counter++ VAL [counter=35, counter++=34, v=-129, x=0, X=199, x=33, x=34, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=35, v=-129, X=199, 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=-129, x=34, x=34, x=0, X=199, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=35, v=-129, x=0, x=34, x=34, X=199, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=35, v=-127, x=34, x=34, X=199, x=0, y=0, Y=1] [L45] x++ VAL [counter=35, v=-127, x=34, x=35, x=0, X=199, y=0, Y=1] [L31] EXPR counter++ VAL [counter=36, counter++=35, v=-127, x=35, x=34, x=0, X=199, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=36, v=-127, x=35, x=35, x=0, X=199, y=0, Y=1] [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=-127, X=199, x=35, x=0, x=35, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=36, v=-127, x=35, x=0, X=199, x=35, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=36, v=-125, x=35, x=35, x=0, X=199, y=0, Y=1] [L45] x++ VAL [counter=36, v=-125, x=36, X=199, x=35, x=0, y=0, Y=1] [L31] EXPR counter++ VAL [counter=37, counter++=36, v=-125, x=0, x=36, X=199, x=35, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=37, v=-125, x=36, X=199, x=36, 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=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=-125, x=36, x=0, X=199, x=36, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=37, v=-125, X=199, x=0, x=36, x=36, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=37, v=-123, x=36, x=0, X=199, x=36, Y=1, y=0] [L45] x++ VAL [counter=37, v=-123, X=199, x=0, x=36, x=37, Y=1, y=0] [L31] EXPR counter++ VAL [counter=38, counter++=37, v=-123, x=37, X=199, x=0, x=36, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=38, v=-123, x=37, X=199, x=0, 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=-123, x=0, x=37, x=37, X=199, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=38, v=-123, X=199, x=37, x=37, x=0, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=38, v=-121, x=37, x=37, X=199, x=0, Y=1, y=0] [L45] x++ VAL [counter=38, v=-121, x=0, x=38, X=199, x=37, y=0, Y=1] [L31] EXPR counter++ VAL [counter=39, counter++=38, v=-121, x=37, X=199, x=0, x=38, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=39, v=-121, x=38, X=199, 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=-121, X=199, x=38, x=0, x=38, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=39, v=-121, x=0, x=38, x=38, X=199, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=39, v=-119, x=38, X=199, x=0, x=38, Y=1, y=0] [L45] x++ VAL [counter=39, v=-119, x=38, X=199, x=0, x=39, Y=1, y=0] [L31] EXPR counter++ VAL [counter=40, counter++=39, v=-119, x=0, X=199, x=39, x=38, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=40, v=-119, x=0, x=39, X=199, x=39, y=0, Y=1] [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=-119, x=0, X=199, x=39, x=39, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=40, v=-119, x=0, x=39, x=39, X=199, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=40, v=-117, x=0, x=39, x=39, X=199, Y=1, y=0] [L45] x++ VAL [counter=40, v=-117, X=199, x=40, x=39, x=0, Y=1, y=0] [L31] EXPR counter++ VAL [counter=41, counter++=40, v=-117, x=0, x=39, X=199, x=40, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=41, v=-117, X=199, x=40, x=0, x=40, Y=1, y=0] [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=-117, x=40, x=40, x=0, X=199, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=41, v=-117, x=40, X=199, x=0, x=40, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=41, v=-115, x=0, x=40, x=40, X=199, y=0, Y=1] [L45] x++ VAL [counter=41, v=-115, x=40, x=41, X=199, x=0, Y=1, y=0] [L31] EXPR counter++ VAL [counter=42, counter++=41, v=-115, x=40, x=41, x=0, X=199, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=42, v=-115, x=41, x=0, X=199, x=41, y=0, Y=1] [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=-115, x=41, X=199, x=41, x=0, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=42, v=-115, x=41, X=199, x=0, x=41, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=42, v=-113, x=0, X=199, x=41, x=41, Y=1, y=0] [L45] x++ VAL [counter=42, v=-113, x=0, x=42, x=41, X=199, Y=1, y=0] [L31] EXPR counter++ VAL [counter=43, counter++=42, v=-113, x=41, x=0, x=42, X=199, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=43, v=-113, x=42, x=0, X=199, 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=-113, x=42, X=199, x=0, x=42, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=43, v=-113, x=42, x=42, x=0, X=199, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=43, v=-111, x=42, X=199, x=0, x=42, y=0, Y=1] [L45] x++ VAL [counter=43, v=-111, x=0, X=199, x=42, x=43, Y=1, y=0] [L31] EXPR counter++ VAL [counter=44, counter++=43, v=-111, X=199, x=42, x=0, x=43, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=44, v=-111, x=0, x=43, X=199, x=43, y=0, Y=1] [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=-111, x=0, x=43, x=43, X=199, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=44, v=-111, x=43, X=199, x=43, x=0, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=44, v=-109, x=43, x=0, X=199, x=43, Y=1, y=0] [L45] x++ VAL [counter=44, v=-109, x=43, x=0, X=199, x=44, y=0, Y=1] [L31] EXPR counter++ VAL [counter=45, counter++=44, v=-109, X=199, x=43, x=0, x=44, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=45, v=-109, x=0, x=44, x=44, X=199, 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=-109, x=44, x=0, x=44, X=199, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=45, v=-109, x=0, x=44, X=199, x=44, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=45, v=-107, X=199, x=44, x=0, x=44, y=0, Y=1] [L45] x++ VAL [counter=45, v=-107, x=44, x=45, x=0, X=199, Y=1, y=0] [L31] EXPR counter++ VAL [counter=46, counter++=45, v=-107, X=199, x=44, x=0, x=45, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=46, v=-107, x=0, x=45, x=45, X=199, 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=-107, X=199, x=45, x=0, x=45, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=46, v=-107, x=45, X=199, x=0, x=45, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=46, v=-105, x=45, x=45, x=0, X=199, y=0, Y=1] [L45] x++ VAL [counter=46, v=-105, x=45, x=46, X=199, x=0, y=0, Y=1] [L31] EXPR counter++ VAL [counter=47, counter++=46, v=-105, x=0, X=199, x=45, x=46, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=47, v=-105, x=0, x=46, X=199, 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=-105, x=0, x=46, x=46, X=199, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=47, v=-105, x=46, X=199, x=0, x=46, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=47, v=-103, X=199, x=46, x=0, x=46, Y=1, y=0] [L45] x++ VAL [counter=47, v=-103, x=47, x=46, x=0, X=199, y=0, Y=1] [L31] EXPR counter++ VAL [counter=48, counter++=47, v=-103, x=46, x=0, X=199, x=47, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=48, v=-103, X=199, x=47, x=47, 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=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=-103, x=0, X=199, x=47, x=47, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=48, v=-103, x=0, X=199, x=47, x=47, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=48, v=-101, x=47, x=0, X=199, x=47, y=0, Y=1] [L45] x++ VAL [counter=48, v=-101, X=199, x=0, x=47, x=48, y=0, Y=1] [L31] EXPR counter++ VAL [counter=49, counter++=48, v=-101, x=48, x=47, X=199, x=0, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=49, v=-101, X=199, x=48, x=48, 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=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=-101, x=48, X=199, x=0, x=48, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=49, v=-101, X=199, x=48, x=48, x=0, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=49, v=-99, x=48, X=199, x=48, x=0, Y=1, y=0] [L45] x++ VAL [counter=49, v=-99, x=49, x=48, x=0, X=199, Y=1, y=0] [L31] EXPR counter++ VAL [counter=50, counter++=49, v=-99, x=49, x=0, x=48, X=199, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=50, v=-99, x=49, X=199, x=0, x=49, 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=-99, x=49, x=49, X=199, x=0, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=50, v=-99, x=49, x=49, x=0, X=199, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=50, v=-97, X=199, x=49, x=0, x=49, Y=1, y=0] [L45] x++ VAL [counter=50, v=-97, x=49, X=199, x=50, x=0, y=0, Y=1] [L31] EXPR counter++ VAL [counter=51, counter++=50, v=-97, x=49, x=50, x=0, X=199, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=51, v=-97, x=50, X=199, x=50, 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=51] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=51] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=51, v=-97, x=50, X=199, x=0, x=50, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=51, v=-97, x=50, X=199, x=0, x=50, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=51, v=-95, X=199, x=50, x=0, x=50, Y=1, y=0] [L45] x++ VAL [counter=51, v=-95, x=0, x=51, x=50, X=199, Y=1, y=0] [L31] EXPR counter++ VAL [counter=52, counter++=51, v=-95, x=51, X=199, x=0, x=50, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=52, v=-95, x=51, x=51, X=199, 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=52] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=52] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=52, v=-95, X=199, x=51, x=0, x=51, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=52, v=-95, X=199, x=51, x=0, x=51, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=52, v=-93, x=51, x=0, x=51, X=199, y=0, Y=1] [L45] x++ VAL [counter=52, v=-93, x=0, x=52, X=199, x=51, y=0, Y=1] [L31] EXPR counter++ VAL [counter=53, counter++=52, v=-93, x=51, x=0, X=199, x=52, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=53, v=-93, x=52, x=0, X=199, x=52, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=53] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=53] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=53, v=-93, X=199, x=52, x=0, x=52, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=53, v=-93, x=0, x=52, X=199, x=52, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=53, v=-91, X=199, x=0, x=52, x=52, Y=1, y=0] [L45] x++ VAL [counter=53, v=-91, x=53, x=52, X=199, x=0, Y=1, y=0] [L31] EXPR counter++ VAL [counter=54, counter++=53, v=-91, x=53, X=199, x=0, x=52, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=54, v=-91, x=0, x=53, x=53, X=199, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=54] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=54] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=54, v=-91, x=53, x=0, X=199, x=53, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=54, v=-91, X=199, x=0, x=53, x=53, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=54, v=-89, X=199, x=53, x=53, x=0, Y=1, y=0] [L45] x++ VAL [counter=54, v=-89, x=54, x=53, x=0, X=199, Y=1, y=0] [L31] EXPR counter++ VAL [counter=55, counter++=54, v=-89, x=53, x=54, X=199, x=0, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=55, v=-89, X=199, x=54, x=0, x=54, y=0, Y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=55] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=55] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=55, v=-89, x=54, x=0, x=54, X=199, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=55, v=-89, x=54, X=199, x=0, x=54, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=55, v=-87, x=54, X=199, x=0, x=54, Y=1, y=0] [L45] x++ VAL [counter=55, v=-87, X=199, x=54, x=55, x=0, Y=1, y=0] [L31] EXPR counter++ VAL [counter=56, counter++=55, v=-87, x=0, x=55, x=54, X=199, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=56, v=-87, X=199, x=55, x=0, x=55, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=56] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=56] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=56, v=-87, x=55, x=0, X=199, x=55, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=56, v=-87, x=55, x=0, x=55, X=199, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=56, v=-85, x=0, x=55, X=199, x=55, Y=1, y=0] [L45] x++ VAL [counter=56, v=-85, X=199, x=0, x=55, x=56, y=0, Y=1] [L31] EXPR counter++ VAL [counter=57, counter++=56, v=-85, X=199, x=0, x=56, x=55, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=57, v=-85, x=0, x=56, X=199, x=56, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=57] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=57] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=57, v=-85, x=56, X=199, x=56, x=0, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=57, v=-85, x=0, x=56, X=199, x=56, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=57, v=-83, x=56, x=56, x=0, X=199, y=0, Y=1] [L45] x++ VAL [counter=57, v=-83, x=57, x=56, x=0, X=199, y=0, Y=1] [L31] EXPR counter++ VAL [counter=58, counter++=57, v=-83, X=199, x=57, x=56, x=0, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=58, v=-83, x=57, X=199, x=57, 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=58] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=58] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=58, v=-83, x=0, x=57, x=57, X=199, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=58, v=-83, x=57, x=0, X=199, x=57, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=58, v=-81, x=0, X=199, x=57, x=57, y=0, Y=1] [L45] x++ VAL [counter=58, v=-81, x=0, x=58, X=199, x=57, Y=1, y=0] [L31] EXPR counter++ VAL [counter=59, counter++=58, v=-81, x=0, x=58, X=199, x=57, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=59, v=-81, X=199, x=0, x=58, x=58, y=0, Y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=59] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=59] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=59, v=-81, x=0, x=58, x=58, X=199, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=59, v=-81, x=0, x=58, X=199, x=58, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=59, v=-79, x=58, X=199, x=0, x=58, Y=1, y=0] [L45] x++ VAL [counter=59, v=-79, X=199, x=0, x=58, x=59, Y=1, y=0] [L31] EXPR counter++ VAL [counter=60, counter++=59, v=-79, x=58, X=199, x=59, x=0, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=60, v=-79, x=0, x=59, X=199, x=59, y=0, Y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=60] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=60] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=60, v=-79, x=59, x=59, X=199, x=0, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=60, v=-79, x=59, x=59, x=0, X=199, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=60, v=-77, x=0, x=59, x=59, X=199, Y=1, y=0] [L45] x++ VAL [counter=60, v=-77, x=0, x=60, X=199, x=59, y=0, Y=1] [L31] EXPR counter++ VAL [counter=61, counter++=60, v=-77, x=60, X=199, x=59, x=0, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=61, v=-77, x=0, x=60, x=60, X=199, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=61] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=61] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=61, v=-77, x=0, x=60, x=60, X=199, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=61, v=-77, x=0, x=60, x=60, X=199, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=61, v=-75, X=199, x=60, x=60, x=0, Y=1, y=0] [L45] x++ VAL [counter=61, v=-75, x=61, X=199, x=60, x=0, Y=1, y=0] [L31] EXPR counter++ VAL [counter=62, counter++=61, v=-75, x=61, x=60, x=0, X=199, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=62, v=-75, x=61, X=199, x=0, x=61, y=0, Y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=62] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=62] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=62, v=-75, x=0, x=61, X=199, x=61, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=62, v=-75, x=61, X=199, x=61, x=0, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=62, v=-73, x=61, X=199, x=61, x=0, y=0, Y=1] [L45] x++ VAL [counter=62, v=-73, x=61, X=199, x=62, x=0, y=0, Y=1] [L31] EXPR counter++ VAL [counter=63, counter++=62, v=-73, x=0, X=199, x=62, x=61, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=63, v=-73, x=62, X=199, x=62, 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=63] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=63] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=63, v=-73, x=0, x=62, X=199, x=62, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=63, v=-73, x=62, x=62, X=199, x=0, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=63, v=-71, x=62, X=199, x=62, x=0, y=0, Y=1] [L45] x++ VAL [counter=63, v=-71, x=0, x=62, x=63, X=199, Y=1, y=0] [L31] EXPR counter++ VAL [counter=64, counter++=63, v=-71, x=0, x=63, X=199, x=62, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=64, v=-71, X=199, x=63, x=0, x=63, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=64] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=64] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=64, v=-71, x=63, X=199, x=63, x=0, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=64, v=-71, x=63, x=63, X=199, x=0, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=64, v=-69, X=199, x=63, x=63, x=0, y=0, Y=1] [L45] x++ VAL [counter=64, v=-69, x=64, x=63, x=0, X=199, y=0, Y=1] [L31] EXPR counter++ VAL [counter=65, counter++=64, v=-69, X=199, x=63, x=0, x=64, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=65, v=-69, X=199, x=64, x=0, x=64, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=65] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=65] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=65, v=-69, X=199, x=0, x=64, x=64, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=65, v=-69, x=64, X=199, x=64, x=0, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=65, v=-67, x=64, X=199, x=0, x=64, y=0, Y=1] [L45] x++ VAL [counter=65, v=-67, x=65, x=0, x=64, X=199, Y=1, y=0] [L31] EXPR counter++ VAL [counter=66, counter++=65, v=-67, x=0, x=64, X=199, x=65, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=66, v=-67, X=199, x=0, x=65, x=65, y=0, Y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=66] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=66] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=66, v=-67, x=0, X=199, x=65, x=65, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=66, v=-67, x=65, x=0, x=65, X=199, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=66, v=-65, X=199, x=0, x=65, x=65, Y=1, y=0] [L45] x++ VAL [counter=66, v=-65, X=199, x=0, x=66, x=65, y=0, Y=1] [L31] EXPR counter++ VAL [counter=67, counter++=66, v=-65, x=0, x=66, x=65, X=199, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=67, v=-65, x=66, X=199, x=66, 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=67] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=67] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=67, v=-65, x=66, x=0, X=199, x=66, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=67, v=-65, x=0, x=66, X=199, x=66, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=67, v=-63, x=66, X=199, x=0, x=66, Y=1, y=0] [L45] x++ VAL [counter=67, v=-63, X=199, x=67, x=0, x=66, y=0, Y=1] [L31] EXPR counter++ VAL [counter=68, counter++=67, v=-63, x=66, x=67, X=199, x=0, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=68, v=-63, x=67, x=67, x=0, X=199, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=68] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=68] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=68, v=-63, x=0, x=67, X=199, x=67, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=68, v=-63, x=0, X=199, x=67, x=67, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=68, v=-61, X=199, x=67, x=67, x=0, Y=1, y=0] [L45] x++ VAL [counter=68, v=-61, x=68, X=199, x=0, x=67, y=0, Y=1] [L31] EXPR counter++ VAL [counter=69, counter++=68, v=-61, X=199, x=67, x=0, x=68, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=69, v=-61, x=0, x=68, x=68, X=199, y=0, Y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=69] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=69] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=69, v=-61, x=68, X=199, x=0, x=68, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=69, v=-61, x=0, X=199, x=68, x=68, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=69, v=-59, X=199, x=0, x=68, x=68, Y=1, y=0] [L45] x++ VAL [counter=69, v=-59, x=0, x=68, x=69, X=199, y=0, Y=1] [L31] EXPR counter++ VAL [counter=70, counter++=69, v=-59, x=0, X=199, x=68, x=69, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=70, v=-59, x=0, x=69, x=69, X=199, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=70] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=70] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=70, v=-59, x=69, x=0, x=69, X=199, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=70, v=-59, X=199, x=0, x=69, x=69, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=70, v=-57, x=0, x=69, x=69, X=199, Y=1, y=0] [L45] x++ VAL [counter=70, v=-57, X=199, x=70, x=69, x=0, Y=1, y=0] [L31] EXPR counter++ VAL [counter=71, counter++=70, v=-57, x=70, X=199, x=69, x=0, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=71, v=-57, X=199, x=70, x=0, x=70, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=71] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=71] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=71, v=-57, x=0, x=70, x=70, X=199, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=71, v=-57, x=0, x=70, x=70, X=199, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=71, v=-55, x=0, x=70, X=199, x=70, y=0, Y=1] [L45] x++ VAL [counter=71, v=-55, X=199, x=71, x=0, x=70, Y=1, y=0] [L31] EXPR counter++ VAL [counter=72, counter++=71, v=-55, x=70, x=0, x=71, X=199, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=72, v=-55, x=71, x=71, x=0, X=199, y=0, Y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=72] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=72] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=72, v=-55, x=71, X=199, x=0, x=71, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=72, v=-55, x=71, x=71, X=199, x=0, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=72, v=-53, x=71, X=199, x=0, x=71, Y=1, y=0] [L45] x++ VAL [counter=72, v=-53, X=199, x=0, x=71, x=72, y=0, Y=1] [L31] EXPR counter++ VAL [counter=73, counter++=72, v=-53, X=199, x=71, x=0, x=72, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=73, v=-53, x=72, x=0, X=199, x=72, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=73] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=73] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=73, v=-53, X=199, x=0, x=72, x=72, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=73, v=-53, x=72, X=199, x=72, x=0, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=73, v=-51, x=0, X=199, x=72, x=72, Y=1, y=0] [L45] x++ VAL [counter=73, v=-51, x=73, x=72, X=199, x=0, y=0, Y=1] [L31] EXPR counter++ VAL [counter=74, counter++=73, v=-51, X=199, x=72, x=73, x=0, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=74, v=-51, X=199, x=73, x=73, 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=74] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=74] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=74, v=-51, x=73, x=0, x=73, X=199, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=74, v=-51, x=73, X=199, x=73, x=0, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=74, v=-49, x=73, X=199, x=73, x=0, Y=1, y=0] [L45] x++ VAL [counter=74, v=-49, x=73, X=199, x=74, x=0, Y=1, y=0] [L31] EXPR counter++ VAL [counter=75, counter++=74, v=-49, X=199, x=74, x=0, x=73, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=75, v=-49, X=199, x=74, x=0, x=74, y=0, Y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=75] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=75] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=75, v=-49, X=199, x=74, x=0, x=74, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=75, v=-49, X=199, x=0, x=74, x=74, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=75, v=-47, X=199, x=74, x=0, x=74, y=0, Y=1] [L45] x++ VAL [counter=75, v=-47, x=74, x=75, x=0, X=199, Y=1, y=0] [L31] EXPR counter++ VAL [counter=76, counter++=75, v=-47, X=199, x=0, x=74, x=75, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=76, v=-47, x=0, X=199, x=75, x=75, y=0, Y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=76] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=76] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=76, v=-47, x=0, x=75, x=75, X=199, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=76, v=-47, x=75, X=199, x=0, x=75, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=76, v=-45, X=199, x=0, x=75, x=75, Y=1, y=0] [L45] x++ VAL [counter=76, v=-45, X=199, x=76, x=75, x=0, Y=1, y=0] [L31] EXPR counter++ VAL [counter=77, counter++=76, v=-45, X=199, x=0, x=75, x=76, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=77, v=-45, x=76, x=76, X=199, 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=77] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=77] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=77, v=-45, x=76, x=76, X=199, x=0, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=77, v=-45, x=76, x=76, X=199, x=0, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=77, v=-43, X=199, x=76, x=76, x=0, y=0, Y=1] [L45] x++ VAL [counter=77, v=-43, x=77, X=199, x=0, x=76, y=0, Y=1] [L31] EXPR counter++ VAL [counter=78, counter++=77, v=-43, x=77, x=76, x=0, X=199, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=78, v=-43, x=0, X=199, x=77, x=77, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=78] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=78] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=78, v=-43, x=77, x=0, X=199, x=77, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=78, v=-43, x=0, X=199, x=77, x=77, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=78, v=-41, x=0, x=77, X=199, x=77, Y=1, y=0] [L45] x++ VAL [counter=78, v=-41, x=0, X=199, x=77, x=78, y=0, Y=1] [L31] EXPR counter++ VAL [counter=79, counter++=78, v=-41, x=78, x=0, X=199, x=77, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=79, v=-41, x=78, x=0, x=78, X=199, y=0, Y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=79] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=79] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=79, v=-41, X=199, x=78, x=78, x=0, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=79, v=-41, x=78, x=78, X=199, x=0, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=79, v=-39, X=199, x=78, x=0, x=78, Y=1, y=0] [L45] x++ VAL [counter=79, v=-39, X=199, x=0, x=79, x=78, Y=1, y=0] [L31] EXPR counter++ VAL [counter=80, counter++=79, v=-39, X=199, x=0, x=78, x=79, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=80, v=-39, X=199, x=0, x=79, x=79, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=80] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=80] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=80, v=-39, X=199, x=0, x=79, x=79, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=80, v=-39, x=79, x=0, x=79, X=199, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=80, v=-37, x=0, x=79, X=199, x=79, y=0, Y=1] [L45] x++ VAL [counter=80, v=-37, x=79, x=0, x=80, X=199, Y=1, y=0] [L31] EXPR counter++ VAL [counter=81, counter++=80, v=-37, X=199, x=80, x=0, x=79, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=81, v=-37, x=80, x=80, x=0, X=199, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=81] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=81] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=81, v=-37, x=0, X=199, x=80, x=80, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=81, v=-37, x=0, x=80, x=80, X=199, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=81, v=-35, x=0, X=199, x=80, x=80, y=0, Y=1] [L45] x++ VAL [counter=81, v=-35, x=0, X=199, x=80, x=81, Y=1, y=0] [L31] EXPR counter++ VAL [counter=82, counter++=81, v=-35, x=81, x=80, x=0, X=199, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=82, v=-35, x=0, x=81, x=81, X=199, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=82] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=82] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=82, v=-35, x=81, X=199, x=0, x=81, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=82, v=-35, x=0, x=81, X=199, x=81, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=82, v=-33, x=0, X=199, x=81, x=81, Y=1, y=0] [L45] x++ VAL [counter=82, v=-33, x=81, X=199, x=0, x=82, y=0, Y=1] [L31] EXPR counter++ VAL [counter=83, counter++=82, v=-33, x=81, x=82, x=0, X=199, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=83, v=-33, x=82, x=0, X=199, x=82, y=0, Y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=83] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=83] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=83, v=-33, x=82, X=199, x=82, x=0, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=83, v=-33, x=0, X=199, x=82, x=82, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=83, v=-31, X=199, x=82, x=82, x=0, Y=1, y=0] [L45] x++ VAL [counter=83, v=-31, X=199, x=82, x=83, x=0, Y=1, y=0] [L31] EXPR counter++ VAL [counter=84, counter++=83, v=-31, x=83, x=82, x=0, X=199, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=84, v=-31, x=83, X=199, x=0, x=83, y=0, Y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=84] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=84] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=84, v=-31, x=83, x=83, x=0, X=199, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=84, v=-31, x=83, x=0, x=83, X=199, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=84, v=-29, X=199, x=83, x=83, x=0, y=0, Y=1] [L45] x++ VAL [counter=84, v=-29, x=83, X=199, x=84, x=0, Y=1, y=0] [L31] EXPR counter++ VAL [counter=85, counter++=84, v=-29, x=0, X=199, x=83, x=84, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=85, v=-29, x=0, x=84, x=84, X=199, y=0, Y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=85] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=85] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=85, v=-29, x=84, X=199, x=0, x=84, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=85, v=-29, X=199, x=84, x=84, x=0, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=85, v=-27, X=199, x=0, x=84, x=84, y=0, Y=1] [L45] x++ VAL [counter=85, v=-27, x=84, x=0, x=85, X=199, y=0, Y=1] [L31] EXPR counter++ VAL [counter=86, counter++=85, v=-27, x=0, x=85, x=84, X=199, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=86, v=-27, x=85, x=85, X=199, 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=86] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=86] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=86, v=-27, x=0, x=85, X=199, x=85, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=86, v=-27, x=0, X=199, x=85, x=85, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=86, v=-25, x=85, x=85, x=0, X=199, Y=1, y=0] [L45] x++ VAL [counter=86, v=-25, x=86, X=199, x=0, x=85, y=0, Y=1] [L31] EXPR counter++ VAL [counter=87, counter++=86, v=-25, X=199, x=0, x=86, x=85, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=87, v=-25, X=199, x=86, x=86, 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=87] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=87] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=87, v=-25, x=86, x=86, x=0, X=199, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=87, v=-25, x=86, x=0, X=199, x=86, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=87, v=-23, X=199, x=86, x=0, x=86, y=0, Y=1] [L45] x++ VAL [counter=87, v=-23, x=0, x=87, X=199, x=86, Y=1, y=0] [L31] EXPR counter++ VAL [counter=88, counter++=87, v=-23, x=86, x=87, x=0, X=199, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=88, v=-23, x=87, x=87, x=0, X=199, y=0, Y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=88] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=88] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=88, v=-23, x=87, x=0, x=87, X=199, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=88, v=-23, x=0, x=87, x=87, X=199, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=88, v=-21, x=87, x=87, X=199, x=0, y=0, Y=1] [L45] x++ VAL [counter=88, v=-21, x=88, x=0, X=199, x=87, Y=1, y=0] [L31] EXPR counter++ VAL [counter=89, counter++=88, v=-21, X=199, x=87, x=0, x=88, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=89, v=-21, x=88, x=0, x=88, X=199, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=89] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=89] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=89, v=-21, x=88, X=199, x=0, x=88, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=89, v=-21, x=88, x=88, x=0, X=199, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=89, v=-19, x=88, x=88, x=0, X=199, Y=1, y=0] [L45] x++ VAL [counter=89, v=-19, X=199, x=0, x=89, x=88, y=0, Y=1] [L31] EXPR counter++ VAL [counter=90, counter++=89, v=-19, x=89, X=199, x=0, x=88, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=90, v=-19, x=0, x=89, x=89, X=199, y=0, Y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=90] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=90] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=90, v=-19, x=0, x=89, x=89, X=199, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=90, v=-19, x=89, x=89, x=0, X=199, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=90, v=-17, x=89, x=0, X=199, x=89, y=0, Y=1] [L45] x++ VAL [counter=90, v=-17, x=0, X=199, x=89, x=90, y=0, Y=1] [L31] EXPR counter++ VAL [counter=91, counter++=90, v=-17, X=199, x=89, x=90, x=0, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=91, v=-17, X=199, x=0, x=90, x=90, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=91] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=91] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=91, v=-17, x=90, X=199, x=90, x=0, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=91, v=-17, x=0, x=90, x=90, X=199, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=91, v=-15, x=90, X=199, x=0, x=90, Y=1, y=0] [L45] x++ VAL [counter=91, v=-15, X=199, x=90, x=0, x=91, y=0, Y=1] [L31] EXPR counter++ VAL [counter=92, counter++=91, v=-15, x=91, x=90, X=199, x=0, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=92, v=-15, x=91, x=91, x=0, X=199, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=92] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=92] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=92, v=-15, x=91, x=91, X=199, x=0, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=92, v=-15, X=199, x=91, x=0, x=91, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=92, v=-13, x=91, x=91, X=199, x=0, Y=1, y=0] [L45] x++ VAL [counter=92, v=-13, X=199, x=0, x=92, x=91, Y=1, y=0] [L31] EXPR counter++ VAL [counter=93, counter++=92, v=-13, x=0, x=92, x=91, X=199, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=93, v=-13, x=92, X=199, x=0, x=92, y=0, Y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=93] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=93] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=93, v=-13, X=199, x=92, x=0, x=92, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=93, v=-13, X=199, x=0, x=92, x=92, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=93, v=-11, x=92, x=0, X=199, x=92, y=0, Y=1] [L45] x++ VAL [counter=93, v=-11, X=199, x=0, x=93, x=92, Y=1, y=0] [L31] EXPR counter++ VAL [counter=94, counter++=93, v=-11, x=0, x=92, X=199, x=93, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=94, v=-11, x=0, x=93, x=93, X=199, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=94] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=94] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=94, v=-11, x=0, x=93, X=199, x=93, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=94, v=-11, x=93, x=0, x=93, X=199, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=94, v=-9, x=93, x=93, X=199, x=0, y=0, Y=1] [L45] x++ VAL [counter=94, v=-9, x=0, x=94, X=199, x=93, y=0, Y=1] [L31] EXPR counter++ VAL [counter=95, counter++=94, v=-9, X=199, x=0, x=93, x=94, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=95, v=-9, x=0, X=199, x=94, x=94, y=0, Y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=95] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=95] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=95, v=-9, x=94, x=0, X=199, x=94, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=95, v=-9, x=94, x=0, x=94, X=199, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=95, v=-7, X=199, x=0, x=94, x=94, Y=1, y=0] [L45] x++ VAL [counter=95, v=-7, x=0, X=199, x=94, x=95, Y=1, y=0] [L31] EXPR counter++ VAL [counter=96, counter++=95, v=-7, x=95, x=94, x=0, X=199, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=96, v=-7, X=199, x=95, x=95, 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=96] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=96] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=96, v=-7, x=0, x=95, X=199, x=95, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=96, v=-7, X=199, x=0, x=95, x=95, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=96, v=-5, x=95, x=0, X=199, x=95, Y=1, y=0] [L45] x++ VAL [counter=96, v=-5, x=95, x=96, X=199, x=0, y=0, Y=1] [L31] EXPR counter++ VAL [counter=97, counter++=96, v=-5, x=0, x=96, X=199, x=95, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=97, v=-5, x=0, x=96, x=96, X=199, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=97] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=97] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=97, v=-5, x=96, X=199, x=96, x=0, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=97, v=-5, x=96, x=96, X=199, x=0, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=97, v=-3, X=199, x=96, x=0, x=96, y=0, Y=1] [L45] x++ VAL [counter=97, v=-3, x=97, x=0, x=96, X=199, y=0, Y=1] [L31] EXPR counter++ VAL [counter=98, counter++=97, v=-3, x=96, x=97, X=199, x=0, Y=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=98, v=-3, x=97, X=199, x=0, x=97, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=98] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=98] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=98, v=-3, X=199, x=0, x=97, x=97, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=98, v=-3, x=97, x=0, x=97, X=199, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=98, v=-1, x=0, X=199, x=97, x=97, Y=1, y=0] [L45] x++ VAL [counter=98, v=-1, x=98, x=0, X=199, x=97, y=0, Y=1] [L31] EXPR counter++ VAL [counter=99, counter++=98, v=-1, x=0, x=97, X=199, x=98, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=99, v=-1, X=199, x=98, x=98, 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=99] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=99] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=99, v=-1, x=98, x=98, x=0, X=199, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=99, v=-1, x=0, x=98, X=199, x=98, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=99, v=1, X=199, x=0, x=98, x=98, y=0, Y=1] [L45] x++ VAL [counter=99, v=1, x=99, X=199, x=0, x=98, Y=1, y=0] [L31] EXPR counter++ VAL [counter=100, counter++=99, v=1, X=199, x=0, x=98, x=99, y=0, Y=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=100, v=1, x=0, x=99, X=199, 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=100] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=100] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=100, v=1, x=0, X=199, x=99, x=99, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=100, v=1, x=0, x=99, X=199, x=99, y=0, Y=1] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=100, v=-395, X=199, x=99, x=0, x=99, y=1, Y=1] [L45] x++ VAL [counter=100, v=-395, x=99, X=199, x=100, x=0, Y=1, y=1] [L31] EXPR counter++ VAL [counter=101, counter++=100, v=-395, x=0, X=199, x=99, x=100, y=1, Y=1] [L31] COND FALSE !(counter++<100) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [counter=101, v=-395, X=199, x=100, x=100, x=100, 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=101] [L14] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=101] [L16] reach_error() VAL [\old(cond)=0, cond=0, counter=101] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 70.9s, OverallIterations: 15, TraceHistogramMax: 101, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 38.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8 mSolverCounterUnknown, 4299 SdHoareTripleChecker+Valid, 18.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4294 mSDsluCounter, 3607 SdHoareTripleChecker+Invalid, 18.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 117 IncrementalHoareTripleChecker+Unchecked, 3130 mSDsCounter, 1125 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3062 IncrementalHoareTripleChecker+Invalid, 4312 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1125 mSolverCounterUnsat, 477 mSDtfsCounter, 3062 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4604 GetRequests, 3892 SyntacticMatches, 10 SemanticMatches, 702 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 12723 ImplicationChecksByTransitivity, 29.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2000occurred in iteration=14, InterpolantAutomatonStates: 668, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 97 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 23.1s InterpolantComputationTime, 3273 NumberOfCodeBlocks, 3043 NumberOfCodeBlocksAsserted, 115 NumberOfCheckSat, 4265 ConstructedInterpolants, 4 QuantifiedInterpolants, 12920 SizeOfPredicates, 220 NumberOfNonLiveVariables, 5366 ConjunctsInSsa, 507 ConjunctsInUnsatCore, 26 InterpolantComputations, 1 PerfectInterpolantSequences, 26161/117984 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! [2022-07-12 04:24:03,422 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