./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB --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 0bb6ea6333d2c4e133ad252fe2bcbc17b832f383e2bb5defb402851de157204c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:05:18,773 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:05:18,852 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 03:05:18,859 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:05:18,859 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:05:18,899 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:05:18,903 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:05:18,903 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:05:18,904 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:05:18,904 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:05:18,904 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:05:18,904 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:05:18,904 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:05:18,904 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:05:18,904 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:05:18,905 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:05:18,905 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 03:05:18,905 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:05:18,905 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:05:18,905 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:05:18,905 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:05:18,905 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 03:05:18,905 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:05:18,905 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 03:05:18,906 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:05:18,906 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 03:05:18,906 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:05:18,906 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:05:18,908 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:05:18,908 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:05:18,908 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:05:18,908 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:05:18,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:05:18,908 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:05:18,908 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:05:18,908 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:05:18,908 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:05:18,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:05:18,909 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:05:18,909 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:05:18,909 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 03:05:18,909 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 03:05:18,909 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:05:18,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:05:18,909 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:05:18,909 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:05:18,909 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:05:18,909 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:05:18,909 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_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 0bb6ea6333d2c4e133ad252fe2bcbc17b832f383e2bb5defb402851de157204c [2024-11-28 03:05:19,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:05:19,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:05:19,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:05:19,239 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:05:19,240 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:05:19,241 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c [2024-11-28 03:05:22,207 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/data/5e38e955f/dca1bbadc2cf45939579e964717ec019/FLAGcbc3a7466 [2024-11-28 03:05:22,435 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:05:22,436 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c [2024-11-28 03:05:22,445 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/data/5e38e955f/dca1bbadc2cf45939579e964717ec019/FLAGcbc3a7466 [2024-11-28 03:05:22,470 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/data/5e38e955f/dca1bbadc2cf45939579e964717ec019 [2024-11-28 03:05:22,472 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:05:22,474 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:05:22,477 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:05:22,477 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:05:22,483 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:05:22,484 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:05:22" (1/1) ... [2024-11-28 03:05:22,485 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ee3f563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:22, skipping insertion in model container [2024-11-28 03:05:22,487 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:05:22" (1/1) ... [2024-11-28 03:05:22,502 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:05:22,659 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_d7bfff34-0bf1-4cbe-8061-876172976627/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c[597,610] [2024-11-28 03:05:22,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:05:22,694 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:05:22,705 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_d7bfff34-0bf1-4cbe-8061-876172976627/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c[597,610] [2024-11-28 03:05:22,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:05:22,736 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:05:22,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:22 WrapperNode [2024-11-28 03:05:22,738 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:05:22,740 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:05:22,740 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:05:22,740 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:05:22,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:22" (1/1) ... [2024-11-28 03:05:22,754 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:22" (1/1) ... [2024-11-28 03:05:22,770 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2024-11-28 03:05:22,771 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:05:22,771 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:05:22,772 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:05:22,772 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:05:22,780 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:22" (1/1) ... [2024-11-28 03:05:22,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:22" (1/1) ... [2024-11-28 03:05:22,782 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:22" (1/1) ... [2024-11-28 03:05:22,796 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-11-28 03:05:22,797 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:22" (1/1) ... [2024-11-28 03:05:22,797 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:22" (1/1) ... [2024-11-28 03:05:22,800 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:22" (1/1) ... [2024-11-28 03:05:22,802 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:22" (1/1) ... [2024-11-28 03:05:22,806 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:22" (1/1) ... [2024-11-28 03:05:22,809 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:22" (1/1) ... [2024-11-28 03:05:22,810 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:22" (1/1) ... [2024-11-28 03:05:22,811 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:05:22,816 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:05:22,816 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:05:22,816 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:05:22,817 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:22" (1/1) ... [2024-11-28 03:05:22,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:05:22,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:05:22,851 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:05:22,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:05:22,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:05:22,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 03:05:22,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:05:22,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:05:22,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-28 03:05:22,883 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-28 03:05:22,944 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:05:22,946 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:05:23,091 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-28 03:05:23,091 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:05:23,100 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:05:23,100 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-28 03:05:23,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:05:23 BoogieIcfgContainer [2024-11-28 03:05:23,100 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:05:23,103 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:05:23,103 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:05:23,108 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:05:23,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:05:22" (1/3) ... [2024-11-28 03:05:23,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c5ed29e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:05:23, skipping insertion in model container [2024-11-28 03:05:23,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:22" (2/3) ... [2024-11-28 03:05:23,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c5ed29e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:05:23, skipping insertion in model container [2024-11-28 03:05:23,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:05:23" (3/3) ... [2024-11-28 03:05:23,111 INFO L128 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound50.c [2024-11-28 03:05:23,127 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:05:23,128 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bresenham-ll_unwindbound50.c that has 2 procedures, 21 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-28 03:05:23,179 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:05:23,190 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;@294b53d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:05:23,191 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 03:05:23,194 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-11-28 03:05:23,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-28 03:05:23,200 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:05:23,200 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:05:23,201 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:05:23,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:05:23,206 INFO L85 PathProgramCache]: Analyzing trace with hash 798370362, now seen corresponding path program 1 times [2024-11-28 03:05:23,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:05:23,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113304870] [2024-11-28 03:05:23,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:05:23,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:05:23,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:05:23,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:05:23,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:05:23,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113304870] [2024-11-28 03:05:23,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113304870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:05:23,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:05:23,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:05:23,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319420357] [2024-11-28 03:05:23,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:05:23,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 03:05:23,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:05:23,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 03:05:23,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 03:05:23,358 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-11-28 03:05:23,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:05:23,376 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2024-11-28 03:05:23,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 03:05:23,378 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-11-28 03:05:23,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:05:23,385 INFO L225 Difference]: With dead ends: 40 [2024-11-28 03:05:23,385 INFO L226 Difference]: Without dead ends: 17 [2024-11-28 03:05:23,387 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-11-28 03:05:23,395 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-11-28 03:05:23,395 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-11-28 03:05:23,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-28 03:05:23,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-28 03:05:23,428 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-11-28 03:05:23,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2024-11-28 03:05:23,433 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 8 [2024-11-28 03:05:23,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:05:23,433 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-11-28 03:05:23,433 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-11-28 03:05:23,434 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2024-11-28 03:05:23,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-28 03:05:23,434 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:05:23,434 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:05:23,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 03:05:23,435 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:05:23,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:05:23,437 INFO L85 PathProgramCache]: Analyzing trace with hash 295298814, now seen corresponding path program 1 times [2024-11-28 03:05:23,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:05:23,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114363586] [2024-11-28 03:05:23,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:05:23,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:05:23,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-28 03:05:23,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1203913552] [2024-11-28 03:05:23,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:05:23,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:05:23,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:05:23,494 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:05:23,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 03:05:23,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:05:23,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-28 03:05:23,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:05:23,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:05:23,789 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:05:23,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:05:23,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114363586] [2024-11-28 03:05:23,790 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-28 03:05:23,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203913552] [2024-11-28 03:05:23,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203913552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:05:23,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:05:23,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:05:23,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742092427] [2024-11-28 03:05:23,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:05:23,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:05:23,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:05:23,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:05:23,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:05:23,793 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-11-28 03:05:23,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:05:23,907 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2024-11-28 03:05:23,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 03:05:23,908 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-11-28 03:05:23,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:05:23,909 INFO L225 Difference]: With dead ends: 32 [2024-11-28 03:05:23,909 INFO L226 Difference]: Without dead ends: 30 [2024-11-28 03:05:23,910 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-11-28 03:05:23,910 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-11-28 03:05:23,911 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-11-28 03:05:23,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-28 03:05:23,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2024-11-28 03:05:23,917 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-11-28 03:05:23,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-11-28 03:05:23,918 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 9 [2024-11-28 03:05:23,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:05:23,918 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-11-28 03:05:23,918 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-11-28 03:05:23,918 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-11-28 03:05:23,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-28 03:05:23,919 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:05:23,919 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:05:23,928 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-28 03:05:24,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:05:24,124 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:05:24,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:05:24,124 INFO L85 PathProgramCache]: Analyzing trace with hash 368316555, now seen corresponding path program 1 times [2024-11-28 03:05:24,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:05:24,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224863] [2024-11-28 03:05:24,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:05:24,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:05:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:05:24,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:05:24,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:05:24,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224863] [2024-11-28 03:05:24,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:05:24,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:05:24,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:05:24,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649310302] [2024-11-28 03:05:24,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:05:24,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:05:24,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:05:24,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:05:24,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:05:24,213 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-11-28 03:05:24,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:05:24,234 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2024-11-28 03:05:24,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:05:24,235 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-11-28 03:05:24,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:05:24,237 INFO L225 Difference]: With dead ends: 33 [2024-11-28 03:05:24,237 INFO L226 Difference]: Without dead ends: 25 [2024-11-28 03:05:24,237 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-11-28 03:05:24,238 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-11-28 03:05:24,238 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-11-28 03:05:24,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-28 03:05:24,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-28 03:05:24,243 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-11-28 03:05:24,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2024-11-28 03:05:24,244 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 9 [2024-11-28 03:05:24,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:05:24,244 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2024-11-28 03:05:24,244 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-11-28 03:05:24,244 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2024-11-28 03:05:24,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-28 03:05:24,245 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:05:24,245 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:05:24,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 03:05:24,245 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:05:24,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:05:24,245 INFO L85 PathProgramCache]: Analyzing trace with hash -156697420, now seen corresponding path program 1 times [2024-11-28 03:05:24,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:05:24,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035449795] [2024-11-28 03:05:24,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:05:24,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:05:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-28 03:05:24,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1495315857] [2024-11-28 03:05:24,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:05:24,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:05:24,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:05:24,279 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:05:24,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 03:05:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:05:24,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-28 03:05:24,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:05:24,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:05:24,549 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:05:24,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:05:24,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035449795] [2024-11-28 03:05:24,549 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-28 03:05:24,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495315857] [2024-11-28 03:05:24,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495315857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:05:24,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:05:24,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:05:24,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258234867] [2024-11-28 03:05:24,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:05:24,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:05:24,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:05:24,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:05:24,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:05:24,553 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-11-28 03:05:24,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:05:24,665 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2024-11-28 03:05:24,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 03:05:24,666 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-11-28 03:05:24,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:05:24,666 INFO L225 Difference]: With dead ends: 35 [2024-11-28 03:05:24,666 INFO L226 Difference]: Without dead ends: 27 [2024-11-28 03:05:24,667 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-11-28 03:05:24,667 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-11-28 03:05:24,668 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-11-28 03:05:24,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-28 03:05:24,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2024-11-28 03:05:24,673 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-11-28 03:05:24,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2024-11-28 03:05:24,674 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 16 [2024-11-28 03:05:24,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:05:24,674 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2024-11-28 03:05:24,675 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-11-28 03:05:24,675 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2024-11-28 03:05:24,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-28 03:05:24,677 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:05:24,677 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:05:24,685 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 03:05:24,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:05:24,878 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:05:24,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:05:24,878 INFO L85 PathProgramCache]: Analyzing trace with hash -716773380, now seen corresponding path program 1 times [2024-11-28 03:05:24,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:05:24,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307505352] [2024-11-28 03:05:24,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:05:24,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:05:24,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-28 03:05:24,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [39868599] [2024-11-28 03:05:24,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:05:24,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:05:24,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:05:24,926 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:05:24,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 03:05:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:05:24,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-28 03:05:24,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:05:25,226 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:05:25,226 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:05:25,393 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 03:05:25,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:05:25,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307505352] [2024-11-28 03:05:25,394 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-28 03:05:25,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39868599] [2024-11-28 03:05:25,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39868599] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:05:25,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:05:25,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2024-11-28 03:05:25,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719939904] [2024-11-28 03:05:25,397 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:05:25,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 03:05:25,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:05:25,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 03:05:25,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-28 03:05:25,399 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-11-28 03:05:25,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:05:25,632 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2024-11-28 03:05:25,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 03:05:25,634 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-11-28 03:05:25,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:05:25,635 INFO L225 Difference]: With dead ends: 44 [2024-11-28 03:05:25,635 INFO L226 Difference]: Without dead ends: 40 [2024-11-28 03:05:25,635 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-11-28 03:05:25,636 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-11-28 03:05:25,636 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-11-28 03:05:25,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-28 03:05:25,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2024-11-28 03:05:25,650 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-11-28 03:05:25,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2024-11-28 03:05:25,652 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 20 [2024-11-28 03:05:25,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:05:25,652 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2024-11-28 03:05:25,653 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-11-28 03:05:25,653 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2024-11-28 03:05:25,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-28 03:05:25,654 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:05:25,654 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:05:25,663 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-28 03:05:25,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:05:25,858 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:05:25,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:05:25,859 INFO L85 PathProgramCache]: Analyzing trace with hash -643755639, now seen corresponding path program 1 times [2024-11-28 03:05:25,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:05:25,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447806554] [2024-11-28 03:05:25,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:05:25,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:05:25,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:05:25,993 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:05:25,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:05:25,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447806554] [2024-11-28 03:05:25,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447806554] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:05:25,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335085632] [2024-11-28 03:05:25,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:05:25,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:05:25,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:05:25,996 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:05:25,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 03:05:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:05:26,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 03:05:26,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:05:26,086 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:05:26,088 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:05:26,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:05:26,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335085632] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:05:26,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:05:26,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 8 [2024-11-28 03:05:26,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545064036] [2024-11-28 03:05:26,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:05:26,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 03:05:26,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:05:26,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 03:05:26,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:05:26,142 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-11-28 03:05:26,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:05:26,233 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2024-11-28 03:05:26,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:05:26,236 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-11-28 03:05:26,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:05:26,236 INFO L225 Difference]: With dead ends: 72 [2024-11-28 03:05:26,236 INFO L226 Difference]: Without dead ends: 66 [2024-11-28 03:05:26,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-28 03:05:26,237 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-11-28 03:05:26,238 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-11-28 03:05:26,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-28 03:05:26,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2024-11-28 03:05:26,251 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-11-28 03:05:26,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2024-11-28 03:05:26,252 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 20 [2024-11-28 03:05:26,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:05:26,252 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2024-11-28 03:05:26,252 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-11-28 03:05:26,252 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2024-11-28 03:05:26,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-28 03:05:26,253 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:05:26,253 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:05:26,262 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 03:05:26,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:05:26,454 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:05:26,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:05:26,455 INFO L85 PathProgramCache]: Analyzing trace with hash 935756278, now seen corresponding path program 1 times [2024-11-28 03:05:26,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:05:26,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087000729] [2024-11-28 03:05:26,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:05:26,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:05:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-28 03:05:26,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [416607186] [2024-11-28 03:05:26,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:05:26,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:05:26,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:05:26,481 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:05:26,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 03:05:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:05:26,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-28 03:05:26,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:05:26,739 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 03:05:26,740 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:05:26,937 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 03:05:26,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:05:26,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087000729] [2024-11-28 03:05:26,938 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-28 03:05:26,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416607186] [2024-11-28 03:05:26,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416607186] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:05:26,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:05:26,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2024-11-28 03:05:26,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581383925] [2024-11-28 03:05:26,939 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:05:26,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 03:05:26,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:05:26,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 03:05:26,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-28 03:05:26,940 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-11-28 03:05:27,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:05:27,150 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2024-11-28 03:05:27,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 03:05:27,150 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-11-28 03:05:27,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:05:27,152 INFO L225 Difference]: With dead ends: 86 [2024-11-28 03:05:27,152 INFO L226 Difference]: Without dead ends: 80 [2024-11-28 03:05:27,152 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-11-28 03:05:27,153 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-11-28 03:05:27,153 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-11-28 03:05:27,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-28 03:05:27,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2024-11-28 03:05:27,183 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-11-28 03:05:27,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2024-11-28 03:05:27,187 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 92 transitions. Word has length 27 [2024-11-28 03:05:27,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:05:27,187 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 92 transitions. [2024-11-28 03:05:27,187 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-11-28 03:05:27,187 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 92 transitions. [2024-11-28 03:05:27,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-28 03:05:27,191 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:05:27,191 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:05:27,203 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-28 03:05:27,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-28 03:05:27,392 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:05:27,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:05:27,393 INFO L85 PathProgramCache]: Analyzing trace with hash -85312076, now seen corresponding path program 1 times [2024-11-28 03:05:27,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:05:27,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129959536] [2024-11-28 03:05:27,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:05:27,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:05:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-28 03:05:27,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [163056697] [2024-11-28 03:05:27,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:05:27,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:05:27,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:05:27,438 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:05:27,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 03:05:27,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:05:27,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-28 03:05:27,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:05:27,815 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 03:05:27,815 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:05:28,173 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 03:05:28,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:05:28,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129959536] [2024-11-28 03:05:28,173 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-28 03:05:28,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163056697] [2024-11-28 03:05:28,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163056697] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:05:28,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:05:28,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2024-11-28 03:05:28,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988177409] [2024-11-28 03:05:28,174 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:05:28,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-28 03:05:28,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:05:28,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-28 03:05:28,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2024-11-28 03:05:28,175 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-11-28 03:05:28,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:05:28,975 INFO L93 Difference]: Finished difference Result 87 states and 100 transitions. [2024-11-28 03:05:28,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-28 03:05:28,976 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-11-28 03:05:28,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:05:28,977 INFO L225 Difference]: With dead ends: 87 [2024-11-28 03:05:28,977 INFO L226 Difference]: Without dead ends: 79 [2024-11-28 03:05:28,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=231, Invalid=1029, Unknown=0, NotChecked=0, Total=1260 [2024-11-28 03:05:28,978 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 32 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:05:28,978 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.3s Time] [2024-11-28 03:05:28,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-28 03:05:29,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 54. [2024-11-28 03:05:29,001 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-11-28 03:05:29,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2024-11-28 03:05:29,003 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 27 [2024-11-28 03:05:29,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:05:29,004 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2024-11-28 03:05:29,004 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-11-28 03:05:29,004 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2024-11-28 03:05:29,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-28 03:05:29,005 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:05:29,006 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:05:29,015 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-28 03:05:29,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-28 03:05:29,206 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:05:29,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:05:29,207 INFO L85 PathProgramCache]: Analyzing trace with hash 380685067, now seen corresponding path program 2 times [2024-11-28 03:05:29,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:05:29,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731992195] [2024-11-28 03:05:29,207 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:05:29,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:05:29,244 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:05:29,248 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:05:29,564 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 8 proven. 50 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-28 03:05:29,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:05:29,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731992195] [2024-11-28 03:05:29,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731992195] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:05:29,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884786285] [2024-11-28 03:05:29,565 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:05:29,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:05:29,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:05:29,567 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:05:29,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 03:05:29,628 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:05:29,628 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:05:29,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-28 03:05:29,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:05:29,726 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 8 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:05:29,726 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:05:29,890 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 8 proven. 50 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-28 03:05:29,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884786285] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:05:29,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:05:29,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 15 [2024-11-28 03:05:29,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638180951] [2024-11-28 03:05:29,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:05:29,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 03:05:29,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:05:29,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 03:05:29,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2024-11-28 03:05:29,894 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-11-28 03:05:30,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:05:30,110 INFO L93 Difference]: Finished difference Result 126 states and 141 transitions. [2024-11-28 03:05:30,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-28 03:05:30,111 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-11-28 03:05:30,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:05:30,112 INFO L225 Difference]: With dead ends: 126 [2024-11-28 03:05:30,115 INFO L226 Difference]: Without dead ends: 120 [2024-11-28 03:05:30,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2024-11-28 03:05:30,117 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-11-28 03:05:30,117 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-11-28 03:05:30,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-28 03:05:30,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-28 03:05:30,161 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-11-28 03:05:30,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2024-11-28 03:05:30,162 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 53 [2024-11-28 03:05:30,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:05:30,163 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2024-11-28 03:05:30,163 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-11-28 03:05:30,163 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2024-11-28 03:05:30,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-28 03:05:30,168 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:05:30,168 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:05:30,181 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-28 03:05:30,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-28 03:05:30,369 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:05:30,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:05:30,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1638130997, now seen corresponding path program 3 times [2024-11-28 03:05:30,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:05:30,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542617020] [2024-11-28 03:05:30,370 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 03:05:30,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:05:30,476 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-28 03:05:30,476 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:05:31,699 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 20 proven. 335 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-28 03:05:31,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:05:31,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542617020] [2024-11-28 03:05:31,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542617020] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:05:31,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715271816] [2024-11-28 03:05:31,700 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 03:05:31,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:05:31,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:05:31,702 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:05:31,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 03:05:31,767 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-28 03:05:31,767 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:05:31,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-28 03:05:31,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:05:32,192 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 102 proven. 1 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2024-11-28 03:05:32,192 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:05:32,715 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 46 proven. 57 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2024-11-28 03:05:32,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715271816] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:05:32,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:05:32,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 11, 12] total 37 [2024-11-28 03:05:32,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229089111] [2024-11-28 03:05:32,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:05:32,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-28 03:05:32,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:05:32,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-28 03:05:32,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1129, Unknown=0, NotChecked=0, Total=1332 [2024-11-28 03:05:32,721 INFO L87 Difference]: Start difference. First operand 120 states and 130 transitions. Second operand has 37 states, 33 states have (on average 3.0303030303030303) internal successors, (100), 36 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-11-28 03:05:36,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:05:36,624 INFO L93 Difference]: Finished difference Result 254 states and 277 transitions. [2024-11-28 03:05:36,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2024-11-28 03:05:36,625 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 33 states have (on average 3.0303030303030303) internal successors, (100), 36 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-11-28 03:05:36,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:05:36,626 INFO L225 Difference]: With dead ends: 254 [2024-11-28 03:05:36,627 INFO L226 Difference]: Without dead ends: 244 [2024-11-28 03:05:36,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 222 SyntacticMatches, 3 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4856 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2195, Invalid=13555, Unknown=0, NotChecked=0, Total=15750 [2024-11-28 03:05:36,634 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 251 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:05:36,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 127 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 03:05:36,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-28 03:05:36,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2024-11-28 03:05:36,678 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-11-28 03:05:36,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 262 transitions. [2024-11-28 03:05:36,680 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 262 transitions. Word has length 119 [2024-11-28 03:05:36,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:05:36,680 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 262 transitions. [2024-11-28 03:05:36,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 33 states have (on average 3.0303030303030303) internal successors, (100), 36 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-11-28 03:05:36,681 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 262 transitions. [2024-11-28 03:05:36,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-28 03:05:36,685 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:05:36,685 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-11-28 03:05:36,694 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-28 03:05:36,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-28 03:05:36,886 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:05:36,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:05:36,886 INFO L85 PathProgramCache]: Analyzing trace with hash -2053046965, now seen corresponding path program 1 times [2024-11-28 03:05:36,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:05:36,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368336267] [2024-11-28 03:05:36,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:05:36,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:05:36,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:05:37,487 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 22 proven. 407 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-28 03:05:37,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:05:37,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368336267] [2024-11-28 03:05:37,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368336267] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:05:37,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380618597] [2024-11-28 03:05:37,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:05:37,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:05:37,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:05:37,490 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:05:37,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 03:05:37,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:05:37,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-28 03:05:37,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:05:37,828 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 22 proven. 627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:05:37,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:05:38,324 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 22 proven. 407 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-28 03:05:38,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380618597] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:05:38,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:05:38,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 28 [2024-11-28 03:05:38,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382526189] [2024-11-28 03:05:38,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:05:38,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-28 03:05:38,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:05:38,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-28 03:05:38,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2024-11-28 03:05:38,328 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-11-28 03:05:38,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:05:38,978 INFO L93 Difference]: Finished difference Result 536 states and 595 transitions. [2024-11-28 03:05:38,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-28 03:05:38,979 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-11-28 03:05:38,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:05:38,982 INFO L225 Difference]: With dead ends: 536 [2024-11-28 03:05:38,982 INFO L226 Difference]: Without dead ends: 530 [2024-11-28 03:05:38,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=940, Invalid=1610, Unknown=0, NotChecked=0, Total=2550 [2024-11-28 03:05:38,984 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 143 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:05:38,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 266 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:05:38,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2024-11-28 03:05:39,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 527. [2024-11-28 03:05:39,094 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-11-28 03:05:39,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 574 transitions. [2024-11-28 03:05:39,097 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 574 transitions. Word has length 130 [2024-11-28 03:05:39,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:05:39,097 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 574 transitions. [2024-11-28 03:05:39,100 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-11-28 03:05:39,101 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 574 transitions. [2024-11-28 03:05:39,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2024-11-28 03:05:39,107 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:05:39,107 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-11-28 03:05:39,117 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-28 03:05:39,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:05:39,308 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:05:39,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:05:39,309 INFO L85 PathProgramCache]: Analyzing trace with hash 182128013, now seen corresponding path program 2 times [2024-11-28 03:05:39,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:05:39,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233709000] [2024-11-28 03:05:39,309 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:05:39,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:05:39,384 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:05:39,384 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:05:41,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3132 backedges. 48 proven. 1980 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-28 03:05:41,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:05:41,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233709000] [2024-11-28 03:05:41,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233709000] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:05:41,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030978820] [2024-11-28 03:05:41,330 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:05:41,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:05:41,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:05:41,335 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:05:41,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 03:05:41,490 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:05:41,490 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:05:41,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-28 03:05:41,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:05:41,856 INFO L134 CoverageAnalysis]: Checked inductivity of 3132 backedges. 48 proven. 3084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:05:41,856 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:05:43,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3132 backedges. 48 proven. 1980 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-28 03:05:43,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030978820] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:05:43,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:05:43,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 28] total 55 [2024-11-28 03:05:43,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825993500] [2024-11-28 03:05:43,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:05:43,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-11-28 03:05:43,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:05:43,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-28 03:05:43,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1361, Invalid=1609, Unknown=0, NotChecked=0, Total=2970 [2024-11-28 03:05:43,160 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-11-28 03:05:44,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:05:44,821 INFO L93 Difference]: Finished difference Result 1108 states and 1232 transitions. [2024-11-28 03:05:44,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2024-11-28 03:05:44,822 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-11-28 03:05:44,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:05:44,828 INFO L225 Difference]: With dead ends: 1108 [2024-11-28 03:05:44,829 INFO L226 Difference]: Without dead ends: 1102 [2024-11-28 03:05:44,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 520 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2075 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3904, Invalid=6602, Unknown=0, NotChecked=0, Total=10506 [2024-11-28 03:05:44,832 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 322 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:05:44,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 469 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 03:05:44,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2024-11-28 03:05:44,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 1099. [2024-11-28 03:05:44,996 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-11-28 03:05:45,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1198 transitions. [2024-11-28 03:05:45,002 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1198 transitions. Word has length 273 [2024-11-28 03:05:45,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:05:45,005 INFO L471 AbstractCegarLoop]: Abstraction has 1099 states and 1198 transitions. [2024-11-28 03:05:45,006 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-11-28 03:05:45,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1198 transitions. [2024-11-28 03:05:45,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2024-11-28 03:05:45,024 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:05:45,025 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-11-28 03:05:45,034 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-28 03:05:45,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:05:45,225 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:05:45,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:05:45,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1615446477, now seen corresponding path program 3 times [2024-11-28 03:05:45,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:05:45,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143662827] [2024-11-28 03:05:45,226 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 03:05:45,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:05:45,902 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2024-11-28 03:05:45,902 INFO L230 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-28 03:05:45,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1476953179] [2024-11-28 03:05:45,908 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 03:05:45,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:05:45,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:05:45,912 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:05:45,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 03:05:46,516 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2024-11-28 03:05:46,516 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-28 03:05:46,516 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:05:46,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:05:46,955 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-28 03:05:46,955 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 03:05:46,956 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-28 03:05:46,966 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-28 03:05:47,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-28 03:05:47,161 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:05:47,322 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 03:05:47,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:05:47 BoogieIcfgContainer [2024-11-28 03:05:47,325 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 03:05:47,326 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 03:05:47,326 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 03:05:47,326 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 03:05:47,333 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:05:23" (3/4) ... [2024-11-28 03:05:47,334 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-28 03:05:47,554 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 304. [2024-11-28 03:05:47,756 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-28 03:05:47,757 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-28 03:05:47,757 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 03:05:47,758 INFO L158 Benchmark]: Toolchain (without parser) took 25283.76ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 117.7MB in the beginning and 180.7MB in the end (delta: -63.0MB). Peak memory consumption was 96.9MB. Max. memory is 16.1GB. [2024-11-28 03:05:47,758 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 117.4MB. Free memory is still 74.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:05:47,758 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.65ms. Allocated memory is still 142.6MB. Free memory was 117.5MB in the beginning and 106.3MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:05:47,758 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.09ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 105.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:05:47,759 INFO L158 Benchmark]: Boogie Preprocessor took 43.90ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 103.8MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:05:47,759 INFO L158 Benchmark]: RCFGBuilder took 284.96ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 93.1MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:05:47,759 INFO L158 Benchmark]: TraceAbstraction took 24222.00ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 92.6MB in the beginning and 214.2MB in the end (delta: -121.6MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB. [2024-11-28 03:05:47,760 INFO L158 Benchmark]: Witness Printer took 431.26ms. Allocated memory is still 302.0MB. Free memory was 214.2MB in the beginning and 180.7MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-28 03:05:47,761 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.29ms. Allocated memory is still 117.4MB. Free memory is still 74.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 261.65ms. Allocated memory is still 142.6MB. Free memory was 117.5MB in the beginning and 106.3MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.09ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 105.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.90ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 103.8MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 284.96ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 93.1MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 24222.00ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 92.6MB in the beginning and 214.2MB in the end (delta: -121.6MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB. * Witness Printer took 431.26ms. Allocated memory is still 302.0MB. Free memory was 214.2MB in the beginning and 180.7MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. 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=197, Y=2, counter=0, v=-193, x=0, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, counter=1, v=-193, x=0, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=1, v=-193, 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=197, Y=2, counter=1, v=-193, x=0, xy=0, y=0, yx=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=1, v=-193, x=0, xy=0, y=0, yx=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=1, v=-189, x=0, xy=0, y=0, yx=0] [L45] x++ VAL [X=197, Y=2, counter=1, v=-189, x=1, xy=0, y=0, yx=0] [L31] EXPR counter++ VAL [X=197, Y=2, counter=2, v=-189, x=1, xy=0, y=0, yx=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=2, v=-189, x=1, 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=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=197, Y=2, counter=2, v=-189, x=1, xy=0, y=0, yx=2] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=2, v=-189, x=1, xy=0, y=0, yx=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=2, v=-185, x=1, xy=0, y=0, yx=2] [L45] x++ VAL [X=197, Y=2, counter=2, v=-185, x=2, xy=0, y=0, yx=2] [L31] EXPR counter++ VAL [X=197, Y=2, counter=3, v=-185, x=2, xy=0, y=0, yx=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=3, v=-185, x=2, 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=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=197, Y=2, counter=3, v=-185, x=2, xy=0, y=0, yx=4] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=3, v=-185, x=2, xy=0, y=0, yx=4] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=3, v=-181, x=2, xy=0, y=0, yx=4] [L45] x++ VAL [X=197, Y=2, counter=3, v=-181, x=3, xy=0, y=0, yx=4] [L31] EXPR counter++ VAL [X=197, Y=2, counter=4, v=-181, x=3, xy=0, y=0, yx=4] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=4, v=-181, x=3, 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=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=197, Y=2, counter=4, v=-181, x=3, xy=0, y=0, yx=6] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=4, v=-181, x=3, xy=0, y=0, yx=6] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=4, v=-177, x=3, xy=0, y=0, yx=6] [L45] x++ VAL [X=197, Y=2, counter=4, v=-177, x=4, xy=0, y=0, yx=6] [L31] EXPR counter++ VAL [X=197, Y=2, counter=5, v=-177, x=4, xy=0, y=0, yx=6] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=5, v=-177, x=4, 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=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=197, Y=2, counter=5, v=-177, x=4, xy=0, y=0, yx=8] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=5, v=-177, x=4, xy=0, y=0, yx=8] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=5, v=-173, x=4, xy=0, y=0, yx=8] [L45] x++ VAL [X=197, Y=2, counter=5, v=-173, x=5, xy=0, y=0, yx=8] [L31] EXPR counter++ VAL [X=197, Y=2, counter=6, v=-173, x=5, xy=0, y=0, yx=8] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=6, v=-173, x=5, 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=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=197, Y=2, counter=6, v=-173, x=5, xy=0, y=0, yx=10] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=6, v=-173, x=5, xy=0, y=0, yx=10] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=6, v=-169, x=5, xy=0, y=0, yx=10] [L45] x++ VAL [X=197, Y=2, counter=6, v=-169, x=6, xy=0, y=0, yx=10] [L31] EXPR counter++ VAL [X=197, Y=2, counter=7, v=-169, x=6, xy=0, y=0, yx=10] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=7, v=-169, x=6, 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=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=197, Y=2, counter=7, v=-169, x=6, xy=0, y=0, yx=12] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=7, v=-169, x=6, xy=0, y=0, yx=12] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=7, v=-165, x=6, xy=0, y=0, yx=12] [L45] x++ VAL [X=197, Y=2, counter=7, v=-165, x=7, xy=0, y=0, yx=12] [L31] EXPR counter++ VAL [X=197, Y=2, counter=8, v=-165, x=7, xy=0, y=0, yx=12] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=8, v=-165, x=7, 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=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=197, Y=2, counter=8, v=-165, x=7, xy=0, y=0, yx=14] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=8, v=-165, x=7, xy=0, y=0, yx=14] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=8, v=-161, x=7, xy=0, y=0, yx=14] [L45] x++ VAL [X=197, Y=2, counter=8, v=-161, x=8, xy=0, y=0, yx=14] [L31] EXPR counter++ VAL [X=197, Y=2, counter=9, v=-161, x=8, xy=0, y=0, yx=14] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=9, v=-161, x=8, 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=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=197, Y=2, counter=9, v=-161, x=8, xy=0, y=0, yx=16] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=9, v=-161, x=8, xy=0, y=0, yx=16] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=9, v=-157, x=8, xy=0, y=0, yx=16] [L45] x++ VAL [X=197, Y=2, counter=9, v=-157, x=9, xy=0, y=0, yx=16] [L31] EXPR counter++ VAL [X=197, Y=2, counter=10, v=-157, x=9, xy=0, y=0, yx=16] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=10, v=-157, x=9, 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=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=197, Y=2, counter=10, v=-157, x=9, xy=0, y=0, yx=18] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=10, v=-157, x=9, xy=0, y=0, yx=18] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=10, v=-153, x=9, xy=0, y=0, yx=18] [L45] x++ VAL [X=197, Y=2, counter=10, v=-153, x=10, xy=0, y=0, yx=18] [L31] EXPR counter++ VAL [X=197, Y=2, counter=11, v=-153, x=10, xy=0, y=0, yx=18] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=11, v=-153, x=10, 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=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=197, Y=2, counter=11, v=-153, x=10, xy=0, y=0, yx=20] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=11, v=-153, x=10, xy=0, y=0, yx=20] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=11, v=-149, x=10, xy=0, y=0, yx=20] [L45] x++ VAL [X=197, Y=2, counter=11, v=-149, x=11, xy=0, y=0, yx=20] [L31] EXPR counter++ VAL [X=197, Y=2, counter=12, v=-149, x=11, xy=0, y=0, yx=20] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=12, v=-149, x=11, 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=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=197, Y=2, counter=12, v=-149, x=11, xy=0, y=0, yx=22] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=12, v=-149, x=11, xy=0, y=0, yx=22] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=12, v=-145, x=11, xy=0, y=0, yx=22] [L45] x++ VAL [X=197, Y=2, counter=12, v=-145, x=12, xy=0, y=0, yx=22] [L31] EXPR counter++ VAL [X=197, Y=2, counter=13, v=-145, x=12, xy=0, y=0, yx=22] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=13, v=-145, x=12, 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=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=197, Y=2, counter=13, v=-145, x=12, xy=0, y=0, yx=24] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=13, v=-145, x=12, xy=0, y=0, yx=24] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=13, v=-141, x=12, xy=0, y=0, yx=24] [L45] x++ VAL [X=197, Y=2, counter=13, v=-141, x=13, xy=0, y=0, yx=24] [L31] EXPR counter++ VAL [X=197, Y=2, counter=14, v=-141, x=13, xy=0, y=0, yx=24] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=14, v=-141, x=13, 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=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=197, Y=2, counter=14, v=-141, x=13, xy=0, y=0, yx=26] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=14, v=-141, x=13, xy=0, y=0, yx=26] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=14, v=-137, x=13, xy=0, y=0, yx=26] [L45] x++ VAL [X=197, Y=2, counter=14, v=-137, x=14, xy=0, y=0, yx=26] [L31] EXPR counter++ VAL [X=197, Y=2, counter=15, v=-137, x=14, xy=0, y=0, yx=26] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=15, v=-137, x=14, 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=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=197, Y=2, counter=15, v=-137, x=14, xy=0, y=0, yx=28] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=15, v=-137, x=14, xy=0, y=0, yx=28] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=15, v=-133, x=14, xy=0, y=0, yx=28] [L45] x++ VAL [X=197, Y=2, counter=15, v=-133, x=15, xy=0, y=0, yx=28] [L31] EXPR counter++ VAL [X=197, Y=2, counter=16, v=-133, x=15, xy=0, y=0, yx=28] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=16, v=-133, x=15, 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=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=197, Y=2, counter=16, v=-133, x=15, xy=0, y=0, yx=30] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=16, v=-133, x=15, xy=0, y=0, yx=30] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=16, v=-129, x=15, xy=0, y=0, yx=30] [L45] x++ VAL [X=197, Y=2, counter=16, v=-129, x=16, xy=0, y=0, yx=30] [L31] EXPR counter++ VAL [X=197, Y=2, counter=17, v=-129, x=16, xy=0, y=0, yx=30] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=17, v=-129, x=16, 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=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=197, Y=2, counter=17, v=-129, x=16, xy=0, y=0, yx=32] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=17, v=-129, x=16, xy=0, y=0, yx=32] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=17, v=-125, x=16, xy=0, y=0, yx=32] [L45] x++ VAL [X=197, Y=2, counter=17, v=-125, x=17, xy=0, y=0, yx=32] [L31] EXPR counter++ VAL [X=197, Y=2, counter=18, v=-125, x=17, xy=0, y=0, yx=32] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=18, v=-125, x=17, 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=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=197, Y=2, counter=18, v=-125, x=17, xy=0, y=0, yx=34] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=18, v=-125, x=17, xy=0, y=0, yx=34] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=18, v=-121, x=17, xy=0, y=0, yx=34] [L45] x++ VAL [X=197, Y=2, counter=18, v=-121, x=18, xy=0, y=0, yx=34] [L31] EXPR counter++ VAL [X=197, Y=2, counter=19, v=-121, x=18, xy=0, y=0, yx=34] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=19, v=-121, x=18, 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=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=197, Y=2, counter=19, v=-121, x=18, xy=0, y=0, yx=36] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=19, v=-121, x=18, xy=0, y=0, yx=36] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=19, v=-117, x=18, xy=0, y=0, yx=36] [L45] x++ VAL [X=197, Y=2, counter=19, v=-117, x=19, xy=0, y=0, yx=36] [L31] EXPR counter++ VAL [X=197, Y=2, counter=20, v=-117, x=19, xy=0, y=0, yx=36] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=20, v=-117, x=19, 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=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=197, Y=2, counter=20, v=-117, x=19, xy=0, y=0, yx=38] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=20, v=-117, x=19, xy=0, y=0, yx=38] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=20, v=-113, x=19, xy=0, y=0, yx=38] [L45] x++ VAL [X=197, Y=2, counter=20, v=-113, x=20, xy=0, y=0, yx=38] [L31] EXPR counter++ VAL [X=197, Y=2, counter=21, v=-113, x=20, xy=0, y=0, yx=38] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=21, v=-113, x=20, 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=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=197, Y=2, counter=21, v=-113, x=20, xy=0, y=0, yx=40] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=21, v=-113, x=20, xy=0, y=0, yx=40] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=21, v=-109, x=20, xy=0, y=0, yx=40] [L45] x++ VAL [X=197, Y=2, counter=21, v=-109, x=21, xy=0, y=0, yx=40] [L31] EXPR counter++ VAL [X=197, Y=2, counter=22, v=-109, x=21, xy=0, y=0, yx=40] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=22, v=-109, x=21, 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=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=197, Y=2, counter=22, v=-109, x=21, xy=0, y=0, yx=42] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=22, v=-109, x=21, xy=0, y=0, yx=42] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=22, v=-105, x=21, xy=0, y=0, yx=42] [L45] x++ VAL [X=197, Y=2, counter=22, v=-105, x=22, xy=0, y=0, yx=42] [L31] EXPR counter++ VAL [X=197, Y=2, counter=23, v=-105, x=22, xy=0, y=0, yx=42] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=23, v=-105, x=22, 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=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=197, Y=2, counter=23, v=-105, x=22, xy=0, y=0, yx=44] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=23, v=-105, x=22, xy=0, y=0, yx=44] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=23, v=-101, x=22, xy=0, y=0, yx=44] [L45] x++ VAL [X=197, Y=2, counter=23, v=-101, x=23, xy=0, y=0, yx=44] [L31] EXPR counter++ VAL [X=197, Y=2, counter=24, v=-101, x=23, xy=0, y=0, yx=44] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=24, v=-101, x=23, 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=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=197, Y=2, counter=24, v=-101, x=23, xy=0, y=0, yx=46] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=24, v=-101, x=23, xy=0, y=0, yx=46] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=24, v=-97, x=23, xy=0, y=0, yx=46] [L45] x++ VAL [X=197, Y=2, counter=24, v=-97, x=24, xy=0, y=0, yx=46] [L31] EXPR counter++ VAL [X=197, Y=2, counter=25, v=-97, x=24, xy=0, y=0, yx=46] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=25, v=-97, x=24, 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=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=197, Y=2, counter=25, v=-97, x=24, xy=0, y=0, yx=48] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=25, v=-97, x=24, xy=0, y=0, yx=48] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=25, v=-93, x=24, xy=0, y=0, yx=48] [L45] x++ VAL [X=197, Y=2, counter=25, v=-93, x=25, xy=0, y=0, yx=48] [L31] EXPR counter++ VAL [X=197, Y=2, counter=26, v=-93, x=25, xy=0, y=0, yx=48] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=26, v=-93, x=25, 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=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=197, Y=2, counter=26, v=-93, x=25, xy=0, y=0, yx=50] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=26, v=-93, x=25, xy=0, y=0, yx=50] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=26, v=-89, x=25, xy=0, y=0, yx=50] [L45] x++ VAL [X=197, Y=2, counter=26, v=-89, x=26, xy=0, y=0, yx=50] [L31] EXPR counter++ VAL [X=197, Y=2, counter=27, v=-89, x=26, xy=0, y=0, yx=50] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=27, v=-89, x=26, 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=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=197, Y=2, counter=27, v=-89, x=26, xy=0, y=0, yx=52] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=27, v=-89, x=26, xy=0, y=0, yx=52] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=27, v=-85, x=26, xy=0, y=0, yx=52] [L45] x++ VAL [X=197, Y=2, counter=27, v=-85, x=27, xy=0, y=0, yx=52] [L31] EXPR counter++ VAL [X=197, Y=2, counter=28, v=-85, x=27, xy=0, y=0, yx=52] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=28, v=-85, x=27, 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=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=197, Y=2, counter=28, v=-85, x=27, xy=0, y=0, yx=54] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=28, v=-85, x=27, xy=0, y=0, yx=54] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=28, v=-81, x=27, xy=0, y=0, yx=54] [L45] x++ VAL [X=197, Y=2, counter=28, v=-81, x=28, xy=0, y=0, yx=54] [L31] EXPR counter++ VAL [X=197, Y=2, counter=29, v=-81, x=28, xy=0, y=0, yx=54] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=29, v=-81, x=28, 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=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=197, Y=2, counter=29, v=-81, x=28, xy=0, y=0, yx=56] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=29, v=-81, x=28, xy=0, y=0, yx=56] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=29, v=-77, x=28, xy=0, y=0, yx=56] [L45] x++ VAL [X=197, Y=2, counter=29, v=-77, x=29, xy=0, y=0, yx=56] [L31] EXPR counter++ VAL [X=197, Y=2, counter=30, v=-77, x=29, xy=0, y=0, yx=56] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=30, v=-77, x=29, 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=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=197, Y=2, counter=30, v=-77, x=29, xy=0, y=0, yx=58] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=30, v=-77, x=29, xy=0, y=0, yx=58] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=30, v=-73, x=29, xy=0, y=0, yx=58] [L45] x++ VAL [X=197, Y=2, counter=30, v=-73, x=30, xy=0, y=0, yx=58] [L31] EXPR counter++ VAL [X=197, Y=2, counter=31, v=-73, x=30, xy=0, y=0, yx=58] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=31, v=-73, x=30, 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=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=197, Y=2, counter=31, v=-73, x=30, xy=0, y=0, yx=60] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=31, v=-73, x=30, xy=0, y=0, yx=60] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=31, v=-69, x=30, xy=0, y=0, yx=60] [L45] x++ VAL [X=197, Y=2, counter=31, v=-69, x=31, xy=0, y=0, yx=60] [L31] EXPR counter++ VAL [X=197, Y=2, counter=32, v=-69, x=31, xy=0, y=0, yx=60] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=32, v=-69, x=31, 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=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=197, Y=2, counter=32, v=-69, x=31, xy=0, y=0, yx=62] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=32, v=-69, x=31, xy=0, y=0, yx=62] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=32, v=-65, x=31, xy=0, y=0, yx=62] [L45] x++ VAL [X=197, Y=2, counter=32, v=-65, x=32, xy=0, y=0, yx=62] [L31] EXPR counter++ VAL [X=197, Y=2, counter=33, v=-65, x=32, xy=0, y=0, yx=62] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=33, v=-65, x=32, 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=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=197, Y=2, counter=33, v=-65, x=32, xy=0, y=0, yx=64] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=33, v=-65, x=32, xy=0, y=0, yx=64] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=33, v=-61, x=32, xy=0, y=0, yx=64] [L45] x++ VAL [X=197, Y=2, counter=33, v=-61, x=33, xy=0, y=0, yx=64] [L31] EXPR counter++ VAL [X=197, Y=2, counter=34, v=-61, x=33, xy=0, y=0, yx=64] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=34, v=-61, x=33, 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=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=197, Y=2, counter=34, v=-61, x=33, xy=0, y=0, yx=66] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=34, v=-61, x=33, xy=0, y=0, yx=66] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=34, v=-57, x=33, xy=0, y=0, yx=66] [L45] x++ VAL [X=197, Y=2, counter=34, v=-57, x=34, xy=0, y=0, yx=66] [L31] EXPR counter++ VAL [X=197, Y=2, counter=35, v=-57, x=34, xy=0, y=0, yx=66] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=35, v=-57, x=34, 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=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=197, Y=2, counter=35, v=-57, x=34, xy=0, y=0, yx=68] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=35, v=-57, x=34, xy=0, y=0, yx=68] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=35, v=-53, x=34, xy=0, y=0, yx=68] [L45] x++ VAL [X=197, Y=2, counter=35, v=-53, x=35, xy=0, y=0, yx=68] [L31] EXPR counter++ VAL [X=197, Y=2, counter=36, v=-53, x=35, xy=0, y=0, yx=68] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=36, v=-53, x=35, 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=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=197, Y=2, counter=36, v=-53, x=35, xy=0, y=0, yx=70] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=36, v=-53, x=35, xy=0, y=0, yx=70] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=36, v=-49, x=35, xy=0, y=0, yx=70] [L45] x++ VAL [X=197, Y=2, counter=36, v=-49, x=36, xy=0, y=0, yx=70] [L31] EXPR counter++ VAL [X=197, Y=2, counter=37, v=-49, x=36, xy=0, y=0, yx=70] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=37, v=-49, x=36, 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=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=197, Y=2, counter=37, v=-49, x=36, xy=0, y=0, yx=72] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=37, v=-49, x=36, xy=0, y=0, yx=72] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=37, v=-45, x=36, xy=0, y=0, yx=72] [L45] x++ VAL [X=197, Y=2, counter=37, v=-45, x=37, xy=0, y=0, yx=72] [L31] EXPR counter++ VAL [X=197, Y=2, counter=38, v=-45, x=37, xy=0, y=0, yx=72] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=38, v=-45, x=37, 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=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=197, Y=2, counter=38, v=-45, x=37, xy=0, y=0, yx=74] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=38, v=-45, x=37, xy=0, y=0, yx=74] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=38, v=-41, x=37, xy=0, y=0, yx=74] [L45] x++ VAL [X=197, Y=2, counter=38, v=-41, x=38, xy=0, y=0, yx=74] [L31] EXPR counter++ VAL [X=197, Y=2, counter=39, v=-41, x=38, xy=0, y=0, yx=74] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=39, v=-41, x=38, 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=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=197, Y=2, counter=39, v=-41, x=38, xy=0, y=0, yx=76] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=39, v=-41, x=38, xy=0, y=0, yx=76] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=39, v=-37, x=38, xy=0, y=0, yx=76] [L45] x++ VAL [X=197, Y=2, counter=39, v=-37, x=39, xy=0, y=0, yx=76] [L31] EXPR counter++ VAL [X=197, Y=2, counter=40, v=-37, x=39, xy=0, y=0, yx=76] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=40, v=-37, x=39, 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=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=197, Y=2, counter=40, v=-37, x=39, xy=0, y=0, yx=78] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=40, v=-37, x=39, xy=0, y=0, yx=78] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=40, v=-33, x=39, xy=0, y=0, yx=78] [L45] x++ VAL [X=197, Y=2, counter=40, v=-33, x=40, xy=0, y=0, yx=78] [L31] EXPR counter++ VAL [X=197, Y=2, counter=41, v=-33, x=40, xy=0, y=0, yx=78] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=41, v=-33, x=40, 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=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=197, Y=2, counter=41, v=-33, x=40, xy=0, y=0, yx=80] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=41, v=-33, x=40, xy=0, y=0, yx=80] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=41, v=-29, x=40, xy=0, y=0, yx=80] [L45] x++ VAL [X=197, Y=2, counter=41, v=-29, x=41, xy=0, y=0, yx=80] [L31] EXPR counter++ VAL [X=197, Y=2, counter=42, v=-29, x=41, xy=0, y=0, yx=80] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=42, v=-29, x=41, 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=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=197, Y=2, counter=42, v=-29, x=41, xy=0, y=0, yx=82] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=42, v=-29, x=41, xy=0, y=0, yx=82] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=42, v=-25, x=41, xy=0, y=0, yx=82] [L45] x++ VAL [X=197, Y=2, counter=42, v=-25, x=42, xy=0, y=0, yx=82] [L31] EXPR counter++ VAL [X=197, Y=2, counter=43, v=-25, x=42, xy=0, y=0, yx=82] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=43, v=-25, x=42, 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=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=197, Y=2, counter=43, v=-25, x=42, xy=0, y=0, yx=84] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=43, v=-25, x=42, xy=0, y=0, yx=84] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=43, v=-21, x=42, xy=0, y=0, yx=84] [L45] x++ VAL [X=197, Y=2, counter=43, v=-21, x=43, xy=0, y=0, yx=84] [L31] EXPR counter++ VAL [X=197, Y=2, counter=44, v=-21, x=43, xy=0, y=0, yx=84] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=44, v=-21, x=43, 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=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=197, Y=2, counter=44, v=-21, x=43, xy=0, y=0, yx=86] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=44, v=-21, x=43, xy=0, y=0, yx=86] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=44, v=-17, x=43, xy=0, y=0, yx=86] [L45] x++ VAL [X=197, Y=2, counter=44, v=-17, x=44, xy=0, y=0, yx=86] [L31] EXPR counter++ VAL [X=197, Y=2, counter=45, v=-17, x=44, xy=0, y=0, yx=86] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=45, v=-17, x=44, 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=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=197, Y=2, counter=45, v=-17, x=44, xy=0, y=0, yx=88] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=45, v=-17, x=44, xy=0, y=0, yx=88] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=45, v=-13, x=44, xy=0, y=0, yx=88] [L45] x++ VAL [X=197, Y=2, counter=45, v=-13, x=45, xy=0, y=0, yx=88] [L31] EXPR counter++ VAL [X=197, Y=2, counter=46, v=-13, x=45, xy=0, y=0, yx=88] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=46, v=-13, x=45, 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=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=197, Y=2, counter=46, v=-13, x=45, xy=0, y=0, yx=90] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=46, v=-13, x=45, xy=0, y=0, yx=90] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=46, v=-9, x=45, xy=0, y=0, yx=90] [L45] x++ VAL [X=197, Y=2, counter=46, v=-9, x=46, xy=0, y=0, yx=90] [L31] EXPR counter++ VAL [X=197, Y=2, counter=47, v=-9, x=46, xy=0, y=0, yx=90] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=47, v=-9, x=46, 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=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=197, Y=2, counter=47, v=-9, x=46, xy=0, y=0, yx=92] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=47, v=-9, x=46, xy=0, y=0, yx=92] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=47, v=-5, x=46, xy=0, y=0, yx=92] [L45] x++ VAL [X=197, Y=2, counter=47, v=-5, x=47, xy=0, y=0, yx=92] [L31] EXPR counter++ VAL [X=197, Y=2, counter=48, v=-5, x=47, xy=0, y=0, yx=92] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=48, v=-5, x=47, 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=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=197, Y=2, counter=48, v=-5, x=47, xy=0, y=0, yx=94] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=48, v=-5, x=47, xy=0, y=0, yx=94] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=48, v=-1, x=47, xy=0, y=0, yx=94] [L45] x++ VAL [X=197, Y=2, counter=48, v=-1, x=48, xy=0, y=0, yx=94] [L31] EXPR counter++ VAL [X=197, Y=2, counter=49, v=-1, x=48, xy=0, y=0, yx=94] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=49, v=-1, x=48, 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=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=197, Y=2, counter=49, v=-1, x=48, xy=0, y=0, yx=96] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=49, v=-1, x=48, xy=0, y=0, yx=96] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=49, v=3, x=48, xy=0, y=0, yx=96] [L45] x++ VAL [X=197, Y=2, counter=49, v=3, x=49, xy=0, y=0, yx=96] [L31] EXPR counter++ VAL [X=197, Y=2, counter=50, v=3, x=49, xy=0, y=0, yx=96] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=50, v=3, x=49, 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=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=197, Y=2, counter=50, v=3, x=49, xy=0, y=0, yx=98] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=50, v=3, x=49, xy=0, y=0, yx=98] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [X=197, Y=2, counter=50, v=-387, x=49, xy=0, y=1, yx=98] [L45] x++ VAL [X=197, Y=2, counter=50, v=-387, x=50, xy=0, y=1, yx=98] [L31] EXPR counter++ VAL [X=197, Y=2, counter=51, v=-387, x=50, xy=0, y=1, yx=98] [L31] COND FALSE !(counter++<50) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [X=197, Y=2, counter=51, v=-387, xy=50, 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=51] [L14] COND TRUE !(cond) VAL [\old(cond)=0, counter=51] [L16] reach_error() VAL [\old(cond)=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.0s, OverallIterations: 13, TraceHistogramMax: 51, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 891 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 889 mSDsluCounter, 1593 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1416 mSDsCounter, 178 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1336 IncrementalHoareTripleChecker+Invalid, 1514 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 178 mSolverCounterUnsat, 177 mSDtfsCounter, 1336 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1627 GetRequests, 1238 SyntacticMatches, 10 SemanticMatches, 379 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7654 ImplicationChecksByTransitivity, 8.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1099occurred in iteration=12, InterpolantAutomatonStates: 366, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 66 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 9.9s InterpolantComputationTime, 2523 NumberOfCodeBlocks, 2424 NumberOfCodeBlocksAsserted, 139 NumberOfCheckSat, 1950 ConstructedInterpolants, 2 QuantifiedInterpolants, 5829 SizeOfPredicates, 64 NumberOfNonLiveVariables, 1614 ConjunctsInSsa, 201 ConjunctsInUnsatCore, 25 InterpolantComputations, 4 PerfectInterpolantSequences, 4198/13272 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-11-28 03:05:47,795 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfff34-0bf1-4cbe-8061-876172976627/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE