./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-tiling/mbpr4.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_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/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_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-tiling/mbpr4.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/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_03ec3310-6da2-4228-83f9-1e6778cc8be6/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 d3770c63a87ff983494c9353997301d9eb30588c650f83b67bcf55f325443055 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 02:55:22,920 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 02:55:23,019 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 02:55:23,027 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 02:55:23,027 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 02:55:23,066 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 02:55:23,067 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 02:55:23,067 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 02:55:23,069 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 02:55:23,069 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 02:55:23,070 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 02:55:23,070 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 02:55:23,071 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 02:55:23,071 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 02:55:23,071 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 02:55:23,072 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 02:55:23,072 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 02:55:23,072 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 02:55:23,072 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 02:55:23,072 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 02:55:23,072 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 02:55:23,073 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 02:55:23,073 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 02:55:23,073 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 02:55:23,073 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 02:55:23,073 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 02:55:23,073 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 02:55:23,073 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 02:55:23,073 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 02:55:23,073 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:55:23,074 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:55:23,074 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:55:23,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:55:23,074 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 02:55:23,074 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:55:23,074 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:55:23,075 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:55:23,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:55:23,075 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 02:55:23,075 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 02:55:23,075 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 02:55:23,075 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 02:55:23,075 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 02:55:23,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 02:55:23,075 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 02:55:23,075 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 02:55:23,075 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 02:55:23,076 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 02:55:23,076 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_03ec3310-6da2-4228-83f9-1e6778cc8be6/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 -> d3770c63a87ff983494c9353997301d9eb30588c650f83b67bcf55f325443055 [2024-11-28 02:55:23,407 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 02:55:23,420 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 02:55:23,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 02:55:23,425 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 02:55:23,425 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 02:55:23,427 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/array-tiling/mbpr4.c [2024-11-28 02:55:26,424 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/data/2e21f2e1d/8b28e4a5c7294daea26a933f0919a8e3/FLAG1774b6c7a [2024-11-28 02:55:26,708 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 02:55:26,709 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/sv-benchmarks/c/array-tiling/mbpr4.c [2024-11-28 02:55:26,717 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/data/2e21f2e1d/8b28e4a5c7294daea26a933f0919a8e3/FLAG1774b6c7a [2024-11-28 02:55:26,981 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/data/2e21f2e1d/8b28e4a5c7294daea26a933f0919a8e3 [2024-11-28 02:55:26,984 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 02:55:26,986 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 02:55:26,987 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 02:55:26,987 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 02:55:26,992 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 02:55:26,993 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:55:26" (1/1) ... [2024-11-28 02:55:26,994 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@647641e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:55:26, skipping insertion in model container [2024-11-28 02:55:26,994 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:55:26" (1/1) ... [2024-11-28 02:55:27,014 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 02:55:27,189 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_03ec3310-6da2-4228-83f9-1e6778cc8be6/sv-benchmarks/c/array-tiling/mbpr4.c[396,409] [2024-11-28 02:55:27,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:55:27,253 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 02:55:27,269 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_03ec3310-6da2-4228-83f9-1e6778cc8be6/sv-benchmarks/c/array-tiling/mbpr4.c[396,409] [2024-11-28 02:55:27,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:55:27,329 INFO L204 MainTranslator]: Completed translation [2024-11-28 02:55:27,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:55:27 WrapperNode [2024-11-28 02:55:27,330 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 02:55:27,332 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 02:55:27,333 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 02:55:27,333 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 02:55:27,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:55:27" (1/1) ... [2024-11-28 02:55:27,353 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:55:27" (1/1) ... [2024-11-28 02:55:27,401 INFO L138 Inliner]: procedures = 15, calls = 54, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 141 [2024-11-28 02:55:27,403 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 02:55:27,404 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 02:55:27,404 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 02:55:27,404 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 02:55:27,415 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:55:27" (1/1) ... [2024-11-28 02:55:27,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:55:27" (1/1) ... [2024-11-28 02:55:27,418 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:55:27" (1/1) ... [2024-11-28 02:55:27,439 INFO L175 MemorySlicer]: Split 44 memory accesses to 3 slices as follows [2, 8, 34]. 77 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0]. The 20 writes are split as follows [0, 0, 20]. [2024-11-28 02:55:27,441 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:55:27" (1/1) ... [2024-11-28 02:55:27,442 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:55:27" (1/1) ... [2024-11-28 02:55:27,457 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:55:27" (1/1) ... [2024-11-28 02:55:27,458 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:55:27" (1/1) ... [2024-11-28 02:55:27,466 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:55:27" (1/1) ... [2024-11-28 02:55:27,467 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:55:27" (1/1) ... [2024-11-28 02:55:27,472 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:55:27" (1/1) ... [2024-11-28 02:55:27,474 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 02:55:27,475 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 02:55:27,479 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 02:55:27,479 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 02:55:27,480 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:55:27" (1/1) ... [2024-11-28 02:55:27,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:55:27,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:55:27,517 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 02:55:27,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 02:55:27,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 02:55:27,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 02:55:27,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 02:55:27,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-28 02:55:27,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 02:55:27,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 02:55:27,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 02:55:27,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-28 02:55:27,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 02:55:27,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 02:55:27,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 02:55:27,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 02:55:27,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-28 02:55:27,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 02:55:27,655 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 02:55:27,657 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 02:55:28,005 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-28 02:55:28,005 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 02:55:28,022 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 02:55:28,022 INFO L312 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-28 02:55:28,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:55:28 BoogieIcfgContainer [2024-11-28 02:55:28,023 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 02:55:28,026 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 02:55:28,027 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 02:55:28,033 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 02:55:28,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:55:26" (1/3) ... [2024-11-28 02:55:28,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fdb5193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:55:28, skipping insertion in model container [2024-11-28 02:55:28,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:55:27" (2/3) ... [2024-11-28 02:55:28,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fdb5193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:55:28, skipping insertion in model container [2024-11-28 02:55:28,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:55:28" (3/3) ... [2024-11-28 02:55:28,037 INFO L128 eAbstractionObserver]: Analyzing ICFG mbpr4.c [2024-11-28 02:55:28,055 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 02:55:28,057 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mbpr4.c that has 1 procedures, 35 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2024-11-28 02:55:28,130 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 02:55:28,146 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;@1ee31e66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 02:55:28,146 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 02:55:28,151 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 33 states have (on average 1.606060606060606) internal successors, (53), 34 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:28,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-28 02:55:28,159 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:55:28,160 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:55:28,160 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:55:28,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:28,166 INFO L85 PathProgramCache]: Analyzing trace with hash 399772912, now seen corresponding path program 1 times [2024-11-28 02:55:28,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:28,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160181181] [2024-11-28 02:55:28,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:55:28,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:55:28,412 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 02:55:28,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:28,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160181181] [2024-11-28 02:55:28,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160181181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:55:28,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:55:28,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:55:28,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731735206] [2024-11-28 02:55:28,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:55:28,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 02:55:28,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:28,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 02:55:28,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 02:55:28,451 INFO L87 Difference]: Start difference. First operand has 35 states, 33 states have (on average 1.606060606060606) internal successors, (53), 34 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:28,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:55:28,471 INFO L93 Difference]: Finished difference Result 65 states and 98 transitions. [2024-11-28 02:55:28,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 02:55:28,475 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-28 02:55:28,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:55:28,485 INFO L225 Difference]: With dead ends: 65 [2024-11-28 02:55:28,485 INFO L226 Difference]: Without dead ends: 30 [2024-11-28 02:55:28,488 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 02:55:28,491 INFO L435 NwaCegarLoop]: 46 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, 46 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 02:55:28,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:55:28,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-28 02:55:28,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-28 02:55:28,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 29 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:28,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2024-11-28 02:55:28,533 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 20 [2024-11-28 02:55:28,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:55:28,534 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2024-11-28 02:55:28,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:28,535 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2024-11-28 02:55:28,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-28 02:55:28,537 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:55:28,537 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:55:28,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 02:55:28,538 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:55:28,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:28,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1151503678, now seen corresponding path program 1 times [2024-11-28 02:55:28,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:28,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427972764] [2024-11-28 02:55:28,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:55:28,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:55:29,127 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 02:55:29,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:29,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427972764] [2024-11-28 02:55:29,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427972764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:55:29,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:55:29,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:55:29,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978075077] [2024-11-28 02:55:29,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:55:29,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:55:29,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:29,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:55:29,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:55:29,130 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:29,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:55:29,319 INFO L93 Difference]: Finished difference Result 63 states and 87 transitions. [2024-11-28 02:55:29,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:55:29,320 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-28 02:55:29,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:55:29,321 INFO L225 Difference]: With dead ends: 63 [2024-11-28 02:55:29,321 INFO L226 Difference]: Without dead ends: 42 [2024-11-28 02:55:29,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:55:29,322 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 95 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:55:29,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 23 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 02:55:29,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-28 02:55:29,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2024-11-28 02:55:29,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:29,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2024-11-28 02:55:29,329 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 20 [2024-11-28 02:55:29,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:55:29,330 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2024-11-28 02:55:29,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:29,330 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2024-11-28 02:55:29,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-28 02:55:29,331 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:55:29,331 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:55:29,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 02:55:29,331 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:55:29,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:29,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1626476282, now seen corresponding path program 1 times [2024-11-28 02:55:29,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:29,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659789061] [2024-11-28 02:55:29,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:55:29,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:29,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:55:29,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 02:55:29,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:29,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659789061] [2024-11-28 02:55:29,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659789061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:55:29,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:55:29,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:55:29,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681959596] [2024-11-28 02:55:29,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:55:29,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:55:29,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:29,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:55:29,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:55:29,608 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:29,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:55:29,653 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2024-11-28 02:55:29,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:55:29,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-28 02:55:29,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:55:29,654 INFO L225 Difference]: With dead ends: 46 [2024-11-28 02:55:29,654 INFO L226 Difference]: Without dead ends: 34 [2024-11-28 02:55:29,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:55:29,658 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 16 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:55:29,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 31 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:55:29,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-28 02:55:29,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-28 02:55:29,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:29,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2024-11-28 02:55:29,672 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 32 [2024-11-28 02:55:29,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:55:29,673 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2024-11-28 02:55:29,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:29,673 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2024-11-28 02:55:29,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-28 02:55:29,674 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:55:29,674 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:55:29,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 02:55:29,674 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:55:29,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:29,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1233449272, now seen corresponding path program 1 times [2024-11-28 02:55:29,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:29,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54077930] [2024-11-28 02:55:29,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:55:29,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:55:32,112 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:55:32,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:32,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54077930] [2024-11-28 02:55:32,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54077930] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:55:32,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927747609] [2024-11-28 02:55:32,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:55:32,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:55:32,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:55:32,119 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:55:32,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 02:55:32,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:55:32,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-28 02:55:32,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:55:32,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 02:55:32,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 11 [2024-11-28 02:55:32,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 02:55:32,624 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:55:32,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 18 [2024-11-28 02:55:32,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 02:55:32,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 11 [2024-11-28 02:55:32,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-28 02:55:32,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:55:32,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 28 [2024-11-28 02:55:33,047 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:55:33,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 02:55:33,082 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:55:33,083 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:55:33,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2024-11-28 02:55:33,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-11-28 02:55:33,516 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 02:55:33,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927747609] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:55:33,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:55:33,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 7] total 20 [2024-11-28 02:55:33,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817422651] [2024-11-28 02:55:33,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:55:33,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-28 02:55:33,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:33,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-28 02:55:33,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2024-11-28 02:55:33,519 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 20 states, 20 states have (on average 4.25) internal successors, (85), 20 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:34,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:55:34,130 INFO L93 Difference]: Finished difference Result 88 states and 109 transitions. [2024-11-28 02:55:34,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 02:55:34,130 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.25) internal successors, (85), 20 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-28 02:55:34,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:55:34,131 INFO L225 Difference]: With dead ends: 88 [2024-11-28 02:55:34,132 INFO L226 Difference]: Without dead ends: 61 [2024-11-28 02:55:34,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=206, Invalid=606, Unknown=0, NotChecked=0, Total=812 [2024-11-28 02:55:34,133 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 267 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:55:34,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 93 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 02:55:34,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-28 02:55:34,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 37. [2024-11-28 02:55:34,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 36 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:34,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2024-11-28 02:55:34,144 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 32 [2024-11-28 02:55:34,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:55:34,144 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2024-11-28 02:55:34,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.25) internal successors, (85), 20 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:34,145 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2024-11-28 02:55:34,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-28 02:55:34,145 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:55:34,146 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:55:34,157 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 02:55:34,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:55:34,350 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:55:34,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:34,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1233389690, now seen corresponding path program 1 times [2024-11-28 02:55:34,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:34,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021775992] [2024-11-28 02:55:34,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:55:34,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:34,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:55:34,464 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 02:55:34,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:34,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021775992] [2024-11-28 02:55:34,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021775992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:55:34,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:55:34,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:55:34,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225737946] [2024-11-28 02:55:34,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:55:34,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:55:34,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:34,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:55:34,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:55:34,467 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:34,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:55:34,501 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2024-11-28 02:55:34,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:55:34,502 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-28 02:55:34,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:55:34,504 INFO L225 Difference]: With dead ends: 41 [2024-11-28 02:55:34,505 INFO L226 Difference]: Without dead ends: 39 [2024-11-28 02:55:34,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 02:55:34,506 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:55:34,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:55:34,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-28 02:55:34,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-28 02:55:34,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 38 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:34,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2024-11-28 02:55:34,522 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 32 [2024-11-28 02:55:34,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:55:34,523 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2024-11-28 02:55:34,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:34,523 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2024-11-28 02:55:34,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-28 02:55:34,523 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:55:34,524 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:55:34,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 02:55:34,524 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:55:34,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:34,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1138158754, now seen corresponding path program 1 times [2024-11-28 02:55:34,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:34,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841023458] [2024-11-28 02:55:34,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:55:34,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:34,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:55:35,751 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 02:55:35,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:35,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841023458] [2024-11-28 02:55:35,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841023458] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:55:35,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061860444] [2024-11-28 02:55:35,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:55:35,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:55:35,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:55:35,754 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:55:35,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 02:55:35,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:55:35,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-28 02:55:35,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:55:36,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 02:55:36,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:55:36,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 25 [2024-11-28 02:55:36,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 02:55:36,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 11 [2024-11-28 02:55:36,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-28 02:55:36,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:55:36,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 28 [2024-11-28 02:55:36,485 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:55:36,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 02:55:36,515 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 02:55:36,515 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:55:36,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2024-11-28 02:55:36,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-28 02:55:36,879 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 02:55:36,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061860444] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:55:36,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:55:36,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 8] total 21 [2024-11-28 02:55:36,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631590601] [2024-11-28 02:55:36,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:55:36,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-28 02:55:36,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:36,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-28 02:55:36,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2024-11-28 02:55:36,884 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 21 states, 21 states have (on average 4.904761904761905) internal successors, (103), 21 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:37,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:55:37,424 INFO L93 Difference]: Finished difference Result 87 states and 105 transitions. [2024-11-28 02:55:37,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 02:55:37,425 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.904761904761905) internal successors, (103), 21 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-28 02:55:37,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:55:37,426 INFO L225 Difference]: With dead ends: 87 [2024-11-28 02:55:37,426 INFO L226 Difference]: Without dead ends: 60 [2024-11-28 02:55:37,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2024-11-28 02:55:37,429 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 188 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:55:37,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 82 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 02:55:37,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-28 02:55:37,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 45. [2024-11-28 02:55:37,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:37,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2024-11-28 02:55:37,444 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 38 [2024-11-28 02:55:37,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:55:37,445 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2024-11-28 02:55:37,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.904761904761905) internal successors, (103), 21 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:37,446 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2024-11-28 02:55:37,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-28 02:55:37,448 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:55:37,449 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:55:37,459 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-28 02:55:37,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:55:37,649 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:55:37,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:37,650 INFO L85 PathProgramCache]: Analyzing trace with hash 550842508, now seen corresponding path program 2 times [2024-11-28 02:55:37,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:37,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009904837] [2024-11-28 02:55:37,650 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:55:37,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:37,706 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 02:55:37,707 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:55:38,511 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 02:55:38,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:38,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009904837] [2024-11-28 02:55:38,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009904837] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:55:38,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727236594] [2024-11-28 02:55:38,512 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:55:38,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:55:38,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:55:38,514 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:55:38,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 02:55:38,625 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 02:55:38,626 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:55:38,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-28 02:55:38,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:55:38,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 02:55:38,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 11 [2024-11-28 02:55:38,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-28 02:55:38,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:55:38,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 21 [2024-11-28 02:55:39,310 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:55:39,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 02:55:39,339 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 02:55:39,340 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:55:39,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2024-11-28 02:55:39,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-28 02:55:39,694 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 02:55:39,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727236594] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:55:39,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:55:39,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 24 [2024-11-28 02:55:39,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617341419] [2024-11-28 02:55:39,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:55:39,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 02:55:39,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:39,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 02:55:39,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2024-11-28 02:55:39,697 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 24 states, 24 states have (on average 5.041666666666667) internal successors, (121), 24 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:40,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:55:40,381 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2024-11-28 02:55:40,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 02:55:40,382 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.041666666666667) internal successors, (121), 24 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-11-28 02:55:40,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:55:40,383 INFO L225 Difference]: With dead ends: 96 [2024-11-28 02:55:40,383 INFO L226 Difference]: Without dead ends: 68 [2024-11-28 02:55:40,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=266, Invalid=994, Unknown=0, NotChecked=0, Total=1260 [2024-11-28 02:55:40,384 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 164 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:55:40,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 110 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 02:55:40,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-28 02:55:40,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 51. [2024-11-28 02:55:40,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:40,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2024-11-28 02:55:40,393 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 44 [2024-11-28 02:55:40,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:55:40,394 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2024-11-28 02:55:40,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.041666666666667) internal successors, (121), 24 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:40,394 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2024-11-28 02:55:40,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-28 02:55:40,395 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:55:40,395 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:55:40,404 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 02:55:40,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-28 02:55:40,600 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:55:40,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:40,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1665621238, now seen corresponding path program 3 times [2024-11-28 02:55:40,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:40,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565768174] [2024-11-28 02:55:40,601 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 02:55:40,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:40,663 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-28 02:55:40,664 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:55:41,702 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 02:55:41,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:41,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565768174] [2024-11-28 02:55:41,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565768174] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:55:41,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657787025] [2024-11-28 02:55:41,703 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 02:55:41,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:55:41,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:55:41,705 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:55:41,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 02:55:41,966 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-28 02:55:41,966 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:55:41,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-28 02:55:41,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:55:42,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 02:55:42,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:55:42,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 18 [2024-11-28 02:55:42,442 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 02:55:42,442 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:55:42,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2024-11-28 02:55:42,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2024-11-28 02:55:42,794 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 02:55:42,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657787025] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:55:42,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:55:42,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 12] total 34 [2024-11-28 02:55:42,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321757572] [2024-11-28 02:55:42,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:55:42,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-28 02:55:42,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:42,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-28 02:55:42,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=950, Unknown=0, NotChecked=0, Total=1122 [2024-11-28 02:55:42,799 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 34 states, 34 states have (on average 4.117647058823529) internal successors, (140), 34 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:44,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:55:44,636 INFO L93 Difference]: Finished difference Result 163 states and 184 transitions. [2024-11-28 02:55:44,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-28 02:55:44,637 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 4.117647058823529) internal successors, (140), 34 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-28 02:55:44,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:55:44,638 INFO L225 Difference]: With dead ends: 163 [2024-11-28 02:55:44,638 INFO L226 Difference]: Without dead ends: 85 [2024-11-28 02:55:44,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1305 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=794, Invalid=3898, Unknown=0, NotChecked=0, Total=4692 [2024-11-28 02:55:44,641 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 314 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 02:55:44,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 152 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 02:55:44,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-28 02:55:44,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 69. [2024-11-28 02:55:44,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:44,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2024-11-28 02:55:44,661 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 50 [2024-11-28 02:55:44,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:55:44,662 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2024-11-28 02:55:44,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.117647058823529) internal successors, (140), 34 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:44,662 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2024-11-28 02:55:44,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-28 02:55:44,662 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:55:44,663 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:55:44,674 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 02:55:44,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-28 02:55:44,863 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:55:44,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:44,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1541908376, now seen corresponding path program 4 times [2024-11-28 02:55:44,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:44,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691194342] [2024-11-28 02:55:44,864 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 02:55:44,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:44,940 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 02:55:44,940 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:55:48,516 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 10 proven. 56 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 02:55:48,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:48,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691194342] [2024-11-28 02:55:48,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691194342] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:55:48,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529666457] [2024-11-28 02:55:48,517 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 02:55:48,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:55:48,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:55:48,519 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:55:48,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 02:55:48,665 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 02:55:48,665 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:55:48,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-28 02:55:48,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:55:48,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 02:55:48,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 11 [2024-11-28 02:55:49,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-28 02:55:49,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:55:49,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 35 [2024-11-28 02:55:49,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:55:49,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2024-11-28 02:55:49,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:55:49,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 35 [2024-11-28 02:55:49,416 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:55:49,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 35 [2024-11-28 02:55:49,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:55:49,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 31 [2024-11-28 02:55:49,596 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:55:49,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2024-11-28 02:55:49,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:55:49,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 28 [2024-11-28 02:55:49,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:55:49,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 35 [2024-11-28 02:55:49,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:55:49,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 38 [2024-11-28 02:55:50,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:55:50,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 45 [2024-11-28 02:55:50,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:55:50,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 73 treesize of output 48 [2024-11-28 02:55:51,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:55:51,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 40 treesize of output 16 [2024-11-28 02:55:51,055 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:55:51,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:55:56,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2024-11-28 02:55:56,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-28 02:55:56,376 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 61 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-28 02:55:56,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529666457] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:55:56,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:55:56,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 27, 13] total 53 [2024-11-28 02:55:56,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072928958] [2024-11-28 02:55:56,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:55:56,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-28 02:55:56,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:56,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-28 02:55:56,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=2517, Unknown=0, NotChecked=0, Total=2756 [2024-11-28 02:55:56,380 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 53 states, 53 states have (on average 3.452830188679245) internal successors, (183), 53 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:56:13,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 02:56:17,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 02:56:21,164 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (let ((.cse0 (div c_~CELLCOUNT~0 4)) (.cse1 (< c_~CELLCOUNT~0 0)) (.cse2 (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2)) (.cse6 (select .cse3 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4))) (.cse4 (+ 16 |c_ULTIMATE.start_main_~#volArray~0#1.offset|))) (and (= 5 |c_ULTIMATE.start_main_~CCCELVOL4~0#1|) (or (< |c_ULTIMATE.start_main_~i~0#1| (+ .cse0 1)) .cse1) (or (and .cse2 (= (select .cse3 .cse4) 5)) .cse1) (or (let ((.cse5 (+ 8 (mod c_~CELLCOUNT~0 4)))) (and (<= .cse5 c_~CELLCOUNT~0) (or (and (= 5 (select .cse3 (+ (* 16 .cse0) (- 16) |c_ULTIMATE.start_main_~#volArray~0#1.offset|))) .cse2) (< .cse5 c_~CELLCOUNT~0)))) .cse1) (or (and (= 5 .cse6) .cse2) (< (+ c_~CELLCOUNT~0 3) |c_ULTIMATE.start_main_~i~0#1|)) (<= 5 (select .cse3 16)) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (<= 5 |c_ULTIMATE.start_main_~CCCELVOL4~0#1|) .cse2 (< |c_ULTIMATE.start_main_~MINVAL~0#1| (+ .cse6 1)) (forall ((v_ArrVal_430 Int) (v_ArrVal_429 Int)) (< |c_ULTIMATE.start_main_~MINVAL~0#1| (+ (select (let ((.cse7 (* 16 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse8 (+ .cse7 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (- 8)))) (store (store (store .cse3 (+ (- 16) .cse7 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_429) (+ .cse7 (- 12) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_430) .cse8 (select .cse3 .cse8)))) .cse4) 1)))))) is different from false [2024-11-28 02:56:26,429 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse6 (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2)) (.cse0 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#volArray~0#1.base|)) (.cse11 (+ 16 |c_ULTIMATE.start_main_~#volArray~0#1.offset|))) (let ((.cse2 (and .cse6 (= (select .cse0 .cse11) 5))) (.cse5 (div c_~CELLCOUNT~0 4)) (.cse3 (< c_~CELLCOUNT~0 0)) (.cse7 (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (and (< |c_ULTIMATE.start_main_~MINVAL~0#1| (+ (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset| 8)) 1)) (= 5 |c_ULTIMATE.start_main_~CCCELVOL4~0#1|) (or .cse2 .cse3) (or (let ((.cse4 (+ 8 (mod c_~CELLCOUNT~0 4)))) (and (<= .cse4 c_~CELLCOUNT~0) (or (and (= 5 (select .cse0 (+ (* 16 .cse5) (- 16) |c_ULTIMATE.start_main_~#volArray~0#1.offset|))) .cse6) (< .cse4 c_~CELLCOUNT~0)))) .cse3) (or (and (= 5 .cse7) .cse6) (< (+ c_~CELLCOUNT~0 3) |c_ULTIMATE.start_main_~i~0#1|)) (<= 5 (select .cse0 16)) (= (select .cse0 4) (select .cse0 20)) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (<= 5 |c_ULTIMATE.start_main_~CCCELVOL4~0#1|) (or (let ((.cse8 (+ .cse5 1))) (and (<= |c_ULTIMATE.start_main_~i~0#1| .cse8) (or (< |c_ULTIMATE.start_main_~i~0#1| .cse8) .cse2))) .cse3) .cse6 (< |c_ULTIMATE.start_main_~MINVAL~0#1| (+ .cse7 1)) (forall ((v_ArrVal_430 Int) (v_ArrVal_429 Int)) (< |c_ULTIMATE.start_main_~MINVAL~0#1| (+ (select (let ((.cse9 (* 16 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse10 (+ .cse9 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (- 8)))) (store (store (store .cse0 (+ (- 16) .cse9 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_429) (+ .cse9 (- 12) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_430) .cse10 (select .cse0 .cse10)))) .cse11) 1)))))) is different from false [2024-11-28 02:56:33,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 02:56:37,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 02:56:41,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 02:56:45,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 02:56:49,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 02:56:53,535 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse5 (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2)) (.cse3 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#volArray~0#1.base|)) (.cse11 (+ 16 |c_ULTIMATE.start_main_~#volArray~0#1.offset|))) (let ((.cse0 (and .cse5 (= (select .cse3 .cse11) 5))) (.cse4 (div c_~CELLCOUNT~0 4)) (.cse1 (< c_~CELLCOUNT~0 0)) (.cse7 (select .cse3 (+ .cse6 |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (and (= 5 |c_ULTIMATE.start_main_~CCCELVOL4~0#1|) (or .cse0 .cse1) (or (let ((.cse2 (+ 8 (mod c_~CELLCOUNT~0 4)))) (and (<= .cse2 c_~CELLCOUNT~0) (or (and (= 5 (select .cse3 (+ (* 16 .cse4) (- 16) |c_ULTIMATE.start_main_~#volArray~0#1.offset|))) .cse5) (< .cse2 c_~CELLCOUNT~0)))) .cse1) (< |c_ULTIMATE.start_main_~MINVAL~0#1| (+ (select .cse3 (+ .cse6 |c_ULTIMATE.start_main_~#volArray~0#1.offset| 12)) 1)) (or (and (= 5 .cse7) .cse5) (< (+ c_~CELLCOUNT~0 3) |c_ULTIMATE.start_main_~i~0#1|)) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (or (let ((.cse8 (+ .cse4 1))) (and (<= |c_ULTIMATE.start_main_~i~0#1| .cse8) (or (< |c_ULTIMATE.start_main_~i~0#1| .cse8) .cse0))) .cse1) .cse5 (< |c_ULTIMATE.start_main_~MINVAL~0#1| (+ .cse7 1)) (forall ((v_ArrVal_430 Int) (v_ArrVal_429 Int)) (< |c_ULTIMATE.start_main_~MINVAL~0#1| (+ (select (let ((.cse9 (* 16 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse10 (+ .cse9 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (- 8)))) (store (store (store .cse3 (+ (- 16) .cse9 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_429) (+ .cse9 (- 12) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_430) .cse10 (select .cse3 .cse10)))) .cse11) 1)))))) is different from false [2024-11-28 02:57:03,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 02:57:16,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 02:57:21,000 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2)) (.cse3 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#volArray~0#1.base|)) (.cse9 (+ 16 |c_ULTIMATE.start_main_~#volArray~0#1.offset|))) (let ((.cse0 (and .cse5 (= (select .cse3 .cse9) 5))) (.cse4 (div c_~CELLCOUNT~0 4)) (.cse1 (< c_~CELLCOUNT~0 0))) (and (= 5 |c_ULTIMATE.start_main_~CCCELVOL4~0#1|) (or .cse0 .cse1) (or (let ((.cse2 (+ 8 (mod c_~CELLCOUNT~0 4)))) (and (<= .cse2 c_~CELLCOUNT~0) (or (and (= 5 (select .cse3 (+ (* 16 .cse4) (- 16) |c_ULTIMATE.start_main_~#volArray~0#1.offset|))) .cse5) (< .cse2 c_~CELLCOUNT~0)))) .cse1) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (or (let ((.cse6 (+ .cse4 1))) (and (<= |c_ULTIMATE.start_main_~i~0#1| .cse6) (or (< |c_ULTIMATE.start_main_~i~0#1| .cse6) .cse0))) .cse1) .cse5 (forall ((v_ArrVal_430 Int) (v_ArrVal_429 Int)) (< |c_ULTIMATE.start_main_~MINVAL~0#1| (+ (select (let ((.cse7 (* 16 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse8 (+ .cse7 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (- 8)))) (store (store (store .cse3 (+ (- 16) .cse7 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_429) (+ .cse7 (- 12) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_430) .cse8 (select .cse3 .cse8)))) .cse9) 1)))))) is different from false [2024-11-28 02:57:36,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 02:57:45,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 02:57:49,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 02:57:54,216 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2)) (.cse3 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#volArray~0#1.base|)) (.cse10 (+ 16 |c_ULTIMATE.start_main_~#volArray~0#1.offset|))) (let ((.cse0 (and .cse5 (= (select .cse3 .cse10) 5))) (.cse4 (div c_~CELLCOUNT~0 4)) (.cse1 (< c_~CELLCOUNT~0 0)) (.cse6 (select .cse3 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (and (= 5 |c_ULTIMATE.start_main_~CCCELVOL4~0#1|) (or .cse0 .cse1) (or (let ((.cse2 (+ 8 (mod c_~CELLCOUNT~0 4)))) (and (<= .cse2 c_~CELLCOUNT~0) (or (and (= 5 (select .cse3 (+ (* 16 .cse4) (- 16) |c_ULTIMATE.start_main_~#volArray~0#1.offset|))) .cse5) (< .cse2 c_~CELLCOUNT~0)))) .cse1) |c_ULTIMATE.start_main_#t~short23#1| (or (and (= 5 .cse6) .cse5) (< (+ c_~CELLCOUNT~0 3) |c_ULTIMATE.start_main_~i~0#1|)) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (or (let ((.cse7 (+ .cse4 1))) (and (<= |c_ULTIMATE.start_main_~i~0#1| .cse7) (or (< |c_ULTIMATE.start_main_~i~0#1| .cse7) .cse0))) .cse1) .cse5 (< |c_ULTIMATE.start_main_~MINVAL~0#1| (+ .cse6 1)) (forall ((v_ArrVal_430 Int) (v_ArrVal_429 Int)) (< |c_ULTIMATE.start_main_~MINVAL~0#1| (+ (select (let ((.cse8 (* 16 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse9 (+ .cse8 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (- 8)))) (store (store (store .cse3 (+ (- 16) .cse8 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_429) (+ .cse8 (- 12) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_430) .cse9 (select .cse3 .cse9)))) .cse10) 1)))))) is different from false [2024-11-28 02:57:59,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 02:58:03,459 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (< c_~CELLCOUNT~0 0)) (.cse0 (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2)) (.cse1 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#volArray~0#1.base|)) (.cse2 (+ 16 |c_ULTIMATE.start_main_~#volArray~0#1.offset|))) (and (= 5 |c_ULTIMATE.start_main_~CCCELVOL4~0#1|) (or (and .cse0 (= (select .cse1 .cse2) 5)) .cse3) (or (let ((.cse4 (+ 8 (mod c_~CELLCOUNT~0 4)))) (and (<= .cse4 c_~CELLCOUNT~0) (or (and (= 5 (select .cse1 (+ (* 16 (div c_~CELLCOUNT~0 4)) (- 16) |c_ULTIMATE.start_main_~#volArray~0#1.offset|))) .cse0) (< .cse4 c_~CELLCOUNT~0)))) .cse3) (= 5 (select .cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|))) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) .cse0 (forall ((v_ArrVal_430 Int) (v_ArrVal_429 Int)) (< |c_ULTIMATE.start_main_~MINVAL~0#1| (+ (select (let ((.cse5 (* 16 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse6 (+ .cse5 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (- 8)))) (store (store (store .cse1 (+ (- 16) .cse5 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_429) (+ .cse5 (- 12) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_430) .cse6 (select .cse1 .cse6)))) .cse2) 1))))) is different from false [2024-11-28 02:58:04,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:58:04,787 INFO L93 Difference]: Finished difference Result 601 states and 669 transitions. [2024-11-28 02:58:04,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2024-11-28 02:58:04,788 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.452830188679245) internal successors, (183), 53 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-28 02:58:04,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:58:04,792 INFO L225 Difference]: With dead ends: 601 [2024-11-28 02:58:04,792 INFO L226 Difference]: Without dead ends: 591 [2024-11-28 02:58:04,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 101 SyntacticMatches, 18 SemanticMatches, 243 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 22556 ImplicationChecksByTransitivity, 78.1s TimeCoverageRelationStatistics Valid=4397, Invalid=52497, Unknown=12, NotChecked=2874, Total=59780 [2024-11-28 02:58:04,812 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 1323 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 3481 mSolverCounterSat, 446 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 56.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1323 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 4389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 446 IncrementalHoareTripleChecker+Valid, 3481 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 449 IncrementalHoareTripleChecker+Unchecked, 56.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:58:04,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1323 Valid, 756 Invalid, 4389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [446 Valid, 3481 Invalid, 13 Unknown, 449 Unchecked, 56.8s Time] [2024-11-28 02:58:04,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2024-11-28 02:58:04,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 133. [2024-11-28 02:58:04,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.1136363636363635) internal successors, (147), 132 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:58:04,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 147 transitions. [2024-11-28 02:58:04,855 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 147 transitions. Word has length 68 [2024-11-28 02:58:04,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:58:04,855 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 147 transitions. [2024-11-28 02:58:04,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 3.452830188679245) internal successors, (183), 53 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:58:04,856 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 147 transitions. [2024-11-28 02:58:04,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-28 02:58:04,857 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:58:04,857 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:58:04,867 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-28 02:58:05,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-28 02:58:05,058 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:58:05,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:58:05,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1322504238, now seen corresponding path program 5 times [2024-11-28 02:58:05,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:58:05,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856196089] [2024-11-28 02:58:05,059 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-28 02:58:05,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:58:05,123 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-11-28 02:58:05,123 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:58:07,053 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 10 proven. 85 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 02:58:07,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:58:07,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856196089] [2024-11-28 02:58:07,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856196089] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:58:07,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047556030] [2024-11-28 02:58:07,054 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-28 02:58:07,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:58:07,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:58:07,056 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:58:07,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 02:58:09,286 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-11-28 02:58:09,286 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:58:09,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-28 02:58:09,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:58:09,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 02:58:09,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:58:09,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 32 [2024-11-28 02:58:09,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-28 02:58:09,679 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:58:09,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 21 [2024-11-28 02:58:09,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:58:09,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2024-11-28 02:58:09,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:58:09,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 28 [2024-11-28 02:58:10,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:58:10,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 35 [2024-11-28 02:58:10,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:58:10,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 38 [2024-11-28 02:58:10,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:58:10,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 45 [2024-11-28 02:58:10,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:58:10,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 73 treesize of output 48 [2024-11-28 02:58:11,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:58:11,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 40 treesize of output 16 [2024-11-28 02:58:11,318 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-28 02:58:11,318 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:58:20,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2024-11-28 02:58:20,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-28 02:58:20,391 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 10 proven. 88 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-28 02:58:20,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047556030] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:58:20,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:58:20,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 23, 14] total 46 [2024-11-28 02:58:20,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074496586] [2024-11-28 02:58:20,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:58:20,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-28 02:58:20,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:58:20,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-28 02:58:20,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=1815, Unknown=0, NotChecked=0, Total=2070 [2024-11-28 02:58:20,394 INFO L87 Difference]: Start difference. First operand 133 states and 147 transitions. Second operand has 46 states, 46 states have (on average 4.304347826086956) internal successors, (198), 46 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:58:25,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 02:58:28,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:58:28,226 INFO L93 Difference]: Finished difference Result 299 states and 339 transitions. [2024-11-28 02:58:28,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-11-28 02:58:28,226 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 4.304347826086956) internal successors, (198), 46 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-11-28 02:58:28,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:58:28,227 INFO L225 Difference]: With dead ends: 299 [2024-11-28 02:58:28,227 INFO L226 Difference]: Without dead ends: 289 [2024-11-28 02:58:28,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 120 SyntacticMatches, 6 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2962 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=1140, Invalid=8172, Unknown=0, NotChecked=0, Total=9312 [2024-11-28 02:58:28,229 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 604 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 1953 mSolverCounterSat, 134 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 2088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1953 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-11-28 02:58:28,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 389 Invalid, 2088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1953 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2024-11-28 02:58:28,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-11-28 02:58:28,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 147. [2024-11-28 02:58:28,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 1.1164383561643836) internal successors, (163), 146 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:58:28,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 163 transitions. [2024-11-28 02:58:28,276 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 163 transitions. Word has length 74 [2024-11-28 02:58:28,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:58:28,276 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 163 transitions. [2024-11-28 02:58:28,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 4.304347826086956) internal successors, (198), 46 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:58:28,277 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 163 transitions. [2024-11-28 02:58:28,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-28 02:58:28,278 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:58:28,278 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:58:28,289 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 02:58:28,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-28 02:58:28,478 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:58:28,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:58:28,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1843373474, now seen corresponding path program 6 times [2024-11-28 02:58:28,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:58:28,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713658500] [2024-11-28 02:58:28,479 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-28 02:58:28,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:58:28,571 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-11-28 02:58:28,571 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:58:32,668 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 8 proven. 60 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-28 02:58:32,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:58:32,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713658500] [2024-11-28 02:58:32,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713658500] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:58:32,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447291732] [2024-11-28 02:58:32,669 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-28 02:58:32,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:58:32,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:58:32,671 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:58:32,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 02:58:33,614 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-11-28 02:58:33,614 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:58:33,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 86 conjuncts are in the unsatisfiable core [2024-11-28 02:58:33,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:58:33,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 02:58:33,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 11 [2024-11-28 02:58:33,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2024-11-28 02:58:33,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:58:33,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 21 [2024-11-28 02:58:34,062 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:58:34,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2024-11-28 02:58:34,122 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:58:34,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 55 treesize of output 45 [2024-11-28 02:58:34,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:58:34,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 38 [2024-11-28 02:58:34,270 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:58:34,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 48 [2024-11-28 02:58:34,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:58:34,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 45 [2024-11-28 02:58:34,450 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:58:34,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 70 treesize of output 55 [2024-11-28 02:58:34,636 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:58:34,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 52 treesize of output 55 [2024-11-28 02:58:34,754 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:58:34,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 77 treesize of output 51 [2024-11-28 02:58:34,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:58:34,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 48 treesize of output 55 [2024-11-28 02:58:34,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:58:34,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 84 treesize of output 51 [2024-11-28 02:58:35,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:58:35,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:58:35,080 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:58:35,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 49 [2024-11-28 02:58:35,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:58:35,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:58:35,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:58:35,250 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2024-11-28 02:58:35,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 27 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 102 treesize of output 56 [2024-11-28 02:58:36,011 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-28 02:58:36,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 95 treesize of output 81 [2024-11-28 02:58:36,214 INFO L349 Elim1Store]: treesize reduction 45, result has 19.6 percent of original size [2024-11-28 02:58:36,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 22 case distinctions, treesize of input 120 treesize of output 84 [2024-11-28 02:58:36,516 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-28 02:58:36,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 102 treesize of output 91 [2024-11-28 02:58:36,738 INFO L349 Elim1Store]: treesize reduction 45, result has 19.6 percent of original size [2024-11-28 02:58:36,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 29 case distinctions, treesize of input 138 treesize of output 94 [2024-11-28 02:58:36,967 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-28 02:58:36,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 109 treesize of output 101 [2024-11-28 02:58:37,221 INFO L349 Elim1Store]: treesize reduction 45, result has 19.6 percent of original size [2024-11-28 02:58:37,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 37 case distinctions, treesize of input 134 treesize of output 97 [2024-11-28 02:58:39,126 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:58:39,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 101 treesize of output 61 [2024-11-28 02:58:39,156 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 8 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:58:39,156 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:59:46,698 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_731 Int) (v_ArrVal_750 Int) (v_ArrVal_749 Int) (|v_ULTIMATE.start_main_~i~0#1_162| Int) (v_ArrVal_733 Int) (v_ArrVal_732 Int)) (let ((.cse5 (* 16 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse0 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#volArray~0#1.base|)) (.cse1 (+ (- 16) .cse5 |c_ULTIMATE.start_main_~#volArray~0#1.offset|))) (or (< v_ArrVal_733 (select .cse0 .cse1)) (< |c_ULTIMATE.start_main_~MINVAL~0#1| (+ (select (let ((.cse3 (* 16 |v_ULTIMATE.start_main_~i~0#1_162|))) (let ((.cse2 (store (store (store (store .cse0 (+ .cse5 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (- 8)) |c_ULTIMATE.start_main_~CCCELVOL2~0#1|) .cse1 v_ArrVal_733) (+ .cse5 (- 12) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_731) (+ .cse5 (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_732)) (.cse4 (+ .cse3 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (- 8)))) (store (store (store .cse2 (+ .cse3 (- 16) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_749) (+ .cse3 (- 12) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_750) .cse4 (select .cse2 .cse4)))) (+ 16 |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) 1)) (< |v_ULTIMATE.start_main_~i~0#1_162| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))))) is different from false [2024-11-28 03:01:02,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2024-11-28 03:01:02,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2024-11-28 03:01:02,733 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 8 proven. 79 refuted. 0 times theorem prover too weak. 12 trivial. 5 not checked. [2024-11-28 03:01:02,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447291732] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:01:02,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:01:02,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 36, 21] total 65 [2024-11-28 03:01:02,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820562635] [2024-11-28 03:01:02,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:01:02,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2024-11-28 03:01:02,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:01:02,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-11-28 03:01:02,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=432, Invalid=3585, Unknown=19, NotChecked=124, Total=4160 [2024-11-28 03:01:02,737 INFO L87 Difference]: Start difference. First operand 147 states and 163 transitions. Second operand has 65 states, 65 states have (on average 3.1384615384615384) internal successors, (204), 65 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:01:59,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:01:59,418 INFO L93 Difference]: Finished difference Result 699 states and 801 transitions. [2024-11-28 03:01:59,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2024-11-28 03:01:59,418 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 3.1384615384615384) internal successors, (204), 65 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-28 03:01:59,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:01:59,422 INFO L225 Difference]: With dead ends: 699 [2024-11-28 03:01:59,422 INFO L226 Difference]: Without dead ends: 683 [2024-11-28 03:01:59,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 119 SyntacticMatches, 22 SemanticMatches, 210 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 15481 ImplicationChecksByTransitivity, 180.9s TimeCoverageRelationStatistics Valid=5104, Invalid=39191, Unknown=19, NotChecked=418, Total=44732 [2024-11-28 03:01:59,428 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 1074 mSDsluCounter, 1964 mSDsCounter, 0 mSdLazyCounter, 7807 mSolverCounterSat, 579 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1074 SdHoareTripleChecker+Valid, 2071 SdHoareTripleChecker+Invalid, 9005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 579 IncrementalHoareTripleChecker+Valid, 7807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 619 IncrementalHoareTripleChecker+Unchecked, 21.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:01:59,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1074 Valid, 2071 Invalid, 9005 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [579 Valid, 7807 Invalid, 0 Unknown, 619 Unchecked, 21.0s Time] [2024-11-28 03:01:59,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2024-11-28 03:01:59,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 158. [2024-11-28 03:01:59,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.1019108280254777) internal successors, (173), 157 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:01:59,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 173 transitions. [2024-11-28 03:01:59,499 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 173 transitions. Word has length 80 [2024-11-28 03:01:59,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:01:59,500 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 173 transitions. [2024-11-28 03:01:59,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 3.1384615384615384) internal successors, (204), 65 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:01:59,500 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 173 transitions. [2024-11-28 03:01:59,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-28 03:01:59,501 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:01:59,501 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:01:59,513 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-28 03:01:59,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:01:59,702 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:01:59,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:01:59,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1491644484, now seen corresponding path program 7 times [2024-11-28 03:01:59,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:01:59,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229570824] [2024-11-28 03:01:59,703 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-28 03:01:59,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:01:59,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:02:01,698 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 12 proven. 123 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-28 03:02:01,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:02:01,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229570824] [2024-11-28 03:02:01,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229570824] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:02:01,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593726056] [2024-11-28 03:02:01,699 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-28 03:02:01,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:02:01,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:02:01,702 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:02:01,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 03:02:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:02:01,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-28 03:02:01,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:02:02,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 03:02:02,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 11 [2024-11-28 03:02:02,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-28 03:02:02,787 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:02:02,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 28 [2024-11-28 03:02:02,898 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:02:02,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2024-11-28 03:02:02,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:02:02,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 31 [2024-11-28 03:02:04,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:02:04,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 13 [2024-11-28 03:02:04,378 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 12 proven. 126 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 03:02:04,378 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:02:05,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2024-11-28 03:02:05,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-28 03:02:05,691 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 12 proven. 113 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-28 03:02:05,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593726056] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:02:05,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:02:05,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 14] total 43 [2024-11-28 03:02:05,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73178030] [2024-11-28 03:02:05,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:02:05,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-28 03:02:05,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:02:05,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-28 03:02:05,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1640, Unknown=0, NotChecked=0, Total=1806 [2024-11-28 03:02:05,694 INFO L87 Difference]: Start difference. First operand 158 states and 173 transitions. Second operand has 43 states, 43 states have (on average 5.023255813953488) internal successors, (216), 43 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:02:10,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:02:10,966 INFO L93 Difference]: Finished difference Result 278 states and 320 transitions. [2024-11-28 03:02:10,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-28 03:02:10,967 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 5.023255813953488) internal successors, (216), 43 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-28 03:02:10,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:02:10,968 INFO L225 Difference]: With dead ends: 278 [2024-11-28 03:02:10,969 INFO L226 Difference]: Without dead ends: 254 [2024-11-28 03:02:10,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 137 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1441 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=714, Invalid=5448, Unknown=0, NotChecked=0, Total=6162 [2024-11-28 03:02:10,970 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 435 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 2566 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 2684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 2566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:02:10,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 433 Invalid, 2684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 2566 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-28 03:02:10,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-28 03:02:11,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 162. [2024-11-28 03:02:11,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.0869565217391304) internal successors, (175), 161 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:02:11,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 175 transitions. [2024-11-28 03:02:11,028 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 175 transitions. Word has length 80 [2024-11-28 03:02:11,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:02:11,028 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 175 transitions. [2024-11-28 03:02:11,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 5.023255813953488) internal successors, (216), 43 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:02:11,028 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 175 transitions. [2024-11-28 03:02:11,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-28 03:02:11,029 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:02:11,029 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:02:11,037 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-28 03:02:11,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:02:11,230 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:02:11,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:02:11,230 INFO L85 PathProgramCache]: Analyzing trace with hash 2086754342, now seen corresponding path program 8 times [2024-11-28 03:02:11,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:02:11,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816238392] [2024-11-28 03:02:11,231 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:02:11,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:02:11,281 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:02:11,281 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:02:12,204 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 166 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-28 03:02:12,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:02:12,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816238392] [2024-11-28 03:02:12,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816238392] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:02:12,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311652699] [2024-11-28 03:02:12,204 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:02:12,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:02:12,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:02:12,207 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:02:12,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 03:02:12,391 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:02:12,392 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:02:12,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-28 03:02:12,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:02:12,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 03:02:12,679 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:02:12,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 18 [2024-11-28 03:02:13,684 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-28 03:02:13,684 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:02:14,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2024-11-28 03:02:14,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2024-11-28 03:02:14,047 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 166 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-28 03:02:14,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311652699] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:02:14,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:02:14,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 17] total 34 [2024-11-28 03:02:14,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917351384] [2024-11-28 03:02:14,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:02:14,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-28 03:02:14,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:02:14,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-28 03:02:14,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=982, Unknown=0, NotChecked=0, Total=1122 [2024-11-28 03:02:14,050 INFO L87 Difference]: Start difference. First operand 162 states and 175 transitions. Second operand has 34 states, 34 states have (on average 4.882352941176471) internal successors, (166), 34 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:02:16,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:02:16,952 INFO L93 Difference]: Finished difference Result 227 states and 251 transitions. [2024-11-28 03:02:16,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-28 03:02:16,953 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 4.882352941176471) internal successors, (166), 34 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-11-28 03:02:16,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:02:16,955 INFO L225 Difference]: With dead ends: 227 [2024-11-28 03:02:16,955 INFO L226 Difference]: Without dead ends: 225 [2024-11-28 03:02:16,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=330, Invalid=2532, Unknown=0, NotChecked=0, Total=2862 [2024-11-28 03:02:16,956 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 59 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 1891 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 1929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:02:16,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 320 Invalid, 1929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1891 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-28 03:02:16,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-28 03:02:17,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 172. [2024-11-28 03:02:17,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.0818713450292399) internal successors, (185), 171 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:02:17,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 185 transitions. [2024-11-28 03:02:17,027 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 185 transitions. Word has length 86 [2024-11-28 03:02:17,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:02:17,027 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 185 transitions. [2024-11-28 03:02:17,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.882352941176471) internal successors, (166), 34 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:02:17,027 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 185 transitions. [2024-11-28 03:02:17,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-28 03:02:17,028 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:02:17,028 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 8, 8, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:02:17,038 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-28 03:02:17,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-28 03:02:17,229 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:02:17,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:02:17,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1276327090, now seen corresponding path program 9 times [2024-11-28 03:02:17,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:02:17,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237614558] [2024-11-28 03:02:17,229 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 03:02:17,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:02:17,324 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2024-11-28 03:02:17,324 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:02:18,281 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 165 proven. 48 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-28 03:02:18,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:02:18,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237614558] [2024-11-28 03:02:18,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237614558] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:02:18,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4536396] [2024-11-28 03:02:18,282 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 03:02:18,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:02:18,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:02:18,285 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:02:18,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 03:02:19,852 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2024-11-28 03:02:19,853 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:02:19,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-28 03:02:19,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:02:21,551 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 208 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-28 03:02:21,551 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:02:22,410 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 208 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-28 03:02:22,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4536396] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:02:22,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:02:22,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 16] total 45 [2024-11-28 03:02:22,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3749327] [2024-11-28 03:02:22,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:02:22,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-28 03:02:22,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:02:22,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-28 03:02:22,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=495, Invalid=1485, Unknown=0, NotChecked=0, Total=1980 [2024-11-28 03:02:22,414 INFO L87 Difference]: Start difference. First operand 172 states and 185 transitions. Second operand has 45 states, 45 states have (on average 5.2) internal successors, (234), 45 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:02:23,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:02:23,532 INFO L93 Difference]: Finished difference Result 397 states and 427 transitions. [2024-11-28 03:02:23,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-28 03:02:23,533 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 5.2) internal successors, (234), 45 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-11-28 03:02:23,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:02:23,534 INFO L225 Difference]: With dead ends: 397 [2024-11-28 03:02:23,534 INFO L226 Difference]: Without dead ends: 119 [2024-11-28 03:02:23,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 155 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 925 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=628, Invalid=1922, Unknown=0, NotChecked=0, Total=2550 [2024-11-28 03:02:23,536 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 335 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 03:02:23,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 221 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 03:02:23,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-28 03:02:23,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 111. [2024-11-28 03:02:23,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 1.0727272727272728) internal successors, (118), 110 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:02:23,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2024-11-28 03:02:23,597 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 92 [2024-11-28 03:02:23,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:02:23,597 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2024-11-28 03:02:23,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 5.2) internal successors, (234), 45 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:02:23,597 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2024-11-28 03:02:23,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-28 03:02:23,598 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:02:23,598 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 9, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:02:23,611 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-28 03:02:23,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:02:23,799 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:02:23,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:02:23,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1337789870, now seen corresponding path program 10 times [2024-11-28 03:02:23,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:02:23,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903618687] [2024-11-28 03:02:23,800 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 03:02:23,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:02:23,886 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 03:02:23,887 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:02:31,790 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 18 proven. 281 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 03:02:31,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:02:31,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903618687] [2024-11-28 03:02:31,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903618687] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:02:31,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024146797] [2024-11-28 03:02:31,791 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 03:02:31,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:02:31,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:02:31,793 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:02:31,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03ec3310-6da2-4228-83f9-1e6778cc8be6/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 03:02:32,035 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 03:02:32,035 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:02:32,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-11-28 03:02:32,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:02:32,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 03:02:32,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:02:32,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 25 [2024-11-28 03:02:32,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-28 03:02:33,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:02:33,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 21 [2024-11-28 03:02:33,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:02:33,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2024-11-28 03:02:33,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:02:33,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 31 [2024-11-28 03:02:33,562 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:02:33,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 35 [2024-11-28 03:02:33,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:02:33,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 38 [2024-11-28 03:02:34,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:02:34,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 45 [2024-11-28 03:02:34,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:02:34,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 48 [2024-11-28 03:02:34,413 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:02:34,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 48 treesize of output 55 [2024-11-28 03:02:34,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:02:34,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 73 treesize of output 58 [2024-11-28 03:02:34,940 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:02:34,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 55 treesize of output 65 [2024-11-28 03:02:35,142 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:02:35,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 91 treesize of output 68 [2024-11-28 03:02:38,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:02:38,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 58 treesize of output 22 [2024-11-28 03:02:38,610 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 18 proven. 290 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 03:02:38,610 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:03:21,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2024-11-28 03:03:21,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-28 03:03:22,501 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 18 proven. 277 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-28 03:03:22,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024146797] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:03:22,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:03:22,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 20] total 78 [2024-11-28 03:03:22,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570123654] [2024-11-28 03:03:22,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:03:22,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2024-11-28 03:03:22,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:03:22,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2024-11-28 03:03:22,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=5671, Unknown=2, NotChecked=0, Total=6006 [2024-11-28 03:03:22,506 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand has 78 states, 78 states have (on average 3.923076923076923) internal successors, (306), 78 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:03:29,938 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#volArray~0#1.base|)) (.cse10 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse4 (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 5)) (.cse2 (select .cse6 (+ .cse10 |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20))) (.cse3 (= 7 |c_ULTIMATE.start_main_~CCCELVOL3~0#1|)) (.cse5 (select .cse6 (+ .cse10 |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4))) (.cse1 (= 5 (select .cse6 0))) (.cse0 (select .cse6 36))) (and (= 5 |c_ULTIMATE.start_main_~CCCELVOL4~0#1|) (<= 7 .cse0) (<= 7 |c_ULTIMATE.start_main_~CCCELVOL3~0#1|) (or (and (= 5 |c_ULTIMATE.start_main_~i~0#1|) (<= (+ c_~CELLCOUNT~0 1) 0) (not (= (mod c_~CELLCOUNT~0 4) 0))) (< |c_ULTIMATE.start_main_~i~0#1| 5)) (<= (div c_~CELLCOUNT~0 4) 3) .cse1 (<= 3 |c_ULTIMATE.start_main_~i~0#1|) (< |c_ULTIMATE.start_main_~MINVAL~0#1| (+ .cse2 1)) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) .cse3 (or (< (+ c_~CELLCOUNT~0 8) |c_ULTIMATE.start_main_~i~0#1|) (and .cse4 (= 7 .cse5))) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2) (or (< (+ c_~CELLCOUNT~0 4) |c_ULTIMATE.start_main_~i~0#1|) (and .cse4 (= 7 .cse2))) (or (not (= 3 |c_ULTIMATE.start_main_~i~0#1|)) (and .cse1 .cse3)) (forall ((v_ArrVal_1240 Int) (v_ArrVal_1241 Int) (v_ArrVal_1235 Int) (v_ArrVal_1237 Int)) (< |c_ULTIMATE.start_main_~MINVAL~0#1| (+ (select (let ((.cse7 (* 16 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse9 (+ .cse7 |c_ULTIMATE.start_main_~#volArray~0#1.offset| 8))) (store (store (store (let ((.cse8 (+ .cse7 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (- 8)))) (store (store (store .cse6 (+ (- 16) .cse7 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_1237) (+ .cse7 (- 12) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_1235) .cse8 (select .cse6 .cse8))) (+ .cse7 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_1241) (+ .cse7 |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4) v_ArrVal_1240) .cse9 (select .cse6 .cse9)))) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 36)) 1))) (< |c_ULTIMATE.start_main_~MINVAL~0#1| (+ .cse5 1)) (or (and .cse1 (= 7 .cse0)) (< c_~CELLCOUNT~0 0))))) is different from false [2024-11-28 03:03:47,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:03:51,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:03:55,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:03:59,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:04:09,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:04:13,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:04:17,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:04:21,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:04:25,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:04:29,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:04:33,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:04:37,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:04:41,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:04:45,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:04:49,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:04:54,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:04:58,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:05:02,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:05:06,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:05:10,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:05:14,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:05:18,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:05:22,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:05:26,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:05:30,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:05:34,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:05:38,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:05:42,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:05:46,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:05:50,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:05:54,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:05:58,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:06:02,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:06:06,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:06:10,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:06:14,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:06:18,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:06:22,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:06:26,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:06:30,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:06:34,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:06:38,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:06:42,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:06:46,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:06:50,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:06:54,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:06:58,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:07:02,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:07:06,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:07:10,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:07:14,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:07:18,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:07:26,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:07:30,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:07:34,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:07:38,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:07:42,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:07:46,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:07:59,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:08:08,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:08:12,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:08:16,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:08:20,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:08:24,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:08:28,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:08:32,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:08:36,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:08:40,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:08:44,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:08:48,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:08:52,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:08:56,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:09:00,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:09:04,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:09:08,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:09:12,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:09:16,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:09:20,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:09:24,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:09:28,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:09:32,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:09:36,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:09:40,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:09:44,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:09:48,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:09:52,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:09:56,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:10:00,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:10:04,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:10:08,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]