./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-01-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 652acbc8fb2d659424086f7ee4bd5fc2f45ff1d49f46cde68db4fdee1ed0638e --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:55:13,770 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:55:13,856 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-13 15:55:13,865 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:55:13,865 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:55:13,900 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:55:13,901 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:55:13,902 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:55:13,902 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:55:13,902 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:55:13,902 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:55:13,902 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:55:13,903 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:55:13,903 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:55:13,903 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:55:13,903 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:55:13,903 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:55:13,903 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 15:55:13,903 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:55:13,903 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:55:13,904 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 15:55:13,904 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 15:55:13,906 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 15:55:13,906 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:55:13,906 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 15:55:13,906 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:55:13,906 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 15:55:13,906 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:55:13,906 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:55:13,907 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:55:13,907 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:55:13,907 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:55:13,907 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:55:13,907 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:55:13,907 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:55:13,907 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:55:13,907 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 15:55:13,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 15:55:13,908 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:55:13,908 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:55:13,908 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:55:13,908 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:55:13,908 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_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 652acbc8fb2d659424086f7ee4bd5fc2f45ff1d49f46cde68db4fdee1ed0638e [2024-11-13 15:55:14,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:55:14,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:55:14,237 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:55:14,238 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:55:14,238 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:55:14,240 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/forester-heap/dll-01-2.i Unable to find full path for "g++" [2024-11-13 15:55:16,235 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:55:16,646 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:55:16,647 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/sv-benchmarks/c/forester-heap/dll-01-2.i [2024-11-13 15:55:16,661 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/data/fe98e7704/39aa736fdd00408ebc99b3f0ebe54f70/FLAG34195cd41 [2024-11-13 15:55:16,819 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/data/fe98e7704/39aa736fdd00408ebc99b3f0ebe54f70 [2024-11-13 15:55:16,822 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:55:16,823 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:55:16,824 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:55:16,824 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:55:16,827 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:55:16,827 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:55:16" (1/1) ... [2024-11-13 15:55:16,828 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7438554a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:55:16, skipping insertion in model container [2024-11-13 15:55:16,829 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:55:16" (1/1) ... [2024-11-13 15:55:16,877 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:55:17,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:55:17,297 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:55:17,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:55:17,402 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:55:17,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:55:17 WrapperNode [2024-11-13 15:55:17,403 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:55:17,404 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:55:17,404 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:55:17,405 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:55:17,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:55:17" (1/1) ... [2024-11-13 15:55:17,435 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:55:17" (1/1) ... [2024-11-13 15:55:17,466 INFO L138 Inliner]: procedures = 119, calls = 58, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 217 [2024-11-13 15:55:17,467 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:55:17,467 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:55:17,467 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:55:17,467 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:55:17,475 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:55:17" (1/1) ... [2024-11-13 15:55:17,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:55:17" (1/1) ... [2024-11-13 15:55:17,479 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:55:17" (1/1) ... [2024-11-13 15:55:17,504 INFO L175 MemorySlicer]: Split 35 memory accesses to 2 slices as follows [2, 33]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 14 writes are split as follows [0, 14]. [2024-11-13 15:55:17,504 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:55:17" (1/1) ... [2024-11-13 15:55:17,504 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:55:17" (1/1) ... [2024-11-13 15:55:17,525 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:55:17" (1/1) ... [2024-11-13 15:55:17,530 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:55:17" (1/1) ... [2024-11-13 15:55:17,531 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:55:17" (1/1) ... [2024-11-13 15:55:17,532 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:55:17" (1/1) ... [2024-11-13 15:55:17,538 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:55:17,539 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:55:17,539 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:55:17,539 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:55:17,544 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:55:17" (1/1) ... [2024-11-13 15:55:17,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:55:17,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:55:17,583 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:55:17,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:55:17,615 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-13 15:55:17,615 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-13 15:55:17,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 15:55:17,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:55:17,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 15:55:17,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 15:55:17,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 15:55:17,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 15:55:17,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 15:55:17,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 15:55:17,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 15:55:17,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:55:17,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:55:17,744 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:55:17,747 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:55:18,329 INFO L? ?]: Removed 154 outVars from TransFormulas that were not future-live. [2024-11-13 15:55:18,329 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:55:18,348 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:55:18,351 INFO L316 CfgBuilder]: Removed 30 assume(true) statements. [2024-11-13 15:55:18,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:55:18 BoogieIcfgContainer [2024-11-13 15:55:18,352 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:55:18,355 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:55:18,356 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:55:18,360 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:55:18,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:55:16" (1/3) ... [2024-11-13 15:55:18,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d345cb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:55:18, skipping insertion in model container [2024-11-13 15:55:18,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:55:17" (2/3) ... [2024-11-13 15:55:18,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d345cb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:55:18, skipping insertion in model container [2024-11-13 15:55:18,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:55:18" (3/3) ... [2024-11-13 15:55:18,364 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-01-2.i [2024-11-13 15:55:18,381 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:55:18,383 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-01-2.i that has 2 procedures, 208 locations, 1 initial locations, 17 loop locations, and 74 error locations. [2024-11-13 15:55:18,442 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:55:18,459 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=None, 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;@65df7588, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:55:18,459 INFO L334 AbstractCegarLoop]: Starting to check reachability of 74 error locations. [2024-11-13 15:55:18,464 INFO L276 IsEmpty]: Start isEmpty. Operand has 208 states, 119 states have (on average 2.0756302521008405) internal successors, (247), 193 states have internal predecessors, (247), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 15:55:18,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-13 15:55:18,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:18,471 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-13 15:55:18,473 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:18,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:18,478 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2024-11-13 15:55:18,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:18,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186792477] [2024-11-13 15:55:18,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:18,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:18,709 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-13 15:55:18,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:18,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186792477] [2024-11-13 15:55:18,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186792477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:18,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:18,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:55:18,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157009503] [2024-11-13 15:55:18,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:18,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:55:18,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:18,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:55:18,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:55:18,769 INFO L87 Difference]: Start difference. First operand has 208 states, 119 states have (on average 2.0756302521008405) internal successors, (247), 193 states have internal predecessors, (247), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-13 15:55:19,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:19,061 INFO L93 Difference]: Finished difference Result 185 states and 208 transitions. [2024-11-13 15:55:19,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:55:19,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-13 15:55:19,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:19,071 INFO L225 Difference]: With dead ends: 185 [2024-11-13 15:55:19,072 INFO L226 Difference]: Without dead ends: 183 [2024-11-13 15:55:19,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-13 15:55:19,076 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 162 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:19,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 130 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:55:19,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-13 15:55:19,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2024-11-13 15:55:19,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 106 states have (on average 1.820754716981132) internal successors, (193), 181 states have internal predecessors, (193), 13 states have call successors, (13), 1 states have call predecessors, (13), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:19,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 206 transitions. [2024-11-13 15:55:19,135 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 206 transitions. Word has length 3 [2024-11-13 15:55:19,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:19,137 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 206 transitions. [2024-11-13 15:55:19,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-13 15:55:19,137 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 206 transitions. [2024-11-13 15:55:19,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-13 15:55:19,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:19,138 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-13 15:55:19,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 15:55:19,139 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:19,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:19,140 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2024-11-13 15:55:19,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:19,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735812348] [2024-11-13 15:55:19,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:19,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:19,284 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-13 15:55:19,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:19,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735812348] [2024-11-13 15:55:19,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735812348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:19,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:19,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:55:19,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96000950] [2024-11-13 15:55:19,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:19,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:55:19,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:19,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:55:19,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:55:19,288 INFO L87 Difference]: Start difference. First operand 183 states and 206 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-13 15:55:19,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:19,520 INFO L93 Difference]: Finished difference Result 202 states and 229 transitions. [2024-11-13 15:55:19,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:55:19,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-13 15:55:19,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:19,523 INFO L225 Difference]: With dead ends: 202 [2024-11-13 15:55:19,523 INFO L226 Difference]: Without dead ends: 202 [2024-11-13 15:55:19,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-13 15:55:19,524 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 161 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:19,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 153 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:55:19,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-13 15:55:19,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 192. [2024-11-13 15:55:19,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 123 states have (on average 1.7317073170731707) internal successors, (213), 190 states have internal predecessors, (213), 13 states have call successors, (13), 1 states have call predecessors, (13), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:19,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 226 transitions. [2024-11-13 15:55:19,547 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 226 transitions. Word has length 3 [2024-11-13 15:55:19,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:19,547 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 226 transitions. [2024-11-13 15:55:19,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-13 15:55:19,547 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 226 transitions. [2024-11-13 15:55:19,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 15:55:19,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:19,548 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:55:19,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 15:55:19,548 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:19,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:19,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1770900490, now seen corresponding path program 1 times [2024-11-13 15:55:19,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:19,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473054817] [2024-11-13 15:55:19,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:19,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:19,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:19,636 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-13 15:55:19,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:19,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473054817] [2024-11-13 15:55:19,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473054817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:19,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:19,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:55:19,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505270274] [2024-11-13 15:55:19,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:19,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:55:19,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:19,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:55:19,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:55:19,638 INFO L87 Difference]: Start difference. First operand 192 states and 226 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:19,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:19,733 INFO L93 Difference]: Finished difference Result 203 states and 229 transitions. [2024-11-13 15:55:19,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:55:19,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-13 15:55:19,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:19,737 INFO L225 Difference]: With dead ends: 203 [2024-11-13 15:55:19,737 INFO L226 Difference]: Without dead ends: 203 [2024-11-13 15:55:19,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-13 15:55:19,740 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 163 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:19,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 217 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:55:19,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-13 15:55:19,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 191. [2024-11-13 15:55:19,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 123 states have (on average 1.7154471544715446) internal successors, (211), 189 states have internal predecessors, (211), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:19,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 223 transitions. [2024-11-13 15:55:19,758 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 223 transitions. Word has length 8 [2024-11-13 15:55:19,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:19,761 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 223 transitions. [2024-11-13 15:55:19,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:19,762 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 223 transitions. [2024-11-13 15:55:19,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 15:55:19,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:19,764 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:55:19,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 15:55:19,764 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:19,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:19,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1503259545, now seen corresponding path program 1 times [2024-11-13 15:55:19,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:19,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782464510] [2024-11-13 15:55:19,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:19,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:19,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:20,099 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-13 15:55:20,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:20,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782464510] [2024-11-13 15:55:20,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782464510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:20,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:20,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:55:20,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840013561] [2024-11-13 15:55:20,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:20,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:55:20,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:20,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:55:20,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:55:20,103 INFO L87 Difference]: Start difference. First operand 191 states and 223 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-13 15:55:20,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:20,390 INFO L93 Difference]: Finished difference Result 190 states and 222 transitions. [2024-11-13 15:55:20,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:55:20,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2024-11-13 15:55:20,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:20,392 INFO L225 Difference]: With dead ends: 190 [2024-11-13 15:55:20,392 INFO L226 Difference]: Without dead ends: 190 [2024-11-13 15:55:20,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:55:20,393 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 2 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:20,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 547 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 15:55:20,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-13 15:55:20,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2024-11-13 15:55:20,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 123 states have (on average 1.7073170731707317) internal successors, (210), 188 states have internal predecessors, (210), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:20,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 222 transitions. [2024-11-13 15:55:20,411 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 222 transitions. Word has length 12 [2024-11-13 15:55:20,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:20,412 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 222 transitions. [2024-11-13 15:55:20,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-13 15:55:20,412 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 222 transitions. [2024-11-13 15:55:20,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 15:55:20,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:20,416 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:55:20,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 15:55:20,416 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:20,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:20,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1503259546, now seen corresponding path program 1 times [2024-11-13 15:55:20,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:20,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885625100] [2024-11-13 15:55:20,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:20,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:20,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:20,780 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-13 15:55:20,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:20,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885625100] [2024-11-13 15:55:20,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885625100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:20,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:20,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:55:20,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770041542] [2024-11-13 15:55:20,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:20,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:55:20,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:20,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:55:20,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:55:20,783 INFO L87 Difference]: Start difference. First operand 190 states and 222 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-13 15:55:21,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:21,051 INFO L93 Difference]: Finished difference Result 189 states and 221 transitions. [2024-11-13 15:55:21,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:55:21,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2024-11-13 15:55:21,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:21,054 INFO L225 Difference]: With dead ends: 189 [2024-11-13 15:55:21,054 INFO L226 Difference]: Without dead ends: 189 [2024-11-13 15:55:21,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:55:21,055 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 1 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:21,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 556 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:55:21,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-13 15:55:21,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2024-11-13 15:55:21,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 123 states have (on average 1.6991869918699187) internal successors, (209), 187 states have internal predecessors, (209), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:21,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 221 transitions. [2024-11-13 15:55:21,070 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 221 transitions. Word has length 12 [2024-11-13 15:55:21,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:21,070 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 221 transitions. [2024-11-13 15:55:21,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-13 15:55:21,070 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 221 transitions. [2024-11-13 15:55:21,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 15:55:21,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:21,071 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:55:21,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 15:55:21,071 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:21,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:21,072 INFO L85 PathProgramCache]: Analyzing trace with hash -874170367, now seen corresponding path program 1 times [2024-11-13 15:55:21,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:21,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951387296] [2024-11-13 15:55:21,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:21,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:21,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:21,133 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-13 15:55:21,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:21,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951387296] [2024-11-13 15:55:21,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951387296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:21,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:21,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:55:21,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273852781] [2024-11-13 15:55:21,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:21,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:55:21,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:21,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:55:21,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:55:21,138 INFO L87 Difference]: Start difference. First operand 189 states and 221 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:21,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:21,153 INFO L93 Difference]: Finished difference Result 190 states and 222 transitions. [2024-11-13 15:55:21,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:55:21,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-13 15:55:21,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:21,156 INFO L225 Difference]: With dead ends: 190 [2024-11-13 15:55:21,156 INFO L226 Difference]: Without dead ends: 190 [2024-11-13 15:55:21,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-13 15:55:21,159 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 0 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:21,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 372 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:55:21,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-13 15:55:21,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2024-11-13 15:55:21,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 124 states have (on average 1.6935483870967742) internal successors, (210), 188 states have internal predecessors, (210), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:21,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 222 transitions. [2024-11-13 15:55:21,166 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 222 transitions. Word has length 16 [2024-11-13 15:55:21,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:21,167 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 222 transitions. [2024-11-13 15:55:21,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:21,167 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 222 transitions. [2024-11-13 15:55:21,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 15:55:21,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:21,168 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:55:21,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 15:55:21,168 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:21,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:21,168 INFO L85 PathProgramCache]: Analyzing trace with hash -18865437, now seen corresponding path program 1 times [2024-11-13 15:55:21,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:21,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072911722] [2024-11-13 15:55:21,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:21,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:21,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:21,506 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-13 15:55:21,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:21,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072911722] [2024-11-13 15:55:21,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072911722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:21,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:21,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:55:21,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329987197] [2024-11-13 15:55:21,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:21,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 15:55:21,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:21,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 15:55:21,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:55:21,509 INFO L87 Difference]: Start difference. First operand 190 states and 222 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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-13 15:55:21,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:21,902 INFO L93 Difference]: Finished difference Result 189 states and 221 transitions. [2024-11-13 15:55:21,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:55:21,902 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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 15 [2024-11-13 15:55:21,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:21,903 INFO L225 Difference]: With dead ends: 189 [2024-11-13 15:55:21,904 INFO L226 Difference]: Without dead ends: 189 [2024-11-13 15:55:21,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-13 15:55:21,905 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 159 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:21,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 430 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 15:55:21,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-13 15:55:21,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2024-11-13 15:55:21,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 124 states have (on average 1.685483870967742) internal successors, (209), 187 states have internal predecessors, (209), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:21,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 221 transitions. [2024-11-13 15:55:21,911 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 221 transitions. Word has length 15 [2024-11-13 15:55:21,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:21,912 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 221 transitions. [2024-11-13 15:55:21,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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-13 15:55:21,912 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 221 transitions. [2024-11-13 15:55:21,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 15:55:21,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:21,913 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:55:21,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 15:55:21,913 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:21,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:21,914 INFO L85 PathProgramCache]: Analyzing trace with hash -18865436, now seen corresponding path program 1 times [2024-11-13 15:55:21,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:21,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504654989] [2024-11-13 15:55:21,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:21,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:21,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:22,315 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-13 15:55:22,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:22,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504654989] [2024-11-13 15:55:22,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504654989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:22,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:22,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:55:22,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982106515] [2024-11-13 15:55:22,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:22,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 15:55:22,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:22,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 15:55:22,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:55:22,317 INFO L87 Difference]: Start difference. First operand 189 states and 221 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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-13 15:55:22,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:22,867 INFO L93 Difference]: Finished difference Result 188 states and 220 transitions. [2024-11-13 15:55:22,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:55:22,867 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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 15 [2024-11-13 15:55:22,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:22,868 INFO L225 Difference]: With dead ends: 188 [2024-11-13 15:55:22,869 INFO L226 Difference]: Without dead ends: 188 [2024-11-13 15:55:22,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-13 15:55:22,869 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 156 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:22,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 500 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 15:55:22,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-13 15:55:22,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2024-11-13 15:55:22,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 124 states have (on average 1.6774193548387097) internal successors, (208), 186 states have internal predecessors, (208), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:22,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 220 transitions. [2024-11-13 15:55:22,877 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 220 transitions. Word has length 15 [2024-11-13 15:55:22,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:22,878 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 220 transitions. [2024-11-13 15:55:22,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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-13 15:55:22,878 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 220 transitions. [2024-11-13 15:55:22,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-13 15:55:22,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:22,879 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:55:22,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 15:55:22,880 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:22,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:22,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1330830362, now seen corresponding path program 1 times [2024-11-13 15:55:22,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:22,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875352394] [2024-11-13 15:55:22,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:22,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:23,072 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-13 15:55:23,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:23,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875352394] [2024-11-13 15:55:23,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875352394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:23,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:23,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:55:23,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691531087] [2024-11-13 15:55:23,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:23,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:55:23,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:23,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:55:23,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:55:23,079 INFO L87 Difference]: Start difference. First operand 188 states and 220 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:23,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:23,390 INFO L93 Difference]: Finished difference Result 267 states and 315 transitions. [2024-11-13 15:55:23,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 15:55:23,391 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-13 15:55:23,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:23,393 INFO L225 Difference]: With dead ends: 267 [2024-11-13 15:55:23,393 INFO L226 Difference]: Without dead ends: 267 [2024-11-13 15:55:23,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-13 15:55:23,394 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 81 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:23,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 865 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:55:23,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-11-13 15:55:23,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 186. [2024-11-13 15:55:23,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 123 states have (on average 1.6747967479674797) internal successors, (206), 184 states have internal predecessors, (206), 11 states have call successors, (11), 1 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:23,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 217 transitions. [2024-11-13 15:55:23,406 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 217 transitions. Word has length 18 [2024-11-13 15:55:23,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:23,406 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 217 transitions. [2024-11-13 15:55:23,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:23,407 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 217 transitions. [2024-11-13 15:55:23,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-13 15:55:23,407 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:23,407 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:55:23,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 15:55:23,408 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:23,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:23,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1515179892, now seen corresponding path program 1 times [2024-11-13 15:55:23,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:23,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892812139] [2024-11-13 15:55:23,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:23,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:23,595 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-13 15:55:23,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:23,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892812139] [2024-11-13 15:55:23,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892812139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:23,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:23,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:55:23,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402054680] [2024-11-13 15:55:23,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:23,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:55:23,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:23,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:55:23,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:55:23,597 INFO L87 Difference]: Start difference. First operand 186 states and 217 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-13 15:55:23,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:23,793 INFO L93 Difference]: Finished difference Result 268 states and 315 transitions. [2024-11-13 15:55:23,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:55:23,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 18 [2024-11-13 15:55:23,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:23,795 INFO L225 Difference]: With dead ends: 268 [2024-11-13 15:55:23,795 INFO L226 Difference]: Without dead ends: 268 [2024-11-13 15:55:23,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:55:23,796 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 81 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:23,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 621 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:55:23,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-13 15:55:23,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 189. [2024-11-13 15:55:23,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 126 states have (on average 1.6587301587301588) internal successors, (209), 187 states have internal predecessors, (209), 11 states have call successors, (11), 1 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:23,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 220 transitions. [2024-11-13 15:55:23,807 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 220 transitions. Word has length 18 [2024-11-13 15:55:23,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:23,807 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 220 transitions. [2024-11-13 15:55:23,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-13 15:55:23,808 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 220 transitions. [2024-11-13 15:55:23,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 15:55:23,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:23,808 INFO L215 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-13 15:55:23,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 15:55:23,809 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:23,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:23,809 INFO L85 PathProgramCache]: Analyzing trace with hash 751588889, now seen corresponding path program 1 times [2024-11-13 15:55:23,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:23,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882019971] [2024-11-13 15:55:23,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:23,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:23,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:23,937 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-13 15:55:23,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:23,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882019971] [2024-11-13 15:55:23,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882019971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:23,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:23,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:55:23,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840754486] [2024-11-13 15:55:23,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:23,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:55:23,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:23,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:55:23,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:55:23,940 INFO L87 Difference]: Start difference. First operand 189 states and 220 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 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-13 15:55:24,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:24,166 INFO L93 Difference]: Finished difference Result 179 states and 210 transitions. [2024-11-13 15:55:24,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:55:24,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 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-13 15:55:24,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:24,167 INFO L225 Difference]: With dead ends: 179 [2024-11-13 15:55:24,167 INFO L226 Difference]: Without dead ends: 179 [2024-11-13 15:55:24,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:55:24,168 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 214 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:24,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 123 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:55:24,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-13 15:55:24,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2024-11-13 15:55:24,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 128 states have (on average 1.5546875) internal successors, (199), 177 states have internal predecessors, (199), 11 states have call successors, (11), 1 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:24,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 210 transitions. [2024-11-13 15:55:24,175 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 210 transitions. Word has length 20 [2024-11-13 15:55:24,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:24,175 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 210 transitions. [2024-11-13 15:55:24,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 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-13 15:55:24,175 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 210 transitions. [2024-11-13 15:55:24,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 15:55:24,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:24,176 INFO L215 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-13 15:55:24,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 15:55:24,176 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:24,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:24,177 INFO L85 PathProgramCache]: Analyzing trace with hash 751588890, now seen corresponding path program 1 times [2024-11-13 15:55:24,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:24,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979588203] [2024-11-13 15:55:24,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:24,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:24,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:24,400 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-13 15:55:24,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:24,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979588203] [2024-11-13 15:55:24,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979588203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:24,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:24,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:55:24,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179470963] [2024-11-13 15:55:24,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:24,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:55:24,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:24,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:55:24,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:55:24,402 INFO L87 Difference]: Start difference. First operand 179 states and 210 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 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-13 15:55:24,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:24,755 INFO L93 Difference]: Finished difference Result 224 states and 256 transitions. [2024-11-13 15:55:24,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:55:24,756 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 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-13 15:55:24,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:24,757 INFO L225 Difference]: With dead ends: 224 [2024-11-13 15:55:24,757 INFO L226 Difference]: Without dead ends: 224 [2024-11-13 15:55:24,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:55:24,758 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 250 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:24,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 205 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 15:55:24,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-13 15:55:24,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 203. [2024-11-13 15:55:24,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 152 states have (on average 1.5592105263157894) internal successors, (237), 201 states have internal predecessors, (237), 11 states have call successors, (11), 1 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:24,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 248 transitions. [2024-11-13 15:55:24,765 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 248 transitions. Word has length 20 [2024-11-13 15:55:24,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:24,765 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 248 transitions. [2024-11-13 15:55:24,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 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-13 15:55:24,765 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 248 transitions. [2024-11-13 15:55:24,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 15:55:24,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:24,766 INFO L215 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] [2024-11-13 15:55:24,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 15:55:24,766 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:24,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:24,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1487146500, now seen corresponding path program 1 times [2024-11-13 15:55:24,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:24,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318443709] [2024-11-13 15:55:24,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:24,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:24,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:24,813 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-13 15:55:24,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:24,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318443709] [2024-11-13 15:55:24,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318443709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:24,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:24,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:55:24,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329275903] [2024-11-13 15:55:24,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:24,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:55:24,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:24,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:55:24,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:55:24,817 INFO L87 Difference]: Start difference. First operand 203 states and 248 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:24,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:24,956 INFO L93 Difference]: Finished difference Result 225 states and 256 transitions. [2024-11-13 15:55:24,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:55:24,957 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-13 15:55:24,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:24,958 INFO L225 Difference]: With dead ends: 225 [2024-11-13 15:55:24,958 INFO L226 Difference]: Without dead ends: 225 [2024-11-13 15:55:24,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:55:24,959 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 211 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:24,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 286 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:55:24,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-13 15:55:24,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 202. [2024-11-13 15:55:24,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 152 states have (on average 1.5460526315789473) internal successors, (235), 200 states have internal predecessors, (235), 10 states have call successors, (10), 1 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:24,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 245 transitions. [2024-11-13 15:55:24,973 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 245 transitions. Word has length 24 [2024-11-13 15:55:24,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:24,973 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 245 transitions. [2024-11-13 15:55:24,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:24,973 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 245 transitions. [2024-11-13 15:55:24,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 15:55:24,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:24,974 INFO L215 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] [2024-11-13 15:55:24,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 15:55:24,976 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:24,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:24,977 INFO L85 PathProgramCache]: Analyzing trace with hash 920155640, now seen corresponding path program 1 times [2024-11-13 15:55:24,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:24,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427691173] [2024-11-13 15:55:24,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:24,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:24,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:25,088 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-13 15:55:25,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:25,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427691173] [2024-11-13 15:55:25,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427691173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:25,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:25,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:55:25,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649246057] [2024-11-13 15:55:25,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:25,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:55:25,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:25,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:55:25,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:55:25,091 INFO L87 Difference]: Start difference. First operand 202 states and 245 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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-13 15:55:25,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:25,295 INFO L93 Difference]: Finished difference Result 201 states and 243 transitions. [2024-11-13 15:55:25,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:55:25,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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 23 [2024-11-13 15:55:25,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:25,297 INFO L225 Difference]: With dead ends: 201 [2024-11-13 15:55:25,297 INFO L226 Difference]: Without dead ends: 201 [2024-11-13 15:55:25,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:55:25,298 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 4 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:25,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 477 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:55:25,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-13 15:55:25,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2024-11-13 15:55:25,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 152 states have (on average 1.5328947368421053) internal successors, (233), 199 states have internal predecessors, (233), 10 states have call successors, (10), 1 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:25,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 243 transitions. [2024-11-13 15:55:25,312 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 243 transitions. Word has length 23 [2024-11-13 15:55:25,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:25,312 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 243 transitions. [2024-11-13 15:55:25,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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-13 15:55:25,312 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 243 transitions. [2024-11-13 15:55:25,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 15:55:25,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:25,312 INFO L215 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] [2024-11-13 15:55:25,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 15:55:25,313 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:25,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:25,313 INFO L85 PathProgramCache]: Analyzing trace with hash 920155641, now seen corresponding path program 1 times [2024-11-13 15:55:25,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:25,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661107057] [2024-11-13 15:55:25,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:25,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:25,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:25,504 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-13 15:55:25,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:25,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661107057] [2024-11-13 15:55:25,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661107057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:25,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:25,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:55:25,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481668532] [2024-11-13 15:55:25,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:25,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:55:25,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:25,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:55:25,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:55:25,506 INFO L87 Difference]: Start difference. First operand 201 states and 243 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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-13 15:55:25,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:25,732 INFO L93 Difference]: Finished difference Result 200 states and 241 transitions. [2024-11-13 15:55:25,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:55:25,733 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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 23 [2024-11-13 15:55:25,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:25,734 INFO L225 Difference]: With dead ends: 200 [2024-11-13 15:55:25,734 INFO L226 Difference]: Without dead ends: 200 [2024-11-13 15:55:25,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:55:25,734 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 2 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:25,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 466 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:55:25,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-13 15:55:25,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2024-11-13 15:55:25,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 152 states have (on average 1.519736842105263) internal successors, (231), 198 states have internal predecessors, (231), 10 states have call successors, (10), 1 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:25,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 241 transitions. [2024-11-13 15:55:25,741 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 241 transitions. Word has length 23 [2024-11-13 15:55:25,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:25,741 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 241 transitions. [2024-11-13 15:55:25,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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-13 15:55:25,741 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 241 transitions. [2024-11-13 15:55:25,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 15:55:25,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:25,742 INFO L215 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] [2024-11-13 15:55:25,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 15:55:25,742 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:25,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:25,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1989891206, now seen corresponding path program 1 times [2024-11-13 15:55:25,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:25,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705963438] [2024-11-13 15:55:25,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:25,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:25,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:25,989 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-13 15:55:25,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:25,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705963438] [2024-11-13 15:55:25,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705963438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:25,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:25,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 15:55:25,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972402560] [2024-11-13 15:55:25,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:25,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 15:55:25,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:25,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 15:55:25,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-13 15:55:25,991 INFO L87 Difference]: Start difference. First operand 200 states and 241 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 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-13 15:55:26,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:26,535 INFO L93 Difference]: Finished difference Result 199 states and 240 transitions. [2024-11-13 15:55:26,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 15:55:26,535 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 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 27 [2024-11-13 15:55:26,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:26,536 INFO L225 Difference]: With dead ends: 199 [2024-11-13 15:55:26,536 INFO L226 Difference]: Without dead ends: 199 [2024-11-13 15:55:26,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-13 15:55:26,537 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 208 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:26,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 474 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 15:55:26,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-13 15:55:26,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2024-11-13 15:55:26,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 152 states have (on average 1.513157894736842) internal successors, (230), 197 states have internal predecessors, (230), 10 states have call successors, (10), 1 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:26,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 240 transitions. [2024-11-13 15:55:26,543 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 240 transitions. Word has length 27 [2024-11-13 15:55:26,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:26,544 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 240 transitions. [2024-11-13 15:55:26,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 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-13 15:55:26,544 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 240 transitions. [2024-11-13 15:55:26,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 15:55:26,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:26,545 INFO L215 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] [2024-11-13 15:55:26,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 15:55:26,545 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:26,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:26,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1989891205, now seen corresponding path program 1 times [2024-11-13 15:55:26,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:26,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264307111] [2024-11-13 15:55:26,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:26,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:26,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:26,953 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-13 15:55:26,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:26,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264307111] [2024-11-13 15:55:26,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264307111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:26,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:26,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 15:55:26,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001520740] [2024-11-13 15:55:26,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:26,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 15:55:26,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:26,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 15:55:26,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-13 15:55:26,955 INFO L87 Difference]: Start difference. First operand 199 states and 240 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 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-13 15:55:27,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:27,605 INFO L93 Difference]: Finished difference Result 190 states and 231 transitions. [2024-11-13 15:55:27,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 15:55:27,606 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 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 27 [2024-11-13 15:55:27,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:27,607 INFO L225 Difference]: With dead ends: 190 [2024-11-13 15:55:27,607 INFO L226 Difference]: Without dead ends: 190 [2024-11-13 15:55:27,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2024-11-13 15:55:27,608 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 235 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:27,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 489 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 15:55:27,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-13 15:55:27,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 181. [2024-11-13 15:55:27,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 144 states have (on average 1.4652777777777777) internal successors, (211), 179 states have internal predecessors, (211), 10 states have call successors, (10), 1 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:27,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 221 transitions. [2024-11-13 15:55:27,613 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 221 transitions. Word has length 27 [2024-11-13 15:55:27,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:27,614 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 221 transitions. [2024-11-13 15:55:27,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 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-13 15:55:27,614 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 221 transitions. [2024-11-13 15:55:27,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 15:55:27,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:27,615 INFO L215 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] [2024-11-13 15:55:27,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 15:55:27,615 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:27,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:27,616 INFO L85 PathProgramCache]: Analyzing trace with hash 846628965, now seen corresponding path program 1 times [2024-11-13 15:55:27,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:27,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238218568] [2024-11-13 15:55:27,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:27,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:27,653 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-13 15:55:27,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:27,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238218568] [2024-11-13 15:55:27,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238218568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:27,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:27,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:55:27,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470887130] [2024-11-13 15:55:27,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:27,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:55:27,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:27,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:55:27,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:55:27,655 INFO L87 Difference]: Start difference. First operand 181 states and 221 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:27,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:27,668 INFO L93 Difference]: Finished difference Result 193 states and 235 transitions. [2024-11-13 15:55:27,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:55:27,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-13 15:55:27,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:27,669 INFO L225 Difference]: With dead ends: 193 [2024-11-13 15:55:27,669 INFO L226 Difference]: Without dead ends: 193 [2024-11-13 15:55:27,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-13 15:55:27,670 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 7 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:27,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 305 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:55:27,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-13 15:55:27,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 187. [2024-11-13 15:55:27,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 150 states have (on average 1.46) internal successors, (219), 185 states have internal predecessors, (219), 10 states have call successors, (10), 1 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:27,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 229 transitions. [2024-11-13 15:55:27,676 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 229 transitions. Word has length 30 [2024-11-13 15:55:27,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:27,676 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 229 transitions. [2024-11-13 15:55:27,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:27,676 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 229 transitions. [2024-11-13 15:55:27,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 15:55:27,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:27,677 INFO L215 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] [2024-11-13 15:55:27,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 15:55:27,677 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:27,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:27,678 INFO L85 PathProgramCache]: Analyzing trace with hash 846147566, now seen corresponding path program 1 times [2024-11-13 15:55:27,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:27,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966914702] [2024-11-13 15:55:27,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:27,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:27,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:27,866 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-13 15:55:27,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:27,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966914702] [2024-11-13 15:55:27,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966914702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:27,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:27,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 15:55:27,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659865325] [2024-11-13 15:55:27,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:27,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 15:55:27,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:27,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 15:55:27,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:55:27,869 INFO L87 Difference]: Start difference. First operand 187 states and 229 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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-13 15:55:28,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:28,326 INFO L93 Difference]: Finished difference Result 283 states and 344 transitions. [2024-11-13 15:55:28,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 15:55:28,327 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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 30 [2024-11-13 15:55:28,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:28,328 INFO L225 Difference]: With dead ends: 283 [2024-11-13 15:55:28,328 INFO L226 Difference]: Without dead ends: 283 [2024-11-13 15:55:28,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-13 15:55:28,329 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 97 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:28,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 886 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 15:55:28,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-13 15:55:28,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 199. [2024-11-13 15:55:28,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 162 states have (on average 1.4320987654320987) internal successors, (232), 197 states have internal predecessors, (232), 10 states have call successors, (10), 1 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:28,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 242 transitions. [2024-11-13 15:55:28,336 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 242 transitions. Word has length 30 [2024-11-13 15:55:28,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:28,336 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 242 transitions. [2024-11-13 15:55:28,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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-13 15:55:28,336 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 242 transitions. [2024-11-13 15:55:28,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-13 15:55:28,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:28,337 INFO L215 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] [2024-11-13 15:55:28,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-13 15:55:28,337 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:28,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:28,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1476317628, now seen corresponding path program 1 times [2024-11-13 15:55:28,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:28,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442327058] [2024-11-13 15:55:28,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:28,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:28,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:28,450 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-13 15:55:28,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:28,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442327058] [2024-11-13 15:55:28,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442327058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:28,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:28,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:55:28,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380629201] [2024-11-13 15:55:28,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:28,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:55:28,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:28,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:55:28,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:55:28,452 INFO L87 Difference]: Start difference. First operand 199 states and 242 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:28,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:28,637 INFO L93 Difference]: Finished difference Result 201 states and 243 transitions. [2024-11-13 15:55:28,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:55:28,638 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-13 15:55:28,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:28,638 INFO L225 Difference]: With dead ends: 201 [2024-11-13 15:55:28,639 INFO L226 Difference]: Without dead ends: 201 [2024-11-13 15:55:28,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:55:28,639 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 192 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:28,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 234 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:55:28,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-13 15:55:28,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 197. [2024-11-13 15:55:28,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 162 states have (on average 1.4197530864197532) internal successors, (230), 195 states have internal predecessors, (230), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:28,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 238 transitions. [2024-11-13 15:55:28,645 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 238 transitions. Word has length 31 [2024-11-13 15:55:28,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:28,645 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 238 transitions. [2024-11-13 15:55:28,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:28,646 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 238 transitions. [2024-11-13 15:55:28,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-13 15:55:28,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:28,646 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-13 15:55:28,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-13 15:55:28,647 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:28,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:28,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1864724449, now seen corresponding path program 1 times [2024-11-13 15:55:28,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:28,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980780554] [2024-11-13 15:55:28,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:28,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:28,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:28,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:55:28,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:28,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980780554] [2024-11-13 15:55:28,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980780554] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:55:28,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886376323] [2024-11-13 15:55:28,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:28,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:55:28,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:55:28,904 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:55:28,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 15:55:29,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:29,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-13 15:55:29,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:55:29,099 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-13 15:55:29,107 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-13 15:55:29,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 19 treesize of output 18 [2024-11-13 15:55:29,151 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-13 15:55:29,232 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-13 15:55:29,242 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 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-13 15:55:29,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:55:29,623 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:55:30,300 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 10 treesize of output 8 [2024-11-13 15:55:30,306 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 14 treesize of output 12 [2024-11-13 15:55:30,316 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 10 treesize of output 8 [2024-11-13 15:55:30,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:55:30,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:55:30,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886376323] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:55:30,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:55:30,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 7] total 14 [2024-11-13 15:55:30,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516145091] [2024-11-13 15:55:30,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:55:30,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 15:55:30,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:30,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 15:55:30,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-13 15:55:30,359 INFO L87 Difference]: Start difference. First operand 197 states and 238 transitions. Second operand has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 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-13 15:55:31,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:31,104 INFO L93 Difference]: Finished difference Result 319 states and 373 transitions. [2024-11-13 15:55:31,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 15:55:31,105 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 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-13 15:55:31,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:31,106 INFO L225 Difference]: With dead ends: 319 [2024-11-13 15:55:31,106 INFO L226 Difference]: Without dead ends: 319 [2024-11-13 15:55:31,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2024-11-13 15:55:31,108 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 445 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:31,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 973 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 15:55:31,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-13 15:55:31,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 225. [2024-11-13 15:55:31,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 190 states have (on average 1.431578947368421) internal successors, (272), 223 states have internal predecessors, (272), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:31,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 280 transitions. [2024-11-13 15:55:31,115 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 280 transitions. Word has length 32 [2024-11-13 15:55:31,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:31,115 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 280 transitions. [2024-11-13 15:55:31,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 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-13 15:55:31,116 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 280 transitions. [2024-11-13 15:55:31,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 15:55:31,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:31,116 INFO L215 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, 1, 1, 1] [2024-11-13 15:55:31,137 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 15:55:31,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-13 15:55:31,317 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:31,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:31,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1911992456, now seen corresponding path program 1 times [2024-11-13 15:55:31,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:31,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939063640] [2024-11-13 15:55:31,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:31,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:31,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:31,682 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-13 15:55:31,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:31,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939063640] [2024-11-13 15:55:31,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939063640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:31,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:31,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 15:55:31,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954871012] [2024-11-13 15:55:31,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:31,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 15:55:31,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:31,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 15:55:31,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:55:31,684 INFO L87 Difference]: Start difference. First operand 225 states and 280 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 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-13 15:55:32,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:32,492 INFO L93 Difference]: Finished difference Result 286 states and 340 transitions. [2024-11-13 15:55:32,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 15:55:32,493 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 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 35 [2024-11-13 15:55:32,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:32,494 INFO L225 Difference]: With dead ends: 286 [2024-11-13 15:55:32,494 INFO L226 Difference]: Without dead ends: 286 [2024-11-13 15:55:32,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2024-11-13 15:55:32,496 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 352 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:32,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 854 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 15:55:32,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-11-13 15:55:32,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 226. [2024-11-13 15:55:32,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 193 states have (on average 1.4041450777202074) internal successors, (271), 224 states have internal predecessors, (271), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:32,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 279 transitions. [2024-11-13 15:55:32,503 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 279 transitions. Word has length 35 [2024-11-13 15:55:32,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:32,503 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 279 transitions. [2024-11-13 15:55:32,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 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-13 15:55:32,504 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 279 transitions. [2024-11-13 15:55:32,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 15:55:32,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:32,504 INFO L215 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, 1, 1, 1] [2024-11-13 15:55:32,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-13 15:55:32,504 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:32,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:32,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1911992457, now seen corresponding path program 1 times [2024-11-13 15:55:32,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:32,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009161105] [2024-11-13 15:55:32,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:32,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:33,188 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-13 15:55:33,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:33,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009161105] [2024-11-13 15:55:33,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009161105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:33,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:33,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 15:55:33,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959198699] [2024-11-13 15:55:33,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:33,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 15:55:33,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:33,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 15:55:33,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:55:33,191 INFO L87 Difference]: Start difference. First operand 226 states and 279 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 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-13 15:55:34,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:34,243 INFO L93 Difference]: Finished difference Result 283 states and 336 transitions. [2024-11-13 15:55:34,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 15:55:34,243 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 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 35 [2024-11-13 15:55:34,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:34,245 INFO L225 Difference]: With dead ends: 283 [2024-11-13 15:55:34,245 INFO L226 Difference]: Without dead ends: 283 [2024-11-13 15:55:34,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2024-11-13 15:55:34,246 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 276 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:34,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 908 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 15:55:34,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-13 15:55:34,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 225. [2024-11-13 15:55:34,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 193 states have (on average 1.383419689119171) internal successors, (267), 223 states have internal predecessors, (267), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:34,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 275 transitions. [2024-11-13 15:55:34,253 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 275 transitions. Word has length 35 [2024-11-13 15:55:34,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:34,253 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 275 transitions. [2024-11-13 15:55:34,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 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-13 15:55:34,253 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 275 transitions. [2024-11-13 15:55:34,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 15:55:34,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:34,254 INFO L215 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, 1, 1, 1, 1] [2024-11-13 15:55:34,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-13 15:55:34,254 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:34,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:34,255 INFO L85 PathProgramCache]: Analyzing trace with hash -857721257, now seen corresponding path program 1 times [2024-11-13 15:55:34,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:34,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456215342] [2024-11-13 15:55:34,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:34,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:34,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:34,301 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-13 15:55:34,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:34,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456215342] [2024-11-13 15:55:34,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456215342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:34,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:34,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:55:34,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605639741] [2024-11-13 15:55:34,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:34,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:55:34,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:34,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:55:34,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:55:34,304 INFO L87 Difference]: Start difference. First operand 225 states and 275 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:34,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:34,326 INFO L93 Difference]: Finished difference Result 224 states and 270 transitions. [2024-11-13 15:55:34,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:55:34,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-13 15:55:34,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:34,327 INFO L225 Difference]: With dead ends: 224 [2024-11-13 15:55:34,327 INFO L226 Difference]: Without dead ends: 224 [2024-11-13 15:55:34,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-13 15:55:34,328 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 11 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:34,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 271 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:55:34,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-13 15:55:34,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2024-11-13 15:55:34,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 193 states have (on average 1.3626943005181347) internal successors, (263), 222 states have internal predecessors, (263), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:34,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 270 transitions. [2024-11-13 15:55:34,334 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 270 transitions. Word has length 36 [2024-11-13 15:55:34,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:34,335 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 270 transitions. [2024-11-13 15:55:34,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:34,335 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 270 transitions. [2024-11-13 15:55:34,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 15:55:34,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:34,336 INFO L215 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, 1, 1, 1, 1, 1] [2024-11-13 15:55:34,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-13 15:55:34,336 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:34,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:34,336 INFO L85 PathProgramCache]: Analyzing trace with hash 617916849, now seen corresponding path program 1 times [2024-11-13 15:55:34,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:34,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107843913] [2024-11-13 15:55:34,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:34,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:34,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:34,601 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-13 15:55:34,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:34,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107843913] [2024-11-13 15:55:34,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107843913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:34,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:34,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:55:34,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998485017] [2024-11-13 15:55:34,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:34,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:55:34,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:34,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:55:34,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:55:34,604 INFO L87 Difference]: Start difference. First operand 224 states and 270 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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-13 15:55:34,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:34,803 INFO L93 Difference]: Finished difference Result 223 states and 269 transitions. [2024-11-13 15:55:34,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:55:34,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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 37 [2024-11-13 15:55:34,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:34,804 INFO L225 Difference]: With dead ends: 223 [2024-11-13 15:55:34,805 INFO L226 Difference]: Without dead ends: 223 [2024-11-13 15:55:34,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:55:34,805 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 2 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:34,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 419 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:55:34,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-13 15:55:34,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2024-11-13 15:55:34,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 193 states have (on average 1.3575129533678756) internal successors, (262), 221 states have internal predecessors, (262), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:34,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 269 transitions. [2024-11-13 15:55:34,811 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 269 transitions. Word has length 37 [2024-11-13 15:55:34,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:34,811 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 269 transitions. [2024-11-13 15:55:34,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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-13 15:55:34,812 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 269 transitions. [2024-11-13 15:55:34,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 15:55:34,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:34,812 INFO L215 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, 1, 1, 1, 1, 1] [2024-11-13 15:55:34,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-13 15:55:34,812 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:34,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:34,813 INFO L85 PathProgramCache]: Analyzing trace with hash 617916848, now seen corresponding path program 1 times [2024-11-13 15:55:34,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:34,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73396121] [2024-11-13 15:55:34,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:34,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:34,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:34,941 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-13 15:55:34,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:34,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73396121] [2024-11-13 15:55:34,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73396121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:34,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:34,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:55:34,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247719284] [2024-11-13 15:55:34,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:34,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:55:34,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:34,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:55:34,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:55:34,944 INFO L87 Difference]: Start difference. First operand 223 states and 269 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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-13 15:55:35,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:35,121 INFO L93 Difference]: Finished difference Result 222 states and 268 transitions. [2024-11-13 15:55:35,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:55:35,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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 37 [2024-11-13 15:55:35,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:35,123 INFO L225 Difference]: With dead ends: 222 [2024-11-13 15:55:35,123 INFO L226 Difference]: Without dead ends: 222 [2024-11-13 15:55:35,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:55:35,124 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:35,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 422 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:55:35,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-13 15:55:35,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2024-11-13 15:55:35,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 193 states have (on average 1.3523316062176165) internal successors, (261), 220 states have internal predecessors, (261), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:35,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 268 transitions. [2024-11-13 15:55:35,130 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 268 transitions. Word has length 37 [2024-11-13 15:55:35,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:35,130 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 268 transitions. [2024-11-13 15:55:35,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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-13 15:55:35,131 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 268 transitions. [2024-11-13 15:55:35,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 15:55:35,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:35,131 INFO L215 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:55:35,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-13 15:55:35,131 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:35,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:35,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1408221920, now seen corresponding path program 1 times [2024-11-13 15:55:35,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:35,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735898554] [2024-11-13 15:55:35,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:35,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:35,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:35,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:55:35,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:35,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735898554] [2024-11-13 15:55:35,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735898554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:35,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:35,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:55:35,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606342696] [2024-11-13 15:55:35,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:35,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:55:35,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:35,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:55:35,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:55:35,285 INFO L87 Difference]: Start difference. First operand 222 states and 268 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:35,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:35,566 INFO L93 Difference]: Finished difference Result 238 states and 286 transitions. [2024-11-13 15:55:35,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 15:55:35,566 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-13 15:55:35,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:35,567 INFO L225 Difference]: With dead ends: 238 [2024-11-13 15:55:35,567 INFO L226 Difference]: Without dead ends: 238 [2024-11-13 15:55:35,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-13 15:55:35,568 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 9 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:35,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 644 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:55:35,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-13 15:55:35,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 231. [2024-11-13 15:55:35,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 202 states have (on average 1.3366336633663367) internal successors, (270), 229 states have internal predecessors, (270), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:35,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 277 transitions. [2024-11-13 15:55:35,574 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 277 transitions. Word has length 39 [2024-11-13 15:55:35,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:35,574 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 277 transitions. [2024-11-13 15:55:35,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:35,575 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 277 transitions. [2024-11-13 15:55:35,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 15:55:35,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:35,575 INFO L215 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:55:35,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-13 15:55:35,576 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:35,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:35,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1058463036, now seen corresponding path program 1 times [2024-11-13 15:55:35,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:35,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365144242] [2024-11-13 15:55:35,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:35,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:35,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:36,324 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-13 15:55:36,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:36,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365144242] [2024-11-13 15:55:36,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365144242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:36,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:36,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 15:55:36,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826452964] [2024-11-13 15:55:36,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:36,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 15:55:36,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:36,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 15:55:36,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-13 15:55:36,326 INFO L87 Difference]: Start difference. First operand 231 states and 277 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:37,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:37,339 INFO L93 Difference]: Finished difference Result 304 states and 349 transitions. [2024-11-13 15:55:37,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 15:55:37,340 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-13 15:55:37,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:37,341 INFO L225 Difference]: With dead ends: 304 [2024-11-13 15:55:37,341 INFO L226 Difference]: Without dead ends: 304 [2024-11-13 15:55:37,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2024-11-13 15:55:37,342 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 375 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:37,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 1031 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 15:55:37,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-13 15:55:37,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 232. [2024-11-13 15:55:37,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 203 states have (on average 1.3349753694581281) internal successors, (271), 230 states have internal predecessors, (271), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:37,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 278 transitions. [2024-11-13 15:55:37,350 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 278 transitions. Word has length 39 [2024-11-13 15:55:37,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:37,350 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 278 transitions. [2024-11-13 15:55:37,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:37,350 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 278 transitions. [2024-11-13 15:55:37,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-13 15:55:37,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:37,351 INFO L215 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, 1, 1, 1, 1, 1, 1] [2024-11-13 15:55:37,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-13 15:55:37,351 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:37,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:37,352 INFO L85 PathProgramCache]: Analyzing trace with hash 311237446, now seen corresponding path program 1 times [2024-11-13 15:55:37,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:37,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513864609] [2024-11-13 15:55:37,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:37,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:37,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:37,778 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-13 15:55:37,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:37,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513864609] [2024-11-13 15:55:37,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513864609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:37,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:37,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 15:55:37,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121538742] [2024-11-13 15:55:37,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:37,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 15:55:37,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:37,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 15:55:37,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-13 15:55:37,780 INFO L87 Difference]: Start difference. First operand 232 states and 278 transitions. Second operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 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-13 15:55:38,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:38,636 INFO L93 Difference]: Finished difference Result 317 states and 372 transitions. [2024-11-13 15:55:38,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 15:55:38,637 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 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-13 15:55:38,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:38,638 INFO L225 Difference]: With dead ends: 317 [2024-11-13 15:55:38,638 INFO L226 Difference]: Without dead ends: 317 [2024-11-13 15:55:38,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2024-11-13 15:55:38,643 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 373 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:38,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 824 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 15:55:38,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-11-13 15:55:38,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 234. [2024-11-13 15:55:38,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 205 states have (on average 1.3317073170731708) internal successors, (273), 232 states have internal predecessors, (273), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:38,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 280 transitions. [2024-11-13 15:55:38,651 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 280 transitions. Word has length 38 [2024-11-13 15:55:38,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:38,652 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 280 transitions. [2024-11-13 15:55:38,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 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-13 15:55:38,652 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 280 transitions. [2024-11-13 15:55:38,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 15:55:38,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:38,653 INFO L215 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:55:38,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-13 15:55:38,653 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:38,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:38,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1342582207, now seen corresponding path program 1 times [2024-11-13 15:55:38,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:38,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586956239] [2024-11-13 15:55:38,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:38,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:38,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:55:38,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:38,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586956239] [2024-11-13 15:55:38,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586956239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:38,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:38,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:55:38,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662121041] [2024-11-13 15:55:38,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:38,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:55:38,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:38,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:55:38,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:55:38,708 INFO L87 Difference]: Start difference. First operand 234 states and 280 transitions. Second operand has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 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-13 15:55:38,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:38,775 INFO L93 Difference]: Finished difference Result 243 states and 284 transitions. [2024-11-13 15:55:38,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:55:38,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 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) Word has length 39 [2024-11-13 15:55:38,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:38,777 INFO L225 Difference]: With dead ends: 243 [2024-11-13 15:55:38,777 INFO L226 Difference]: Without dead ends: 243 [2024-11-13 15:55:38,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-13 15:55:38,778 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 90 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:38,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 152 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:55:38,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-13 15:55:38,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 235. [2024-11-13 15:55:38,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 206 states have (on average 1.3300970873786409) internal successors, (274), 233 states have internal predecessors, (274), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:38,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 281 transitions. [2024-11-13 15:55:38,788 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 281 transitions. Word has length 39 [2024-11-13 15:55:38,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:38,789 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 281 transitions. [2024-11-13 15:55:38,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 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-13 15:55:38,793 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 281 transitions. [2024-11-13 15:55:38,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-13 15:55:38,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:38,793 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:55:38,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-13 15:55:38,794 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:38,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:38,794 INFO L85 PathProgramCache]: Analyzing trace with hash -519266716, now seen corresponding path program 1 times [2024-11-13 15:55:38,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:38,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002581368] [2024-11-13 15:55:38,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:38,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:38,837 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-13 15:55:38,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:38,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002581368] [2024-11-13 15:55:38,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002581368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:38,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:38,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:55:38,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143138592] [2024-11-13 15:55:38,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:38,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:55:38,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:38,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:55:38,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:55:38,839 INFO L87 Difference]: Start difference. First operand 235 states and 281 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:38,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:38,851 INFO L93 Difference]: Finished difference Result 236 states and 282 transitions. [2024-11-13 15:55:38,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:55:38,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-13 15:55:38,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:38,853 INFO L225 Difference]: With dead ends: 236 [2024-11-13 15:55:38,853 INFO L226 Difference]: Without dead ends: 236 [2024-11-13 15:55:38,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-13 15:55:38,854 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:38,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 288 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:55:38,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-13 15:55:38,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2024-11-13 15:55:38,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 207 states have (on average 1.328502415458937) internal successors, (275), 234 states have internal predecessors, (275), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:38,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 282 transitions. [2024-11-13 15:55:38,860 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 282 transitions. Word has length 41 [2024-11-13 15:55:38,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:38,861 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 282 transitions. [2024-11-13 15:55:38,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:38,861 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 282 transitions. [2024-11-13 15:55:38,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 15:55:38,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:38,861 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:55:38,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-13 15:55:38,863 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:38,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:38,864 INFO L85 PathProgramCache]: Analyzing trace with hash 131134118, now seen corresponding path program 1 times [2024-11-13 15:55:38,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:38,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727022982] [2024-11-13 15:55:38,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:38,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:39,351 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-13 15:55:39,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:39,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727022982] [2024-11-13 15:55:39,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727022982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:39,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:39,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 15:55:39,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502293894] [2024-11-13 15:55:39,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:39,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 15:55:39,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:39,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 15:55:39,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-13 15:55:39,354 INFO L87 Difference]: Start difference. First operand 236 states and 282 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 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-13 15:55:40,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:40,065 INFO L93 Difference]: Finished difference Result 235 states and 281 transitions. [2024-11-13 15:55:40,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 15:55:40,065 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 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 40 [2024-11-13 15:55:40,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:40,066 INFO L225 Difference]: With dead ends: 235 [2024-11-13 15:55:40,066 INFO L226 Difference]: Without dead ends: 235 [2024-11-13 15:55:40,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2024-11-13 15:55:40,067 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 180 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:40,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 653 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 15:55:40,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-13 15:55:40,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2024-11-13 15:55:40,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 207 states have (on average 1.3236714975845412) internal successors, (274), 233 states have internal predecessors, (274), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:40,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 281 transitions. [2024-11-13 15:55:40,076 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 281 transitions. Word has length 40 [2024-11-13 15:55:40,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:40,076 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 281 transitions. [2024-11-13 15:55:40,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 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-13 15:55:40,076 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 281 transitions. [2024-11-13 15:55:40,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 15:55:40,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:40,077 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:55:40,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-13 15:55:40,077 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:40,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:40,077 INFO L85 PathProgramCache]: Analyzing trace with hash 131134119, now seen corresponding path program 1 times [2024-11-13 15:55:40,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:40,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564152589] [2024-11-13 15:55:40,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:40,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:40,424 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-13 15:55:40,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:40,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564152589] [2024-11-13 15:55:40,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564152589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:40,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:40,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:55:40,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494438812] [2024-11-13 15:55:40,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:40,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 15:55:40,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:40,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 15:55:40,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:55:40,426 INFO L87 Difference]: Start difference. First operand 235 states and 281 transitions. Second operand has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 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-13 15:55:40,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:40,863 INFO L93 Difference]: Finished difference Result 235 states and 281 transitions. [2024-11-13 15:55:40,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:55:40,864 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 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 40 [2024-11-13 15:55:40,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:40,865 INFO L225 Difference]: With dead ends: 235 [2024-11-13 15:55:40,865 INFO L226 Difference]: Without dead ends: 235 [2024-11-13 15:55:40,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-13 15:55:40,865 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 61 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:40,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 553 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 15:55:40,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-13 15:55:40,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 234. [2024-11-13 15:55:40,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 207 states have (on average 1.318840579710145) internal successors, (273), 232 states have internal predecessors, (273), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:40,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 280 transitions. [2024-11-13 15:55:40,872 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 280 transitions. Word has length 40 [2024-11-13 15:55:40,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:40,872 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 280 transitions. [2024-11-13 15:55:40,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 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-13 15:55:40,872 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 280 transitions. [2024-11-13 15:55:40,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 15:55:40,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:40,874 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:55:40,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-13 15:55:40,875 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:40,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:40,877 INFO L85 PathProgramCache]: Analyzing trace with hash -2066169753, now seen corresponding path program 1 times [2024-11-13 15:55:40,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:40,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359026483] [2024-11-13 15:55:40,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:40,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:41,602 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-13 15:55:41,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:41,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359026483] [2024-11-13 15:55:41,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359026483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:41,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:41,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 15:55:41,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620099675] [2024-11-13 15:55:41,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:41,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 15:55:41,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:41,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 15:55:41,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-13 15:55:41,604 INFO L87 Difference]: Start difference. First operand 234 states and 280 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:42,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:42,562 INFO L93 Difference]: Finished difference Result 294 states and 343 transitions. [2024-11-13 15:55:42,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 15:55:42,563 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-13 15:55:42,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:42,564 INFO L225 Difference]: With dead ends: 294 [2024-11-13 15:55:42,564 INFO L226 Difference]: Without dead ends: 294 [2024-11-13 15:55:42,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2024-11-13 15:55:42,564 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 370 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:42,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 847 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 15:55:42,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-13 15:55:42,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 235. [2024-11-13 15:55:42,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 208 states have (on average 1.3173076923076923) internal successors, (274), 233 states have internal predecessors, (274), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:42,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 281 transitions. [2024-11-13 15:55:42,572 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 281 transitions. Word has length 42 [2024-11-13 15:55:42,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:42,572 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 281 transitions. [2024-11-13 15:55:42,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:42,572 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 281 transitions. [2024-11-13 15:55:42,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 15:55:42,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:42,573 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:55:42,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-13 15:55:42,574 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:42,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:42,574 INFO L85 PathProgramCache]: Analyzing trace with hash -2130599491, now seen corresponding path program 1 times [2024-11-13 15:55:42,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:42,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405385715] [2024-11-13 15:55:42,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:42,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:42,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:55:42,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:42,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405385715] [2024-11-13 15:55:42,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405385715] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:55:42,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166430411] [2024-11-13 15:55:42,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:42,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:55:42,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:55:42,903 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:55:42,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 15:55:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:43,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-13 15:55:43,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:55:43,065 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-13 15:55:43,073 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-13 15:55:43,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 21 treesize of output 20 [2024-11-13 15:55:43,093 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 27 treesize of output 11 [2024-11-13 15:55:43,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:55:43,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2024-11-13 15:55:43,170 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 21 treesize of output 20 [2024-11-13 15:55:43,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:55:43,511 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:55:43,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:55:43,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166430411] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:55:43,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:55:43,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 6] total 9 [2024-11-13 15:55:43,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065376672] [2024-11-13 15:55:43,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:55:43,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 15:55:43,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:43,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 15:55:43,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-13 15:55:43,686 INFO L87 Difference]: Start difference. First operand 235 states and 281 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-13 15:55:44,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:44,139 INFO L93 Difference]: Finished difference Result 299 states and 348 transitions. [2024-11-13 15:55:44,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 15:55:44,139 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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 42 [2024-11-13 15:55:44,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:44,140 INFO L225 Difference]: With dead ends: 299 [2024-11-13 15:55:44,140 INFO L226 Difference]: Without dead ends: 299 [2024-11-13 15:55:44,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-11-13 15:55:44,141 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 103 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:44,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 683 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 15:55:44,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-13 15:55:44,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 257. [2024-11-13 15:55:44,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 230 states have (on average 1.3304347826086957) internal successors, (306), 255 states have internal predecessors, (306), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:44,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 313 transitions. [2024-11-13 15:55:44,148 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 313 transitions. Word has length 42 [2024-11-13 15:55:44,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:44,148 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 313 transitions. [2024-11-13 15:55:44,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-13 15:55:44,148 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 313 transitions. [2024-11-13 15:55:44,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-13 15:55:44,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:44,149 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:55:44,169 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 15:55:44,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-11-13 15:55:44,353 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:44,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:44,354 INFO L85 PathProgramCache]: Analyzing trace with hash 539930569, now seen corresponding path program 1 times [2024-11-13 15:55:44,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:44,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162473904] [2024-11-13 15:55:44,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:44,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:44,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:44,500 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-13 15:55:44,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:44,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162473904] [2024-11-13 15:55:44,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162473904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:44,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:44,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:55:44,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470179860] [2024-11-13 15:55:44,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:44,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:55:44,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:44,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:55:44,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:55:44,503 INFO L87 Difference]: Start difference. First operand 257 states and 313 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:44,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:44,721 INFO L93 Difference]: Finished difference Result 268 states and 325 transitions. [2024-11-13 15:55:44,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 15:55:44,722 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-13 15:55:44,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:44,722 INFO L225 Difference]: With dead ends: 268 [2024-11-13 15:55:44,722 INFO L226 Difference]: Without dead ends: 268 [2024-11-13 15:55:44,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-13 15:55:44,723 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 22 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:44,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 455 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:55:44,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-13 15:55:44,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 255. [2024-11-13 15:55:44,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 229 states have (on average 1.3275109170305677) internal successors, (304), 253 states have internal predecessors, (304), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:44,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 310 transitions. [2024-11-13 15:55:44,729 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 310 transitions. Word has length 43 [2024-11-13 15:55:44,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:44,729 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 310 transitions. [2024-11-13 15:55:44,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:44,730 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 310 transitions. [2024-11-13 15:55:44,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-13 15:55:44,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:44,732 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:55:44,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-13 15:55:44,733 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:44,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:44,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1624073493, now seen corresponding path program 1 times [2024-11-13 15:55:44,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:44,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437937990] [2024-11-13 15:55:44,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:44,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:44,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:44,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:55:44,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:44,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437937990] [2024-11-13 15:55:44,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437937990] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:55:44,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886085412] [2024-11-13 15:55:44,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:44,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:55:44,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:55:44,849 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:55:44,853 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 15:55:44,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:44,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 15:55:44,996 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:55:45,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 9 [2024-11-13 15:55:45,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:55:45,113 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:55:45,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:55:45,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886085412] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:55:45,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:55:45,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2024-11-13 15:55:45,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66576078] [2024-11-13 15:55:45,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:55:45,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:55:45,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:45,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:55:45,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:55:45,190 INFO L87 Difference]: Start difference. First operand 255 states and 310 transitions. Second operand has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 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-13 15:55:45,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:45,328 INFO L93 Difference]: Finished difference Result 286 states and 341 transitions. [2024-11-13 15:55:45,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:55:45,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 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 43 [2024-11-13 15:55:45,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:45,330 INFO L225 Difference]: With dead ends: 286 [2024-11-13 15:55:45,330 INFO L226 Difference]: Without dead ends: 262 [2024-11-13 15:55:45,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:55:45,331 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:45,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 305 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:55:45,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-13 15:55:45,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2024-11-13 15:55:45,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 236 states have (on average 1.3177966101694916) internal successors, (311), 260 states have internal predecessors, (311), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:45,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 317 transitions. [2024-11-13 15:55:45,336 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 317 transitions. Word has length 43 [2024-11-13 15:55:45,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:45,336 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 317 transitions. [2024-11-13 15:55:45,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 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-13 15:55:45,337 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 317 transitions. [2024-11-13 15:55:45,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-13 15:55:45,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:45,339 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:55:45,358 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 15:55:45,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-13 15:55:45,540 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:45,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:45,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1591293498, now seen corresponding path program 1 times [2024-11-13 15:55:45,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:45,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45570160] [2024-11-13 15:55:45,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:45,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:45,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:55:45,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:45,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45570160] [2024-11-13 15:55:45,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45570160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:45,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:45,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:55:45,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671353242] [2024-11-13 15:55:45,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:45,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:55:45,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:45,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:55:45,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:55:45,583 INFO L87 Difference]: Start difference. First operand 262 states and 317 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:45,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:45,659 INFO L93 Difference]: Finished difference Result 267 states and 319 transitions. [2024-11-13 15:55:45,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:55:45,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-11-13 15:55:45,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:45,660 INFO L225 Difference]: With dead ends: 267 [2024-11-13 15:55:45,660 INFO L226 Difference]: Without dead ends: 267 [2024-11-13 15:55:45,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-13 15:55:45,661 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 68 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:45,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 177 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:55:45,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-11-13 15:55:45,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 261. [2024-11-13 15:55:45,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 236 states have (on average 1.305084745762712) internal successors, (308), 259 states have internal predecessors, (308), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:45,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 313 transitions. [2024-11-13 15:55:45,667 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 313 transitions. Word has length 44 [2024-11-13 15:55:45,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:45,667 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 313 transitions. [2024-11-13 15:55:45,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:45,667 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 313 transitions. [2024-11-13 15:55:45,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-13 15:55:45,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:45,668 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:55:45,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-13 15:55:45,668 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:45,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:45,668 INFO L85 PathProgramCache]: Analyzing trace with hash -605520095, now seen corresponding path program 1 times [2024-11-13 15:55:45,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:45,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171496357] [2024-11-13 15:55:45,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:45,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:45,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:45,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:55:45,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:45,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171496357] [2024-11-13 15:55:45,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171496357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:45,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:45,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 15:55:45,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030059436] [2024-11-13 15:55:45,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:45,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 15:55:45,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:45,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 15:55:45,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-13 15:55:45,934 INFO L87 Difference]: Start difference. First operand 261 states and 313 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 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-13 15:55:46,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:46,428 INFO L93 Difference]: Finished difference Result 277 states and 321 transitions. [2024-11-13 15:55:46,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 15:55:46,428 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 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) Word has length 43 [2024-11-13 15:55:46,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:46,429 INFO L225 Difference]: With dead ends: 277 [2024-11-13 15:55:46,429 INFO L226 Difference]: Without dead ends: 277 [2024-11-13 15:55:46,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2024-11-13 15:55:46,430 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 344 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:46,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 481 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 15:55:46,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-13 15:55:46,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 261. [2024-11-13 15:55:46,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 236 states have (on average 1.3008474576271187) internal successors, (307), 259 states have internal predecessors, (307), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:46,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 312 transitions. [2024-11-13 15:55:46,436 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 312 transitions. Word has length 43 [2024-11-13 15:55:46,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:46,437 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 312 transitions. [2024-11-13 15:55:46,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 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-13 15:55:46,437 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 312 transitions. [2024-11-13 15:55:46,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-13 15:55:46,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:46,438 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:55:46,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-13 15:55:46,438 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:46,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:46,438 INFO L85 PathProgramCache]: Analyzing trace with hash -605520094, now seen corresponding path program 1 times [2024-11-13 15:55:46,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:46,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516503248] [2024-11-13 15:55:46,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:46,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:46,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:55:46,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:46,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516503248] [2024-11-13 15:55:46,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516503248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:46,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:46,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 15:55:46,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023709330] [2024-11-13 15:55:46,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:46,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 15:55:46,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:46,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 15:55:46,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-13 15:55:46,824 INFO L87 Difference]: Start difference. First operand 261 states and 312 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 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-13 15:55:47,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:47,329 INFO L93 Difference]: Finished difference Result 274 states and 318 transitions. [2024-11-13 15:55:47,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 15:55:47,329 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 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) Word has length 43 [2024-11-13 15:55:47,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:47,330 INFO L225 Difference]: With dead ends: 274 [2024-11-13 15:55:47,331 INFO L226 Difference]: Without dead ends: 274 [2024-11-13 15:55:47,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2024-11-13 15:55:47,331 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 281 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:47,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 468 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 15:55:47,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-13 15:55:47,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 261. [2024-11-13 15:55:47,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 236 states have (on average 1.2881355932203389) internal successors, (304), 259 states have internal predecessors, (304), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:47,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 309 transitions. [2024-11-13 15:55:47,337 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 309 transitions. Word has length 43 [2024-11-13 15:55:47,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:47,338 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 309 transitions. [2024-11-13 15:55:47,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 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-13 15:55:47,338 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 309 transitions. [2024-11-13 15:55:47,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-13 15:55:47,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:47,338 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:55:47,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-13 15:55:47,339 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:47,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:47,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1743276927, now seen corresponding path program 1 times [2024-11-13 15:55:47,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:47,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878485952] [2024-11-13 15:55:47,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:47,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:47,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:55:47,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:47,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878485952] [2024-11-13 15:55:47,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878485952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:47,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:47,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:55:47,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513867105] [2024-11-13 15:55:47,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:47,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:55:47,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:47,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:55:47,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:55:47,381 INFO L87 Difference]: Start difference. First operand 261 states and 309 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:47,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:47,394 INFO L93 Difference]: Finished difference Result 314 states and 377 transitions. [2024-11-13 15:55:47,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:55:47,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-13 15:55:47,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:47,396 INFO L225 Difference]: With dead ends: 314 [2024-11-13 15:55:47,396 INFO L226 Difference]: Without dead ends: 314 [2024-11-13 15:55:47,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-13 15:55:47,397 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 10 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:47,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 291 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:55:47,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-11-13 15:55:47,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 297. [2024-11-13 15:55:47,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 272 states have (on average 1.3161764705882353) internal successors, (358), 295 states have internal predecessors, (358), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:47,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 363 transitions. [2024-11-13 15:55:47,403 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 363 transitions. Word has length 47 [2024-11-13 15:55:47,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:47,403 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 363 transitions. [2024-11-13 15:55:47,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:47,404 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 363 transitions. [2024-11-13 15:55:47,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-13 15:55:47,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:47,404 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:55:47,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-13 15:55:47,405 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:47,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:47,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1475565674, now seen corresponding path program 1 times [2024-11-13 15:55:47,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:47,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514723066] [2024-11-13 15:55:47,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:47,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:47,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:55:47,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:47,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514723066] [2024-11-13 15:55:47,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514723066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:47,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:47,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 15:55:47,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129467525] [2024-11-13 15:55:47,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:47,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 15:55:47,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:47,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 15:55:47,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:55:47,729 INFO L87 Difference]: Start difference. First operand 297 states and 363 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:48,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:48,187 INFO L93 Difference]: Finished difference Result 315 states and 376 transitions. [2024-11-13 15:55:48,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 15:55:48,188 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-13 15:55:48,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:48,189 INFO L225 Difference]: With dead ends: 315 [2024-11-13 15:55:48,189 INFO L226 Difference]: Without dead ends: 315 [2024-11-13 15:55:48,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-13 15:55:48,191 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 136 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:48,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 451 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 15:55:48,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-11-13 15:55:48,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 297. [2024-11-13 15:55:48,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 272 states have (on average 1.3125) internal successors, (357), 295 states have internal predecessors, (357), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:48,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 362 transitions. [2024-11-13 15:55:48,198 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 362 transitions. Word has length 47 [2024-11-13 15:55:48,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:48,198 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 362 transitions. [2024-11-13 15:55:48,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:48,199 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 362 transitions. [2024-11-13 15:55:48,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-13 15:55:48,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:48,202 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:55:48,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-13 15:55:48,203 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:48,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:48,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1743698744, now seen corresponding path program 1 times [2024-11-13 15:55:48,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:48,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729423326] [2024-11-13 15:55:48,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:48,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:48,309 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:55:48,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:48,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729423326] [2024-11-13 15:55:48,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729423326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:48,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:48,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:55:48,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776804948] [2024-11-13 15:55:48,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:48,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:55:48,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:48,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:55:48,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:55:48,311 INFO L87 Difference]: Start difference. First operand 297 states and 362 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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-13 15:55:48,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:48,441 INFO L93 Difference]: Finished difference Result 247 states and 280 transitions. [2024-11-13 15:55:48,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:55:48,441 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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 47 [2024-11-13 15:55:48,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:48,442 INFO L225 Difference]: With dead ends: 247 [2024-11-13 15:55:48,442 INFO L226 Difference]: Without dead ends: 247 [2024-11-13 15:55:48,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:55:48,444 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 1 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:48,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 571 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:55:48,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-13 15:55:48,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2024-11-13 15:55:48,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 223 states have (on average 1.2376681614349776) internal successors, (276), 245 states have internal predecessors, (276), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:48,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 280 transitions. [2024-11-13 15:55:48,450 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 280 transitions. Word has length 47 [2024-11-13 15:55:48,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:48,451 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 280 transitions. [2024-11-13 15:55:48,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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-13 15:55:48,451 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 280 transitions. [2024-11-13 15:55:48,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-13 15:55:48,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:48,451 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:55:48,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-13 15:55:48,452 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:48,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:48,453 INFO L85 PathProgramCache]: Analyzing trace with hash -988585972, now seen corresponding path program 1 times [2024-11-13 15:55:48,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:48,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030611319] [2024-11-13 15:55:48,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:48,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:48,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 15:55:48,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:48,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030611319] [2024-11-13 15:55:48,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030611319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:48,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:48,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 15:55:48,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096479442] [2024-11-13 15:55:48,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:48,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 15:55:48,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:48,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 15:55:48,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:55:48,743 INFO L87 Difference]: Start difference. First operand 247 states and 280 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 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-13 15:55:49,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:49,193 INFO L93 Difference]: Finished difference Result 231 states and 261 transitions. [2024-11-13 15:55:49,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 15:55:49,193 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 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-13 15:55:49,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:49,194 INFO L225 Difference]: With dead ends: 231 [2024-11-13 15:55:49,194 INFO L226 Difference]: Without dead ends: 231 [2024-11-13 15:55:49,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2024-11-13 15:55:49,195 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 447 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:49,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 532 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 15:55:49,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-13 15:55:49,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 224. [2024-11-13 15:55:49,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 200 states have (on average 1.255) internal successors, (251), 222 states have internal predecessors, (251), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:49,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 255 transitions. [2024-11-13 15:55:49,199 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 255 transitions. Word has length 50 [2024-11-13 15:55:49,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:49,200 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 255 transitions. [2024-11-13 15:55:49,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 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-13 15:55:49,200 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 255 transitions. [2024-11-13 15:55:49,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-13 15:55:49,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:49,201 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:55:49,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-13 15:55:49,201 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:49,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:49,201 INFO L85 PathProgramCache]: Analyzing trace with hash 319112565, now seen corresponding path program 1 times [2024-11-13 15:55:49,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:49,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101862675] [2024-11-13 15:55:49,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:49,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:49,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:49,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:55:49,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:49,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101862675] [2024-11-13 15:55:49,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101862675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:49,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:49,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:55:49,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583721313] [2024-11-13 15:55:49,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:49,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:55:49,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:49,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:55:49,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:55:49,350 INFO L87 Difference]: Start difference. First operand 224 states and 255 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-13 15:55:49,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:49,501 INFO L93 Difference]: Finished difference Result 238 states and 270 transitions. [2024-11-13 15:55:49,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:55:49,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 52 [2024-11-13 15:55:49,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:49,503 INFO L225 Difference]: With dead ends: 238 [2024-11-13 15:55:49,503 INFO L226 Difference]: Without dead ends: 238 [2024-11-13 15:55:49,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:55:49,503 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 12 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:49,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 493 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:55:49,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-13 15:55:49,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 227. [2024-11-13 15:55:49,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 203 states have (on average 1.251231527093596) internal successors, (254), 225 states have internal predecessors, (254), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:55:49,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 258 transitions. [2024-11-13 15:55:49,508 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 258 transitions. Word has length 52 [2024-11-13 15:55:49,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:49,508 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 258 transitions. [2024-11-13 15:55:49,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-13 15:55:49,509 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 258 transitions. [2024-11-13 15:55:49,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-13 15:55:49,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:49,509 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:55:49,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-13 15:55:49,510 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 15:55:49,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:49,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1068815088, now seen corresponding path program 1 times [2024-11-13 15:55:49,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:49,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073194542] [2024-11-13 15:55:49,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:49,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:50,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:55:50,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:50,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073194542] [2024-11-13 15:55:50,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073194542] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:55:50,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129014115] [2024-11-13 15:55:50,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:50,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:55:50,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:55:50,538 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:55:50,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 15:55:50,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:50,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-13 15:55:50,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:55:50,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-13 15:55:50,798 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-13 15:55:50,804 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-13 15:55:50,982 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 15:55:50,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 15:55:51,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:55:51,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-13 15:55:51,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:55:51,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-13 15:55:51,173 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 15:55:51,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 43 [2024-11-13 15:55:51,183 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 24 treesize of output 11 [2024-11-13 15:55:51,381 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-13 15:55:51,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2024-11-13 15:55:51,407 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 15:55:51,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-13 15:55:51,585 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 15:55:51,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 43 [2024-11-13 15:55:51,593 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 24 treesize of output 11 [2024-11-13 15:55:51,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:55:51,886 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:55:52,183 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((v_ArrVal_1521 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1521) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1522 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1522) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)))) is different from false [2024-11-13 15:55:52,297 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((v_ArrVal_1521 (Array Int Int)) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1517) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1518) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1521) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1522 (Array Int Int)) (v_ArrVal_1518 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1518))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1522)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)))) is different from false [2024-11-13 15:55:52,327 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.base|))) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((|ULTIMATE.start_main_#t~malloc10#1.offset| Int) (v_ArrVal_1521 (Array Int Int)) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| |ULTIMATE.start_main_#t~malloc10#1.offset|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1517) (select (select (store .cse0 |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1518) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1521) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1522 (Array Int Int)) (v_ArrVal_1518 (Array Int Int))) (= (select (select (let ((.cse2 (store .cse0 |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1518))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1522)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)))) is different from false [2024-11-13 15:55:56,870 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:55:56,877 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:55:56,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 41 [2024-11-13 15:55:56,883 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:55:56,887 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:55:56,887 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 242 treesize of output 164 [2024-11-13 15:55:56,900 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:55:56,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 54 treesize of output 44 [2024-11-13 15:55:56,906 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 44 treesize of output 36 [2024-11-13 15:55:56,928 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:55:56,933 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-13 15:55:56,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 1 [2024-11-13 15:56:02,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:56:02,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129014115] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:56:02,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:56:02,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 15] total 38 [2024-11-13 15:56:02,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916527695] [2024-11-13 15:56:02,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:56:02,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-13 15:56:02,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:56:02,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-13 15:56:02,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=990, Unknown=37, NotChecked=204, Total=1406 [2024-11-13 15:56:02,655 INFO L87 Difference]: Start difference. First operand 227 states and 258 transitions. Second operand has 38 states, 38 states have (on average 3.8421052631578947) internal successors, (146), 38 states have internal predecessors, (146), 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-13 15:56:06,792 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 [0] [2024-11-13 15:56:11,028 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 [0] [2024-11-13 15:56:15,036 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 [0] [2024-11-13 15:56:28,107 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 [0, 1] [2024-11-13 15:56:36,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 [0, 1] [2024-11-13 15:56:40,295 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 [0, 1] [2024-11-13 15:56:44,453 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 [0, 1] [2024-11-13 15:56:48,472 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 [0, 1] [2024-11-13 15:56:52,528 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 [0, 1] [2024-11-13 15:56:56,672 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 [0, 1] [2024-11-13 15:57:00,965 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 [0, 1] [2024-11-13 15:57:04,969 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 [0, 1] [2024-11-13 15:57:08,996 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 [0, 1] [2024-11-13 15:57:13,030 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 [0, 1] [2024-11-13 15:57:17,211 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 [0, 1] [2024-11-13 15:57:21,215 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 [0, 1] [2024-11-13 15:57:25,473 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 [0, 1] [2024-11-13 15:57:29,557 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 [0, 1] [2024-11-13 15:57:33,597 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 [0, 1] [2024-11-13 15:57:41,845 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 [0, 1] [2024-11-13 15:57:45,852 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 [0, 1] [2024-11-13 15:57:49,892 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 [0, 1] [2024-11-13 15:58:06,404 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 [0, 1] [2024-11-13 15:58:14,601 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 [0, 1] [2024-11-13 15:58:15,278 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (forall ((v_ArrVal_1521 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1521) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1522 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1522) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)))) is different from false [2024-11-13 15:58:32,552 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 [0, 1] [2024-11-13 15:58:48,901 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 [0, 1] [2024-11-13 15:58:52,954 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 [0, 1] [2024-11-13 15:58:57,156 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 [0, 1] [2024-11-13 15:59:01,196 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 [0] [2024-11-13 15:59:05,264 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 [0, 1] [2024-11-13 15:59:09,338 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 [0, 1] [2024-11-13 15:59:13,609 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 [0, 1] [2024-11-13 15:59:18,001 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 [0, 1] [2024-11-13 15:59:22,005 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 [0, 1] [2024-11-13 15:59:26,059 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 [0, 1] [2024-11-13 15:59:30,064 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 [0, 1] [2024-11-13 15:59:34,292 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 [0, 1] [2024-11-13 15:59:38,296 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 [0, 1] [2024-11-13 15:59:58,910 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 [0, 1] [2024-11-13 16:00:03,104 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 [0, 1] [2024-11-13 16:00:07,119 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 [0, 1] [2024-11-13 16:00:23,447 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 [0, 1] [2024-11-13 16:00:27,453 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 [0, 1] [2024-11-13 16:00:31,540 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 [0, 1] [2024-11-13 16:00:36,793 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 [0] [2024-11-13 16:00:40,799 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 [0, 1] [2024-11-13 16:00:49,389 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 [0] [2024-11-13 16:00:53,421 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 [0, 1] [2024-11-13 16:00:57,643 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 [0] [2024-11-13 16:01:01,704 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 [0, 1] [2024-11-13 16:01:05,796 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 [0, 1] [2024-11-13 16:01:09,897 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 [0, 1] [2024-11-13 16:01:14,005 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 [0, 1] [2024-11-13 16:01:18,044 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 [0, 1] [2024-11-13 16:01:22,057 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 [0, 1] [2024-11-13 16:01:26,066 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 [0, 1] [2024-11-13 16:01:50,266 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 [0] [2024-11-13 16:01:54,296 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 [0, 1] [2024-11-13 16:01:58,299 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 [0, 1] [2024-11-13 16:02:02,305 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 [0, 1] [2024-11-13 16:02:06,310 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 [0, 1] [2024-11-13 16:02:10,315 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 [0, 1] [2024-11-13 16:02:14,344 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 [0, 1] [2024-11-13 16:02:18,370 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 [0, 1] [2024-11-13 16:02:22,382 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 [0, 1] [2024-11-13 16:02:26,388 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 [0, 1] [2024-11-13 16:02:30,410 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 [0, 1] [2024-11-13 16:02:34,416 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 [0, 1] [2024-11-13 16:02:38,423 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 [0, 1] [2024-11-13 16:02:42,435 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 [0, 1] [2024-11-13 16:02:58,611 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 [0, 1] [2024-11-13 16:03:02,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 [0, 1] [2024-11-13 16:03:06,619 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 [0, 1] [2024-11-13 16:03:30,914 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 [0, 1] [2024-11-13 16:03:34,962 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 [0, 1] [2024-11-13 16:03:59,571 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 [0] [2024-11-13 16:03:59,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:03:59,587 INFO L93 Difference]: Finished difference Result 857 states and 959 transitions. [2024-11-13 16:03:59,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-11-13 16:03:59,589 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.8421052631578947) internal successors, (146), 38 states have internal predecessors, (146), 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 54 [2024-11-13 16:03:59,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:03:59,591 INFO L225 Difference]: With dead ends: 857 [2024-11-13 16:03:59,591 INFO L226 Difference]: Without dead ends: 857 [2024-11-13 16:03:59,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 91 SyntacticMatches, 3 SemanticMatches, 94 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 2499 ImplicationChecksByTransitivity, 178.0s TimeCoverageRelationStatistics Valid=1332, Invalid=6895, Unknown=161, NotChecked=732, Total=9120 [2024-11-13 16:03:59,595 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 1875 mSDsluCounter, 2736 mSDsCounter, 0 mSdLazyCounter, 2602 mSolverCounterSat, 172 mSolverCounterUnsat, 210 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 309.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1875 SdHoareTripleChecker+Valid, 2885 SdHoareTripleChecker+Invalid, 5457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 2602 IncrementalHoareTripleChecker+Invalid, 210 IncrementalHoareTripleChecker+Unknown, 2473 IncrementalHoareTripleChecker+Unchecked, 309.6s IncrementalHoareTripleChecker+Time [2024-11-13 16:03:59,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1875 Valid, 2885 Invalid, 5457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 2602 Invalid, 210 Unknown, 2473 Unchecked, 309.6s Time] [2024-11-13 16:03:59,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2024-11-13 16:03:59,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 309. [2024-11-13 16:03:59,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 285 states have (on average 1.2035087719298245) internal successors, (343), 307 states have internal predecessors, (343), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:03:59,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 347 transitions. [2024-11-13 16:03:59,605 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 347 transitions. Word has length 54 [2024-11-13 16:03:59,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:03:59,606 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 347 transitions. [2024-11-13 16:03:59,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.8421052631578947) internal successors, (146), 38 states have internal predecessors, (146), 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-13 16:03:59,606 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 347 transitions. [2024-11-13 16:03:59,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-13 16:03:59,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:03:59,607 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:03:59,633 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-13 16:03:59,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2024-11-13 16:03:59,811 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 16:03:59,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:03:59,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1099848291, now seen corresponding path program 1 times [2024-11-13 16:03:59,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:03:59,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912235159] [2024-11-13 16:03:59,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:03:59,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:03:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:00,391 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-13 16:04:00,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:00,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912235159] [2024-11-13 16:04:00,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912235159] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:04:00,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779473112] [2024-11-13 16:04:00,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:00,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:04:00,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:04:00,394 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:04:00,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 16:04:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:00,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-13 16:04:00,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:04:00,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-13 16:04:00,803 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 16:04:00,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 16:04:00,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-13 16:04:00,977 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 16:04:00,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-11-13 16:04:01,087 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-13 16:04:01,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-13 16:04:01,222 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 16:04:01,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-13 16:04:01,452 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 25 treesize of output 13 [2024-11-13 16:04:01,463 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-13 16:04:01,463 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:04:01,975 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2024-11-13 16:04:01,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-11-13 16:04:02,424 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_80| Int) (v_ArrVal_1620 (Array Int Int)) (v_ArrVal_1618 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_80| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_80|) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1618))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (= (select (select (store .cse0 .cse1 v_ArrVal_1620) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_80|) .cse1))))) is different from false [2024-11-13 16:04:02,450 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:04:02,450 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 36 [2024-11-13 16:04:02,463 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:04:02,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 330 treesize of output 265 [2024-11-13 16:04:02,491 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:04:02,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 59 [2024-11-13 16:04:02,501 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 74 treesize of output 68 [2024-11-13 16:04:03,156 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-13 16:04:03,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779473112] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:04:03,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 16:04:03,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 33 [2024-11-13 16:04:03,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560812989] [2024-11-13 16:04:03,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 16:04:03,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-13 16:04:03,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:03,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-13 16:04:03,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=930, Unknown=26, NotChecked=62, Total=1122 [2024-11-13 16:04:03,159 INFO L87 Difference]: Start difference. First operand 309 states and 347 transitions. Second operand has 34 states, 33 states have (on average 4.848484848484849) internal successors, (160), 34 states have internal predecessors, (160), 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-13 16:04:05,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:04:05,264 INFO L93 Difference]: Finished difference Result 488 states and 534 transitions. [2024-11-13 16:04:05,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 16:04:05,264 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 4.848484848484849) internal successors, (160), 34 states have internal predecessors, (160), 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 56 [2024-11-13 16:04:05,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:04:05,265 INFO L225 Difference]: With dead ends: 488 [2024-11-13 16:04:05,265 INFO L226 Difference]: Without dead ends: 488 [2024-11-13 16:04:05,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=240, Invalid=1543, Unknown=27, NotChecked=82, Total=1892 [2024-11-13 16:04:05,266 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 843 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 1977 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 1644 SdHoareTripleChecker+Invalid, 2347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 313 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-13 16:04:05,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 1644 Invalid, 2347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1977 Invalid, 0 Unknown, 313 Unchecked, 1.7s Time] [2024-11-13 16:04:05,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2024-11-13 16:04:05,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 388. [2024-11-13 16:04:05,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 364 states have (on average 1.1923076923076923) internal successors, (434), 386 states have internal predecessors, (434), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:04:05,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 438 transitions. [2024-11-13 16:04:05,274 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 438 transitions. Word has length 56 [2024-11-13 16:04:05,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:04:05,274 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 438 transitions. [2024-11-13 16:04:05,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 4.848484848484849) internal successors, (160), 34 states have internal predecessors, (160), 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-13 16:04:05,274 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 438 transitions. [2024-11-13 16:04:05,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-13 16:04:05,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:04:05,275 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:04:05,300 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 16:04:05,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2024-11-13 16:04:05,476 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 16:04:05,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:05,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1099848292, now seen corresponding path program 1 times [2024-11-13 16:04:05,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:05,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616891373] [2024-11-13 16:04:05,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:05,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:06,149 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-13 16:04:06,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:06,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616891373] [2024-11-13 16:04:06,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616891373] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:04:06,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991840153] [2024-11-13 16:04:06,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:06,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:04:06,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:04:06,153 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:04:06,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 16:04:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:06,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-13 16:04:06,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:04:06,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-13 16:04:06,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-11-13 16:04:06,512 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 16:04:06,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 16:04:06,550 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-13 16:04:06,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-13 16:04:06,679 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 16:04:06,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-13 16:04:06,685 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 24 treesize of output 11 [2024-11-13 16:04:06,813 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 16:04:06,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-13 16:04:06,835 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-13 16:04:06,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-13 16:04:06,992 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 16:04:06,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-13 16:04:06,999 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 24 treesize of output 11 [2024-11-13 16:04:07,264 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 25 treesize of output 13 [2024-11-13 16:04:07,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-11-13 16:04:07,338 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-13 16:04:07,338 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:04:08,135 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1723 (Array Int Int)) (v_ArrVal_1722 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_87| Int)) (or (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1723) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_87|) 11) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1722) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_87|))) (< |v_ULTIMATE.start_main_~end~0#1.offset_87| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_87|))) (forall ((v_ArrVal_1723 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_87| Int)) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_87| 0) (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1723) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_87|) 9)) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_87|)))) is different from false [2024-11-13 16:04:08,383 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1723 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_87| Int) (v_ArrVal_1719 (Array Int Int)) (v_ArrVal_1718 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_87| 0) (< 0 (+ 9 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1718) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1719) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1723) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_87|))) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_87|))) (forall ((v_ArrVal_1723 (Array Int Int)) (v_ArrVal_1722 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_87| Int) (v_ArrVal_1719 (Array Int Int)) (v_ArrVal_1718 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_87| 0) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1719))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (< (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1718) .cse0 v_ArrVal_1723) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_87|) 11) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_1722) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_87|))))) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_87|)))) is different from false [2024-11-13 16:04:08,416 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (forall ((v_ArrVal_1723 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_87| Int) (v_ArrVal_1719 (Array Int Int)) (v_ArrVal_1718 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_87| 0) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1718) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1719) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1723) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_87|) 9)) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_87|))) (forall ((v_ArrVal_1723 (Array Int Int)) (v_ArrVal_1722 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_87| Int) (v_ArrVal_1719 (Array Int Int)) (v_ArrVal_1718 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_87| 0) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1719))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (< (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1718) .cse1 v_ArrVal_1723) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_87|) 11) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1722) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_87|))))) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_87|))))) is different from false [2024-11-13 16:04:08,459 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:04:08,459 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2024-11-13 16:04:08,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:04:08,468 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2024-11-13 16:04:08,486 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:04:08,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 334 treesize of output 301 [2024-11-13 16:04:08,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:04:08,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 474 treesize of output 457 [2024-11-13 16:04:08,536 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 180 treesize of output 172 [2024-11-13 16:04:08,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:04:08,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 162 [2024-11-13 16:04:08,563 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 154 treesize of output 146 [2024-11-13 16:04:08,575 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 74 treesize of output 70 [2024-11-13 16:04:08,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:04:08,963 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2024-11-13 16:04:08,972 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:04:08,972 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2024-11-13 16:04:08,975 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 16:04:08,978 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 28 treesize of output 20 [2024-11-13 16:04:08,982 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 16:04:08,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:04:08,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:04:08,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-13 16:04:09,399 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-13 16:04:09,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991840153] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:04:09,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 16:04:09,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 35 [2024-11-13 16:04:09,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486394800] [2024-11-13 16:04:09,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 16:04:09,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-13 16:04:09,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:09,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-13 16:04:09,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=946, Unknown=9, NotChecked=192, Total=1260 [2024-11-13 16:04:09,401 INFO L87 Difference]: Start difference. First operand 388 states and 438 transitions. Second operand has 36 states, 35 states have (on average 4.742857142857143) internal successors, (166), 36 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-13 16:04:12,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:04:12,062 INFO L93 Difference]: Finished difference Result 511 states and 560 transitions. [2024-11-13 16:04:12,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 16:04:12,062 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 4.742857142857143) internal successors, (166), 36 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 56 [2024-11-13 16:04:12,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:04:12,064 INFO L225 Difference]: With dead ends: 511 [2024-11-13 16:04:12,064 INFO L226 Difference]: Without dead ends: 511 [2024-11-13 16:04:12,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=335, Invalid=2020, Unknown=9, NotChecked=288, Total=2652 [2024-11-13 16:04:12,065 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 1150 mSDsluCounter, 1502 mSDsCounter, 0 mSdLazyCounter, 2009 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1150 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 3114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1043 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-13 16:04:12,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1150 Valid, 1632 Invalid, 3114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 2009 Invalid, 0 Unknown, 1043 Unchecked, 1.9s Time] [2024-11-13 16:04:12,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2024-11-13 16:04:12,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 387. [2024-11-13 16:04:12,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 363 states have (on average 1.1900826446280992) internal successors, (432), 385 states have internal predecessors, (432), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:04:12,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 436 transitions. [2024-11-13 16:04:12,072 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 436 transitions. Word has length 56 [2024-11-13 16:04:12,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:04:12,072 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 436 transitions. [2024-11-13 16:04:12,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 4.742857142857143) internal successors, (166), 36 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-13 16:04:12,073 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 436 transitions. [2024-11-13 16:04:12,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-13 16:04:12,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:04:12,074 INFO L215 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, 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-13 16:04:12,095 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 16:04:12,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2024-11-13 16:04:12,275 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 16:04:12,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:12,275 INFO L85 PathProgramCache]: Analyzing trace with hash 344399896, now seen corresponding path program 1 times [2024-11-13 16:04:12,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:12,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112334508] [2024-11-13 16:04:12,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:12,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:13,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:04:13,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:13,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112334508] [2024-11-13 16:04:13,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112334508] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:04:13,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183622750] [2024-11-13 16:04:13,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:13,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:04:13,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:04:13,087 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:04:13,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 16:04:13,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:13,265 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-13 16:04:13,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:04:13,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-13 16:04:13,302 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 16:04:13,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 16:04:13,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-13 16:04:13,325 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-13 16:04:13,382 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 16:04:13,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-13 16:04:13,387 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 24 treesize of output 11 [2024-11-13 16:04:13,456 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-13 16:04:13,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 33 [2024-11-13 16:04:13,468 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 27 treesize of output 22 [2024-11-13 16:04:14,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:04:14,678 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:04:24,737 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:04:24,738 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 903 treesize of output 743 [2024-11-13 16:04:24,751 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:04:24,751 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 733 treesize of output 463 [2024-11-13 16:04:25,603 INFO L349 Elim1Store]: treesize reduction 770, result has 12.6 percent of original size [2024-11-13 16:04:25,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 17 new quantified variables, introduced 55 case distinctions, treesize of input 25268 treesize of output 22698 [2024-11-13 16:04:25,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:04:26,521 INFO L349 Elim1Store]: treesize reduction 358, result has 27.1 percent of original size [2024-11-13 16:04:26,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 28 case distinctions, treesize of input 56846 treesize of output 50208 [2024-11-13 16:04:27,253 INFO L224 Elim1Store]: Index analysis took 136 ms [2024-11-13 16:04:28,354 INFO L349 Elim1Store]: treesize reduction 819, result has 27.8 percent of original size [2024-11-13 16:04:28,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 4503 treesize of output 4016 [2024-11-13 16:04:29,176 INFO L349 Elim1Store]: treesize reduction 68, result has 55.6 percent of original size [2024-11-13 16:04:29,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 4391 treesize of output 3603 [2024-11-13 16:04:36,772 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 6 treesize of output 4 [2024-11-13 16:04:36,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 6 treesize of output 4 [2024-11-13 16:04:36,896 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 6 treesize of output 4 [2024-11-13 16:04:38,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:04:38,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 103 [2024-11-13 16:04:38,443 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 127 treesize of output 115 [2024-11-13 16:04:38,494 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 16:04:38,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 64 [2024-11-13 16:04:38,534 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-13 16:04:38,534 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 903 treesize of output 1 [2024-11-13 16:04:38,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:04:38,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183622750] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 16:04:38,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:04:38,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [15, 16] total 37 [2024-11-13 16:04:38,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436663038] [2024-11-13 16:04:38,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:38,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 16:04:38,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:38,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 16:04:38,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=1033, Unknown=2, NotChecked=0, Total=1332 [2024-11-13 16:04:38,746 INFO L87 Difference]: Start difference. First operand 387 states and 436 transitions. Second operand has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:04:43,813 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-13 16:04:48,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-13 16:04:50,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 16:04:54,494 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-13 16:04:58,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 16:05:02,554 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-13 16:05:05,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 16:05:10,127 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-13 16:05:19,690 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-13 16:05:28,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 16:05:32,749 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-13 16:05:36,764 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-13 16:05:40,844 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-13 16:05:57,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:05:57,073 INFO L93 Difference]: Finished difference Result 727 states and 825 transitions. [2024-11-13 16:05:57,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-11-13 16:05:57,074 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-13 16:05:57,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:05:57,085 INFO L225 Difference]: With dead ends: 727 [2024-11-13 16:05:57,085 INFO L226 Difference]: Without dead ends: 727 [2024-11-13 16:05:57,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 95 SyntacticMatches, 3 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1993 ImplicationChecksByTransitivity, 24.7s TimeCoverageRelationStatistics Valid=1207, Invalid=4191, Unknown=4, NotChecked=0, Total=5402 [2024-11-13 16:05:57,089 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 623 mSDsluCounter, 1681 mSDsCounter, 0 mSdLazyCounter, 1961 mSolverCounterSat, 37 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 62.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 1869 SdHoareTripleChecker+Invalid, 2009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1961 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 63.3s IncrementalHoareTripleChecker+Time [2024-11-13 16:05:57,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 1869 Invalid, 2009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1961 Invalid, 11 Unknown, 0 Unchecked, 63.3s Time] [2024-11-13 16:05:57,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2024-11-13 16:05:57,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 442. [2024-11-13 16:05:57,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 418 states have (on average 1.2129186602870814) internal successors, (507), 440 states have internal predecessors, (507), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:05:57,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 511 transitions. [2024-11-13 16:05:57,151 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 511 transitions. Word has length 59 [2024-11-13 16:05:57,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:05:57,151 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 511 transitions. [2024-11-13 16:05:57,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:05:57,152 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 511 transitions. [2024-11-13 16:05:57,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-13 16:05:57,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:05:57,155 INFO L215 NwaCegarLoop]: trace histogram [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, 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-13 16:05:57,184 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 16:05:57,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2024-11-13 16:05:57,356 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 16:05:57,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:05:57,361 INFO L85 PathProgramCache]: Analyzing trace with hash -976575094, now seen corresponding path program 1 times [2024-11-13 16:05:57,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:05:57,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983177587] [2024-11-13 16:05:57,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:05:57,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:05:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:00,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:06:00,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:06:00,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983177587] [2024-11-13 16:06:00,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983177587] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:06:00,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252470054] [2024-11-13 16:06:00,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:06:00,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:06:00,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:06:00,488 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:06:00,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 16:06:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:00,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-13 16:06:00,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:06:00,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-13 16:06:00,886 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 16:06:00,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 16:06:00,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-13 16:06:01,180 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 16:06:01,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-13 16:06:01,351 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 16:06:01,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-13 16:06:01,697 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2024-11-13 16:06:01,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2024-11-13 16:06:01,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:06:01,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2024-11-13 16:06:02,273 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 16:06:02,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 47 [2024-11-13 16:06:02,830 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-13 16:06:02,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 38 [2024-11-13 16:06:03,344 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 16:06:03,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 54 [2024-11-13 16:06:04,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:06:04,251 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 0 case distinctions, treesize of input 54 treesize of output 26 [2024-11-13 16:06:04,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:06:04,664 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:06:05,738 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc10#1.base_23| Int) (v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1931 (Array Int Int)) (v_ArrVal_1928 Int)) (let ((.cse2 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| |v_ULTIMATE.start_main_#t~malloc10#1.base_23|)) |v_ULTIMATE.start_main_#t~malloc10#1.base_23| v_ArrVal_1931))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_23| v_ArrVal_1928)) (.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (not (= (select .cse0 .cse1) 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_23|) 0)) (= (select .cse0 (select (select (store .cse2 .cse1 v_ArrVal_1933) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) 1))))) is different from false [2024-11-13 16:06:05,814 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc10#1.base_23| Int) (v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1931 (Array Int Int)) (v_ArrVal_1928 Int) (|v_ULTIMATE.start_main_~end~0#1.offset_100| Int)) (let ((.cse2 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_100| |v_ULTIMATE.start_main_#t~malloc10#1.base_23|)) |v_ULTIMATE.start_main_#t~malloc10#1.base_23| v_ArrVal_1931))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_23| v_ArrVal_1928)) (.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_100|))) (or (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_100|) (not (= (select .cse0 .cse1) 1)) (= (select .cse0 (select (select (store .cse2 .cse1 v_ArrVal_1933) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_23|) 0)))))) is different from false [2024-11-13 16:06:06,083 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc10#1.base_23| Int) (v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1931 (Array Int Int)) (v_ArrVal_1928 Int) (v_ArrVal_1927 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_100| Int)) (let ((.cse2 (store (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1927))) (store .cse3 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_100| |v_ULTIMATE.start_main_#t~malloc10#1.base_23|))) |v_ULTIMATE.start_main_#t~malloc10#1.base_23| v_ArrVal_1931))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_23| v_ArrVal_1928)) (.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_100|))) (or (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_100|) (not (= (select .cse0 .cse1) 1)) (= (select .cse0 (select (select (store .cse2 .cse1 v_ArrVal_1933) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_23|) 0)))))) is different from false [2024-11-13 16:06:06,868 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 16:06:06,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:06:06,877 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 68 [2024-11-13 16:06:06,889 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 348 treesize of output 330 [2024-11-13 16:06:06,900 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 16:06:06,904 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 262 treesize of output 238 [2024-11-13 16:06:06,913 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 16:06:06,917 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 226 treesize of output 210 [2024-11-13 16:06:06,926 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 16:06:06,929 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 213 treesize of output 185 [2024-11-13 16:06:07,137 INFO L349 Elim1Store]: treesize reduction 57, result has 59.6 percent of original size [2024-11-13 16:06:07,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 145 treesize of output 208 [2024-11-13 16:06:07,153 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 49 treesize of output 33 [2024-11-13 16:06:07,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-13 16:06:07,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252470054] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:06:07,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 16:06:07,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 20] total 48 [2024-11-13 16:06:07,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092819415] [2024-11-13 16:06:07,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 16:06:07,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-13 16:06:07,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:06:07,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-13 16:06:07,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=1796, Unknown=16, NotChecked=270, Total=2352 [2024-11-13 16:06:07,403 INFO L87 Difference]: Start difference. First operand 442 states and 511 transitions. Second operand has 49 states, 48 states have (on average 3.125) internal successors, (150), 49 states have internal predecessors, (150), 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-13 16:06:21,620 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-13 16:06:25,659 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-13 16:06:29,696 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-13 16:06:33,861 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-13 16:06:38,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 16:06:42,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 16:06:46,661 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-13 16:06:50,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 16:06:54,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 16:06:58,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 16:07:00,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:07:00,633 INFO L93 Difference]: Finished difference Result 721 states and 837 transitions. [2024-11-13 16:07:00,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-13 16:07:00,634 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 3.125) internal successors, (150), 49 states have internal predecessors, (150), 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 59 [2024-11-13 16:07:00,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:07:00,638 INFO L225 Difference]: With dead ends: 721 [2024-11-13 16:07:00,638 INFO L226 Difference]: Without dead ends: 721 [2024-11-13 16:07:00,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1384 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=718, Invalid=4527, Unknown=23, NotChecked=432, Total=5700 [2024-11-13 16:07:00,644 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 767 mSDsluCounter, 2623 mSDsCounter, 0 mSdLazyCounter, 2954 mSolverCounterSat, 60 mSolverCounterUnsat, 26 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 2760 SdHoareTripleChecker+Invalid, 4401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2954 IncrementalHoareTripleChecker+Invalid, 26 IncrementalHoareTripleChecker+Unknown, 1361 IncrementalHoareTripleChecker+Unchecked, 46.2s IncrementalHoareTripleChecker+Time [2024-11-13 16:07:00,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 2760 Invalid, 4401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2954 Invalid, 26 Unknown, 1361 Unchecked, 46.2s Time] [2024-11-13 16:07:00,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2024-11-13 16:07:00,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 477. [2024-11-13 16:07:00,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 453 states have (on average 1.2030905077262692) internal successors, (545), 475 states have internal predecessors, (545), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:07:00,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 549 transitions. [2024-11-13 16:07:00,668 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 549 transitions. Word has length 59 [2024-11-13 16:07:00,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:07:00,668 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 549 transitions. [2024-11-13 16:07:00,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 3.125) internal successors, (150), 49 states have internal predecessors, (150), 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-13 16:07:00,673 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 549 transitions. [2024-11-13 16:07:00,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-13 16:07:00,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:07:00,675 INFO L215 NwaCegarLoop]: trace histogram [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, 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-13 16:07:00,701 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 16:07:00,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2024-11-13 16:07:00,876 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 16:07:00,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:07:00,877 INFO L85 PathProgramCache]: Analyzing trace with hash -976575093, now seen corresponding path program 1 times [2024-11-13 16:07:00,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:07:00,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336361952] [2024-11-13 16:07:00,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:07:00,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:07:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:07:03,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:07:03,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:07:03,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336361952] [2024-11-13 16:07:03,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336361952] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:07:03,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907110552] [2024-11-13 16:07:03,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:07:03,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:07:03,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:07:03,064 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:07:03,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 16:07:03,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:07:03,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-11-13 16:07:03,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:07:03,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-13 16:07:03,429 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 16:07:03,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 16:07:03,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 16:07:03,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-13 16:07:03,559 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-13 16:07:03,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:07:03,822 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2024-11-13 16:07:03,839 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 31 treesize of output 16 [2024-11-13 16:07:04,205 INFO L349 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2024-11-13 16:07:04,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 57 [2024-11-13 16:07:04,220 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 40 treesize of output 23 [2024-11-13 16:07:04,231 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 5 treesize of output 3 [2024-11-13 16:07:04,711 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-13 16:07:04,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 18 treesize of output 21 [2024-11-13 16:07:04,759 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-13 16:07:04,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-13 16:07:04,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:07:04,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2024-11-13 16:07:04,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:07:04,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2024-11-13 16:07:05,186 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 16:07:05,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 59 [2024-11-13 16:07:05,207 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 33 treesize of output 18 [2024-11-13 16:07:05,686 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 16:07:05,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 22 [2024-11-13 16:07:05,736 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-13 16:07:05,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 38 [2024-11-13 16:07:06,088 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 16:07:06,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 59 [2024-11-13 16:07:06,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2024-11-13 16:07:06,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:07:06,760 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 0 case distinctions, treesize of input 45 treesize of output 21 [2024-11-13 16:07:06,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 24 treesize of output 12 [2024-11-13 16:07:06,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:07:06,925 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:07:07,275 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((v_ArrVal_2072 (Array Int Int)) (v_ArrVal_2073 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2072) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)))) (forall ((v_ArrVal_2073 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)))))) is different from false [2024-11-13 16:07:07,352 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((v_ArrVal_2072 (Array Int Int)) (v_ArrVal_2073 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_2073) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_2072) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)))) (forall ((v_ArrVal_2073 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_2073) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 8))))) is different from false [2024-11-13 16:07:07,372 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((v_ArrVal_2073 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2073) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))) (forall ((v_ArrVal_2072 (Array Int Int)) (v_ArrVal_2073 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2073) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2072) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))) is different from false [2024-11-13 16:07:07,686 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((v_ArrVal_2072 (Array Int Int)) (v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2068 (Array Int Int)) (v_ArrVal_2073 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2069))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2068) .cse1 v_ArrVal_2073) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2072) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2068 (Array Int Int)) (v_ArrVal_2073 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2068) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2069) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_2073) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 8))))) is different from false [2024-11-13 16:07:18,942 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:07:18,942 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 2996 treesize of output 2957 [2024-11-13 16:07:19,064 INFO L349 Elim1Store]: treesize reduction 19, result has 68.3 percent of original size [2024-11-13 16:07:19,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 2051 treesize of output 1954 [2024-11-13 16:07:19,132 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 1147 treesize of output 1125 [2024-11-13 16:07:19,221 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-13 16:07:19,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 889 treesize of output 869 [2024-11-13 16:07:19,259 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 824 treesize of output 816 [2024-11-13 16:07:19,351 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:07:19,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 847 treesize of output 849 [2024-11-13 16:07:19,379 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 849 treesize of output 837 [2024-11-13 16:07:19,402 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 822 treesize of output 810 [2024-11-13 16:07:19,433 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 766 treesize of output 758 [2024-11-13 16:07:19,468 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 772 treesize of output 744 [2024-11-13 16:07:19,763 INFO L349 Elim1Store]: treesize reduction 4, result has 95.1 percent of original size [2024-11-13 16:07:19,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 704 treesize of output 766 [2024-11-13 16:07:19,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:07:19,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 651 treesize of output 638 [2024-11-13 16:07:19,898 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 627 treesize of output 619 [2024-11-13 16:07:19,952 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 619 treesize of output 611 [2024-11-13 16:07:19,989 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 611 treesize of output 603 [2024-11-13 16:07:20,033 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 651 treesize of output 639 [2024-11-13 16:07:20,082 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 598 treesize of output 590 [2024-11-13 16:07:20,109 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 571 treesize of output 567 [2024-11-13 16:07:20,136 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 567 treesize of output 559 [2024-11-13 16:07:20,164 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 559 treesize of output 551 [2024-11-13 16:07:20,763 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 6 treesize of output 4 [2024-11-13 16:07:20,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:07:20,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2024-11-13 16:07:21,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:07:21,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907110552] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:07:21,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 16:07:21,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 19] total 53 [2024-11-13 16:07:21,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341088353] [2024-11-13 16:07:21,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 16:07:21,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-13 16:07:21,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:07:21,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-13 16:07:21,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=2153, Unknown=58, NotChecked=396, Total=2862 [2024-11-13 16:07:21,146 INFO L87 Difference]: Start difference. First operand 477 states and 549 transitions. Second operand has 54 states, 53 states have (on average 3.30188679245283) internal successors, (175), 54 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-13 16:07:25,721 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 [0] [2024-11-13 16:07:29,995 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 [0] [2024-11-13 16:07:34,445 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 [0] [2024-11-13 16:07:39,054 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 [0] [2024-11-13 16:07:43,067 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 [0] [2024-11-13 16:07:51,065 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((v_ArrVal_2073 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2073) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (forall ((v_ArrVal_2072 (Array Int Int)) (v_ArrVal_2073 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2073) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2072) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))) is different from false [2024-11-13 16:07:57,226 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 [0] [2024-11-13 16:08:06,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:08:06,966 INFO L93 Difference]: Finished difference Result 970 states and 1151 transitions. [2024-11-13 16:08:06,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-13 16:08:06,969 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 3.30188679245283) internal successors, (175), 54 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) Word has length 59 [2024-11-13 16:08:06,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:08:06,973 INFO L225 Difference]: With dead ends: 970 [2024-11-13 16:08:06,974 INFO L226 Difference]: Without dead ends: 970 [2024-11-13 16:08:06,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 84 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 1678 ImplicationChecksByTransitivity, 23.5s TimeCoverageRelationStatistics Valid=916, Invalid=5511, Unknown=73, NotChecked=810, Total=7310 [2024-11-13 16:08:06,978 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 1223 mSDsluCounter, 3463 mSDsCounter, 0 mSdLazyCounter, 3832 mSolverCounterSat, 97 mSolverCounterUnsat, 50 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1223 SdHoareTripleChecker+Valid, 3601 SdHoareTripleChecker+Invalid, 6809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 3832 IncrementalHoareTripleChecker+Invalid, 50 IncrementalHoareTripleChecker+Unknown, 2830 IncrementalHoareTripleChecker+Unchecked, 35.3s IncrementalHoareTripleChecker+Time [2024-11-13 16:08:06,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1223 Valid, 3601 Invalid, 6809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 3832 Invalid, 50 Unknown, 2830 Unchecked, 35.3s Time] [2024-11-13 16:08:06,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2024-11-13 16:08:06,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 477. [2024-11-13 16:08:06,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 453 states have (on average 1.1964679911699778) internal successors, (542), 475 states have internal predecessors, (542), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:08:06,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 546 transitions. [2024-11-13 16:08:06,997 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 546 transitions. Word has length 59 [2024-11-13 16:08:06,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:08:06,999 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 546 transitions. [2024-11-13 16:08:07,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 3.30188679245283) internal successors, (175), 54 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-13 16:08:07,000 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 546 transitions. [2024-11-13 16:08:07,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-13 16:08:07,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:08:07,003 INFO L215 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, 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-13 16:08:07,029 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 16:08:07,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:08:07,204 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 16:08:07,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:08:07,205 INFO L85 PathProgramCache]: Analyzing trace with hash -98894769, now seen corresponding path program 1 times [2024-11-13 16:08:07,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:08:07,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688266799] [2024-11-13 16:08:07,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:08:07,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:08:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:08:07,614 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 16:08:07,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:08:07,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688266799] [2024-11-13 16:08:07,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688266799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:08:07,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:08:07,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 16:08:07,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476976286] [2024-11-13 16:08:07,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:08:07,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 16:08:07,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:08:07,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 16:08:07,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 16:08:07,617 INFO L87 Difference]: Start difference. First operand 477 states and 546 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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-13 16:08:09,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:08:09,129 INFO L93 Difference]: Finished difference Result 479 states and 546 transitions. [2024-11-13 16:08:09,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 16:08:09,130 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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 60 [2024-11-13 16:08:09,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:08:09,132 INFO L225 Difference]: With dead ends: 479 [2024-11-13 16:08:09,132 INFO L226 Difference]: Without dead ends: 479 [2024-11-13 16:08:09,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-13 16:08:09,133 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 113 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-13 16:08:09,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 499 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-13 16:08:09,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-11-13 16:08:09,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 477. [2024-11-13 16:08:09,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 453 states have (on average 1.1942604856512142) internal successors, (541), 475 states have internal predecessors, (541), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:08:09,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 545 transitions. [2024-11-13 16:08:09,143 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 545 transitions. Word has length 60 [2024-11-13 16:08:09,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:08:09,143 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 545 transitions. [2024-11-13 16:08:09,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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-13 16:08:09,144 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 545 transitions. [2024-11-13 16:08:09,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-13 16:08:09,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:08:09,145 INFO L215 NwaCegarLoop]: trace histogram [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, 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-13 16:08:09,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-11-13 16:08:09,146 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-13 16:08:09,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:08:09,146 INFO L85 PathProgramCache]: Analyzing trace with hash 178587997, now seen corresponding path program 1 times [2024-11-13 16:08:09,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:08:09,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547678871] [2024-11-13 16:08:09,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:08:09,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:08:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:08:11,148 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-13 16:08:11,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:08:11,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547678871] [2024-11-13 16:08:11,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547678871] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:08:11,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861502402] [2024-11-13 16:08:11,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:08:11,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:08:11,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:08:11,151 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:08:11,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb861625-6722-4fec-a3c4-026a09fd89f4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 16:08:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:08:11,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-13 16:08:11,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:08:11,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-13 16:08:11,844 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 16:08:11,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 16:08:11,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-13 16:08:12,324 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 16:08:12,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-11-13 16:08:12,880 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-13 16:08:12,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-13 16:08:13,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:08:13,238 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-13 16:08:13,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-13 16:08:13,454 INFO L349 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2024-11-13 16:08:13,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2024-11-13 16:08:14,036 INFO L349 Elim1Store]: treesize reduction 48, result has 18.6 percent of original size [2024-11-13 16:08:14,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 56 [2024-11-13 16:08:14,361 INFO L349 Elim1Store]: treesize reduction 48, result has 18.6 percent of original size [2024-11-13 16:08:14,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 65 [2024-11-13 16:08:15,222 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-13 16:08:15,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 24 [2024-11-13 16:08:15,240 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-13 16:08:15,240 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:08:16,869 INFO L349 Elim1Store]: treesize reduction 5, result has 89.4 percent of original size [2024-11-13 16:08:16,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 50 [2024-11-13 16:08:16,897 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_2237 (Array Int Int)) (v_ArrVal_2236 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_111| Int)) (or (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_111|) (= (select (select (let ((.cse1 (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~malloc14#1.base|)) |c_ULTIMATE.start_main_#t~malloc14#1.base| v_ArrVal_2236))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) .cse1) v_ArrVal_2237))) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_111|) |c_ULTIMATE.start_main_~end~0#1.base|) (< |v_ULTIMATE.start_main_~end~0#1.offset_111| 0))) is different from false [2024-11-13 16:08:17,389 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:08:17,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2024-11-13 16:08:18,731 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:08:18,731 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 92 [2024-11-13 16:08:18,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:08:18,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23906 treesize of output 23101 [2024-11-13 16:08:19,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:08:19,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1576 treesize of output 1360 [2024-11-13 16:08:19,143 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 1835 treesize of output 1761 [2024-11-13 16:08:19,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:08:19,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1771 treesize of output 1403 [2024-11-13 16:08:19,264 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:08:19,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1387 treesize of output 1185 [2024-11-13 16:08:19,488 INFO L349 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2024-11-13 16:08:19,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 61 [2024-11-13 16:08:22,748 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-13 16:08:22,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861502402] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:08:22,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 16:08:22,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 19] total 48 [2024-11-13 16:08:22,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229852535] [2024-11-13 16:08:22,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 16:08:22,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-13 16:08:22,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:08:22,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-13 16:08:22,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=2012, Unknown=37, NotChecked=92, Total=2352 [2024-11-13 16:08:22,751 INFO L87 Difference]: Start difference. First operand 477 states and 545 transitions. Second operand has 49 states, 48 states have (on average 3.6458333333333335) internal successors, (175), 49 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-13 16:08:27,990 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 [0] [2024-11-13 16:08:32,015 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 [0] [2024-11-13 16:08:36,513 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 [0] [2024-11-13 16:08:40,586 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 [0] [2024-11-13 16:08:45,087 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 [0] [2024-11-13 16:08:49,437 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 [0] [2024-11-13 16:08:53,772 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 [0] [2024-11-13 16:08:58,938 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 [0] [2024-11-13 16:09:03,089 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 [0] [2024-11-13 16:09:07,285 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 [0] [2024-11-13 16:09:11,508 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 [0] [2024-11-13 16:09:15,823 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 [0] [2024-11-13 16:09:20,935 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 [0] [2024-11-13 16:09:25,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 [0]