./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 9fd228108b00a337c799c923821cefd2f3f25ea1b43eb489705884efe2b6ca03 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:11:02,321 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:11:02,387 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:11:02,391 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:11:02,391 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:11:02,409 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:11:02,410 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:11:02,410 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:11:02,411 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:11:02,411 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:11:02,412 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:11:02,412 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:11:02,413 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:11:02,413 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:11:02,413 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:11:02,414 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:11:02,415 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:11:02,415 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:11:02,415 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:11:02,416 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:11:02,416 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:11:02,416 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:11:02,417 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:11:02,417 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:11:02,417 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:11:02,418 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:11:02,418 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:11:02,418 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:11:02,419 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:11:02,419 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:11:02,419 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:11:02,419 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:11:02,420 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:11:02,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:11:02,420 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:11:02,421 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:11:02,421 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:11:02,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:11:02,422 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:11:02,422 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:11:02,422 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:11:02,425 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:11:02,425 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 9fd228108b00a337c799c923821cefd2f3f25ea1b43eb489705884efe2b6ca03 [2024-11-09 10:11:02,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:11:02,724 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:11:02,729 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:11:02,730 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:11:02,730 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:11:02,731 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-1.i [2024-11-09 10:11:04,111 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:11:04,423 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:11:04,424 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-1.i [2024-11-09 10:11:04,447 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33e52c9e5/691741e25b3e43058f867e04647444f8/FLAGd81f9699b [2024-11-09 10:11:04,720 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33e52c9e5/691741e25b3e43058f867e04647444f8 [2024-11-09 10:11:04,722 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:11:04,723 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:11:04,724 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:11:04,725 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:11:04,730 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:11:04,730 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:11:04" (1/1) ... [2024-11-09 10:11:04,731 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@203db69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:11:04, skipping insertion in model container [2024-11-09 10:11:04,731 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:11:04" (1/1) ... [2024-11-09 10:11:04,788 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:11:05,201 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:05,241 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:05,247 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:05,252 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:05,260 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:05,303 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:05,305 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:05,310 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:05,317 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:05,357 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:05,359 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:05,361 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:05,362 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:05,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:11:05,387 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:11:05,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:11:05,547 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:11:05,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:11:05 WrapperNode [2024-11-09 10:11:05,548 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:11:05,549 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:11:05,549 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:11:05,549 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:11:05,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:11:05" (1/1) ... [2024-11-09 10:11:05,604 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:11:05" (1/1) ... [2024-11-09 10:11:05,685 INFO L138 Inliner]: procedures = 177, calls = 375, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2052 [2024-11-09 10:11:05,686 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:11:05,687 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:11:05,687 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:11:05,687 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:11:05,697 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:11:05" (1/1) ... [2024-11-09 10:11:05,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:11:05" (1/1) ... [2024-11-09 10:11:05,711 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:11:05" (1/1) ... [2024-11-09 10:11:05,817 INFO L175 MemorySlicer]: Split 349 memory accesses to 3 slices as follows [2, 323, 24]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 83 writes are split as follows [0, 82, 1]. [2024-11-09 10:11:05,817 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:11:05" (1/1) ... [2024-11-09 10:11:05,818 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:11:05" (1/1) ... [2024-11-09 10:11:05,880 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:11:05" (1/1) ... [2024-11-09 10:11:05,901 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:11:05" (1/1) ... [2024-11-09 10:11:05,917 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:11:05" (1/1) ... [2024-11-09 10:11:05,927 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:11:05" (1/1) ... [2024-11-09 10:11:05,947 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:11:05,948 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:11:05,949 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:11:05,950 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:11:05,950 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:11:05" (1/1) ... [2024-11-09 10:11:05,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:11:05,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:11:05,988 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 10:11:06,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 10:11:06,126 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-09 10:11:06,127 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-09 10:11:06,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 10:11:06,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 10:11:06,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 10:11:06,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 10:11:06,128 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 10:11:06,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 10:11:06,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 10:11:06,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 10:11:06,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-09 10:11:06,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-09 10:11:06,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-09 10:11:06,129 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-09 10:11:06,129 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-09 10:11:06,129 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-09 10:11:06,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 10:11:06,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:11:06,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 10:11:06,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 10:11:06,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 10:11:06,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 10:11:06,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 10:11:06,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 10:11:06,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 10:11:06,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 10:11:06,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:11:06,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 10:11:06,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 10:11:06,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:11:06,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:11:06,442 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:11:06,444 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:11:06,470 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:11:06,493 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:11:06,509 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:11:09,272 INFO L? ?]: Removed 1735 outVars from TransFormulas that were not future-live. [2024-11-09 10:11:09,274 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:11:09,323 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:11:09,325 INFO L316 CfgBuilder]: Removed 83 assume(true) statements. [2024-11-09 10:11:09,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:11:09 BoogieIcfgContainer [2024-11-09 10:11:09,326 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:11:09,328 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:11:09,329 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:11:09,333 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:11:09,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:11:04" (1/3) ... [2024-11-09 10:11:09,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39dac183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:11:09, skipping insertion in model container [2024-11-09 10:11:09,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:11:05" (2/3) ... [2024-11-09 10:11:09,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39dac183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:11:09, skipping insertion in model container [2024-11-09 10:11:09,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:11:09" (3/3) ... [2024-11-09 10:11:09,335 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test5-1.i [2024-11-09 10:11:09,354 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:11:09,354 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 712 error locations. [2024-11-09 10:11:09,430 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:11:09,440 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;@2960a078, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:11:09,440 INFO L334 AbstractCegarLoop]: Starting to check reachability of 712 error locations. [2024-11-09 10:11:09,452 INFO L276 IsEmpty]: Start isEmpty. Operand has 1738 states, 1015 states have (on average 2.0344827586206895) internal successors, (2065), 1728 states have internal predecessors, (2065), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:11:09,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 10:11:09,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:09,460 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:11:09,461 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:11:09,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:09,467 INFO L85 PathProgramCache]: Analyzing trace with hash 63053744, now seen corresponding path program 1 times [2024-11-09 10:11:09,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:11:09,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192256761] [2024-11-09 10:11:09,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:09,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:11:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:09,630 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-09 10:11:09,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:11:09,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192256761] [2024-11-09 10:11:09,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192256761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:11:09,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:11:09,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:11:09,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145442980] [2024-11-09 10:11:09,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:11:09,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 10:11:09,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:11:09,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 10:11:09,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 10:11:09,673 INFO L87 Difference]: Start difference. First operand has 1738 states, 1015 states have (on average 2.0344827586206895) internal successors, (2065), 1728 states have internal predecessors, (2065), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-09 10:11:09,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:09,784 INFO L93 Difference]: Finished difference Result 1718 states and 1978 transitions. [2024-11-09 10:11:09,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 10:11:09,786 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2024-11-09 10:11:09,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:09,816 INFO L225 Difference]: With dead ends: 1718 [2024-11-09 10:11:09,816 INFO L226 Difference]: Without dead ends: 1716 [2024-11-09 10:11:09,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 10:11:09,822 INFO L432 NwaCegarLoop]: 1978 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1978 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:11:09,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1978 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:11:09,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1716 states. [2024-11-09 10:11:09,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1716 to 1716. [2024-11-09 10:11:09,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1716 states, 1005 states have (on average 1.9422885572139303) internal successors, (1952), 1706 states have internal predecessors, (1952), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:11:09,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 1976 transitions. [2024-11-09 10:11:09,935 INFO L78 Accepts]: Start accepts. Automaton has 1716 states and 1976 transitions. Word has length 5 [2024-11-09 10:11:09,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:09,935 INFO L471 AbstractCegarLoop]: Abstraction has 1716 states and 1976 transitions. [2024-11-09 10:11:09,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-09 10:11:09,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 1976 transitions. [2024-11-09 10:11:09,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 10:11:09,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:09,936 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:11:09,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:11:09,937 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:11:09,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:09,938 INFO L85 PathProgramCache]: Analyzing trace with hash 63053806, now seen corresponding path program 1 times [2024-11-09 10:11:09,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:11:09,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742278073] [2024-11-09 10:11:09,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:09,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:11:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:10,055 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-09 10:11:10,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:11:10,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742278073] [2024-11-09 10:11:10,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742278073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:11:10,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:11:10,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:11:10,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696875148] [2024-11-09 10:11:10,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:11:10,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:11:10,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:11:10,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:11:10,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:11:10,059 INFO L87 Difference]: Start difference. First operand 1716 states and 1976 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-09 10:11:11,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:11,225 INFO L93 Difference]: Finished difference Result 1945 states and 2293 transitions. [2024-11-09 10:11:11,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:11:11,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-11-09 10:11:11,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:11,233 INFO L225 Difference]: With dead ends: 1945 [2024-11-09 10:11:11,233 INFO L226 Difference]: Without dead ends: 1945 [2024-11-09 10:11:11,233 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-09 10:11:11,235 INFO L432 NwaCegarLoop]: 1590 mSDtfsCounter, 1737 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1748 SdHoareTripleChecker+Valid, 1918 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:11:11,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1748 Valid, 1918 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 10:11:11,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1945 states. [2024-11-09 10:11:11,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1945 to 1624. [2024-11-09 10:11:11,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1005 states have (on average 1.8507462686567164) internal successors, (1860), 1614 states have internal predecessors, (1860), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:11:11,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 1884 transitions. [2024-11-09 10:11:11,276 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 1884 transitions. Word has length 5 [2024-11-09 10:11:11,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:11,277 INFO L471 AbstractCegarLoop]: Abstraction has 1624 states and 1884 transitions. [2024-11-09 10:11:11,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-09 10:11:11,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 1884 transitions. [2024-11-09 10:11:11,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 10:11:11,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:11,278 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:11:11,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:11:11,279 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:11:11,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:11,279 INFO L85 PathProgramCache]: Analyzing trace with hash 63053807, now seen corresponding path program 1 times [2024-11-09 10:11:11,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:11:11,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134441192] [2024-11-09 10:11:11,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:11,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:11:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:11,404 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-09 10:11:11,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:11:11,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134441192] [2024-11-09 10:11:11,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134441192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:11:11,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:11:11,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:11:11,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73606740] [2024-11-09 10:11:11,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:11:11,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:11:11,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:11:11,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:11:11,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:11:11,408 INFO L87 Difference]: Start difference. First operand 1624 states and 1884 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-09 10:11:12,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:12,521 INFO L93 Difference]: Finished difference Result 2361 states and 2785 transitions. [2024-11-09 10:11:12,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:11:12,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-11-09 10:11:12,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:12,533 INFO L225 Difference]: With dead ends: 2361 [2024-11-09 10:11:12,533 INFO L226 Difference]: Without dead ends: 2361 [2024-11-09 10:11:12,536 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-09 10:11:12,537 INFO L432 NwaCegarLoop]: 1955 mSDtfsCounter, 1217 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1222 SdHoareTripleChecker+Valid, 2890 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:11:12,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1222 Valid, 2890 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 10:11:12,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states. [2024-11-09 10:11:12,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 1887. [2024-11-09 10:11:12,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1887 states, 1278 states have (on average 1.8262910798122065) internal successors, (2334), 1877 states have internal predecessors, (2334), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:11:12,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1887 states to 1887 states and 2358 transitions. [2024-11-09 10:11:12,629 INFO L78 Accepts]: Start accepts. Automaton has 1887 states and 2358 transitions. Word has length 5 [2024-11-09 10:11:12,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:12,629 INFO L471 AbstractCegarLoop]: Abstraction has 1887 states and 2358 transitions. [2024-11-09 10:11:12,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-09 10:11:12,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1887 states and 2358 transitions. [2024-11-09 10:11:12,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 10:11:12,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:12,630 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 10:11:12,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 10:11:12,630 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:11:12,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:12,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1957056365, now seen corresponding path program 1 times [2024-11-09 10:11:12,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:11:12,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41361158] [2024-11-09 10:11:12,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:12,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:11:12,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:12,657 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-09 10:11:12,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:11:12,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41361158] [2024-11-09 10:11:12,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41361158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:11:12,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:11:12,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:11:12,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321450988] [2024-11-09 10:11:12,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:11:12,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:11:12,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:11:12,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:11:12,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:11:12,659 INFO L87 Difference]: Start difference. First operand 1887 states and 2358 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-09 10:11:12,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:12,725 INFO L93 Difference]: Finished difference Result 3755 states and 4697 transitions. [2024-11-09 10:11:12,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:11:12,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-11-09 10:11:12,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:12,739 INFO L225 Difference]: With dead ends: 3755 [2024-11-09 10:11:12,739 INFO L226 Difference]: Without dead ends: 3755 [2024-11-09 10:11:12,740 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-09 10:11:12,741 INFO L432 NwaCegarLoop]: 2150 mSDtfsCounter, 1830 mSDsluCounter, 1864 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1841 SdHoareTripleChecker+Valid, 4014 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:11:12,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1841 Valid, 4014 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:11:12,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3755 states. [2024-11-09 10:11:12,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3755 to 1889. [2024-11-09 10:11:12,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1889 states, 1280 states have (on average 1.825) internal successors, (2336), 1879 states have internal predecessors, (2336), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:11:12,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1889 states and 2360 transitions. [2024-11-09 10:11:12,783 INFO L78 Accepts]: Start accepts. Automaton has 1889 states and 2360 transitions. Word has length 6 [2024-11-09 10:11:12,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:12,783 INFO L471 AbstractCegarLoop]: Abstraction has 1889 states and 2360 transitions. [2024-11-09 10:11:12,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-09 10:11:12,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 2360 transitions. [2024-11-09 10:11:12,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 10:11:12,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:12,785 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:11:12,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:11:12,785 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:11:12,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:12,786 INFO L85 PathProgramCache]: Analyzing trace with hash -408167560, now seen corresponding path program 1 times [2024-11-09 10:11:12,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:11:12,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027698720] [2024-11-09 10:11:12,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:12,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:11:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:12,843 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-09 10:11:12,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:11:12,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027698720] [2024-11-09 10:11:12,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027698720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:11:12,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:11:12,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:11:12,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035424593] [2024-11-09 10:11:12,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:11:12,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:11:12,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:11:12,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:11:12,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:11:12,846 INFO L87 Difference]: Start difference. First operand 1889 states and 2360 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-09 10:11:13,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:13,952 INFO L93 Difference]: Finished difference Result 1915 states and 2413 transitions. [2024-11-09 10:11:13,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:11:13,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2024-11-09 10:11:13,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:13,959 INFO L225 Difference]: With dead ends: 1915 [2024-11-09 10:11:13,960 INFO L226 Difference]: Without dead ends: 1915 [2024-11-09 10:11:13,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-09 10:11:13,963 INFO L432 NwaCegarLoop]: 1160 mSDtfsCounter, 2005 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 1498 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2016 SdHoareTripleChecker+Valid, 2176 SdHoareTripleChecker+Invalid, 1530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:11:13,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2016 Valid, 2176 Invalid, 1530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1498 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 10:11:13,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1915 states. [2024-11-09 10:11:14,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1915 to 1866. [2024-11-09 10:11:14,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1866 states, 1280 states have (on average 1.80703125) internal successors, (2313), 1856 states have internal predecessors, (2313), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:11:14,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 2337 transitions. [2024-11-09 10:11:14,015 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 2337 transitions. Word has length 11 [2024-11-09 10:11:14,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:14,015 INFO L471 AbstractCegarLoop]: Abstraction has 1866 states and 2337 transitions. [2024-11-09 10:11:14,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-09 10:11:14,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 2337 transitions. [2024-11-09 10:11:14,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 10:11:14,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:14,016 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:11:14,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:11:14,016 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:11:14,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:14,017 INFO L85 PathProgramCache]: Analyzing trace with hash -408167559, now seen corresponding path program 1 times [2024-11-09 10:11:14,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:11:14,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661611778] [2024-11-09 10:11:14,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:14,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:11:14,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:14,102 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-09 10:11:14,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:11:14,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661611778] [2024-11-09 10:11:14,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661611778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:11:14,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:11:14,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:11:14,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948347316] [2024-11-09 10:11:14,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:11:14,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:11:14,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:11:14,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:11:14,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:11:14,105 INFO L87 Difference]: Start difference. First operand 1866 states and 2337 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-09 10:11:14,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:14,135 INFO L93 Difference]: Finished difference Result 1791 states and 2234 transitions. [2024-11-09 10:11:14,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:11:14,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2024-11-09 10:11:14,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:14,143 INFO L225 Difference]: With dead ends: 1791 [2024-11-09 10:11:14,143 INFO L226 Difference]: Without dead ends: 1791 [2024-11-09 10:11:14,143 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-09 10:11:14,144 INFO L432 NwaCegarLoop]: 1736 mSDtfsCounter, 61 mSDsluCounter, 1683 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 3419 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:11:14,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 3419 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:11:14,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states. [2024-11-09 10:11:14,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 1791. [2024-11-09 10:11:14,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1791 states, 1217 states have (on average 1.8159408381265407) internal successors, (2210), 1781 states have internal predecessors, (2210), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:11:14,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 2234 transitions. [2024-11-09 10:11:14,174 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 2234 transitions. Word has length 11 [2024-11-09 10:11:14,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:14,174 INFO L471 AbstractCegarLoop]: Abstraction has 1791 states and 2234 transitions. [2024-11-09 10:11:14,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-09 10:11:14,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2234 transitions. [2024-11-09 10:11:14,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 10:11:14,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:14,175 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:11:14,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 10:11:14,175 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:11:14,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:14,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1406843659, now seen corresponding path program 1 times [2024-11-09 10:11:14,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:11:14,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016917761] [2024-11-09 10:11:14,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:14,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:11:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:14,233 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-09 10:11:14,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:11:14,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016917761] [2024-11-09 10:11:14,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016917761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:11:14,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:11:14,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:11:14,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636561591] [2024-11-09 10:11:14,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:11:14,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:11:14,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:11:14,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:11:14,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:11:14,236 INFO L87 Difference]: Start difference. First operand 1791 states and 2234 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-09 10:11:14,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:14,314 INFO L93 Difference]: Finished difference Result 1776 states and 2212 transitions. [2024-11-09 10:11:14,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:11:14,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2024-11-09 10:11:14,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:14,321 INFO L225 Difference]: With dead ends: 1776 [2024-11-09 10:11:14,321 INFO L226 Difference]: Without dead ends: 1776 [2024-11-09 10:11:14,322 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-09 10:11:14,323 INFO L432 NwaCegarLoop]: 1698 mSDtfsCounter, 45 mSDsluCounter, 3373 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 5071 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:11:14,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 5071 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:11:14,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2024-11-09 10:11:14,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 1776. [2024-11-09 10:11:14,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1776 states, 1209 states have (on average 1.8097601323407775) internal successors, (2188), 1766 states have internal predecessors, (2188), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:11:14,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 2212 transitions. [2024-11-09 10:11:14,352 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 2212 transitions. Word has length 13 [2024-11-09 10:11:14,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:14,352 INFO L471 AbstractCegarLoop]: Abstraction has 1776 states and 2212 transitions. [2024-11-09 10:11:14,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-09 10:11:14,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 2212 transitions. [2024-11-09 10:11:14,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 10:11:14,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:14,354 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-09 10:11:14,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 10:11:14,354 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:11:14,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:14,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1340702493, now seen corresponding path program 1 times [2024-11-09 10:11:14,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:11:14,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623385121] [2024-11-09 10:11:14,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:14,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:11:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:14,522 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-09 10:11:14,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:11:14,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623385121] [2024-11-09 10:11:14,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623385121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:11:14,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:11:14,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:11:14,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443427656] [2024-11-09 10:11:14,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:11:14,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:11:14,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:11:14,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:11:14,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:11:14,524 INFO L87 Difference]: Start difference. First operand 1776 states and 2212 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 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-09 10:11:15,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:15,798 INFO L93 Difference]: Finished difference Result 2296 states and 2712 transitions. [2024-11-09 10:11:15,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:11:15,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 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-09 10:11:15,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:15,806 INFO L225 Difference]: With dead ends: 2296 [2024-11-09 10:11:15,806 INFO L226 Difference]: Without dead ends: 2296 [2024-11-09 10:11:15,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-09 10:11:15,807 INFO L432 NwaCegarLoop]: 1431 mSDtfsCounter, 1222 mSDsluCounter, 1954 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1227 SdHoareTripleChecker+Valid, 3385 SdHoareTripleChecker+Invalid, 1569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:11:15,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1227 Valid, 3385 Invalid, 1569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 10:11:15,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2296 states. [2024-11-09 10:11:15,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2296 to 1772. [2024-11-09 10:11:15,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1772 states, 1209 states have (on average 1.8064516129032258) internal successors, (2184), 1762 states have internal predecessors, (2184), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:11:15,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 2208 transitions. [2024-11-09 10:11:15,839 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 2208 transitions. Word has length 27 [2024-11-09 10:11:15,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:15,839 INFO L471 AbstractCegarLoop]: Abstraction has 1772 states and 2208 transitions. [2024-11-09 10:11:15,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 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-09 10:11:15,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2208 transitions. [2024-11-09 10:11:15,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 10:11:15,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:15,843 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, 1] [2024-11-09 10:11:15,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 10:11:15,843 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:11:15,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:15,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1878905961, now seen corresponding path program 1 times [2024-11-09 10:11:15,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:11:15,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737646338] [2024-11-09 10:11:15,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:15,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:11:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:15,934 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-09 10:11:15,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:11:15,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737646338] [2024-11-09 10:11:15,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737646338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:11:15,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:11:15,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:11:15,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174830158] [2024-11-09 10:11:15,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:11:15,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:11:15,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:11:15,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:11:15,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:11:15,937 INFO L87 Difference]: Start difference. First operand 1772 states and 2208 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-09 10:11:15,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:15,991 INFO L93 Difference]: Finished difference Result 1766 states and 2198 transitions. [2024-11-09 10:11:15,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:11:15,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 61 [2024-11-09 10:11:15,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:15,997 INFO L225 Difference]: With dead ends: 1766 [2024-11-09 10:11:15,997 INFO L226 Difference]: Without dead ends: 1766 [2024-11-09 10:11:15,998 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-09 10:11:15,998 INFO L432 NwaCegarLoop]: 1696 mSDtfsCounter, 21 mSDsluCounter, 3361 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 5057 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:11:15,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 5057 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:11:16,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1766 states. [2024-11-09 10:11:16,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1766 to 1766. [2024-11-09 10:11:16,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1203 states have (on average 1.8071487946799667) internal successors, (2174), 1756 states have internal predecessors, (2174), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:11:16,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 2198 transitions. [2024-11-09 10:11:16,022 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 2198 transitions. Word has length 61 [2024-11-09 10:11:16,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:16,022 INFO L471 AbstractCegarLoop]: Abstraction has 1766 states and 2198 transitions. [2024-11-09 10:11:16,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-09 10:11:16,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2198 transitions. [2024-11-09 10:11:16,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-09 10:11:16,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:16,024 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:11:16,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 10:11:16,024 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:11:16,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:16,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1294710755, now seen corresponding path program 1 times [2024-11-09 10:11:16,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:11:16,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586831012] [2024-11-09 10:11:16,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:16,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:11:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:16,136 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-09 10:11:16,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:11:16,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586831012] [2024-11-09 10:11:16,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586831012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:11:16,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:11:16,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:11:16,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205798453] [2024-11-09 10:11:16,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:11:16,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:11:16,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:11:16,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:11:16,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:11:16,139 INFO L87 Difference]: Start difference. First operand 1766 states and 2198 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-09 10:11:16,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:16,183 INFO L93 Difference]: Finished difference Result 1858 states and 2317 transitions. [2024-11-09 10:11:16,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:11:16,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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 69 [2024-11-09 10:11:16,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:16,191 INFO L225 Difference]: With dead ends: 1858 [2024-11-09 10:11:16,192 INFO L226 Difference]: Without dead ends: 1858 [2024-11-09 10:11:16,192 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-09 10:11:16,192 INFO L432 NwaCegarLoop]: 1711 mSDtfsCounter, 54 mSDsluCounter, 1684 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 3395 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:11:16,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 3395 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:11:16,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states. [2024-11-09 10:11:16,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1858. [2024-11-09 10:11:16,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1295 states have (on average 1.7706563706563707) internal successors, (2293), 1848 states have internal predecessors, (2293), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:11:16,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2317 transitions. [2024-11-09 10:11:16,254 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 2317 transitions. Word has length 69 [2024-11-09 10:11:16,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:16,255 INFO L471 AbstractCegarLoop]: Abstraction has 1858 states and 2317 transitions. [2024-11-09 10:11:16,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-09 10:11:16,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2317 transitions. [2024-11-09 10:11:16,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-09 10:11:16,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:16,256 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:11:16,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 10:11:16,257 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:11:16,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:16,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1814650898, now seen corresponding path program 1 times [2024-11-09 10:11:16,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:11:16,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457630740] [2024-11-09 10:11:16,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:16,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:11:16,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:16,720 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-09 10:11:16,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:11:16,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457630740] [2024-11-09 10:11:16,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457630740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:11:16,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:11:16,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:11:16,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622948464] [2024-11-09 10:11:16,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:11:16,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:11:16,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:11:16,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:11:16,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:11:16,723 INFO L87 Difference]: Start difference. First operand 1858 states and 2317 transitions. Second operand has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 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-09 10:11:17,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:17,934 INFO L93 Difference]: Finished difference Result 1774 states and 2233 transitions. [2024-11-09 10:11:17,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:11:17,935 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 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 72 [2024-11-09 10:11:17,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:17,941 INFO L225 Difference]: With dead ends: 1774 [2024-11-09 10:11:17,941 INFO L226 Difference]: Without dead ends: 1774 [2024-11-09 10:11:17,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:11:17,942 INFO L432 NwaCegarLoop]: 826 mSDtfsCounter, 1535 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 1668 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1546 SdHoareTripleChecker+Valid, 1620 SdHoareTripleChecker+Invalid, 1761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:11:17,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1546 Valid, 1620 Invalid, 1761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1668 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 10:11:17,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1774 states. [2024-11-09 10:11:17,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1774 to 1501. [2024-11-09 10:11:17,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1501 states, 1022 states have (on average 1.687866927592955) internal successors, (1725), 1491 states have internal predecessors, (1725), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:11:17,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 1749 transitions. [2024-11-09 10:11:17,970 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 1749 transitions. Word has length 72 [2024-11-09 10:11:17,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:17,970 INFO L471 AbstractCegarLoop]: Abstraction has 1501 states and 1749 transitions. [2024-11-09 10:11:17,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 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-09 10:11:17,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 1749 transitions. [2024-11-09 10:11:17,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-09 10:11:17,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:17,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 10:11:17,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 10:11:17,974 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:11:17,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:17,975 INFO L85 PathProgramCache]: Analyzing trace with hash -702590666, now seen corresponding path program 1 times [2024-11-09 10:11:17,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:11:17,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745289582] [2024-11-09 10:11:17,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:17,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:11:18,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:18,243 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-09 10:11:18,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:11:18,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745289582] [2024-11-09 10:11:18,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745289582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:11:18,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:11:18,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:11:18,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999032080] [2024-11-09 10:11:18,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:11:18,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:11:18,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:11:18,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:11:18,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:11:18,245 INFO L87 Difference]: Start difference. First operand 1501 states and 1749 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 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-09 10:11:19,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:19,106 INFO L93 Difference]: Finished difference Result 1500 states and 1748 transitions. [2024-11-09 10:11:19,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:11:19,106 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 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 77 [2024-11-09 10:11:19,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:19,110 INFO L225 Difference]: With dead ends: 1500 [2024-11-09 10:11:19,110 INFO L226 Difference]: Without dead ends: 1500 [2024-11-09 10:11:19,110 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-09 10:11:19,111 INFO L432 NwaCegarLoop]: 1623 mSDtfsCounter, 2 mSDsluCounter, 3155 mSDsCounter, 0 mSdLazyCounter, 1721 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4778 SdHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:11:19,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4778 Invalid, 1722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1721 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 10:11:19,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2024-11-09 10:11:19,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 1500. [2024-11-09 10:11:19,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1500 states, 1022 states have (on average 1.6868884540117417) internal successors, (1724), 1490 states have internal predecessors, (1724), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:11:19,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 1748 transitions. [2024-11-09 10:11:19,130 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 1748 transitions. Word has length 77 [2024-11-09 10:11:19,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:19,131 INFO L471 AbstractCegarLoop]: Abstraction has 1500 states and 1748 transitions. [2024-11-09 10:11:19,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 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-09 10:11:19,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 1748 transitions. [2024-11-09 10:11:19,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-09 10:11:19,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:19,132 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:11:19,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 10:11:19,132 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:11:19,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:19,133 INFO L85 PathProgramCache]: Analyzing trace with hash -702590665, now seen corresponding path program 1 times [2024-11-09 10:11:19,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:11:19,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589768079] [2024-11-09 10:11:19,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:19,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:11:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:19,585 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-09 10:11:19,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:11:19,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589768079] [2024-11-09 10:11:19,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589768079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:11:19,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:11:19,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:11:19,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188914570] [2024-11-09 10:11:19,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:11:19,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:11:19,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:11:19,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:11:19,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:11:19,590 INFO L87 Difference]: Start difference. First operand 1500 states and 1748 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 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-09 10:11:20,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:20,720 INFO L93 Difference]: Finished difference Result 1499 states and 1747 transitions. [2024-11-09 10:11:20,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:11:20,721 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 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 77 [2024-11-09 10:11:20,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:20,726 INFO L225 Difference]: With dead ends: 1499 [2024-11-09 10:11:20,726 INFO L226 Difference]: Without dead ends: 1499 [2024-11-09 10:11:20,726 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-09 10:11:20,727 INFO L432 NwaCegarLoop]: 1623 mSDtfsCounter, 1 mSDsluCounter, 3177 mSDsCounter, 0 mSdLazyCounter, 1696 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4800 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:11:20,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4800 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1696 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 10:11:20,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2024-11-09 10:11:20,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1499. [2024-11-09 10:11:20,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1499 states, 1021 states have (on average 1.6875612144955925) internal successors, (1723), 1489 states have internal predecessors, (1723), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:11:20,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 1747 transitions. [2024-11-09 10:11:20,750 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 1747 transitions. Word has length 77 [2024-11-09 10:11:20,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:20,750 INFO L471 AbstractCegarLoop]: Abstraction has 1499 states and 1747 transitions. [2024-11-09 10:11:20,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 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-09 10:11:20,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 1747 transitions. [2024-11-09 10:11:20,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-09 10:11:20,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:20,754 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, 1, 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-09 10:11:20,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 10:11:20,755 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:11:20,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:20,755 INFO L85 PathProgramCache]: Analyzing trace with hash 545873214, now seen corresponding path program 1 times [2024-11-09 10:11:20,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:11:20,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477446935] [2024-11-09 10:11:20,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:20,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:11:20,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:21,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 10:11:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:21,458 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-09 10:11:21,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:11:21,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477446935] [2024-11-09 10:11:21,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477446935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:11:21,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:11:21,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:11:21,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010877181] [2024-11-09 10:11:21,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:11:21,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:11:21,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:11:21,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:11:21,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:11:21,462 INFO L87 Difference]: Start difference. First operand 1499 states and 1747 transitions. Second operand has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:11:22,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:22,845 INFO L93 Difference]: Finished difference Result 1506 states and 1760 transitions. [2024-11-09 10:11:22,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:11:22,846 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2024-11-09 10:11:22,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:22,851 INFO L225 Difference]: With dead ends: 1506 [2024-11-09 10:11:22,852 INFO L226 Difference]: Without dead ends: 1506 [2024-11-09 10:11:22,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 10:11:22,852 INFO L432 NwaCegarLoop]: 1611 mSDtfsCounter, 13 mSDsluCounter, 5816 mSDsCounter, 0 mSdLazyCounter, 2281 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 7427 SdHoareTripleChecker+Invalid, 2292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 10:11:22,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 7427 Invalid, 2292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2281 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 10:11:22,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2024-11-09 10:11:22,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1505. [2024-11-09 10:11:22,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1026 states have (on average 1.6861598440545809) internal successors, (1730), 1494 states have internal predecessors, (1730), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2024-11-09 10:11:22,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 1760 transitions. [2024-11-09 10:11:22,873 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 1760 transitions. Word has length 85 [2024-11-09 10:11:22,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:22,874 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 1760 transitions. [2024-11-09 10:11:22,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:11:22,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1760 transitions. [2024-11-09 10:11:22,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-09 10:11:22,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:22,875 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, 1, 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-09 10:11:22,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 10:11:22,875 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:11:22,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:22,876 INFO L85 PathProgramCache]: Analyzing trace with hash 545873213, now seen corresponding path program 1 times [2024-11-09 10:11:22,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:11:22,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221682864] [2024-11-09 10:11:22,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:22,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:11:22,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:23,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 10:11:23,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:23,120 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-09 10:11:23,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:11:23,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221682864] [2024-11-09 10:11:23,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221682864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:11:23,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:11:23,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:11:23,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147956786] [2024-11-09 10:11:23,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:11:23,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:11:23,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:11:23,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:11:23,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:11:23,124 INFO L87 Difference]: Start difference. First operand 1505 states and 1760 transitions. Second operand has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:11:24,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:24,349 INFO L93 Difference]: Finished difference Result 1510 states and 1764 transitions. [2024-11-09 10:11:24,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:11:24,350 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2024-11-09 10:11:24,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:24,354 INFO L225 Difference]: With dead ends: 1510 [2024-11-09 10:11:24,354 INFO L226 Difference]: Without dead ends: 1510 [2024-11-09 10:11:24,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-09 10:11:24,355 INFO L432 NwaCegarLoop]: 1606 mSDtfsCounter, 16 mSDsluCounter, 5776 mSDsCounter, 0 mSdLazyCounter, 2350 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 7382 SdHoareTripleChecker+Invalid, 2363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:11:24,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 7382 Invalid, 2363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2350 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 10:11:24,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2024-11-09 10:11:24,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1505. [2024-11-09 10:11:24,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1026 states have (on average 1.6851851851851851) internal successors, (1729), 1494 states have internal predecessors, (1729), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2024-11-09 10:11:24,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 1759 transitions. [2024-11-09 10:11:24,375 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 1759 transitions. Word has length 85 [2024-11-09 10:11:24,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:24,375 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 1759 transitions. [2024-11-09 10:11:24,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:11:24,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1759 transitions. [2024-11-09 10:11:24,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-09 10:11:24,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:24,376 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, 1, 1, 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-09 10:11:24,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 10:11:24,376 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:11:24,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:24,377 INFO L85 PathProgramCache]: Analyzing trace with hash -749829340, now seen corresponding path program 1 times [2024-11-09 10:11:24,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:11:24,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773015281] [2024-11-09 10:11:24,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:24,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:11:24,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:25,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 10:11:25,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:25,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:11:25,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:11:25,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773015281] [2024-11-09 10:11:25,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773015281] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:11:25,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510099627] [2024-11-09 10:11:25,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:25,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:11:25,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:11:25,161 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:11:25,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 10:11:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:25,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 10:11:25,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:11:25,452 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-09 10:11:25,596 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-09 10:11:25,611 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:11:25,612 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-09 10:11:25,639 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 13 treesize of output 9 [2024-11-09 10:11:25,648 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 19 treesize of output 1 [2024-11-09 10:11:25,740 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 22 treesize of output 10 [2024-11-09 10:11:25,744 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 9 treesize of output 3 [2024-11-09 10:11:25,880 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:11:25,881 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 62 treesize of output 57 [2024-11-09 10:11:25,885 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 30 treesize of output 13 [2024-11-09 10:11:25,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 10:11:25,935 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 9 treesize of output 3 [2024-11-09 10:11:25,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:11:25,953 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:11:26,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510099627] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:11:26,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:11:26,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-09 10:11:26,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043421849] [2024-11-09 10:11:26,132 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:11:26,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 10:11:26,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:11:26,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 10:11:26,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=385, Unknown=12, NotChecked=0, Total=462 [2024-11-09 10:11:26,134 INFO L87 Difference]: Start difference. First operand 1505 states and 1759 transitions. Second operand has 19 states, 16 states have (on average 8.4375) internal successors, (135), 18 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:11:31,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:31,463 INFO L93 Difference]: Finished difference Result 1512 states and 1766 transitions. [2024-11-09 10:11:31,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 10:11:31,463 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.4375) internal successors, (135), 18 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 86 [2024-11-09 10:11:31,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:31,471 INFO L225 Difference]: With dead ends: 1512 [2024-11-09 10:11:31,471 INFO L226 Difference]: Without dead ends: 1512 [2024-11-09 10:11:31,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=584, Unknown=12, NotChecked=0, Total=702 [2024-11-09 10:11:31,472 INFO L432 NwaCegarLoop]: 1050 mSDtfsCounter, 1552 mSDsluCounter, 11052 mSDsCounter, 0 mSdLazyCounter, 10585 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1567 SdHoareTripleChecker+Valid, 12102 SdHoareTripleChecker+Invalid, 10627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 10585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:11:31,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1567 Valid, 12102 Invalid, 10627 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [42 Valid, 10585 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-09 10:11:31,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-11-09 10:11:31,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1509. [2024-11-09 10:11:31,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1030 states have (on average 1.6825242718446602) internal successors, (1733), 1497 states have internal predecessors, (1733), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-09 10:11:31,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 1758 transitions. [2024-11-09 10:11:31,493 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 1758 transitions. Word has length 86 [2024-11-09 10:11:31,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:31,494 INFO L471 AbstractCegarLoop]: Abstraction has 1509 states and 1758 transitions. [2024-11-09 10:11:31,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.4375) internal successors, (135), 18 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:11:31,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 1758 transitions. [2024-11-09 10:11:31,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-09 10:11:31,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:31,495 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, 1, 1, 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-09 10:11:31,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 10:11:31,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 10:11:31,697 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:11:31,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:31,697 INFO L85 PathProgramCache]: Analyzing trace with hash -749829341, now seen corresponding path program 1 times [2024-11-09 10:11:31,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:11:31,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251197009] [2024-11-09 10:11:31,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:31,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:11:31,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:32,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 10:11:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:32,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:11:32,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:11:32,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251197009] [2024-11-09 10:11:32,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251197009] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:11:32,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215448056] [2024-11-09 10:11:32,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:32,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:11:32,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:11:32,186 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:11:32,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 10:11:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:32,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 10:11:32,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:11:32,426 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-09 10:11:32,524 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:11:32,525 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-09 10:11:32,535 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 19 treesize of output 1 [2024-11-09 10:11:32,611 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:11:32,612 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 42 treesize of output 41 [2024-11-09 10:11:32,645 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 31 treesize of output 13 [2024-11-09 10:11:32,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:11:32,648 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:11:32,692 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-09 10:11:32,692 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 21 treesize of output 20 [2024-11-09 10:11:32,701 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_683 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_683) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)))) is different from false [2024-11-09 10:11:32,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215448056] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:11:32,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:11:32,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 14 [2024-11-09 10:11:32,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652729296] [2024-11-09 10:11:32,703 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:11:32,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 10:11:32,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:11:32,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 10:11:32,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=176, Unknown=1, NotChecked=26, Total=240 [2024-11-09 10:11:32,705 INFO L87 Difference]: Start difference. First operand 1509 states and 1758 transitions. Second operand has 15 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:11:35,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:35,296 INFO L93 Difference]: Finished difference Result 1511 states and 1765 transitions. [2024-11-09 10:11:35,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:11:35,297 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 86 [2024-11-09 10:11:35,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:35,300 INFO L225 Difference]: With dead ends: 1511 [2024-11-09 10:11:35,301 INFO L226 Difference]: Without dead ends: 1511 [2024-11-09 10:11:35,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=419, Unknown=1, NotChecked=42, Total=552 [2024-11-09 10:11:35,302 INFO L432 NwaCegarLoop]: 1045 mSDtfsCounter, 1547 mSDsluCounter, 10191 mSDsCounter, 0 mSdLazyCounter, 6568 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1562 SdHoareTripleChecker+Valid, 11236 SdHoareTripleChecker+Invalid, 6606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 6568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-09 10:11:35,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1562 Valid, 11236 Invalid, 6606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 6568 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-09 10:11:35,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2024-11-09 10:11:35,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1502. [2024-11-09 10:11:35,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1502 states, 1025 states have (on average 1.6839024390243902) internal successors, (1726), 1491 states have internal predecessors, (1726), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:11:35,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 1750 transitions. [2024-11-09 10:11:35,322 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 1750 transitions. Word has length 86 [2024-11-09 10:11:35,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:35,323 INFO L471 AbstractCegarLoop]: Abstraction has 1502 states and 1750 transitions. [2024-11-09 10:11:35,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:11:35,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 1750 transitions. [2024-11-09 10:11:35,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-09 10:11:35,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:35,324 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, 1, 1, 1, 1, 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-09 10:11:35,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 10:11:35,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-09 10:11:35,529 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:11:35,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:35,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1363328473, now seen corresponding path program 1 times [2024-11-09 10:11:35,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:11:35,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131309936] [2024-11-09 10:11:35,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:35,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:11:35,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:36,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 10:11:36,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:36,069 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-09 10:11:36,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:11:36,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131309936] [2024-11-09 10:11:36,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131309936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:11:36,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:11:36,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 10:11:36,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692226291] [2024-11-09 10:11:36,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:11:36,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:11:36,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:11:36,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:11:36,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:11:36,073 INFO L87 Difference]: Start difference. First operand 1502 states and 1750 transitions. Second operand has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:11:38,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:38,306 INFO L93 Difference]: Finished difference Result 1515 states and 1769 transitions. [2024-11-09 10:11:38,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 10:11:38,306 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2024-11-09 10:11:38,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:38,308 INFO L225 Difference]: With dead ends: 1515 [2024-11-09 10:11:38,309 INFO L226 Difference]: Without dead ends: 1515 [2024-11-09 10:11:38,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-11-09 10:11:38,309 INFO L432 NwaCegarLoop]: 1044 mSDtfsCounter, 1567 mSDsluCounter, 8171 mSDsCounter, 0 mSdLazyCounter, 5399 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1582 SdHoareTripleChecker+Valid, 9215 SdHoareTripleChecker+Invalid, 5424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 5399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:11:38,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1582 Valid, 9215 Invalid, 5424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 5399 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-09 10:11:38,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2024-11-09 10:11:38,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1511. [2024-11-09 10:11:38,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1511 states, 1033 states have (on average 1.6805421103581801) internal successors, (1736), 1499 states have internal predecessors, (1736), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-09 10:11:38,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 1761 transitions. [2024-11-09 10:11:38,332 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 1761 transitions. Word has length 88 [2024-11-09 10:11:38,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:38,332 INFO L471 AbstractCegarLoop]: Abstraction has 1511 states and 1761 transitions. [2024-11-09 10:11:38,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:11:38,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 1761 transitions. [2024-11-09 10:11:38,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-09 10:11:38,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:38,333 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, 1, 1, 1, 1, 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-09 10:11:38,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 10:11:38,334 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:11:38,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:38,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1363328474, now seen corresponding path program 1 times [2024-11-09 10:11:38,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:11:38,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071594175] [2024-11-09 10:11:38,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:38,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:11:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:39,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 10:11:39,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:39,043 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-09 10:11:39,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:11:39,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071594175] [2024-11-09 10:11:39,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071594175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:11:39,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:11:39,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 10:11:39,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402070674] [2024-11-09 10:11:39,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:11:39,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 10:11:39,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:11:39,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 10:11:39,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-09 10:11:39,046 INFO L87 Difference]: Start difference. First operand 1511 states and 1761 transitions. Second operand has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:11:41,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:41,183 INFO L93 Difference]: Finished difference Result 1514 states and 1768 transitions. [2024-11-09 10:11:41,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 10:11:41,184 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2024-11-09 10:11:41,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:41,187 INFO L225 Difference]: With dead ends: 1514 [2024-11-09 10:11:41,187 INFO L226 Difference]: Without dead ends: 1514 [2024-11-09 10:11:41,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-09 10:11:41,188 INFO L432 NwaCegarLoop]: 1051 mSDtfsCounter, 1554 mSDsluCounter, 4448 mSDsCounter, 0 mSdLazyCounter, 4236 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1569 SdHoareTripleChecker+Valid, 5499 SdHoareTripleChecker+Invalid, 4272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 4236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:11:41,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1569 Valid, 5499 Invalid, 4272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 4236 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 10:11:41,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2024-11-09 10:11:41,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1511. [2024-11-09 10:11:41,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1511 states, 1033 states have (on average 1.6795740561471442) internal successors, (1735), 1499 states have internal predecessors, (1735), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-09 10:11:41,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 1760 transitions. [2024-11-09 10:11:41,211 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 1760 transitions. Word has length 88 [2024-11-09 10:11:41,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:41,212 INFO L471 AbstractCegarLoop]: Abstraction has 1511 states and 1760 transitions. [2024-11-09 10:11:41,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:11:41,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 1760 transitions. [2024-11-09 10:11:41,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-09 10:11:41,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:41,213 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, 1, 1, 1, 1, 1, 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-09 10:11:41,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 10:11:41,213 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:11:41,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:41,214 INFO L85 PathProgramCache]: Analyzing trace with hash -40368589, now seen corresponding path program 1 times [2024-11-09 10:11:41,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:11:41,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132194667] [2024-11-09 10:11:41,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:41,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:11:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:41,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 10:11:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:41,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:11:41,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:11:41,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132194667] [2024-11-09 10:11:41,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132194667] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:11:41,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914534793] [2024-11-09 10:11:41,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:41,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:11:41,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:11:41,756 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:11:41,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 10:11:42,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:42,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 10:11:42,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:11:42,018 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-09 10:11:42,106 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:11:42,107 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-09 10:11:42,112 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 19 treesize of output 1 [2024-11-09 10:11:42,172 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:11:42,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 42 treesize of output 41 [2024-11-09 10:11:42,215 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:11:42,216 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 42 treesize of output 41 [2024-11-09 10:11:42,227 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 31 treesize of output 13 [2024-11-09 10:11:42,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:11:42,229 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:11:42,321 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-09 10:11:42,322 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 33 treesize of output 32 [2024-11-09 10:11:42,327 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_946 (Array Int Int)) (v_ArrVal_949 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_949))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_946)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-09 10:11:42,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914534793] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:11:42,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:11:42,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 16 [2024-11-09 10:11:42,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828938196] [2024-11-09 10:11:42,328 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:11:42,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 10:11:42,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:11:42,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 10:11:42,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=278, Unknown=14, NotChecked=34, Total=380 [2024-11-09 10:11:42,330 INFO L87 Difference]: Start difference. First operand 1511 states and 1760 transitions. Second operand has 17 states, 15 states have (on average 8.6) internal successors, (129), 15 states have internal predecessors, (129), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:11:45,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:45,105 INFO L93 Difference]: Finished difference Result 1513 states and 1767 transitions. [2024-11-09 10:11:45,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:11:45,105 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 8.6) internal successors, (129), 15 states have internal predecessors, (129), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2024-11-09 10:11:45,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:45,107 INFO L225 Difference]: With dead ends: 1513 [2024-11-09 10:11:45,107 INFO L226 Difference]: Without dead ends: 1513 [2024-11-09 10:11:45,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=577, Unknown=14, NotChecked=50, Total=756 [2024-11-09 10:11:45,108 INFO L432 NwaCegarLoop]: 1044 mSDtfsCounter, 1538 mSDsluCounter, 10212 mSDsCounter, 0 mSdLazyCounter, 6544 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1553 SdHoareTripleChecker+Valid, 11256 SdHoareTripleChecker+Invalid, 6569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 6544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:11:45,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1553 Valid, 11256 Invalid, 6569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 6544 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-09 10:11:45,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2024-11-09 10:11:45,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1510. [2024-11-09 10:11:45,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1510 states, 1033 states have (on average 1.6786060019361084) internal successors, (1734), 1498 states have internal predecessors, (1734), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-09 10:11:45,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 1759 transitions. [2024-11-09 10:11:45,125 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 1759 transitions. Word has length 89 [2024-11-09 10:11:45,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:45,125 INFO L471 AbstractCegarLoop]: Abstraction has 1510 states and 1759 transitions. [2024-11-09 10:11:45,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 8.6) internal successors, (129), 15 states have internal predecessors, (129), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:11:45,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 1759 transitions. [2024-11-09 10:11:45,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-09 10:11:45,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:45,126 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, 1, 1, 1, 1, 1, 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-09 10:11:45,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 10:11:45,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:11:45,331 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:11:45,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:45,331 INFO L85 PathProgramCache]: Analyzing trace with hash -40368588, now seen corresponding path program 1 times [2024-11-09 10:11:45,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:11:45,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798063673] [2024-11-09 10:11:45,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:45,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:11:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:46,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 10:11:46,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:46,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:11:46,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:11:46,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798063673] [2024-11-09 10:11:46,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798063673] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:11:46,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773448838] [2024-11-09 10:11:46,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:46,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:11:46,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:11:46,101 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:11:46,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 10:11:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:46,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-09 10:11:46,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:11:46,332 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-09 10:11:46,425 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:11:46,425 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-09 10:11:46,432 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-09 10:11:46,455 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 13 treesize of output 9 [2024-11-09 10:11:46,460 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 19 treesize of output 1 [2024-11-09 10:11:46,525 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 22 treesize of output 10 [2024-11-09 10:11:46,529 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 9 treesize of output 3 [2024-11-09 10:11:46,618 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:11:46,618 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 62 treesize of output 57 [2024-11-09 10:11:46,622 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 30 treesize of output 13 [2024-11-09 10:11:46,700 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:11:46,700 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 62 treesize of output 57 [2024-11-09 10:11:46,704 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 30 treesize of output 13 [2024-11-09 10:11:46,717 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 31 treesize of output 13 [2024-11-09 10:11:46,720 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 9 treesize of output 3 [2024-11-09 10:11:46,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:11:46,734 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:11:46,839 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1096 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1096) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1097 (Array Int Int)) (v_ArrVal_1096 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1096) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1097) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-09 10:11:46,885 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_ArrVal_1097 (Array Int Int)) (v_ArrVal_1096 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1102))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1103) .cse0 v_ArrVal_1096) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1097) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_ArrVal_1096 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1103) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1102) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1096) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))))) is different from false [2024-11-09 10:11:46,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773448838] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:11:46,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:11:46,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-11-09 10:11:46,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951386572] [2024-11-09 10:11:46,888 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:11:46,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 10:11:46,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:11:46,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 10:11:46,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=470, Unknown=10, NotChecked=90, Total=650 [2024-11-09 10:11:46,889 INFO L87 Difference]: Start difference. First operand 1510 states and 1759 transitions. Second operand has 21 states, 18 states have (on average 7.833333333333333) internal successors, (141), 20 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:11:50,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:50,910 INFO L93 Difference]: Finished difference Result 1512 states and 1766 transitions. [2024-11-09 10:11:50,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 10:11:50,911 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 7.833333333333333) internal successors, (141), 20 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 89 [2024-11-09 10:11:50,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:50,913 INFO L225 Difference]: With dead ends: 1512 [2024-11-09 10:11:50,913 INFO L226 Difference]: Without dead ends: 1512 [2024-11-09 10:11:50,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=736, Unknown=11, NotChecked=114, Total=992 [2024-11-09 10:11:50,915 INFO L432 NwaCegarLoop]: 1049 mSDtfsCounter, 1550 mSDsluCounter, 9651 mSDsCounter, 0 mSdLazyCounter, 8707 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1565 SdHoareTripleChecker+Valid, 10700 SdHoareTripleChecker+Invalid, 8748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 8707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:11:50,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1565 Valid, 10700 Invalid, 8748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 8707 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-09 10:11:50,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-11-09 10:11:50,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1500. [2024-11-09 10:11:50,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1500 states, 1025 states have (on average 1.681951219512195) internal successors, (1724), 1489 states have internal predecessors, (1724), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:11:50,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 1748 transitions. [2024-11-09 10:11:50,931 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 1748 transitions. Word has length 89 [2024-11-09 10:11:50,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:50,931 INFO L471 AbstractCegarLoop]: Abstraction has 1500 states and 1748 transitions. [2024-11-09 10:11:50,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 7.833333333333333) internal successors, (141), 20 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:11:50,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 1748 transitions. [2024-11-09 10:11:50,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-09 10:11:50,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:50,933 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, 1, 1, 1, 1, 1, 1, 1, 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-09 10:11:50,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 10:11:51,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:11:51,134 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:11:51,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:51,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1708417764, now seen corresponding path program 1 times [2024-11-09 10:11:51,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:11:51,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528240433] [2024-11-09 10:11:51,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:51,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:11:51,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:51,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 10:11:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:51,687 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-09 10:11:51,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:11:51,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528240433] [2024-11-09 10:11:51,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528240433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:11:51,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:11:51,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 10:11:51,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005304772] [2024-11-09 10:11:51,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:11:51,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 10:11:51,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:11:51,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 10:11:51,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-09 10:11:51,691 INFO L87 Difference]: Start difference. First operand 1500 states and 1748 transitions. Second operand has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:11:53,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:53,906 INFO L93 Difference]: Finished difference Result 1516 states and 1770 transitions. [2024-11-09 10:11:53,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:11:53,907 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2024-11-09 10:11:53,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:53,910 INFO L225 Difference]: With dead ends: 1516 [2024-11-09 10:11:53,910 INFO L226 Difference]: Without dead ends: 1516 [2024-11-09 10:11:53,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2024-11-09 10:11:53,911 INFO L432 NwaCegarLoop]: 1043 mSDtfsCounter, 1572 mSDsluCounter, 8167 mSDsCounter, 0 mSdLazyCounter, 5402 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1587 SdHoareTripleChecker+Valid, 9210 SdHoareTripleChecker+Invalid, 5428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 5402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:11:53,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1587 Valid, 9210 Invalid, 5428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 5402 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 10:11:53,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2024-11-09 10:11:53,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1512. [2024-11-09 10:11:53,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1036 states have (on average 1.6766409266409266) internal successors, (1737), 1500 states have internal predecessors, (1737), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-09 10:11:53,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1762 transitions. [2024-11-09 10:11:53,931 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1762 transitions. Word has length 91 [2024-11-09 10:11:53,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:53,931 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 1762 transitions. [2024-11-09 10:11:53,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:11:53,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1762 transitions. [2024-11-09 10:11:53,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-09 10:11:53,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:53,933 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, 1, 1, 1, 1, 1, 1, 1, 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-09 10:11:53,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 10:11:53,933 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:11:53,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:53,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1708417765, now seen corresponding path program 1 times [2024-11-09 10:11:53,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:11:53,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624131689] [2024-11-09 10:11:53,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:53,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:11:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:54,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 10:11:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:54,720 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-09 10:11:54,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:11:54,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624131689] [2024-11-09 10:11:54,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624131689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:11:54,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:11:54,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 10:11:54,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941859715] [2024-11-09 10:11:54,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:11:54,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 10:11:54,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:11:54,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 10:11:54,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-09 10:11:54,723 INFO L87 Difference]: Start difference. First operand 1512 states and 1762 transitions. Second operand has 13 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:11:56,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:56,990 INFO L93 Difference]: Finished difference Result 1515 states and 1769 transitions. [2024-11-09 10:11:56,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:11:56,990 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2024-11-09 10:11:56,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:56,993 INFO L225 Difference]: With dead ends: 1515 [2024-11-09 10:11:56,993 INFO L226 Difference]: Without dead ends: 1515 [2024-11-09 10:11:56,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2024-11-09 10:11:56,994 INFO L432 NwaCegarLoop]: 1050 mSDtfsCounter, 1554 mSDsluCounter, 5443 mSDsCounter, 0 mSdLazyCounter, 4839 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1569 SdHoareTripleChecker+Valid, 6493 SdHoareTripleChecker+Invalid, 4875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 4839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:11:56,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1569 Valid, 6493 Invalid, 4875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 4839 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-09 10:11:56,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2024-11-09 10:11:57,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1512. [2024-11-09 10:11:57,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1036 states have (on average 1.6756756756756757) internal successors, (1736), 1500 states have internal predecessors, (1736), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-09 10:11:57,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1761 transitions. [2024-11-09 10:11:57,014 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1761 transitions. Word has length 91 [2024-11-09 10:11:57,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:57,014 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 1761 transitions. [2024-11-09 10:11:57,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:11:57,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1761 transitions. [2024-11-09 10:11:57,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 10:11:57,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:57,016 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 10:11:57,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 10:11:57,016 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:11:57,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:57,016 INFO L85 PathProgramCache]: Analyzing trace with hash -29162422, now seen corresponding path program 1 times [2024-11-09 10:11:57,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:11:57,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949505528] [2024-11-09 10:11:57,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:57,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:11:57,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:57,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 10:11:57,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:57,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:11:57,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:11:57,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949505528] [2024-11-09 10:11:57,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949505528] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:11:57,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007730200] [2024-11-09 10:11:57,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:57,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:11:57,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:11:57,594 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:11:57,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 10:11:57,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:57,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 10:11:57,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:11:57,881 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-09 10:11:57,976 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:11:57,976 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-09 10:11:57,983 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 19 treesize of output 1 [2024-11-09 10:11:58,048 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:11:58,051 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 31 treesize of output 32 [2024-11-09 10:11:58,092 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:11:58,092 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 31 treesize of output 32 [2024-11-09 10:11:58,132 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:11:58,132 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 42 treesize of output 41 [2024-11-09 10:11:58,144 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 31 treesize of output 13 [2024-11-09 10:11:58,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:11:58,147 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:11:58,162 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-09 10:11:58,162 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 21 treesize of output 20 [2024-11-09 10:11:58,213 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1390 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1390) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-09 10:11:58,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007730200] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:11:58,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:11:58,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 19 [2024-11-09 10:11:58,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689485997] [2024-11-09 10:11:58,258 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:11:58,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 10:11:58,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:11:58,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 10:11:58,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=388, Unknown=15, NotChecked=40, Total=506 [2024-11-09 10:11:58,259 INFO L87 Difference]: Start difference. First operand 1512 states and 1761 transitions. Second operand has 20 states, 18 states have (on average 7.777777777777778) internal successors, (140), 19 states have internal predecessors, (140), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:12:00,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:00,323 INFO L93 Difference]: Finished difference Result 1514 states and 1768 transitions. [2024-11-09 10:12:00,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 10:12:00,324 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 7.777777777777778) internal successors, (140), 19 states have internal predecessors, (140), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 92 [2024-11-09 10:12:00,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:00,326 INFO L225 Difference]: With dead ends: 1514 [2024-11-09 10:12:00,326 INFO L226 Difference]: Without dead ends: 1514 [2024-11-09 10:12:00,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 93 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=786, Unknown=15, NotChecked=58, Total=992 [2024-11-09 10:12:00,327 INFO L432 NwaCegarLoop]: 1043 mSDtfsCounter, 1545 mSDsluCounter, 7148 mSDsCounter, 0 mSdLazyCounter, 4813 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1560 SdHoareTripleChecker+Valid, 8191 SdHoareTripleChecker+Invalid, 4851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 4813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:00,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1560 Valid, 8191 Invalid, 4851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 4813 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 10:12:00,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2024-11-09 10:12:00,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1511. [2024-11-09 10:12:00,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1511 states, 1036 states have (on average 1.6747104247104247) internal successors, (1735), 1499 states have internal predecessors, (1735), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-09 10:12:00,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 1760 transitions. [2024-11-09 10:12:00,346 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 1760 transitions. Word has length 92 [2024-11-09 10:12:00,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:00,346 INFO L471 AbstractCegarLoop]: Abstraction has 1511 states and 1760 transitions. [2024-11-09 10:12:00,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 7.777777777777778) internal successors, (140), 19 states have internal predecessors, (140), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:12:00,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 1760 transitions. [2024-11-09 10:12:00,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 10:12:00,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:00,348 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 10:12:00,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 10:12:00,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-09 10:12:00,552 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:12:00,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:00,553 INFO L85 PathProgramCache]: Analyzing trace with hash -29162421, now seen corresponding path program 1 times [2024-11-09 10:12:00,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:12:00,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257022689] [2024-11-09 10:12:00,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:00,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:12:00,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:01,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 10:12:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:01,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:12:01,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:12:01,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257022689] [2024-11-09 10:12:01,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257022689] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:12:01,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111071737] [2024-11-09 10:12:01,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:01,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:12:01,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:12:01,303 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:12:01,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 10:12:01,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:01,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-09 10:12:01,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:12:01,566 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-09 10:12:01,645 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:12:01,645 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-09 10:12:01,655 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-09 10:12:01,663 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 19 treesize of output 1 [2024-11-09 10:12:01,666 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 13 treesize of output 9 [2024-11-09 10:12:01,705 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 22 treesize of output 10 [2024-11-09 10:12:01,708 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 9 treesize of output 3 [2024-11-09 10:12:01,789 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:12:01,789 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 62 treesize of output 57 [2024-11-09 10:12:01,793 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 30 treesize of output 13 [2024-11-09 10:12:01,840 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:12:01,841 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 62 treesize of output 57 [2024-11-09 10:12:01,845 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 30 treesize of output 13 [2024-11-09 10:12:01,889 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:12:01,889 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 62 treesize of output 57 [2024-11-09 10:12:01,892 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 30 treesize of output 13 [2024-11-09 10:12:01,908 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 31 treesize of output 13 [2024-11-09 10:12:01,914 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 9 treesize of output 3 [2024-11-09 10:12:01,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:12:01,916 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:12:02,018 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1556 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1556) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1555 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1556) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1555) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-09 10:12:02,036 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1555 (Array Int Int)) (v_ArrVal_1554 (Array Int Int)) (v_ArrVal_1553 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1553))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1554) .cse0 v_ArrVal_1556) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1555) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1554 (Array Int Int)) (v_ArrVal_1553 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1554) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1553) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1556) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))))) is different from false [2024-11-09 10:12:02,050 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1554 (Array Int Int)) (v_ArrVal_1553 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1554) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1553) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1556) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1555 (Array Int Int)) (v_ArrVal_1554 (Array Int Int)) (v_ArrVal_1553 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1553))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1554) .cse2 v_ArrVal_1556) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1555) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2024-11-09 10:12:02,106 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1554 (Array Int Int)) (v_ArrVal_1553 (Array Int Int)) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1561 (Array Int Int))) (<= 0 (+ 8 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1561))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1562) .cse0 v_ArrVal_1554) (select (select (store .cse1 .cse0 v_ArrVal_1553) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1556))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1555 (Array Int Int)) (v_ArrVal_1554 (Array Int Int)) (v_ArrVal_1553 (Array Int Int)) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1561 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1561))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1553))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ 12 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1562) .cse3 v_ArrVal_1554) .cse4 v_ArrVal_1556) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1555) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-09 10:12:02,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111071737] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:12:02,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:12:02,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 18 [2024-11-09 10:12:02,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926172700] [2024-11-09 10:12:02,109 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:12:02,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 10:12:02,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:12:02,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 10:12:02,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=389, Unknown=14, NotChecked=172, Total=650 [2024-11-09 10:12:02,111 INFO L87 Difference]: Start difference. First operand 1511 states and 1760 transitions. Second operand has 19 states, 17 states have (on average 8.117647058823529) internal successors, (138), 18 states have internal predecessors, (138), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:12:06,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:06,917 INFO L93 Difference]: Finished difference Result 1513 states and 1767 transitions. [2024-11-09 10:12:06,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 10:12:06,917 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 8.117647058823529) internal successors, (138), 18 states have internal predecessors, (138), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 92 [2024-11-09 10:12:06,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:06,921 INFO L225 Difference]: With dead ends: 1513 [2024-11-09 10:12:06,921 INFO L226 Difference]: Without dead ends: 1513 [2024-11-09 10:12:06,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=792, Unknown=15, NotChecked=244, Total=1190 [2024-11-09 10:12:06,923 INFO L432 NwaCegarLoop]: 1041 mSDtfsCounter, 1540 mSDsluCounter, 10177 mSDsCounter, 0 mSdLazyCounter, 9779 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1555 SdHoareTripleChecker+Valid, 11218 SdHoareTripleChecker+Invalid, 9807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 9779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:06,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1555 Valid, 11218 Invalid, 9807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 9779 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-09 10:12:06,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2024-11-09 10:12:06,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1498. [2024-11-09 10:12:06,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1498 states, 1025 states have (on average 1.68) internal successors, (1722), 1487 states have internal predecessors, (1722), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:12:06,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 1746 transitions. [2024-11-09 10:12:06,942 INFO L78 Accepts]: Start accepts. Automaton has 1498 states and 1746 transitions. Word has length 92 [2024-11-09 10:12:06,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:06,943 INFO L471 AbstractCegarLoop]: Abstraction has 1498 states and 1746 transitions. [2024-11-09 10:12:06,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 8.117647058823529) internal successors, (138), 18 states have internal predecessors, (138), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:12:06,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 1746 transitions. [2024-11-09 10:12:06,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 10:12:06,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:06,945 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 10:12:06,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 10:12:07,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:12:07,146 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:12:07,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:07,147 INFO L85 PathProgramCache]: Analyzing trace with hash 111786272, now seen corresponding path program 1 times [2024-11-09 10:12:07,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:12:07,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373954441] [2024-11-09 10:12:07,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:07,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:12:07,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:07,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 10:12:07,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:07,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-09 10:12:07,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:12:07,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373954441] [2024-11-09 10:12:07,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373954441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:12:07,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:12:07,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-09 10:12:07,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921904061] [2024-11-09 10:12:07,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:12:07,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 10:12:07,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:12:07,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 10:12:07,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-09 10:12:07,655 INFO L87 Difference]: Start difference. First operand 1498 states and 1746 transitions. Second operand has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:12:10,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:10,578 INFO L93 Difference]: Finished difference Result 1517 states and 1771 transitions. [2024-11-09 10:12:10,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 10:12:10,578 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2024-11-09 10:12:10,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:10,581 INFO L225 Difference]: With dead ends: 1517 [2024-11-09 10:12:10,581 INFO L226 Difference]: Without dead ends: 1517 [2024-11-09 10:12:10,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2024-11-09 10:12:10,582 INFO L432 NwaCegarLoop]: 1042 mSDtfsCounter, 1569 mSDsluCounter, 11201 mSDsCounter, 0 mSdLazyCounter, 7198 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1584 SdHoareTripleChecker+Valid, 12243 SdHoareTripleChecker+Invalid, 7223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 7198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:10,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1584 Valid, 12243 Invalid, 7223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 7198 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-09 10:12:10,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2024-11-09 10:12:10,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1513. [2024-11-09 10:12:10,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1039 states have (on average 1.672762271414822) internal successors, (1738), 1501 states have internal predecessors, (1738), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-09 10:12:10,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 1763 transitions. [2024-11-09 10:12:10,597 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 1763 transitions. Word has length 94 [2024-11-09 10:12:10,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:10,598 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 1763 transitions. [2024-11-09 10:12:10,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:12:10,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1763 transitions. [2024-11-09 10:12:10,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 10:12:10,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:10,599 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 10:12:10,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 10:12:10,599 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:12:10,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:10,600 INFO L85 PathProgramCache]: Analyzing trace with hash 111786273, now seen corresponding path program 1 times [2024-11-09 10:12:10,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:12:10,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353477954] [2024-11-09 10:12:10,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:10,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:12:10,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:11,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 10:12:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:11,372 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-09 10:12:11,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:12:11,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353477954] [2024-11-09 10:12:11,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353477954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:12:11,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:12:11,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 10:12:11,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514655432] [2024-11-09 10:12:11,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:12:11,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:12:11,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:12:11,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:12:11,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:12:11,374 INFO L87 Difference]: Start difference. First operand 1513 states and 1763 transitions. Second operand has 14 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:12:14,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:14,446 INFO L93 Difference]: Finished difference Result 1516 states and 1770 transitions. [2024-11-09 10:12:14,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 10:12:14,446 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2024-11-09 10:12:14,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:14,449 INFO L225 Difference]: With dead ends: 1516 [2024-11-09 10:12:14,449 INFO L226 Difference]: Without dead ends: 1516 [2024-11-09 10:12:14,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-09 10:12:14,450 INFO L432 NwaCegarLoop]: 1049 mSDtfsCounter, 1550 mSDsluCounter, 8062 mSDsCounter, 0 mSdLazyCounter, 7039 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1565 SdHoareTripleChecker+Valid, 9111 SdHoareTripleChecker+Invalid, 7063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 7039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:14,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1565 Valid, 9111 Invalid, 7063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 7039 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-09 10:12:14,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2024-11-09 10:12:14,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1513. [2024-11-09 10:12:14,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1039 states have (on average 1.6717998075072185) internal successors, (1737), 1501 states have internal predecessors, (1737), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-09 10:12:14,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 1762 transitions. [2024-11-09 10:12:14,467 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 1762 transitions. Word has length 94 [2024-11-09 10:12:14,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:14,467 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 1762 transitions. [2024-11-09 10:12:14,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:12:14,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1762 transitions. [2024-11-09 10:12:14,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 10:12:14,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:14,468 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 10:12:14,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 10:12:14,469 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:12:14,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:14,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1193683462, now seen corresponding path program 1 times [2024-11-09 10:12:14,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:12:14,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094437019] [2024-11-09 10:12:14,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:14,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:12:14,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:14,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 10:12:14,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:15,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:12:15,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:12:15,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094437019] [2024-11-09 10:12:15,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094437019] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:12:15,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60224865] [2024-11-09 10:12:15,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:15,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:12:15,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:12:15,026 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:12:15,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 10:12:15,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:15,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 10:12:15,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:12:15,312 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-09 10:12:15,398 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:12:15,399 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-09 10:12:15,404 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 19 treesize of output 1 [2024-11-09 10:12:15,471 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:12:15,471 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 42 treesize of output 41 [2024-11-09 10:12:15,507 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:12:15,507 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 42 treesize of output 41 [2024-11-09 10:12:15,540 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:12:15,541 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 42 treesize of output 41 [2024-11-09 10:12:15,587 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:12:15,587 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 42 treesize of output 41 [2024-11-09 10:12:15,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 10:12:15,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:12:15,603 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:12:15,611 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1875 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1875) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-09 10:12:15,614 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1875 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1875) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-09 10:12:15,621 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1875 (Array Int Int)) (v_ArrVal_1874 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1874))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1875)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-09 10:12:15,664 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1875 (Array Int Int)) (v_ArrVal_1874 (Array Int Int)) (v_ArrVal_1873 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1873))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1874)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1875)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-09 10:12:15,740 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2024-11-09 10:12:15,740 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 105 treesize of output 104 [2024-11-09 10:12:15,747 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1878 (Array Int Int)) (v_ArrVal_1875 (Array Int Int)) (v_ArrVal_1874 (Array Int Int)) (v_ArrVal_1873 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1878))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1873)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1874)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1875)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2024-11-09 10:12:15,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60224865] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:12:15,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:12:15,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 21 [2024-11-09 10:12:15,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255260726] [2024-11-09 10:12:15,749 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:12:15,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 10:12:15,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:12:15,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 10:12:15,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=457, Unknown=21, NotChecked=240, Total=812 [2024-11-09 10:12:15,751 INFO L87 Difference]: Start difference. First operand 1513 states and 1762 transitions. Second operand has 22 states, 20 states have (on average 7.2) internal successors, (144), 21 states have internal predecessors, (144), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:12:18,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:18,624 INFO L93 Difference]: Finished difference Result 1515 states and 1769 transitions. [2024-11-09 10:12:18,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 10:12:18,624 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 7.2) internal successors, (144), 21 states have internal predecessors, (144), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 95 [2024-11-09 10:12:18,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:18,626 INFO L225 Difference]: With dead ends: 1515 [2024-11-09 10:12:18,626 INFO L226 Difference]: Without dead ends: 1515 [2024-11-09 10:12:18,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=938, Unknown=21, NotChecked=340, Total=1482 [2024-11-09 10:12:18,628 INFO L432 NwaCegarLoop]: 1042 mSDtfsCounter, 1542 mSDsluCounter, 11177 mSDsCounter, 0 mSdLazyCounter, 7164 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1557 SdHoareTripleChecker+Valid, 12219 SdHoareTripleChecker+Invalid, 7201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 7164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:18,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1557 Valid, 12219 Invalid, 7201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 7164 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-09 10:12:18,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2024-11-09 10:12:18,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1512. [2024-11-09 10:12:18,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1039 states have (on average 1.670837343599615) internal successors, (1736), 1500 states have internal predecessors, (1736), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-09 10:12:18,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1761 transitions. [2024-11-09 10:12:18,642 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1761 transitions. Word has length 95 [2024-11-09 10:12:18,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:18,642 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 1761 transitions. [2024-11-09 10:12:18,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 7.2) internal successors, (144), 21 states have internal predecessors, (144), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:12:18,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1761 transitions. [2024-11-09 10:12:18,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 10:12:18,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:18,643 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 10:12:18,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 10:12:18,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:12:18,844 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:12:18,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:18,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1193683461, now seen corresponding path program 1 times [2024-11-09 10:12:18,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:12:18,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140157208] [2024-11-09 10:12:18,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:18,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:12:18,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat