./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 d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1 --witnessprinter.witness.filename witness --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.3.0-dev-d790fec [2024-12-02 12:15:04,908 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 12:15:04,966 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-12-02 12:15:04,971 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 12:15:04,971 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 12:15:04,993 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 12:15:04,994 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 12:15:04,994 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 12:15:04,994 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 12:15:04,994 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 12:15:04,994 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 12:15:04,994 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 12:15:04,995 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 12:15:04,995 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 12:15:04,995 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 12:15:04,995 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 12:15:04,995 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 12:15:04,995 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 12:15:04,995 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 12:15:04,995 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 12:15:04,996 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 12:15:04,996 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 12:15:04,996 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 12:15:04,996 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 12:15:04,996 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 12:15:04,996 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 12:15:04,996 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 12:15:04,996 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 12:15:04,996 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 12:15:04,996 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 12:15:04,996 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 12:15:04,996 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 12:15:04,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 12:15:04,997 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 12:15:04,997 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 12:15:04,997 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 12:15:04,997 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 12:15:04,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 12:15:04,997 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 12:15:04,997 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 12:15:04,997 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 12:15:04,997 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 12:15:04,998 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 12:15:04,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 12:15:04,998 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 12:15:04,998 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 12:15:04,998 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 12:15:04,998 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 12:15:04,998 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 [2024-12-02 12:15:05,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 12:15:05,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 12:15:05,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 12:15:05,239 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 12:15:05,240 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 12:15:05,241 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c [2024-12-02 12:15:07,881 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/data/dfd452b2f/f094a7fef7f74967939be78b71e2b913/FLAGf6f709db6 [2024-12-02 12:15:08,081 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 12:15:08,082 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c [2024-12-02 12:15:08,087 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/data/dfd452b2f/f094a7fef7f74967939be78b71e2b913/FLAGf6f709db6 [2024-12-02 12:15:08,462 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/data/dfd452b2f/f094a7fef7f74967939be78b71e2b913 [2024-12-02 12:15:08,463 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 12:15:08,464 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 12:15:08,465 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 12:15:08,465 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 12:15:08,468 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 12:15:08,468 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:15:08" (1/1) ... [2024-12-02 12:15:08,469 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d152dc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:15:08, skipping insertion in model container [2024-12-02 12:15:08,469 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:15:08" (1/1) ... [2024-12-02 12:15:08,479 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 12:15:08,603 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c[597,610] [2024-12-02 12:15:08,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 12:15:08,628 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 12:15:08,638 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c[597,610] [2024-12-02 12:15:08,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 12:15:08,657 INFO L204 MainTranslator]: Completed translation [2024-12-02 12:15:08,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:15:08 WrapperNode [2024-12-02 12:15:08,658 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 12:15:08,658 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 12:15:08,658 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 12:15:08,659 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 12:15:08,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:15:08" (1/1) ... [2024-12-02 12:15:08,670 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:15:08" (1/1) ... [2024-12-02 12:15:08,683 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2024-12-02 12:15:08,683 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 12:15:08,684 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 12:15:08,684 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 12:15:08,684 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 12:15:08,691 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:15:08" (1/1) ... [2024-12-02 12:15:08,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:15:08" (1/1) ... [2024-12-02 12:15:08,692 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:15:08" (1/1) ... [2024-12-02 12:15:08,701 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-12-02 12:15:08,701 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:15:08" (1/1) ... [2024-12-02 12:15:08,702 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:15:08" (1/1) ... [2024-12-02 12:15:08,704 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:15:08" (1/1) ... [2024-12-02 12:15:08,705 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:15:08" (1/1) ... [2024-12-02 12:15:08,707 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:15:08" (1/1) ... [2024-12-02 12:15:08,708 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:15:08" (1/1) ... [2024-12-02 12:15:08,708 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:15:08" (1/1) ... [2024-12-02 12:15:08,710 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 12:15:08,710 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 12:15:08,710 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 12:15:08,711 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 12:15:08,711 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:15:08" (1/1) ... [2024-12-02 12:15:08,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 12:15:08,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:15:08,739 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 12:15:08,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 12:15:08,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 12:15:08,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 12:15:08,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 12:15:08,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 12:15:08,759 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-12-02 12:15:08,759 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-12-02 12:15:08,806 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 12:15:08,807 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 12:15:08,899 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-12-02 12:15:08,899 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 12:15:08,905 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 12:15:08,906 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-12-02 12:15:08,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:15:08 BoogieIcfgContainer [2024-12-02 12:15:08,906 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 12:15:08,908 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 12:15:08,908 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 12:15:08,911 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 12:15:08,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:15:08" (1/3) ... [2024-12-02 12:15:08,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bbb4d20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:15:08, skipping insertion in model container [2024-12-02 12:15:08,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:15:08" (2/3) ... [2024-12-02 12:15:08,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bbb4d20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:15:08, skipping insertion in model container [2024-12-02 12:15:08,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:15:08" (3/3) ... [2024-12-02 12:15:08,913 INFO L128 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound100.c [2024-12-02 12:15:08,925 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 12:15:08,927 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bresenham-ll_unwindbound100.c that has 2 procedures, 21 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-12-02 12:15:08,972 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 12:15:08,983 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4d51873c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 12:15:08,983 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-02 12:15:08,987 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 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) [2024-12-02 12:15:08,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-12-02 12:15:08,992 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:15:08,992 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:15:08,993 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:15:08,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:15:08,997 INFO L85 PathProgramCache]: Analyzing trace with hash 798370362, now seen corresponding path program 1 times [2024-12-02 12:15:09,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:15:09,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920809801] [2024-12-02 12:15:09,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:15:09,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:15:09,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:15:09,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:15:09,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:15:09,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920809801] [2024-12-02 12:15:09,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920809801] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:15:09,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:15:09,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 12:15:09,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829165218] [2024-12-02 12:15:09,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:15:09,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-02 12:15:09,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:15:09,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-02 12:15:09,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-02 12:15:09,129 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 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 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) [2024-12-02 12:15:09,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:15:09,140 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2024-12-02 12:15:09,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-02 12:15:09,141 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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 [2024-12-02 12:15:09,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:15:09,146 INFO L225 Difference]: With dead ends: 40 [2024-12-02 12:15:09,146 INFO L226 Difference]: Without dead ends: 17 [2024-12-02 12:15:09,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-02 12:15:09,151 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 12:15:09,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 12:15:09,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-12-02 12:15:09,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-12-02 12:15:09,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 12:15:09,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2024-12-02 12:15:09,172 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 8 [2024-12-02 12:15:09,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:15:09,172 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-12-02 12:15:09,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) [2024-12-02 12:15:09,172 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2024-12-02 12:15:09,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-02 12:15:09,173 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:15:09,173 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:15:09,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 12:15:09,173 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:15:09,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:15:09,174 INFO L85 PathProgramCache]: Analyzing trace with hash 295298814, now seen corresponding path program 1 times [2024-12-02 12:15:09,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:15:09,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290081440] [2024-12-02 12:15:09,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:15:09,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:15:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-02 12:15:09,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [368212875] [2024-12-02 12:15:09,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:15:09,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:15:09,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:15:09,198 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:15:09,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 12:15:09,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:15:09,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-12-02 12:15:09,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:15:09,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:15:09,399 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 12:15:09,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:15:09,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290081440] [2024-12-02 12:15:09,400 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-12-02 12:15:09,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368212875] [2024-12-02 12:15:09,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368212875] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:15:09,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:15:09,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 12:15:09,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22276402] [2024-12-02 12:15:09,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:15:09,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 12:15:09,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:15:09,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 12:15:09,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 12:15:09,402 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 12:15:09,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:15:09,507 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2024-12-02 12:15:09,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 12:15:09,508 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-12-02 12:15:09,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:15:09,509 INFO L225 Difference]: With dead ends: 32 [2024-12-02 12:15:09,509 INFO L226 Difference]: Without dead ends: 30 [2024-12-02 12:15:09,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-12-02 12:15:09,510 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 12:15:09,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 52 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 12:15:09,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-12-02 12:15:09,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2024-12-02 12:15:09,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.263157894736842) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-12-02 12:15:09,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-12-02 12:15:09,517 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 9 [2024-12-02 12:15:09,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:15:09,517 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-12-02 12:15:09,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 12:15:09,518 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-12-02 12:15:09,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-02 12:15:09,518 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:15:09,518 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:15:09,527 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 12:15:09,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:15:09,719 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:15:09,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:15:09,719 INFO L85 PathProgramCache]: Analyzing trace with hash 368316555, now seen corresponding path program 1 times [2024-12-02 12:15:09,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:15:09,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378094785] [2024-12-02 12:15:09,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:15:09,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:15:09,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:15:09,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:15:09,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:15:09,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378094785] [2024-12-02 12:15:09,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378094785] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:15:09,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:15:09,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 12:15:09,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922348930] [2024-12-02 12:15:09,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:15:09,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 12:15:09,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:15:09,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 12:15:09,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 12:15:09,784 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 12:15:09,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:15:09,800 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2024-12-02 12:15:09,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 12:15:09,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-12-02 12:15:09,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:15:09,802 INFO L225 Difference]: With dead ends: 33 [2024-12-02 12:15:09,802 INFO L226 Difference]: Without dead ends: 25 [2024-12-02 12:15:09,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 12:15:09,803 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 12:15:09,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 12:15:09,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-12-02 12:15:09,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-12-02 12:15:09,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-12-02 12:15:09,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2024-12-02 12:15:09,808 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 9 [2024-12-02 12:15:09,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:15:09,808 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2024-12-02 12:15:09,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 12:15:09,808 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2024-12-02 12:15:09,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-02 12:15:09,809 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:15:09,809 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:15:09,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 12:15:09,809 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:15:09,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:15:09,810 INFO L85 PathProgramCache]: Analyzing trace with hash -156697420, now seen corresponding path program 1 times [2024-12-02 12:15:09,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:15:09,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33582787] [2024-12-02 12:15:09,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:15:09,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:15:09,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-02 12:15:09,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1499761637] [2024-12-02 12:15:09,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:15:09,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:15:09,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:15:09,837 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:15:09,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 12:15:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:15:09,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-12-02 12:15:09,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:15:10,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:15:10,005 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 12:15:10,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:15:10,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33582787] [2024-12-02 12:15:10,005 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-12-02 12:15:10,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499761637] [2024-12-02 12:15:10,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499761637] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:15:10,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:15:10,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 12:15:10,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354399062] [2024-12-02 12:15:10,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:15:10,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 12:15:10,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:15:10,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 12:15:10,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 12:15:10,007 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 12:15:10,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:15:10,088 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2024-12-02 12:15:10,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 12:15:10,089 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-12-02 12:15:10,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:15:10,089 INFO L225 Difference]: With dead ends: 35 [2024-12-02 12:15:10,089 INFO L226 Difference]: Without dead ends: 27 [2024-12-02 12:15:10,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-12-02 12:15:10,090 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 12:15:10,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 52 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 12:15:10,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-12-02 12:15:10,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2024-12-02 12:15:10,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 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) [2024-12-02 12:15:10,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2024-12-02 12:15:10,095 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 16 [2024-12-02 12:15:10,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:15:10,095 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2024-12-02 12:15:10,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 12:15:10,095 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2024-12-02 12:15:10,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-02 12:15:10,096 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:15:10,096 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:15:10,104 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-12-02 12:15:10,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:15:10,296 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:15:10,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:15:10,297 INFO L85 PathProgramCache]: Analyzing trace with hash -716773380, now seen corresponding path program 1 times [2024-12-02 12:15:10,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:15:10,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544965382] [2024-12-02 12:15:10,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:15:10,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:15:10,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-02 12:15:10,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1948773427] [2024-12-02 12:15:10,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:15:10,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:15:10,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:15:10,314 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:15:10,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-02 12:15:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:15:10,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-12-02 12:15:10,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:15:10,513 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:15:10,513 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:15:10,640 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-02 12:15:10,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:15:10,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544965382] [2024-12-02 12:15:10,640 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-12-02 12:15:10,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948773427] [2024-12-02 12:15:10,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948773427] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:15:10,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 12:15:10,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2024-12-02 12:15:10,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588414964] [2024-12-02 12:15:10,641 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 12:15:10,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-12-02 12:15:10,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:15:10,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-12-02 12:15:10,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-12-02 12:15:10,642 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 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) [2024-12-02 12:15:10,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:15:10,840 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2024-12-02 12:15:10,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-12-02 12:15:10,840 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 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 20 [2024-12-02 12:15:10,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:15:10,841 INFO L225 Difference]: With dead ends: 44 [2024-12-02 12:15:10,841 INFO L226 Difference]: Without dead ends: 40 [2024-12-02 12:15:10,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-12-02 12:15:10,842 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 12:15:10,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 73 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 12:15:10,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-12-02 12:15:10,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2024-12-02 12:15:10,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 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) [2024-12-02 12:15:10,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2024-12-02 12:15:10,851 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 20 [2024-12-02 12:15:10,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:15:10,851 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2024-12-02 12:15:10,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 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) [2024-12-02 12:15:10,851 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2024-12-02 12:15:10,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-02 12:15:10,851 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:15:10,852 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:15:10,857 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-12-02 12:15:11,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:15:11,052 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:15:11,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:15:11,053 INFO L85 PathProgramCache]: Analyzing trace with hash -643755639, now seen corresponding path program 1 times [2024-12-02 12:15:11,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:15:11,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553802175] [2024-12-02 12:15:11,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:15:11,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:15:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:15:11,143 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:15:11,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:15:11,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553802175] [2024-12-02 12:15:11,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553802175] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:15:11,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518259811] [2024-12-02 12:15:11,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:15:11,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:15:11,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:15:11,145 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:15:11,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-02 12:15:11,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:15:11,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-02 12:15:11,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:15:11,213 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:15:11,213 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:15:11,253 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:15:11,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518259811] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:15:11,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:15:11,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 8 [2024-12-02 12:15:11,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168751964] [2024-12-02 12:15:11,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:15:11,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 12:15:11,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:15:11,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 12:15:11,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-12-02 12:15:11,255 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-12-02 12:15:11,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:15:11,318 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2024-12-02 12:15:11,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-02 12:15:11,319 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2024-12-02 12:15:11,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:15:11,320 INFO L225 Difference]: With dead ends: 72 [2024-12-02 12:15:11,320 INFO L226 Difference]: Without dead ends: 66 [2024-12-02 12:15:11,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-12-02 12:15:11,321 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 35 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 12:15:11,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 83 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 12:15:11,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-12-02 12:15:11,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2024-12-02 12:15:11,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 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) [2024-12-02 12:15:11,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2024-12-02 12:15:11,333 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 20 [2024-12-02 12:15:11,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:15:11,333 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2024-12-02 12:15:11,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-12-02 12:15:11,333 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2024-12-02 12:15:11,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-12-02 12:15:11,334 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:15:11,334 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:15:11,340 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-12-02 12:15:11,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-12-02 12:15:11,534 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:15:11,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:15:11,535 INFO L85 PathProgramCache]: Analyzing trace with hash 935756278, now seen corresponding path program 1 times [2024-12-02 12:15:11,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:15:11,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532745333] [2024-12-02 12:15:11,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:15:11,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:15:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-02 12:15:11,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1488591422] [2024-12-02 12:15:11,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:15:11,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:15:11,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:15:11,558 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:15:11,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-02 12:15:11,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:15:11,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-12-02 12:15:11,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:15:11,762 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-02 12:15:11,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:15:11,918 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-02 12:15:11,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:15:11,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532745333] [2024-12-02 12:15:11,919 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-12-02 12:15:11,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488591422] [2024-12-02 12:15:11,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488591422] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:15:11,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 12:15:11,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2024-12-02 12:15:11,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688961497] [2024-12-02 12:15:11,919 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 12:15:11,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-12-02 12:15:11,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:15:11,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-12-02 12:15:11,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-12-02 12:15:11,920 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 14 states, 10 states have (on average 2.5) internal successors, (25), 13 states have internal predecessors, (25), 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) [2024-12-02 12:15:12,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:15:12,101 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2024-12-02 12:15:12,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-12-02 12:15:12,102 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 2.5) internal successors, (25), 13 states have internal predecessors, (25), 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 27 [2024-12-02 12:15:12,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:15:12,103 INFO L225 Difference]: With dead ends: 86 [2024-12-02 12:15:12,103 INFO L226 Difference]: Without dead ends: 80 [2024-12-02 12:15:12,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-12-02 12:15:12,104 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 21 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 12:15:12,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 99 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 12:15:12,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-12-02 12:15:12,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2024-12-02 12:15:12,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 65 states have internal predecessors, (77), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-12-02 12:15:12,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2024-12-02 12:15:12,126 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 92 transitions. Word has length 27 [2024-12-02 12:15:12,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:15:12,126 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 92 transitions. [2024-12-02 12:15:12,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 2.5) internal successors, (25), 13 states have internal predecessors, (25), 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) [2024-12-02 12:15:12,126 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 92 transitions. [2024-12-02 12:15:12,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-12-02 12:15:12,127 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:15:12,127 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:15:12,135 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-12-02 12:15:12,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:15:12,328 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:15:12,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:15:12,328 INFO L85 PathProgramCache]: Analyzing trace with hash -85312076, now seen corresponding path program 1 times [2024-12-02 12:15:12,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:15:12,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899214926] [2024-12-02 12:15:12,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:15:12,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:15:12,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-02 12:15:12,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1257109693] [2024-12-02 12:15:12,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:15:12,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:15:12,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:15:12,350 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:15:12,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-12-02 12:15:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:15:12,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-12-02 12:15:12,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:15:12,623 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 12:15:12,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:15:12,897 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 12:15:12,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:15:12,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899214926] [2024-12-02 12:15:12,897 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-12-02 12:15:12,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257109693] [2024-12-02 12:15:12,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257109693] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:15:12,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 12:15:12,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2024-12-02 12:15:12,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645102931] [2024-12-02 12:15:12,898 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 12:15:12,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-12-02 12:15:12,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:15:12,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-12-02 12:15:12,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2024-12-02 12:15:12,899 INFO L87 Difference]: Start difference. First operand 78 states and 92 transitions. Second operand has 22 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 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) [2024-12-02 12:15:13,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:15:13,467 INFO L93 Difference]: Finished difference Result 87 states and 100 transitions. [2024-12-02 12:15:13,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-12-02 12:15:13,467 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 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 27 [2024-12-02 12:15:13,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:15:13,468 INFO L225 Difference]: With dead ends: 87 [2024-12-02 12:15:13,468 INFO L226 Difference]: Without dead ends: 79 [2024-12-02 12:15:13,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=231, Invalid=1029, Unknown=0, NotChecked=0, Total=1260 [2024-12-02 12:15:13,470 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 32 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 12:15:13,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 169 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 12:15:13,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-12-02 12:15:13,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 54. [2024-12-02 12:15:13,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 44 states have internal predecessors, (49), 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) [2024-12-02 12:15:13,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2024-12-02 12:15:13,483 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 27 [2024-12-02 12:15:13,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:15:13,484 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2024-12-02 12:15:13,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 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) [2024-12-02 12:15:13,484 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2024-12-02 12:15:13,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-12-02 12:15:13,485 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:15:13,485 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:15:13,490 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-12-02 12:15:13,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-12-02 12:15:13,685 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:15:13,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:15:13,686 INFO L85 PathProgramCache]: Analyzing trace with hash 380685067, now seen corresponding path program 2 times [2024-12-02 12:15:13,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:15:13,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121615962] [2024-12-02 12:15:13,686 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 12:15:13,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:15:13,707 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 12:15:13,707 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 12:15:13,903 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 8 proven. 50 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-02 12:15:13,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:15:13,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121615962] [2024-12-02 12:15:13,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121615962] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:15:13,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662291763] [2024-12-02 12:15:13,904 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 12:15:13,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:15:13,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:15:13,905 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:15:13,907 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-12-02 12:15:13,954 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 12:15:13,954 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 12:15:13,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-12-02 12:15:13,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:15:14,023 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 8 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:15:14,023 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:15:14,142 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 8 proven. 50 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-02 12:15:14,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662291763] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:15:14,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:15:14,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 15 [2024-12-02 12:15:14,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865796937] [2024-12-02 12:15:14,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:15:14,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-12-02 12:15:14,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:15:14,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-12-02 12:15:14,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2024-12-02 12:15:14,144 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 9 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2024-12-02 12:15:14,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:15:14,299 INFO L93 Difference]: Finished difference Result 126 states and 141 transitions. [2024-12-02 12:15:14,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-12-02 12:15:14,300 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 9 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) Word has length 53 [2024-12-02 12:15:14,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:15:14,301 INFO L225 Difference]: With dead ends: 126 [2024-12-02 12:15:14,301 INFO L226 Difference]: Without dead ends: 120 [2024-12-02 12:15:14,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2024-12-02 12:15:14,302 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 52 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 12:15:14,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 129 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 12:15:14,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-12-02 12:15:14,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-12-02 12:15:14,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 98 states have (on average 1.1122448979591837) internal successors, (109), 98 states have internal predecessors, (109), 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) [2024-12-02 12:15:14,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2024-12-02 12:15:14,324 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 53 [2024-12-02 12:15:14,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:15:14,324 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2024-12-02 12:15:14,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 9 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2024-12-02 12:15:14,324 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2024-12-02 12:15:14,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-12-02 12:15:14,327 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:15:14,327 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:15:14,333 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-12-02 12:15:14,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:15:14,527 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:15:14,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:15:14,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1638130997, now seen corresponding path program 3 times [2024-12-02 12:15:14,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:15:14,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133300298] [2024-12-02 12:15:14,528 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-02 12:15:14,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:15:14,598 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-12-02 12:15:14,598 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 12:15:15,256 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 20 proven. 335 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-12-02 12:15:15,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:15:15,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133300298] [2024-12-02 12:15:15,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133300298] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:15:15,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246594450] [2024-12-02 12:15:15,257 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-02 12:15:15,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:15:15,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:15:15,258 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:15:15,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-12-02 12:15:15,308 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-12-02 12:15:15,308 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 12:15:15,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-12-02 12:15:15,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:15:15,620 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 102 proven. 1 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2024-12-02 12:15:15,620 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:15:15,965 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 46 proven. 57 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2024-12-02 12:15:15,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246594450] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:15:15,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:15:15,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11, 12] total 36 [2024-12-02 12:15:15,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618738297] [2024-12-02 12:15:15,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:15:15,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-12-02 12:15:15,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:15:15,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-12-02 12:15:15,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1056, Unknown=0, NotChecked=0, Total=1260 [2024-12-02 12:15:15,968 INFO L87 Difference]: Start difference. First operand 120 states and 130 transitions. Second operand has 36 states, 32 states have (on average 3.125) internal successors, (100), 35 states have internal predecessors, (100), 16 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-12-02 12:15:18,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:15:18,200 INFO L93 Difference]: Finished difference Result 254 states and 277 transitions. [2024-12-02 12:15:18,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2024-12-02 12:15:18,200 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 32 states have (on average 3.125) internal successors, (100), 35 states have internal predecessors, (100), 16 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 119 [2024-12-02 12:15:18,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:15:18,202 INFO L225 Difference]: With dead ends: 254 [2024-12-02 12:15:18,202 INFO L226 Difference]: Without dead ends: 244 [2024-12-02 12:15:18,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 220 SyntacticMatches, 3 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4344 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1964, Invalid=12556, Unknown=0, NotChecked=0, Total=14520 [2024-12-02 12:15:18,206 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 240 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 12:15:18,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 117 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 12:15:18,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-12-02 12:15:18,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2024-12-02 12:15:18,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 197 states have (on average 1.1116751269035532) internal successors, (219), 197 states have internal predecessors, (219), 22 states have call successors, (22), 22 states have call predecessors, (22), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-12-02 12:15:18,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 262 transitions. [2024-12-02 12:15:18,238 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 262 transitions. Word has length 119 [2024-12-02 12:15:18,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:15:18,239 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 262 transitions. [2024-12-02 12:15:18,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 32 states have (on average 3.125) internal successors, (100), 35 states have internal predecessors, (100), 16 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-12-02 12:15:18,239 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 262 transitions. [2024-12-02 12:15:18,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-12-02 12:15:18,241 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:15:18,242 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:15:18,249 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-12-02 12:15:18,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-12-02 12:15:18,442 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:15:18,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:15:18,443 INFO L85 PathProgramCache]: Analyzing trace with hash -2053046965, now seen corresponding path program 1 times [2024-12-02 12:15:18,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:15:18,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517798108] [2024-12-02 12:15:18,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:15:18,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:15:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:15:18,847 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 22 proven. 407 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-12-02 12:15:18,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:15:18,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517798108] [2024-12-02 12:15:18,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517798108] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:15:18,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489466516] [2024-12-02 12:15:18,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:15:18,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:15:18,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:15:18,849 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:15:18,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-12-02 12:15:18,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:15:18,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-12-02 12:15:18,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:15:19,081 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 22 proven. 627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:15:19,081 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:15:19,407 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 22 proven. 407 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-12-02 12:15:19,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489466516] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:15:19,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:15:19,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 28 [2024-12-02 12:15:19,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142908646] [2024-12-02 12:15:19,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:15:19,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-12-02 12:15:19,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:15:19,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-12-02 12:15:19,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2024-12-02 12:15:19,410 INFO L87 Difference]: Start difference. First operand 241 states and 262 transitions. Second operand has 28 states, 28 states have (on average 6.428571428571429) internal successors, (180), 28 states have internal predecessors, (180), 23 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (33), 22 states have call predecessors, (33), 22 states have call successors, (33) [2024-12-02 12:15:19,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:15:19,856 INFO L93 Difference]: Finished difference Result 536 states and 595 transitions. [2024-12-02 12:15:19,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-12-02 12:15:19,856 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.428571428571429) internal successors, (180), 28 states have internal predecessors, (180), 23 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (33), 22 states have call predecessors, (33), 22 states have call successors, (33) Word has length 130 [2024-12-02 12:15:19,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:15:19,858 INFO L225 Difference]: With dead ends: 536 [2024-12-02 12:15:19,858 INFO L226 Difference]: Without dead ends: 530 [2024-12-02 12:15:19,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=940, Invalid=1610, Unknown=0, NotChecked=0, Total=2550 [2024-12-02 12:15:19,859 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 139 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 12:15:19,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 266 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 12:15:19,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2024-12-02 12:15:19,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 527. [2024-12-02 12:15:19,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 431 states have (on average 1.111368909512761) internal successors, (479), 431 states have internal predecessors, (479), 48 states have call successors, (48), 48 states have call predecessors, (48), 47 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-12-02 12:15:19,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 574 transitions. [2024-12-02 12:15:19,943 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 574 transitions. Word has length 130 [2024-12-02 12:15:19,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:15:19,944 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 574 transitions. [2024-12-02 12:15:19,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.428571428571429) internal successors, (180), 28 states have internal predecessors, (180), 23 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (33), 22 states have call predecessors, (33), 22 states have call successors, (33) [2024-12-02 12:15:19,944 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 574 transitions. [2024-12-02 12:15:19,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2024-12-02 12:15:19,947 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:15:19,947 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:15:19,956 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-12-02 12:15:20,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:15:20,148 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:15:20,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:15:20,148 INFO L85 PathProgramCache]: Analyzing trace with hash 182128013, now seen corresponding path program 2 times [2024-12-02 12:15:20,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:15:20,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770703476] [2024-12-02 12:15:20,149 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 12:15:20,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:15:20,184 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 12:15:20,184 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 12:15:21,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3132 backedges. 48 proven. 1980 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-12-02 12:15:21,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:15:21,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770703476] [2024-12-02 12:15:21,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770703476] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:15:21,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874874654] [2024-12-02 12:15:21,327 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 12:15:21,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:15:21,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:15:21,329 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:15:21,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-12-02 12:15:21,461 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 12:15:21,461 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 12:15:21,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-12-02 12:15:21,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:15:21,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3132 backedges. 48 proven. 3084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:15:21,745 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:15:22,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3132 backedges. 48 proven. 1980 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-12-02 12:15:22,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874874654] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:15:22,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:15:22,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 28] total 55 [2024-12-02 12:15:22,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811299064] [2024-12-02 12:15:22,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:15:22,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-12-02 12:15:22,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:15:22,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-12-02 12:15:22,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1361, Invalid=1609, Unknown=0, NotChecked=0, Total=2970 [2024-12-02 12:15:22,751 INFO L87 Difference]: Start difference. First operand 527 states and 574 transitions. Second operand has 55 states, 55 states have (on average 6.8545454545454545) internal successors, (377), 55 states have internal predecessors, (377), 49 states have call successors, (73), 26 states have call predecessors, (73), 25 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) [2024-12-02 12:15:24,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:15:24,128 INFO L93 Difference]: Finished difference Result 1108 states and 1232 transitions. [2024-12-02 12:15:24,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2024-12-02 12:15:24,129 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 6.8545454545454545) internal successors, (377), 55 states have internal predecessors, (377), 49 states have call successors, (73), 26 states have call predecessors, (73), 25 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) Word has length 273 [2024-12-02 12:15:24,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:15:24,135 INFO L225 Difference]: With dead ends: 1108 [2024-12-02 12:15:24,135 INFO L226 Difference]: Without dead ends: 1102 [2024-12-02 12:15:24,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 520 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2075 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3904, Invalid=6602, Unknown=0, NotChecked=0, Total=10506 [2024-12-02 12:15:24,138 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 349 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 12:15:24,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 467 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 12:15:24,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2024-12-02 12:15:24,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 1099. [2024-12-02 12:15:24,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1099 states, 899 states have (on average 1.1112347052280311) internal successors, (999), 899 states have internal predecessors, (999), 100 states have call successors, (100), 100 states have call predecessors, (100), 99 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2024-12-02 12:15:24,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1198 transitions. [2024-12-02 12:15:24,286 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1198 transitions. Word has length 273 [2024-12-02 12:15:24,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:15:24,286 INFO L471 AbstractCegarLoop]: Abstraction has 1099 states and 1198 transitions. [2024-12-02 12:15:24,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 6.8545454545454545) internal successors, (377), 55 states have internal predecessors, (377), 49 states have call successors, (73), 26 states have call predecessors, (73), 25 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) [2024-12-02 12:15:24,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1198 transitions. [2024-12-02 12:15:24,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2024-12-02 12:15:24,301 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:15:24,301 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 50, 50, 49, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:15:24,310 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-12-02 12:15:24,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-12-02 12:15:24,501 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:15:24,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:15:24,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1615446477, now seen corresponding path program 3 times [2024-12-02 12:15:24,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:15:24,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374724951] [2024-12-02 12:15:24,502 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-02 12:15:24,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:15:24,898 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2024-12-02 12:15:24,898 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 12:15:32,344 INFO L134 CoverageAnalysis]: Checked inductivity of 13675 backedges. 100 proven. 8675 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-12-02 12:15:32,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:15:32,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374724951] [2024-12-02 12:15:32,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374724951] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:15:32,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138780812] [2024-12-02 12:15:32,345 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-02 12:15:32,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:15:32,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:15:32,346 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:15:32,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-12-02 12:15:32,716 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2024-12-02 12:15:32,716 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 12:15:32,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 1253 conjuncts, 103 conjuncts are in the unsatisfiable core [2024-12-02 12:15:32,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:15:33,262 INFO L134 CoverageAnalysis]: Checked inductivity of 13675 backedges. 100 proven. 13575 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:15:33,263 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:15:37,656 INFO L134 CoverageAnalysis]: Checked inductivity of 13675 backedges. 100 proven. 8675 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-12-02 12:15:37,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138780812] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:15:37,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:15:37,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 53, 54] total 142 [2024-12-02 12:15:37,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549836838] [2024-12-02 12:15:37,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:15:37,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 142 states [2024-12-02 12:15:37,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:15:37,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2024-12-02 12:15:37,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8726, Invalid=11296, Unknown=0, NotChecked=0, Total=20022 [2024-12-02 12:15:37,666 INFO L87 Difference]: Start difference. First operand 1099 states and 1198 transitions. Second operand has 142 states, 142 states have (on average 5.887323943661972) internal successors, (836), 142 states have internal predecessors, (836), 100 states have call successors, (150), 52 states have call predecessors, (150), 51 states have return successors, (149), 99 states have call predecessors, (149), 99 states have call successors, (149) [2024-12-02 12:15:43,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:15:43,025 INFO L93 Difference]: Finished difference Result 2208 states and 2456 transitions. [2024-12-02 12:15:43,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2024-12-02 12:15:43,025 INFO L78 Accepts]: Start accepts. Automaton has has 142 states, 142 states have (on average 5.887323943661972) internal successors, (836), 142 states have internal predecessors, (836), 100 states have call successors, (150), 52 states have call predecessors, (150), 51 states have return successors, (149), 99 states have call predecessors, (149), 99 states have call successors, (149) Word has length 559 [2024-12-02 12:15:43,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:15:43,034 INFO L225 Difference]: With dead ends: 2208 [2024-12-02 12:15:43,034 INFO L226 Difference]: Without dead ends: 2202 [2024-12-02 12:15:43,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1269 GetRequests, 1066 SyntacticMatches, 2 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4897 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=15305, Invalid=25701, Unknown=0, NotChecked=0, Total=41006 [2024-12-02 12:15:43,040 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 903 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 12:15:43,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 890 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 12:15:43,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2202 states. [2024-12-02 12:15:43,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2202 to 2199. [2024-12-02 12:15:43,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2199 states, 1799 states have (on average 1.1111728738187883) internal successors, (1999), 1799 states have internal predecessors, (1999), 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) [2024-12-02 12:15:43,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2199 states to 2199 states and 2398 transitions. [2024-12-02 12:15:43,343 INFO L78 Accepts]: Start accepts. Automaton has 2199 states and 2398 transitions. Word has length 559 [2024-12-02 12:15:43,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:15:43,344 INFO L471 AbstractCegarLoop]: Abstraction has 2199 states and 2398 transitions. [2024-12-02 12:15:43,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 142 states, 142 states have (on average 5.887323943661972) internal successors, (836), 142 states have internal predecessors, (836), 100 states have call successors, (150), 52 states have call predecessors, (150), 51 states have return successors, (149), 99 states have call predecessors, (149), 99 states have call successors, (149) [2024-12-02 12:15:43,345 INFO L276 IsEmpty]: Start isEmpty. Operand 2199 states and 2398 transitions. [2024-12-02 12:15:43,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1110 [2024-12-02 12:15:43,353 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:15:43,353 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 100, 100, 100, 100, 100, 100, 100, 100, 99, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:15:43,358 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-12-02 12:15:43,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:15:43,554 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:15:43,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:15:43,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1867392269, now seen corresponding path program 4 times [2024-12-02 12:15:43,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:15:43,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103561650] [2024-12-02 12:15:43,555 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-12-02 12:15:43,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:15:44,097 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-12-02 12:15:44,097 INFO L230 tOrderPrioritization]: Conjunction of SSA is unknown [2024-12-02 12:15:44,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1323064692] [2024-12-02 12:15:44,109 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-12-02 12:15:44,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:15:44,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:15:44,111 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:15:44,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-12-02 12:15:45,315 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-12-02 12:15:45,315 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-12-02 12:15:45,315 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 12:15:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 12:15:46,529 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-02 12:15:46,529 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 12:15:46,530 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-12-02 12:15:46,541 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-12-02 12:15:46,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:15:46,733 INFO L422 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:15:46,946 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 12:15:46,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 12:15:46 BoogieIcfgContainer [2024-12-02 12:15:46,949 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 12:15:46,949 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 12:15:46,949 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 12:15:46,949 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 12:15:46,950 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:15:08" (3/4) ... [2024-12-02 12:15:46,951 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-02 12:15:47,219 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 604. [2024-12-02 12:15:47,418 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/witness.graphml [2024-12-02 12:15:47,419 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/witness.yml [2024-12-02 12:15:47,419 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 12:15:47,420 INFO L158 Benchmark]: Toolchain (without parser) took 38955.73ms. Allocated memory was 142.6MB in the beginning and 780.1MB in the end (delta: 637.5MB). Free memory was 116.5MB in the beginning and 485.5MB in the end (delta: -369.1MB). Peak memory consumption was 263.7MB. Max. memory is 16.1GB. [2024-12-02 12:15:47,420 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 142.6MB. Free memory is still 82.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 12:15:47,420 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.97ms. Allocated memory is still 142.6MB. Free memory was 116.2MB in the beginning and 105.1MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-02 12:15:47,421 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.18ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 103.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 12:15:47,421 INFO L158 Benchmark]: Boogie Preprocessor took 25.83ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 102.5MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-02 12:15:47,421 INFO L158 Benchmark]: RCFGBuilder took 195.81ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 91.4MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-02 12:15:47,421 INFO L158 Benchmark]: TraceAbstraction took 38041.05ms. Allocated memory was 142.6MB in the beginning and 780.1MB in the end (delta: 637.5MB). Free memory was 90.9MB in the beginning and 548.4MB in the end (delta: -457.6MB). Peak memory consumption was 179.8MB. Max. memory is 16.1GB. [2024-12-02 12:15:47,421 INFO L158 Benchmark]: Witness Printer took 470.08ms. Allocated memory is still 780.1MB. Free memory was 548.4MB in the beginning and 485.5MB in the end (delta: 62.9MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2024-12-02 12:15:47,423 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 142.6MB. Free memory is still 82.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 192.97ms. Allocated memory is still 142.6MB. Free memory was 116.2MB in the beginning and 105.1MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.18ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 103.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.83ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 102.5MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 195.81ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 91.4MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 38041.05ms. Allocated memory was 142.6MB in the beginning and 780.1MB in the end (delta: 637.5MB). Free memory was 90.9MB in the beginning and 548.4MB in the end (delta: -457.6MB). Peak memory consumption was 179.8MB. Max. memory is 16.1GB. * Witness Printer took 470.08ms. Allocated memory is still 780.1MB. Free memory was 548.4MB in the beginning and 485.5MB in the end (delta: 62.9MB). Peak memory consumption was 58.7MB. 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 [X=200, Y=1, counter=0, v=-198, x=0, y=0] [L31] EXPR counter++ VAL [X=200, Y=1, counter=1, v=-198, x=0, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=1, v=-198, x=0, xy=0, y=0, yx=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, counter=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=1, v=-198, x=0, xy=0, y=0, yx=0] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=1, v=-198, x=0, xy=0, y=0, yx=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=1, v=-196, x=0, xy=0, y=0, yx=0] [L45] x++ VAL [X=200, Y=1, counter=1, v=-196, x=1, xy=0, y=0, yx=0] [L31] EXPR counter++ VAL [X=200, Y=1, counter=2, v=-196, x=1, xy=0, y=0, yx=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=2, v=-196, x=1, xy=0, y=0, yx=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, counter=2] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=2, v=-196, x=1, xy=0, y=0, yx=1] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=2, v=-196, x=1, xy=0, y=0, yx=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=2, v=-194, x=1, xy=0, y=0, yx=1] [L45] x++ VAL [X=200, Y=1, counter=2, v=-194, x=2, xy=0, y=0, yx=1] [L31] EXPR counter++ VAL [X=200, Y=1, counter=3, v=-194, x=2, xy=0, y=0, yx=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=3, v=-194, x=2, xy=0, y=0, yx=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=3] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=3, v=-194, x=2, xy=0, y=0, yx=2] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=3, v=-194, x=2, xy=0, y=0, yx=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=3, v=-192, x=2, xy=0, y=0, yx=2] [L45] x++ VAL [X=200, Y=1, counter=3, v=-192, x=3, xy=0, y=0, yx=2] [L31] EXPR counter++ VAL [X=200, Y=1, counter=4, v=-192, x=3, xy=0, y=0, yx=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=4, v=-192, x=3, xy=0, y=0, yx=3] [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, counter=4] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=4, v=-192, x=3, xy=0, y=0, yx=3] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=4, v=-192, x=3, xy=0, y=0, yx=3] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=4, v=-190, x=3, xy=0, y=0, yx=3] [L45] x++ VAL [X=200, Y=1, counter=4, v=-190, x=4, xy=0, y=0, yx=3] [L31] EXPR counter++ VAL [X=200, Y=1, counter=5, v=-190, x=4, xy=0, y=0, yx=3] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=5, v=-190, x=4, xy=0, y=0, yx=4] [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, counter=5] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=5, v=-190, x=4, xy=0, y=0, yx=4] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=5, v=-190, x=4, xy=0, y=0, yx=4] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=5, v=-188, x=4, xy=0, y=0, yx=4] [L45] x++ VAL [X=200, Y=1, counter=5, v=-188, x=5, xy=0, y=0, yx=4] [L31] EXPR counter++ VAL [X=200, Y=1, counter=6, v=-188, x=5, xy=0, y=0, yx=4] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=6, v=-188, x=5, xy=0, y=0, yx=5] [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, counter=6] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=6, v=-188, x=5, xy=0, y=0, yx=5] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=6, v=-188, x=5, xy=0, y=0, yx=5] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=6, v=-186, x=5, xy=0, y=0, yx=5] [L45] x++ VAL [X=200, Y=1, counter=6, v=-186, x=6, xy=0, y=0, yx=5] [L31] EXPR counter++ VAL [X=200, Y=1, counter=7, v=-186, x=6, xy=0, y=0, yx=5] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=7, v=-186, x=6, xy=0, y=0, yx=6] [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, counter=7] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=7, v=-186, x=6, xy=0, y=0, yx=6] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=7, v=-186, x=6, xy=0, y=0, yx=6] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=7, v=-184, x=6, xy=0, y=0, yx=6] [L45] x++ VAL [X=200, Y=1, counter=7, v=-184, x=7, xy=0, y=0, yx=6] [L31] EXPR counter++ VAL [X=200, Y=1, counter=8, v=-184, x=7, xy=0, y=0, yx=6] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=8, v=-184, x=7, xy=0, y=0, yx=7] [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, counter=8] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=8, v=-184, x=7, xy=0, y=0, yx=7] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=8, v=-184, x=7, xy=0, y=0, yx=7] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=8, v=-182, x=7, xy=0, y=0, yx=7] [L45] x++ VAL [X=200, Y=1, counter=8, v=-182, x=8, xy=0, y=0, yx=7] [L31] EXPR counter++ VAL [X=200, Y=1, counter=9, v=-182, x=8, xy=0, y=0, yx=7] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=9, v=-182, x=8, xy=0, y=0, yx=8] [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, counter=9] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=9, v=-182, x=8, xy=0, y=0, yx=8] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=9, v=-182, x=8, xy=0, y=0, yx=8] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=9, v=-180, x=8, xy=0, y=0, yx=8] [L45] x++ VAL [X=200, Y=1, counter=9, v=-180, x=9, xy=0, y=0, yx=8] [L31] EXPR counter++ VAL [X=200, Y=1, counter=10, v=-180, x=9, xy=0, y=0, yx=8] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=10, v=-180, x=9, xy=0, y=0, yx=9] [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, counter=10] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=10, v=-180, x=9, xy=0, y=0, yx=9] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=10, v=-180, x=9, xy=0, y=0, yx=9] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=10, v=-178, x=9, xy=0, y=0, yx=9] [L45] x++ VAL [X=200, Y=1, counter=10, v=-178, x=10, xy=0, y=0, yx=9] [L31] EXPR counter++ VAL [X=200, Y=1, counter=11, v=-178, x=10, xy=0, y=0, yx=9] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=11, v=-178, x=10, xy=0, y=0, yx=10] [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, counter=11] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=11, v=-178, x=10, xy=0, y=0, yx=10] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=11, v=-178, x=10, xy=0, y=0, yx=10] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=11, v=-176, x=10, xy=0, y=0, yx=10] [L45] x++ VAL [X=200, Y=1, counter=11, v=-176, x=11, xy=0, y=0, yx=10] [L31] EXPR counter++ VAL [X=200, Y=1, counter=12, v=-176, x=11, xy=0, y=0, yx=10] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=12, v=-176, x=11, xy=0, y=0, yx=11] [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, counter=12] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=12, v=-176, x=11, xy=0, y=0, yx=11] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=12, v=-176, x=11, xy=0, y=0, yx=11] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=12, v=-174, x=11, xy=0, y=0, yx=11] [L45] x++ VAL [X=200, Y=1, counter=12, v=-174, x=12, xy=0, y=0, yx=11] [L31] EXPR counter++ VAL [X=200, Y=1, counter=13, v=-174, x=12, xy=0, y=0, yx=11] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=13, v=-174, x=12, xy=0, y=0, yx=12] [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, counter=13] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=13, v=-174, x=12, xy=0, y=0, yx=12] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=13, v=-174, x=12, xy=0, y=0, yx=12] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=13, v=-172, x=12, xy=0, y=0, yx=12] [L45] x++ VAL [X=200, Y=1, counter=13, v=-172, x=13, xy=0, y=0, yx=12] [L31] EXPR counter++ VAL [X=200, Y=1, counter=14, v=-172, x=13, xy=0, y=0, yx=12] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=14, v=-172, x=13, xy=0, y=0, yx=13] [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, counter=14] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=14, v=-172, x=13, xy=0, y=0, yx=13] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=14, v=-172, x=13, xy=0, y=0, yx=13] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=14, v=-170, x=13, xy=0, y=0, yx=13] [L45] x++ VAL [X=200, Y=1, counter=14, v=-170, x=14, xy=0, y=0, yx=13] [L31] EXPR counter++ VAL [X=200, Y=1, counter=15, v=-170, x=14, xy=0, y=0, yx=13] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=15, v=-170, x=14, xy=0, y=0, yx=14] [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, counter=15] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=15, v=-170, x=14, xy=0, y=0, yx=14] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=15, v=-170, x=14, xy=0, y=0, yx=14] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=15, v=-168, x=14, xy=0, y=0, yx=14] [L45] x++ VAL [X=200, Y=1, counter=15, v=-168, x=15, xy=0, y=0, yx=14] [L31] EXPR counter++ VAL [X=200, Y=1, counter=16, v=-168, x=15, xy=0, y=0, yx=14] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=16, v=-168, x=15, xy=0, y=0, yx=15] [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, counter=16] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=16, v=-168, x=15, xy=0, y=0, yx=15] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=16, v=-168, x=15, xy=0, y=0, yx=15] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=16, v=-166, x=15, xy=0, y=0, yx=15] [L45] x++ VAL [X=200, Y=1, counter=16, v=-166, x=16, xy=0, y=0, yx=15] [L31] EXPR counter++ VAL [X=200, Y=1, counter=17, v=-166, x=16, xy=0, y=0, yx=15] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=17, v=-166, x=16, xy=0, y=0, yx=16] [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, counter=17] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=17, v=-166, x=16, xy=0, y=0, yx=16] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=17, v=-166, x=16, xy=0, y=0, yx=16] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=17, v=-164, x=16, xy=0, y=0, yx=16] [L45] x++ VAL [X=200, Y=1, counter=17, v=-164, x=17, xy=0, y=0, yx=16] [L31] EXPR counter++ VAL [X=200, Y=1, counter=18, v=-164, x=17, xy=0, y=0, yx=16] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=18, v=-164, x=17, xy=0, y=0, yx=17] [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, counter=18] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=18, v=-164, x=17, xy=0, y=0, yx=17] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=18, v=-164, x=17, xy=0, y=0, yx=17] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=18, v=-162, x=17, xy=0, y=0, yx=17] [L45] x++ VAL [X=200, Y=1, counter=18, v=-162, x=18, xy=0, y=0, yx=17] [L31] EXPR counter++ VAL [X=200, Y=1, counter=19, v=-162, x=18, xy=0, y=0, yx=17] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=19, v=-162, x=18, xy=0, y=0, yx=18] [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, counter=19] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=19, v=-162, x=18, xy=0, y=0, yx=18] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=19, v=-162, x=18, xy=0, y=0, yx=18] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=19, v=-160, x=18, xy=0, y=0, yx=18] [L45] x++ VAL [X=200, Y=1, counter=19, v=-160, x=19, xy=0, y=0, yx=18] [L31] EXPR counter++ VAL [X=200, Y=1, counter=20, v=-160, x=19, xy=0, y=0, yx=18] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=20, v=-160, x=19, xy=0, y=0, yx=19] [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, counter=20] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=20, v=-160, x=19, xy=0, y=0, yx=19] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=20, v=-160, x=19, xy=0, y=0, yx=19] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=20, v=-158, x=19, xy=0, y=0, yx=19] [L45] x++ VAL [X=200, Y=1, counter=20, v=-158, x=20, xy=0, y=0, yx=19] [L31] EXPR counter++ VAL [X=200, Y=1, counter=21, v=-158, x=20, xy=0, y=0, yx=19] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=21, v=-158, x=20, xy=0, y=0, yx=20] [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, counter=21] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=21, v=-158, x=20, xy=0, y=0, yx=20] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=21, v=-158, x=20, xy=0, y=0, yx=20] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=21, v=-156, x=20, xy=0, y=0, yx=20] [L45] x++ VAL [X=200, Y=1, counter=21, v=-156, x=21, xy=0, y=0, yx=20] [L31] EXPR counter++ VAL [X=200, Y=1, counter=22, v=-156, x=21, xy=0, y=0, yx=20] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=22, v=-156, x=21, xy=0, y=0, yx=21] [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, counter=22] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=22, v=-156, x=21, xy=0, y=0, yx=21] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=22, v=-156, x=21, xy=0, y=0, yx=21] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=22, v=-154, x=21, xy=0, y=0, yx=21] [L45] x++ VAL [X=200, Y=1, counter=22, v=-154, x=22, xy=0, y=0, yx=21] [L31] EXPR counter++ VAL [X=200, Y=1, counter=23, v=-154, x=22, xy=0, y=0, yx=21] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=23, v=-154, x=22, xy=0, y=0, yx=22] [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, counter=23] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=23, v=-154, x=22, xy=0, y=0, yx=22] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=23, v=-154, x=22, xy=0, y=0, yx=22] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=23, v=-152, x=22, xy=0, y=0, yx=22] [L45] x++ VAL [X=200, Y=1, counter=23, v=-152, x=23, xy=0, y=0, yx=22] [L31] EXPR counter++ VAL [X=200, Y=1, counter=24, v=-152, x=23, xy=0, y=0, yx=22] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=24, v=-152, x=23, xy=0, y=0, yx=23] [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, counter=24] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=24, v=-152, x=23, xy=0, y=0, yx=23] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=24, v=-152, x=23, xy=0, y=0, yx=23] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=24, v=-150, x=23, xy=0, y=0, yx=23] [L45] x++ VAL [X=200, Y=1, counter=24, v=-150, x=24, xy=0, y=0, yx=23] [L31] EXPR counter++ VAL [X=200, Y=1, counter=25, v=-150, x=24, xy=0, y=0, yx=23] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=25, v=-150, x=24, xy=0, y=0, yx=24] [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, counter=25] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=25, v=-150, x=24, xy=0, y=0, yx=24] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=25, v=-150, x=24, xy=0, y=0, yx=24] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=25, v=-148, x=24, xy=0, y=0, yx=24] [L45] x++ VAL [X=200, Y=1, counter=25, v=-148, x=25, xy=0, y=0, yx=24] [L31] EXPR counter++ VAL [X=200, Y=1, counter=26, v=-148, x=25, xy=0, y=0, yx=24] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=26, v=-148, x=25, xy=0, y=0, yx=25] [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, counter=26] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=26, v=-148, x=25, xy=0, y=0, yx=25] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=26, v=-148, x=25, xy=0, y=0, yx=25] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=26, v=-146, x=25, xy=0, y=0, yx=25] [L45] x++ VAL [X=200, Y=1, counter=26, v=-146, x=26, xy=0, y=0, yx=25] [L31] EXPR counter++ VAL [X=200, Y=1, counter=27, v=-146, x=26, xy=0, y=0, yx=25] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=27, v=-146, x=26, xy=0, y=0, yx=26] [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, counter=27] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=27, v=-146, x=26, xy=0, y=0, yx=26] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=27, v=-146, x=26, xy=0, y=0, yx=26] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=27, v=-144, x=26, xy=0, y=0, yx=26] [L45] x++ VAL [X=200, Y=1, counter=27, v=-144, x=27, xy=0, y=0, yx=26] [L31] EXPR counter++ VAL [X=200, Y=1, counter=28, v=-144, x=27, xy=0, y=0, yx=26] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=28, v=-144, x=27, xy=0, y=0, yx=27] [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, counter=28] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=28, v=-144, x=27, xy=0, y=0, yx=27] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=28, v=-144, x=27, xy=0, y=0, yx=27] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=28, v=-142, x=27, xy=0, y=0, yx=27] [L45] x++ VAL [X=200, Y=1, counter=28, v=-142, x=28, xy=0, y=0, yx=27] [L31] EXPR counter++ VAL [X=200, Y=1, counter=29, v=-142, x=28, xy=0, y=0, yx=27] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=29, v=-142, x=28, xy=0, y=0, yx=28] [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, counter=29] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=29, v=-142, x=28, xy=0, y=0, yx=28] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=29, v=-142, x=28, xy=0, y=0, yx=28] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=29, v=-140, x=28, xy=0, y=0, yx=28] [L45] x++ VAL [X=200, Y=1, counter=29, v=-140, x=29, xy=0, y=0, yx=28] [L31] EXPR counter++ VAL [X=200, Y=1, counter=30, v=-140, x=29, xy=0, y=0, yx=28] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=30, v=-140, x=29, xy=0, y=0, yx=29] [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, counter=30] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=30, v=-140, x=29, xy=0, y=0, yx=29] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=30, v=-140, x=29, xy=0, y=0, yx=29] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=30, v=-138, x=29, xy=0, y=0, yx=29] [L45] x++ VAL [X=200, Y=1, counter=30, v=-138, x=30, xy=0, y=0, yx=29] [L31] EXPR counter++ VAL [X=200, Y=1, counter=31, v=-138, x=30, xy=0, y=0, yx=29] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=31, v=-138, x=30, xy=0, y=0, yx=30] [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, counter=31] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=31, v=-138, x=30, xy=0, y=0, yx=30] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=31, v=-138, x=30, xy=0, y=0, yx=30] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=31, v=-136, x=30, xy=0, y=0, yx=30] [L45] x++ VAL [X=200, Y=1, counter=31, v=-136, x=31, xy=0, y=0, yx=30] [L31] EXPR counter++ VAL [X=200, Y=1, counter=32, v=-136, x=31, xy=0, y=0, yx=30] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=32, v=-136, x=31, xy=0, y=0, yx=31] [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, counter=32] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=32, v=-136, x=31, xy=0, y=0, yx=31] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=32, v=-136, x=31, xy=0, y=0, yx=31] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=32, v=-134, x=31, xy=0, y=0, yx=31] [L45] x++ VAL [X=200, Y=1, counter=32, v=-134, x=32, xy=0, y=0, yx=31] [L31] EXPR counter++ VAL [X=200, Y=1, counter=33, v=-134, x=32, xy=0, y=0, yx=31] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=33, v=-134, x=32, xy=0, y=0, yx=32] [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, counter=33] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=33, v=-134, x=32, xy=0, y=0, yx=32] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=33, v=-134, x=32, xy=0, y=0, yx=32] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=33, v=-132, x=32, xy=0, y=0, yx=32] [L45] x++ VAL [X=200, Y=1, counter=33, v=-132, x=33, xy=0, y=0, yx=32] [L31] EXPR counter++ VAL [X=200, Y=1, counter=34, v=-132, x=33, xy=0, y=0, yx=32] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=34, v=-132, x=33, xy=0, y=0, yx=33] [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, counter=34] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=34, v=-132, x=33, xy=0, y=0, yx=33] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=34, v=-132, x=33, xy=0, y=0, yx=33] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=34, v=-130, x=33, xy=0, y=0, yx=33] [L45] x++ VAL [X=200, Y=1, counter=34, v=-130, x=34, xy=0, y=0, yx=33] [L31] EXPR counter++ VAL [X=200, Y=1, counter=35, v=-130, x=34, xy=0, y=0, yx=33] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=35, v=-130, x=34, xy=0, y=0, yx=34] [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, counter=35] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=35, v=-130, x=34, xy=0, y=0, yx=34] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=35, v=-130, x=34, xy=0, y=0, yx=34] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=35, v=-128, x=34, xy=0, y=0, yx=34] [L45] x++ VAL [X=200, Y=1, counter=35, v=-128, x=35, xy=0, y=0, yx=34] [L31] EXPR counter++ VAL [X=200, Y=1, counter=36, v=-128, x=35, xy=0, y=0, yx=34] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=36, v=-128, x=35, xy=0, y=0, yx=35] [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, counter=36] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=36, v=-128, x=35, xy=0, y=0, yx=35] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=36, v=-128, x=35, xy=0, y=0, yx=35] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=36, v=-126, x=35, xy=0, y=0, yx=35] [L45] x++ VAL [X=200, Y=1, counter=36, v=-126, x=36, xy=0, y=0, yx=35] [L31] EXPR counter++ VAL [X=200, Y=1, counter=37, v=-126, x=36, xy=0, y=0, yx=35] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=37, v=-126, x=36, xy=0, y=0, yx=36] [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, counter=37] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=37, v=-126, x=36, xy=0, y=0, yx=36] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=37, v=-126, x=36, xy=0, y=0, yx=36] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=37, v=-124, x=36, xy=0, y=0, yx=36] [L45] x++ VAL [X=200, Y=1, counter=37, v=-124, x=37, xy=0, y=0, yx=36] [L31] EXPR counter++ VAL [X=200, Y=1, counter=38, v=-124, x=37, xy=0, y=0, yx=36] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=38, v=-124, x=37, xy=0, y=0, yx=37] [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, counter=38] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=38, v=-124, x=37, xy=0, y=0, yx=37] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=38, v=-124, x=37, xy=0, y=0, yx=37] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=38, v=-122, x=37, xy=0, y=0, yx=37] [L45] x++ VAL [X=200, Y=1, counter=38, v=-122, x=38, xy=0, y=0, yx=37] [L31] EXPR counter++ VAL [X=200, Y=1, counter=39, v=-122, x=38, xy=0, y=0, yx=37] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=39, v=-122, x=38, xy=0, y=0, yx=38] [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, counter=39] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=39, v=-122, x=38, xy=0, y=0, yx=38] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=39, v=-122, x=38, xy=0, y=0, yx=38] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=39, v=-120, x=38, xy=0, y=0, yx=38] [L45] x++ VAL [X=200, Y=1, counter=39, v=-120, x=39, xy=0, y=0, yx=38] [L31] EXPR counter++ VAL [X=200, Y=1, counter=40, v=-120, x=39, xy=0, y=0, yx=38] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=40, v=-120, x=39, xy=0, y=0, yx=39] [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, counter=40] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=40, v=-120, x=39, xy=0, y=0, yx=39] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=40, v=-120, x=39, xy=0, y=0, yx=39] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=40, v=-118, x=39, xy=0, y=0, yx=39] [L45] x++ VAL [X=200, Y=1, counter=40, v=-118, x=40, xy=0, y=0, yx=39] [L31] EXPR counter++ VAL [X=200, Y=1, counter=41, v=-118, x=40, xy=0, y=0, yx=39] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=41, v=-118, x=40, xy=0, y=0, yx=40] [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, counter=41] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=41, v=-118, x=40, xy=0, y=0, yx=40] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=41, v=-118, x=40, xy=0, y=0, yx=40] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=41, v=-116, x=40, xy=0, y=0, yx=40] [L45] x++ VAL [X=200, Y=1, counter=41, v=-116, x=41, xy=0, y=0, yx=40] [L31] EXPR counter++ VAL [X=200, Y=1, counter=42, v=-116, x=41, xy=0, y=0, yx=40] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=42, v=-116, x=41, xy=0, y=0, yx=41] [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, counter=42] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=42, v=-116, x=41, xy=0, y=0, yx=41] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=42, v=-116, x=41, xy=0, y=0, yx=41] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=42, v=-114, x=41, xy=0, y=0, yx=41] [L45] x++ VAL [X=200, Y=1, counter=42, v=-114, x=42, xy=0, y=0, yx=41] [L31] EXPR counter++ VAL [X=200, Y=1, counter=43, v=-114, x=42, xy=0, y=0, yx=41] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=43, v=-114, x=42, xy=0, y=0, yx=42] [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, counter=43] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=43, v=-114, x=42, xy=0, y=0, yx=42] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=43, v=-114, x=42, xy=0, y=0, yx=42] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=43, v=-112, x=42, xy=0, y=0, yx=42] [L45] x++ VAL [X=200, Y=1, counter=43, v=-112, x=43, xy=0, y=0, yx=42] [L31] EXPR counter++ VAL [X=200, Y=1, counter=44, v=-112, x=43, xy=0, y=0, yx=42] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=44, v=-112, x=43, xy=0, y=0, yx=43] [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, counter=44] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=44, v=-112, x=43, xy=0, y=0, yx=43] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=44, v=-112, x=43, xy=0, y=0, yx=43] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=44, v=-110, x=43, xy=0, y=0, yx=43] [L45] x++ VAL [X=200, Y=1, counter=44, v=-110, x=44, xy=0, y=0, yx=43] [L31] EXPR counter++ VAL [X=200, Y=1, counter=45, v=-110, x=44, xy=0, y=0, yx=43] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=45, v=-110, x=44, xy=0, y=0, yx=44] [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, counter=45] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=45, v=-110, x=44, xy=0, y=0, yx=44] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=45, v=-110, x=44, xy=0, y=0, yx=44] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=45, v=-108, x=44, xy=0, y=0, yx=44] [L45] x++ VAL [X=200, Y=1, counter=45, v=-108, x=45, xy=0, y=0, yx=44] [L31] EXPR counter++ VAL [X=200, Y=1, counter=46, v=-108, x=45, xy=0, y=0, yx=44] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=46, v=-108, x=45, xy=0, y=0, yx=45] [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, counter=46] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=46, v=-108, x=45, xy=0, y=0, yx=45] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=46, v=-108, x=45, xy=0, y=0, yx=45] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=46, v=-106, x=45, xy=0, y=0, yx=45] [L45] x++ VAL [X=200, Y=1, counter=46, v=-106, x=46, xy=0, y=0, yx=45] [L31] EXPR counter++ VAL [X=200, Y=1, counter=47, v=-106, x=46, xy=0, y=0, yx=45] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=47, v=-106, x=46, xy=0, y=0, yx=46] [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, counter=47] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=47, v=-106, x=46, xy=0, y=0, yx=46] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=47, v=-106, x=46, xy=0, y=0, yx=46] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=47, v=-104, x=46, xy=0, y=0, yx=46] [L45] x++ VAL [X=200, Y=1, counter=47, v=-104, x=47, xy=0, y=0, yx=46] [L31] EXPR counter++ VAL [X=200, Y=1, counter=48, v=-104, x=47, xy=0, y=0, yx=46] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=48, v=-104, x=47, xy=0, y=0, yx=47] [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, counter=48] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=48, v=-104, x=47, xy=0, y=0, yx=47] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=48, v=-104, x=47, xy=0, y=0, yx=47] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=48, v=-102, x=47, xy=0, y=0, yx=47] [L45] x++ VAL [X=200, Y=1, counter=48, v=-102, x=48, xy=0, y=0, yx=47] [L31] EXPR counter++ VAL [X=200, Y=1, counter=49, v=-102, x=48, xy=0, y=0, yx=47] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=49, v=-102, x=48, xy=0, y=0, yx=48] [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, counter=49] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=49, v=-102, x=48, xy=0, y=0, yx=48] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=49, v=-102, x=48, xy=0, y=0, yx=48] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=49, v=-100, x=48, xy=0, y=0, yx=48] [L45] x++ VAL [X=200, Y=1, counter=49, v=-100, x=49, xy=0, y=0, yx=48] [L31] EXPR counter++ VAL [X=200, Y=1, counter=50, v=-100, x=49, xy=0, y=0, yx=48] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=50, v=-100, x=49, xy=0, y=0, yx=49] [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, counter=50] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=50, v=-100, x=49, xy=0, y=0, yx=49] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=50, v=-100, x=49, xy=0, y=0, yx=49] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=50, v=-98, x=49, xy=0, y=0, yx=49] [L45] x++ VAL [X=200, Y=1, counter=50, v=-98, x=50, xy=0, y=0, yx=49] [L31] EXPR counter++ VAL [X=200, Y=1, counter=51, v=-98, x=50, xy=0, y=0, yx=49] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=51, v=-98, x=50, xy=0, y=0, yx=50] [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, counter=51] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=51, v=-98, x=50, xy=0, y=0, yx=50] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=51, v=-98, x=50, xy=0, y=0, yx=50] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=51, v=-96, x=50, xy=0, y=0, yx=50] [L45] x++ VAL [X=200, Y=1, counter=51, v=-96, x=51, xy=0, y=0, yx=50] [L31] EXPR counter++ VAL [X=200, Y=1, counter=52, v=-96, x=51, xy=0, y=0, yx=50] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=52, v=-96, x=51, xy=0, y=0, yx=51] [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, counter=52] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=52, v=-96, x=51, xy=0, y=0, yx=51] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=52, v=-96, x=51, xy=0, y=0, yx=51] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=52, v=-94, x=51, xy=0, y=0, yx=51] [L45] x++ VAL [X=200, Y=1, counter=52, v=-94, x=52, xy=0, y=0, yx=51] [L31] EXPR counter++ VAL [X=200, Y=1, counter=53, v=-94, x=52, xy=0, y=0, yx=51] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=53, v=-94, x=52, xy=0, y=0, yx=52] [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, counter=53] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=53, v=-94, x=52, xy=0, y=0, yx=52] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=53, v=-94, x=52, xy=0, y=0, yx=52] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=53, v=-92, x=52, xy=0, y=0, yx=52] [L45] x++ VAL [X=200, Y=1, counter=53, v=-92, x=53, xy=0, y=0, yx=52] [L31] EXPR counter++ VAL [X=200, Y=1, counter=54, v=-92, x=53, xy=0, y=0, yx=52] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=54, v=-92, x=53, xy=0, y=0, yx=53] [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, counter=54] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=54, v=-92, x=53, xy=0, y=0, yx=53] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=54, v=-92, x=53, xy=0, y=0, yx=53] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=54, v=-90, x=53, xy=0, y=0, yx=53] [L45] x++ VAL [X=200, Y=1, counter=54, v=-90, x=54, xy=0, y=0, yx=53] [L31] EXPR counter++ VAL [X=200, Y=1, counter=55, v=-90, x=54, xy=0, y=0, yx=53] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=55, v=-90, x=54, xy=0, y=0, yx=54] [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, counter=55] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=55, v=-90, x=54, xy=0, y=0, yx=54] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=55, v=-90, x=54, xy=0, y=0, yx=54] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=55, v=-88, x=54, xy=0, y=0, yx=54] [L45] x++ VAL [X=200, Y=1, counter=55, v=-88, x=55, xy=0, y=0, yx=54] [L31] EXPR counter++ VAL [X=200, Y=1, counter=56, v=-88, x=55, xy=0, y=0, yx=54] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=56, v=-88, x=55, xy=0, y=0, yx=55] [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, counter=56] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=56, v=-88, x=55, xy=0, y=0, yx=55] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=56, v=-88, x=55, xy=0, y=0, yx=55] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=56, v=-86, x=55, xy=0, y=0, yx=55] [L45] x++ VAL [X=200, Y=1, counter=56, v=-86, x=56, xy=0, y=0, yx=55] [L31] EXPR counter++ VAL [X=200, Y=1, counter=57, v=-86, x=56, xy=0, y=0, yx=55] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=57, v=-86, x=56, xy=0, y=0, yx=56] [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, counter=57] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=57, v=-86, x=56, xy=0, y=0, yx=56] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=57, v=-86, x=56, xy=0, y=0, yx=56] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=57, v=-84, x=56, xy=0, y=0, yx=56] [L45] x++ VAL [X=200, Y=1, counter=57, v=-84, x=57, xy=0, y=0, yx=56] [L31] EXPR counter++ VAL [X=200, Y=1, counter=58, v=-84, x=57, xy=0, y=0, yx=56] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=58, v=-84, x=57, xy=0, y=0, yx=57] [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, counter=58] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=58, v=-84, x=57, xy=0, y=0, yx=57] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=58, v=-84, x=57, xy=0, y=0, yx=57] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=58, v=-82, x=57, xy=0, y=0, yx=57] [L45] x++ VAL [X=200, Y=1, counter=58, v=-82, x=58, xy=0, y=0, yx=57] [L31] EXPR counter++ VAL [X=200, Y=1, counter=59, v=-82, x=58, xy=0, y=0, yx=57] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=59, v=-82, x=58, xy=0, y=0, yx=58] [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, counter=59] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=59, v=-82, x=58, xy=0, y=0, yx=58] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=59, v=-82, x=58, xy=0, y=0, yx=58] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=59, v=-80, x=58, xy=0, y=0, yx=58] [L45] x++ VAL [X=200, Y=1, counter=59, v=-80, x=59, xy=0, y=0, yx=58] [L31] EXPR counter++ VAL [X=200, Y=1, counter=60, v=-80, x=59, xy=0, y=0, yx=58] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=60, v=-80, x=59, xy=0, y=0, yx=59] [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, counter=60] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=60, v=-80, x=59, xy=0, y=0, yx=59] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=60, v=-80, x=59, xy=0, y=0, yx=59] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=60, v=-78, x=59, xy=0, y=0, yx=59] [L45] x++ VAL [X=200, Y=1, counter=60, v=-78, x=60, xy=0, y=0, yx=59] [L31] EXPR counter++ VAL [X=200, Y=1, counter=61, v=-78, x=60, xy=0, y=0, yx=59] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=61, v=-78, x=60, xy=0, y=0, yx=60] [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, counter=61] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=61, v=-78, x=60, xy=0, y=0, yx=60] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=61, v=-78, x=60, xy=0, y=0, yx=60] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=61, v=-76, x=60, xy=0, y=0, yx=60] [L45] x++ VAL [X=200, Y=1, counter=61, v=-76, x=61, xy=0, y=0, yx=60] [L31] EXPR counter++ VAL [X=200, Y=1, counter=62, v=-76, x=61, xy=0, y=0, yx=60] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=62, v=-76, x=61, xy=0, y=0, yx=61] [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, counter=62] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=62, v=-76, x=61, xy=0, y=0, yx=61] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=62, v=-76, x=61, xy=0, y=0, yx=61] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=62, v=-74, x=61, xy=0, y=0, yx=61] [L45] x++ VAL [X=200, Y=1, counter=62, v=-74, x=62, xy=0, y=0, yx=61] [L31] EXPR counter++ VAL [X=200, Y=1, counter=63, v=-74, x=62, xy=0, y=0, yx=61] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=63, v=-74, x=62, xy=0, y=0, yx=62] [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, counter=63] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=63, v=-74, x=62, xy=0, y=0, yx=62] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=63, v=-74, x=62, xy=0, y=0, yx=62] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=63, v=-72, x=62, xy=0, y=0, yx=62] [L45] x++ VAL [X=200, Y=1, counter=63, v=-72, x=63, xy=0, y=0, yx=62] [L31] EXPR counter++ VAL [X=200, Y=1, counter=64, v=-72, x=63, xy=0, y=0, yx=62] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=64, v=-72, x=63, xy=0, y=0, yx=63] [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, counter=64] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=64, v=-72, x=63, xy=0, y=0, yx=63] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=64, v=-72, x=63, xy=0, y=0, yx=63] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=64, v=-70, x=63, xy=0, y=0, yx=63] [L45] x++ VAL [X=200, Y=1, counter=64, v=-70, x=64, xy=0, y=0, yx=63] [L31] EXPR counter++ VAL [X=200, Y=1, counter=65, v=-70, x=64, xy=0, y=0, yx=63] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=65, v=-70, x=64, xy=0, y=0, yx=64] [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, counter=65] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=65, v=-70, x=64, xy=0, y=0, yx=64] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=65, v=-70, x=64, xy=0, y=0, yx=64] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=65, v=-68, x=64, xy=0, y=0, yx=64] [L45] x++ VAL [X=200, Y=1, counter=65, v=-68, x=65, xy=0, y=0, yx=64] [L31] EXPR counter++ VAL [X=200, Y=1, counter=66, v=-68, x=65, xy=0, y=0, yx=64] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=66, v=-68, x=65, xy=0, y=0, yx=65] [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, counter=66] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=66, v=-68, x=65, xy=0, y=0, yx=65] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=66, v=-68, x=65, xy=0, y=0, yx=65] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=66, v=-66, x=65, xy=0, y=0, yx=65] [L45] x++ VAL [X=200, Y=1, counter=66, v=-66, x=66, xy=0, y=0, yx=65] [L31] EXPR counter++ VAL [X=200, Y=1, counter=67, v=-66, x=66, xy=0, y=0, yx=65] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=67, v=-66, x=66, xy=0, y=0, yx=66] [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, counter=67] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=67, v=-66, x=66, xy=0, y=0, yx=66] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=67, v=-66, x=66, xy=0, y=0, yx=66] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=67, v=-64, x=66, xy=0, y=0, yx=66] [L45] x++ VAL [X=200, Y=1, counter=67, v=-64, x=67, xy=0, y=0, yx=66] [L31] EXPR counter++ VAL [X=200, Y=1, counter=68, v=-64, x=67, xy=0, y=0, yx=66] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=68, v=-64, x=67, xy=0, y=0, yx=67] [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, counter=68] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=68, v=-64, x=67, xy=0, y=0, yx=67] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=68, v=-64, x=67, xy=0, y=0, yx=67] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=68, v=-62, x=67, xy=0, y=0, yx=67] [L45] x++ VAL [X=200, Y=1, counter=68, v=-62, x=68, xy=0, y=0, yx=67] [L31] EXPR counter++ VAL [X=200, Y=1, counter=69, v=-62, x=68, xy=0, y=0, yx=67] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=69, v=-62, x=68, xy=0, y=0, yx=68] [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, counter=69] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=69, v=-62, x=68, xy=0, y=0, yx=68] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=69, v=-62, x=68, xy=0, y=0, yx=68] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=69, v=-60, x=68, xy=0, y=0, yx=68] [L45] x++ VAL [X=200, Y=1, counter=69, v=-60, x=69, xy=0, y=0, yx=68] [L31] EXPR counter++ VAL [X=200, Y=1, counter=70, v=-60, x=69, xy=0, y=0, yx=68] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=70, v=-60, x=69, xy=0, y=0, yx=69] [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, counter=70] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=70, v=-60, x=69, xy=0, y=0, yx=69] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=70, v=-60, x=69, xy=0, y=0, yx=69] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=70, v=-58, x=69, xy=0, y=0, yx=69] [L45] x++ VAL [X=200, Y=1, counter=70, v=-58, x=70, xy=0, y=0, yx=69] [L31] EXPR counter++ VAL [X=200, Y=1, counter=71, v=-58, x=70, xy=0, y=0, yx=69] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=71, v=-58, x=70, xy=0, y=0, yx=70] [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, counter=71] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=71, v=-58, x=70, xy=0, y=0, yx=70] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=71, v=-58, x=70, xy=0, y=0, yx=70] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=71, v=-56, x=70, xy=0, y=0, yx=70] [L45] x++ VAL [X=200, Y=1, counter=71, v=-56, x=71, xy=0, y=0, yx=70] [L31] EXPR counter++ VAL [X=200, Y=1, counter=72, v=-56, x=71, xy=0, y=0, yx=70] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=72, v=-56, x=71, xy=0, y=0, yx=71] [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, counter=72] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=72, v=-56, x=71, xy=0, y=0, yx=71] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=72, v=-56, x=71, xy=0, y=0, yx=71] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=72, v=-54, x=71, xy=0, y=0, yx=71] [L45] x++ VAL [X=200, Y=1, counter=72, v=-54, x=72, xy=0, y=0, yx=71] [L31] EXPR counter++ VAL [X=200, Y=1, counter=73, v=-54, x=72, xy=0, y=0, yx=71] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=73, v=-54, x=72, xy=0, y=0, yx=72] [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, counter=73] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=73, v=-54, x=72, xy=0, y=0, yx=72] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=73, v=-54, x=72, xy=0, y=0, yx=72] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=73, v=-52, x=72, xy=0, y=0, yx=72] [L45] x++ VAL [X=200, Y=1, counter=73, v=-52, x=73, xy=0, y=0, yx=72] [L31] EXPR counter++ VAL [X=200, Y=1, counter=74, v=-52, x=73, xy=0, y=0, yx=72] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=74, v=-52, x=73, xy=0, y=0, yx=73] [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, counter=74] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=74, v=-52, x=73, xy=0, y=0, yx=73] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=74, v=-52, x=73, xy=0, y=0, yx=73] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=74, v=-50, x=73, xy=0, y=0, yx=73] [L45] x++ VAL [X=200, Y=1, counter=74, v=-50, x=74, xy=0, y=0, yx=73] [L31] EXPR counter++ VAL [X=200, Y=1, counter=75, v=-50, x=74, xy=0, y=0, yx=73] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=75, v=-50, x=74, xy=0, y=0, yx=74] [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, counter=75] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=75, v=-50, x=74, xy=0, y=0, yx=74] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=75, v=-50, x=74, xy=0, y=0, yx=74] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=75, v=-48, x=74, xy=0, y=0, yx=74] [L45] x++ VAL [X=200, Y=1, counter=75, v=-48, x=75, xy=0, y=0, yx=74] [L31] EXPR counter++ VAL [X=200, Y=1, counter=76, v=-48, x=75, xy=0, y=0, yx=74] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=76, v=-48, x=75, xy=0, y=0, yx=75] [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, counter=76] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=76, v=-48, x=75, xy=0, y=0, yx=75] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=76, v=-48, x=75, xy=0, y=0, yx=75] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=76, v=-46, x=75, xy=0, y=0, yx=75] [L45] x++ VAL [X=200, Y=1, counter=76, v=-46, x=76, xy=0, y=0, yx=75] [L31] EXPR counter++ VAL [X=200, Y=1, counter=77, v=-46, x=76, xy=0, y=0, yx=75] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=77, v=-46, x=76, xy=0, y=0, yx=76] [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, counter=77] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=77, v=-46, x=76, xy=0, y=0, yx=76] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=77, v=-46, x=76, xy=0, y=0, yx=76] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=77, v=-44, x=76, xy=0, y=0, yx=76] [L45] x++ VAL [X=200, Y=1, counter=77, v=-44, x=77, xy=0, y=0, yx=76] [L31] EXPR counter++ VAL [X=200, Y=1, counter=78, v=-44, x=77, xy=0, y=0, yx=76] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=78, v=-44, x=77, xy=0, y=0, yx=77] [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, counter=78] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=78, v=-44, x=77, xy=0, y=0, yx=77] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=78, v=-44, x=77, xy=0, y=0, yx=77] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=78, v=-42, x=77, xy=0, y=0, yx=77] [L45] x++ VAL [X=200, Y=1, counter=78, v=-42, x=78, xy=0, y=0, yx=77] [L31] EXPR counter++ VAL [X=200, Y=1, counter=79, v=-42, x=78, xy=0, y=0, yx=77] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=79, v=-42, x=78, xy=0, y=0, yx=78] [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, counter=79] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=79, v=-42, x=78, xy=0, y=0, yx=78] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=79, v=-42, x=78, xy=0, y=0, yx=78] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=79, v=-40, x=78, xy=0, y=0, yx=78] [L45] x++ VAL [X=200, Y=1, counter=79, v=-40, x=79, xy=0, y=0, yx=78] [L31] EXPR counter++ VAL [X=200, Y=1, counter=80, v=-40, x=79, xy=0, y=0, yx=78] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=80, v=-40, x=79, xy=0, y=0, yx=79] [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, counter=80] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=80, v=-40, x=79, xy=0, y=0, yx=79] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=80, v=-40, x=79, xy=0, y=0, yx=79] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=80, v=-38, x=79, xy=0, y=0, yx=79] [L45] x++ VAL [X=200, Y=1, counter=80, v=-38, x=80, xy=0, y=0, yx=79] [L31] EXPR counter++ VAL [X=200, Y=1, counter=81, v=-38, x=80, xy=0, y=0, yx=79] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=81, v=-38, x=80, xy=0, y=0, yx=80] [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, counter=81] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=81, v=-38, x=80, xy=0, y=0, yx=80] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=81, v=-38, x=80, xy=0, y=0, yx=80] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=81, v=-36, x=80, xy=0, y=0, yx=80] [L45] x++ VAL [X=200, Y=1, counter=81, v=-36, x=81, xy=0, y=0, yx=80] [L31] EXPR counter++ VAL [X=200, Y=1, counter=82, v=-36, x=81, xy=0, y=0, yx=80] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=82, v=-36, x=81, xy=0, y=0, yx=81] [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, counter=82] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=82, v=-36, x=81, xy=0, y=0, yx=81] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=82, v=-36, x=81, xy=0, y=0, yx=81] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=82, v=-34, x=81, xy=0, y=0, yx=81] [L45] x++ VAL [X=200, Y=1, counter=82, v=-34, x=82, xy=0, y=0, yx=81] [L31] EXPR counter++ VAL [X=200, Y=1, counter=83, v=-34, x=82, xy=0, y=0, yx=81] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=83, v=-34, x=82, xy=0, y=0, yx=82] [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, counter=83] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=83, v=-34, x=82, xy=0, y=0, yx=82] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=83, v=-34, x=82, xy=0, y=0, yx=82] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=83, v=-32, x=82, xy=0, y=0, yx=82] [L45] x++ VAL [X=200, Y=1, counter=83, v=-32, x=83, xy=0, y=0, yx=82] [L31] EXPR counter++ VAL [X=200, Y=1, counter=84, v=-32, x=83, xy=0, y=0, yx=82] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=84, v=-32, x=83, xy=0, y=0, yx=83] [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, counter=84] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=84, v=-32, x=83, xy=0, y=0, yx=83] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=84, v=-32, x=83, xy=0, y=0, yx=83] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=84, v=-30, x=83, xy=0, y=0, yx=83] [L45] x++ VAL [X=200, Y=1, counter=84, v=-30, x=84, xy=0, y=0, yx=83] [L31] EXPR counter++ VAL [X=200, Y=1, counter=85, v=-30, x=84, xy=0, y=0, yx=83] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=85, v=-30, x=84, xy=0, y=0, yx=84] [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, counter=85] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=85, v=-30, x=84, xy=0, y=0, yx=84] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=85, v=-30, x=84, xy=0, y=0, yx=84] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=85, v=-28, x=84, xy=0, y=0, yx=84] [L45] x++ VAL [X=200, Y=1, counter=85, v=-28, x=85, xy=0, y=0, yx=84] [L31] EXPR counter++ VAL [X=200, Y=1, counter=86, v=-28, x=85, xy=0, y=0, yx=84] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=86, v=-28, x=85, xy=0, y=0, yx=85] [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, counter=86] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=86, v=-28, x=85, xy=0, y=0, yx=85] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=86, v=-28, x=85, xy=0, y=0, yx=85] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=86, v=-26, x=85, xy=0, y=0, yx=85] [L45] x++ VAL [X=200, Y=1, counter=86, v=-26, x=86, xy=0, y=0, yx=85] [L31] EXPR counter++ VAL [X=200, Y=1, counter=87, v=-26, x=86, xy=0, y=0, yx=85] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=87, v=-26, x=86, xy=0, y=0, yx=86] [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, counter=87] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=87, v=-26, x=86, xy=0, y=0, yx=86] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=87, v=-26, x=86, xy=0, y=0, yx=86] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=87, v=-24, x=86, xy=0, y=0, yx=86] [L45] x++ VAL [X=200, Y=1, counter=87, v=-24, x=87, xy=0, y=0, yx=86] [L31] EXPR counter++ VAL [X=200, Y=1, counter=88, v=-24, x=87, xy=0, y=0, yx=86] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=88, v=-24, x=87, xy=0, y=0, yx=87] [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, counter=88] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=88, v=-24, x=87, xy=0, y=0, yx=87] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=88, v=-24, x=87, xy=0, y=0, yx=87] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=88, v=-22, x=87, xy=0, y=0, yx=87] [L45] x++ VAL [X=200, Y=1, counter=88, v=-22, x=88, xy=0, y=0, yx=87] [L31] EXPR counter++ VAL [X=200, Y=1, counter=89, v=-22, x=88, xy=0, y=0, yx=87] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=89, v=-22, x=88, xy=0, y=0, yx=88] [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, counter=89] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=89, v=-22, x=88, xy=0, y=0, yx=88] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=89, v=-22, x=88, xy=0, y=0, yx=88] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=89, v=-20, x=88, xy=0, y=0, yx=88] [L45] x++ VAL [X=200, Y=1, counter=89, v=-20, x=89, xy=0, y=0, yx=88] [L31] EXPR counter++ VAL [X=200, Y=1, counter=90, v=-20, x=89, xy=0, y=0, yx=88] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=90, v=-20, x=89, xy=0, y=0, yx=89] [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, counter=90] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=90, v=-20, x=89, xy=0, y=0, yx=89] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=90, v=-20, x=89, xy=0, y=0, yx=89] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=90, v=-18, x=89, xy=0, y=0, yx=89] [L45] x++ VAL [X=200, Y=1, counter=90, v=-18, x=90, xy=0, y=0, yx=89] [L31] EXPR counter++ VAL [X=200, Y=1, counter=91, v=-18, x=90, xy=0, y=0, yx=89] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=91, v=-18, x=90, xy=0, y=0, yx=90] [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, counter=91] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=91, v=-18, x=90, xy=0, y=0, yx=90] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=91, v=-18, x=90, xy=0, y=0, yx=90] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=91, v=-16, x=90, xy=0, y=0, yx=90] [L45] x++ VAL [X=200, Y=1, counter=91, v=-16, x=91, xy=0, y=0, yx=90] [L31] EXPR counter++ VAL [X=200, Y=1, counter=92, v=-16, x=91, xy=0, y=0, yx=90] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=92, v=-16, x=91, xy=0, y=0, yx=91] [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, counter=92] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=92, v=-16, x=91, xy=0, y=0, yx=91] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=92, v=-16, x=91, xy=0, y=0, yx=91] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=92, v=-14, x=91, xy=0, y=0, yx=91] [L45] x++ VAL [X=200, Y=1, counter=92, v=-14, x=92, xy=0, y=0, yx=91] [L31] EXPR counter++ VAL [X=200, Y=1, counter=93, v=-14, x=92, xy=0, y=0, yx=91] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=93, v=-14, x=92, xy=0, y=0, yx=92] [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, counter=93] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=93, v=-14, x=92, xy=0, y=0, yx=92] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=93, v=-14, x=92, xy=0, y=0, yx=92] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=93, v=-12, x=92, xy=0, y=0, yx=92] [L45] x++ VAL [X=200, Y=1, counter=93, v=-12, x=93, xy=0, y=0, yx=92] [L31] EXPR counter++ VAL [X=200, Y=1, counter=94, v=-12, x=93, xy=0, y=0, yx=92] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=94, v=-12, x=93, xy=0, y=0, yx=93] [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, counter=94] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=94, v=-12, x=93, xy=0, y=0, yx=93] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=94, v=-12, x=93, xy=0, y=0, yx=93] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=94, v=-10, x=93, xy=0, y=0, yx=93] [L45] x++ VAL [X=200, Y=1, counter=94, v=-10, x=94, xy=0, y=0, yx=93] [L31] EXPR counter++ VAL [X=200, Y=1, counter=95, v=-10, x=94, xy=0, y=0, yx=93] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=95, v=-10, x=94, xy=0, y=0, yx=94] [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, counter=95] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=95, v=-10, x=94, xy=0, y=0, yx=94] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=95, v=-10, x=94, xy=0, y=0, yx=94] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=95, v=-8, x=94, xy=0, y=0, yx=94] [L45] x++ VAL [X=200, Y=1, counter=95, v=-8, x=95, xy=0, y=0, yx=94] [L31] EXPR counter++ VAL [X=200, Y=1, counter=96, v=-8, x=95, xy=0, y=0, yx=94] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=96, v=-8, x=95, xy=0, y=0, yx=95] [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, counter=96] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=96, v=-8, x=95, xy=0, y=0, yx=95] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=96, v=-8, x=95, xy=0, y=0, yx=95] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=96, v=-6, x=95, xy=0, y=0, yx=95] [L45] x++ VAL [X=200, Y=1, counter=96, v=-6, x=96, xy=0, y=0, yx=95] [L31] EXPR counter++ VAL [X=200, Y=1, counter=97, v=-6, x=96, xy=0, y=0, yx=95] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=97, v=-6, x=96, xy=0, y=0, yx=96] [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, counter=97] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=97, v=-6, x=96, xy=0, y=0, yx=96] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=97, v=-6, x=96, xy=0, y=0, yx=96] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=97, v=-4, x=96, xy=0, y=0, yx=96] [L45] x++ VAL [X=200, Y=1, counter=97, v=-4, x=97, xy=0, y=0, yx=96] [L31] EXPR counter++ VAL [X=200, Y=1, counter=98, v=-4, x=97, xy=0, y=0, yx=96] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=98, v=-4, x=97, xy=0, y=0, yx=97] [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, counter=98] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=98, v=-4, x=97, xy=0, y=0, yx=97] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=98, v=-4, x=97, xy=0, y=0, yx=97] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=98, v=-2, x=97, xy=0, y=0, yx=97] [L45] x++ VAL [X=200, Y=1, counter=98, v=-2, x=98, xy=0, y=0, yx=97] [L31] EXPR counter++ VAL [X=200, Y=1, counter=99, v=-2, x=98, xy=0, y=0, yx=97] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=99, v=-2, x=98, xy=0, y=0, yx=98] [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, counter=99] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=99, v=-2, x=98, xy=0, y=0, yx=98] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=99, v=-2, x=98, xy=0, y=0, yx=98] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=99, v=0, x=98, xy=0, y=0, yx=98] [L45] x++ VAL [X=200, Y=1, counter=99, v=0, x=99, xy=0, y=0, yx=98] [L31] EXPR counter++ VAL [X=200, Y=1, counter=100, v=0, x=99, xy=0, y=0, yx=98] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=100, v=0, x=99, xy=0, y=0, yx=99] [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, counter=100] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=100, v=0, x=99, xy=0, y=0, yx=99] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=100, v=0, x=99, xy=0, y=0, yx=99] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [X=200, Y=1, counter=100, v=-398, x=99, xy=0, y=1, yx=99] [L45] x++ VAL [X=200, Y=1, counter=100, v=-398, x=100, xy=0, y=1, yx=99] [L31] EXPR counter++ VAL [X=200, Y=1, counter=101, v=-398, x=100, xy=0, y=1, yx=99] [L31] COND FALSE !(counter++<100) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [X=200, Y=1, counter=101, v=-398, xy=100, y=1, yx=100] [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, counter=101] [L16] reach_error() VAL [\old(cond)=0, counter=101] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 37.8s, OverallIterations: 14, TraceHistogramMax: 101, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 10.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1806 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1804 mSDsluCounter, 2471 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2277 mSDsCounter, 313 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1737 IncrementalHoareTripleChecker+Invalid, 2050 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 313 mSolverCounterUnsat, 194 mSDtfsCounter, 1737 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2889 GetRequests, 2302 SyntacticMatches, 12 SemanticMatches, 575 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12039 ImplicationChecksByTransitivity, 15.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2199occurred in iteration=13, InterpolantAutomatonStates: 568, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 69 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 19.0s InterpolantComputationTime, 4741 NumberOfCodeBlocks, 4642 NumberOfCodeBlocksAsserted, 143 NumberOfCheckSat, 3624 ConstructedInterpolants, 2 QuantifiedInterpolants, 10217 SizeOfPredicates, 114 NumberOfNonLiveVariables, 2867 ConjunctsInSsa, 304 ConjunctsInUnsatCore, 28 InterpolantComputations, 4 PerfectInterpolantSequences, 14298/54297 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-12-02 12:15:47,450 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01abd757-a695-47ae-bca7-b2e634cd90bf/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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