./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-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 fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 17:09:17,277 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 17:09:17,372 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-20 17:09:17,377 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 17:09:17,377 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 17:09:17,397 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 17:09:17,397 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 17:09:17,398 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 17:09:17,398 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 17:09:17,398 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 17:09:17,399 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 17:09:17,399 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 17:09:17,400 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 17:09:17,400 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 17:09:17,401 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 17:09:17,401 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 17:09:17,401 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 17:09:17,402 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 17:09:17,402 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 17:09:17,402 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 17:09:17,403 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 17:09:17,403 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 17:09:17,404 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 17:09:17,404 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 17:09:17,404 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 17:09:17,405 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 17:09:17,405 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 17:09:17,405 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 17:09:17,406 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 17:09:17,406 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 17:09:17,406 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 17:09:17,407 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 17:09:17,407 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 17:09:17,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:09:17,407 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 17:09:17,408 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 17:09:17,408 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 17:09:17,408 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 17:09:17,409 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 17:09:17,409 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 17:09:17,409 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 17:09:17,409 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 17:09:17,410 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 -> fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 [2024-11-20 17:09:17,633 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 17:09:17,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 17:09:17,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 17:09:17,664 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 17:09:17,665 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 17:09:17,666 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-1.i [2024-11-20 17:09:19,167 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 17:09:19,432 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 17:09:19,433 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-1.i [2024-11-20 17:09:19,450 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5384a548f/7c1e0c4e243a49f9a749d1a161921536/FLAG4cacd74bd [2024-11-20 17:09:19,743 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5384a548f/7c1e0c4e243a49f9a749d1a161921536 [2024-11-20 17:09:19,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 17:09:19,747 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 17:09:19,748 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 17:09:19,748 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 17:09:19,753 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 17:09:19,754 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:09:19" (1/1) ... [2024-11-20 17:09:19,757 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61849d7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:19, skipping insertion in model container [2024-11-20 17:09:19,757 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:09:19" (1/1) ... [2024-11-20 17:09:19,822 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 17:09:20,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-20 17:09:20,283 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-20 17:09:20,290 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-20 17:09:20,297 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-20 17:09:20,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-20 17:09:20,325 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-20 17:09:20,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:09:20,352 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 17:09:20,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:09:20,489 INFO L204 MainTranslator]: Completed translation [2024-11-20 17:09:20,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:20 WrapperNode [2024-11-20 17:09:20,490 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 17:09:20,491 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 17:09:20,492 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 17:09:20,492 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 17:09:20,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:20" (1/1) ... [2024-11-20 17:09:20,521 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:20" (1/1) ... [2024-11-20 17:09:20,574 INFO L138 Inliner]: procedures = 176, calls = 170, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 805 [2024-11-20 17:09:20,574 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 17:09:20,575 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 17:09:20,577 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 17:09:20,577 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 17:09:20,592 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:20" (1/1) ... [2024-11-20 17:09:20,592 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:20" (1/1) ... [2024-11-20 17:09:20,602 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:20" (1/1) ... [2024-11-20 17:09:20,664 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2024-11-20 17:09:20,666 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:20" (1/1) ... [2024-11-20 17:09:20,666 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:20" (1/1) ... [2024-11-20 17:09:20,697 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:20" (1/1) ... [2024-11-20 17:09:20,713 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:20" (1/1) ... [2024-11-20 17:09:20,719 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:20" (1/1) ... [2024-11-20 17:09:20,728 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:20" (1/1) ... [2024-11-20 17:09:20,743 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 17:09:20,744 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 17:09:20,744 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 17:09:20,745 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 17:09:20,745 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:20" (1/1) ... [2024-11-20 17:09:20,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:09:20,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:09:20,780 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-20 17:09:20,785 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-20 17:09:20,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 17:09:20,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 17:09:20,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 17:09:20,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 17:09:20,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-20 17:09:20,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-20 17:09:20,834 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-20 17:09:20,835 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-20 17:09:20,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 17:09:20,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 17:09:20,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-20 17:09:20,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-20 17:09:20,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-20 17:09:20,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-20 17:09:20,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 17:09:20,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 17:09:20,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 17:09:20,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 17:09:20,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 17:09:20,996 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 17:09:20,999 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 17:09:21,003 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-20 17:09:21,042 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-20 17:09:22,488 INFO L? ?]: Removed 762 outVars from TransFormulas that were not future-live. [2024-11-20 17:09:22,488 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 17:09:22,525 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 17:09:22,526 INFO L316 CfgBuilder]: Removed 31 assume(true) statements. [2024-11-20 17:09:22,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:09:22 BoogieIcfgContainer [2024-11-20 17:09:22,526 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 17:09:22,528 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 17:09:22,529 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 17:09:22,533 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 17:09:22,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:09:19" (1/3) ... [2024-11-20 17:09:22,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fa3ac3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:09:22, skipping insertion in model container [2024-11-20 17:09:22,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:20" (2/3) ... [2024-11-20 17:09:22,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fa3ac3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:09:22, skipping insertion in model container [2024-11-20 17:09:22,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:09:22" (3/3) ... [2024-11-20 17:09:22,536 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_nondet_test1-1.i [2024-11-20 17:09:22,552 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 17:09:22,553 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 320 error locations. [2024-11-20 17:09:22,629 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 17:09:22,638 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;@2b6887b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 17:09:22,639 INFO L334 AbstractCegarLoop]: Starting to check reachability of 320 error locations. [2024-11-20 17:09:22,646 INFO L276 IsEmpty]: Start isEmpty. Operand has 737 states, 415 states have (on average 2.0626506024096387) internal successors, (856), 732 states have internal predecessors, (856), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 17:09:22,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-20 17:09:22,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:09:22,656 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-20 17:09:22,657 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-20 17:09:22,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:09:22,666 INFO L85 PathProgramCache]: Analyzing trace with hash 45876316, now seen corresponding path program 1 times [2024-11-20 17:09:22,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:09:22,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076303514] [2024-11-20 17:09:22,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:09:22,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:09:22,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:22,883 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-20 17:09:22,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:09:22,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076303514] [2024-11-20 17:09:22,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076303514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:09:22,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:09:22,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 17:09:22,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920005309] [2024-11-20 17:09:22,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:09:22,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:09:22,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:09:22,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:09:22,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:09:22,931 INFO L87 Difference]: Start difference. First operand has 737 states, 415 states have (on average 2.0626506024096387) internal successors, (856), 732 states have internal predecessors, (856), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) 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-20 17:09:23,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:09:23,545 INFO L93 Difference]: Finished difference Result 680 states and 769 transitions. [2024-11-20 17:09:23,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:09:23,548 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-20 17:09:23,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:09:23,571 INFO L225 Difference]: With dead ends: 680 [2024-11-20 17:09:23,572 INFO L226 Difference]: Without dead ends: 678 [2024-11-20 17:09:23,573 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-20 17:09:23,576 INFO L432 NwaCegarLoop]: 457 mSDtfsCounter, 678 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 17:09:23,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 469 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 17:09:23,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2024-11-20 17:09:23,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 676. [2024-11-20 17:09:23,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 409 states have (on average 1.8533007334963325) internal successors, (758), 671 states have internal predecessors, (758), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 17:09:23,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 764 transitions. [2024-11-20 17:09:23,672 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 764 transitions. Word has length 5 [2024-11-20 17:09:23,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:09:23,672 INFO L471 AbstractCegarLoop]: Abstraction has 676 states and 764 transitions. [2024-11-20 17:09:23,672 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-20 17:09:23,673 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 764 transitions. [2024-11-20 17:09:23,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-20 17:09:23,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:09:23,673 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-20 17:09:23,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 17:09:23,674 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-20 17:09:23,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:09:23,675 INFO L85 PathProgramCache]: Analyzing trace with hash 45876317, now seen corresponding path program 1 times [2024-11-20 17:09:23,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:09:23,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763983403] [2024-11-20 17:09:23,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:09:23,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:09:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:23,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:09:23,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:09:23,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763983403] [2024-11-20 17:09:23,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763983403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:09:23,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:09:23,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 17:09:23,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709607017] [2024-11-20 17:09:23,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:09:23,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:09:23,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:09:23,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:09:23,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:09:23,787 INFO L87 Difference]: Start difference. First operand 676 states and 764 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-20 17:09:24,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:09:24,241 INFO L93 Difference]: Finished difference Result 753 states and 847 transitions. [2024-11-20 17:09:24,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:09:24,242 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-20 17:09:24,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:09:24,245 INFO L225 Difference]: With dead ends: 753 [2024-11-20 17:09:24,246 INFO L226 Difference]: Without dead ends: 753 [2024-11-20 17:09:24,247 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-20 17:09:24,250 INFO L432 NwaCegarLoop]: 634 mSDtfsCounter, 416 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 17:09:24,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 828 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 17:09:24,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2024-11-20 17:09:24,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 705. [2024-11-20 17:09:24,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 449 states have (on average 1.8396436525612472) internal successors, (826), 700 states have internal predecessors, (826), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 17:09:24,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 832 transitions. [2024-11-20 17:09:24,284 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 832 transitions. Word has length 5 [2024-11-20 17:09:24,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:09:24,284 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 832 transitions. [2024-11-20 17:09:24,284 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-20 17:09:24,285 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 832 transitions. [2024-11-20 17:09:24,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-20 17:09:24,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:09:24,285 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-20 17:09:24,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 17:09:24,286 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr314REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-20 17:09:24,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:09:24,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1423342697, now seen corresponding path program 1 times [2024-11-20 17:09:24,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:09:24,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010104752] [2024-11-20 17:09:24,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:09:24,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:09:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:24,316 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-20 17:09:24,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:09:24,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010104752] [2024-11-20 17:09:24,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010104752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:09:24,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:09:24,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:09:24,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76605256] [2024-11-20 17:09:24,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:09:24,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:09:24,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:09:24,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:09:24,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:09:24,319 INFO L87 Difference]: Start difference. First operand 705 states and 832 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-20 17:09:24,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:09:24,363 INFO L93 Difference]: Finished difference Result 1386 states and 1639 transitions. [2024-11-20 17:09:24,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:09:24,364 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-20 17:09:24,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:09:24,370 INFO L225 Difference]: With dead ends: 1386 [2024-11-20 17:09:24,371 INFO L226 Difference]: Without dead ends: 1386 [2024-11-20 17:09:24,373 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-20 17:09:24,374 INFO L432 NwaCegarLoop]: 750 mSDtfsCounter, 721 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:09:24,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 1498 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:09:24,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2024-11-20 17:09:24,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 706. [2024-11-20 17:09:24,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 450 states have (on average 1.8377777777777777) internal successors, (827), 701 states have internal predecessors, (827), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 17:09:24,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 833 transitions. [2024-11-20 17:09:24,397 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 833 transitions. Word has length 6 [2024-11-20 17:09:24,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:09:24,398 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 833 transitions. [2024-11-20 17:09:24,398 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-20 17:09:24,398 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 833 transitions. [2024-11-20 17:09:24,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-20 17:09:24,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:09:24,401 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:09:24,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 17:09:24,401 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-20 17:09:24,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:09:24,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1612480742, now seen corresponding path program 1 times [2024-11-20 17:09:24,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:09:24,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266939895] [2024-11-20 17:09:24,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:09:24,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:09:24,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:24,534 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-20 17:09:24,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:09:24,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266939895] [2024-11-20 17:09:24,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266939895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:09:24,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:09:24,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:09:24,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145097621] [2024-11-20 17:09:24,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:09:24,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:09:24,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:09:24,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:09:24,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:09:24,538 INFO L87 Difference]: Start difference. First operand 706 states and 833 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:09:25,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:09:25,096 INFO L93 Difference]: Finished difference Result 732 states and 886 transitions. [2024-11-20 17:09:25,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:09:25,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-20 17:09:25,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:09:25,099 INFO L225 Difference]: With dead ends: 732 [2024-11-20 17:09:25,099 INFO L226 Difference]: Without dead ends: 732 [2024-11-20 17:09:25,100 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-20 17:09:25,101 INFO L432 NwaCegarLoop]: 429 mSDtfsCounter, 942 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 17:09:25,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [945 Valid, 730 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 17:09:25,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2024-11-20 17:09:25,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 683. [2024-11-20 17:09:25,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 450 states have (on average 1.7866666666666666) internal successors, (804), 678 states have internal predecessors, (804), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 17:09:25,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 810 transitions. [2024-11-20 17:09:25,121 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 810 transitions. Word has length 15 [2024-11-20 17:09:25,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:09:25,122 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 810 transitions. [2024-11-20 17:09:25,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:09:25,123 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 810 transitions. [2024-11-20 17:09:25,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-20 17:09:25,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:09:25,123 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:09:25,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 17:09:25,124 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-20 17:09:25,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:09:25,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1612480743, now seen corresponding path program 1 times [2024-11-20 17:09:25,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:09:25,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881482850] [2024-11-20 17:09:25,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:09:25,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:09:25,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:25,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-20 17:09:25,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:09:25,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881482850] [2024-11-20 17:09:25,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881482850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:09:25,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:09:25,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:09:25,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4077028] [2024-11-20 17:09:25,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:09:25,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:09:25,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:09:25,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:09:25,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:09:25,247 INFO L87 Difference]: Start difference. First operand 683 states and 810 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:09:25,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:09:25,282 INFO L93 Difference]: Finished difference Result 608 states and 707 transitions. [2024-11-20 17:09:25,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:09:25,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-20 17:09:25,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:09:25,285 INFO L225 Difference]: With dead ends: 608 [2024-11-20 17:09:25,285 INFO L226 Difference]: Without dead ends: 608 [2024-11-20 17:09:25,286 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-20 17:09:25,289 INFO L432 NwaCegarLoop]: 615 mSDtfsCounter, 61 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1177 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-20 17:09:25,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1177 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:09:25,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-11-20 17:09:25,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2024-11-20 17:09:25,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 387 states have (on average 1.8113695090439277) internal successors, (701), 603 states have internal predecessors, (701), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 17:09:25,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 707 transitions. [2024-11-20 17:09:25,303 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 707 transitions. Word has length 15 [2024-11-20 17:09:25,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:09:25,304 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 707 transitions. [2024-11-20 17:09:25,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-20 17:09:25,304 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 707 transitions. [2024-11-20 17:09:25,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-20 17:09:25,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:09:25,305 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:09:25,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 17:09:25,305 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-20 17:09:25,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:09:25,306 INFO L85 PathProgramCache]: Analyzing trace with hash -889043613, now seen corresponding path program 1 times [2024-11-20 17:09:25,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:09:25,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399431458] [2024-11-20 17:09:25,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:09:25,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:09:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:25,385 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-20 17:09:25,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:09:25,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399431458] [2024-11-20 17:09:25,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399431458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:09:25,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:09:25,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:09:25,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793178821] [2024-11-20 17:09:25,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:09:25,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:09:25,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:09:25,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:09:25,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:09:25,387 INFO L87 Difference]: Start difference. First operand 608 states and 707 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-20 17:09:25,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:09:25,447 INFO L93 Difference]: Finished difference Result 590 states and 682 transitions. [2024-11-20 17:09:25,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:09:25,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2024-11-20 17:09:25,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:09:25,450 INFO L225 Difference]: With dead ends: 590 [2024-11-20 17:09:25,450 INFO L226 Difference]: Without dead ends: 590 [2024-11-20 17:09:25,450 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-20 17:09:25,452 INFO L432 NwaCegarLoop]: 580 mSDtfsCounter, 41 mSDsluCounter, 1132 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1712 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:09:25,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1712 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:09:25,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2024-11-20 17:09:25,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 587. [2024-11-20 17:09:25,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 373 states have (on average 1.804289544235925) internal successors, (673), 582 states have internal predecessors, (673), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 17:09:25,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 679 transitions. [2024-11-20 17:09:25,466 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 679 transitions. Word has length 17 [2024-11-20 17:09:25,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:09:25,466 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 679 transitions. [2024-11-20 17:09:25,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-20 17:09:25,467 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 679 transitions. [2024-11-20 17:09:25,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-20 17:09:25,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:09:25,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] [2024-11-20 17:09:25,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 17:09:25,468 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-20 17:09:25,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:09:25,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1279459759, now seen corresponding path program 1 times [2024-11-20 17:09:25,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:09:25,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654322477] [2024-11-20 17:09:25,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:09:25,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:09:25,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:25,654 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-20 17:09:25,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:09:25,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654322477] [2024-11-20 17:09:25,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654322477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:09:25,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:09:25,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:09:25,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306791266] [2024-11-20 17:09:25,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:09:25,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:09:25,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:09:25,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:09:25,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:09:25,658 INFO L87 Difference]: Start difference. First operand 587 states and 679 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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-20 17:09:26,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:09:26,197 INFO L93 Difference]: Finished difference Result 680 states and 766 transitions. [2024-11-20 17:09:26,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:09:26,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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 31 [2024-11-20 17:09:26,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:09:26,200 INFO L225 Difference]: With dead ends: 680 [2024-11-20 17:09:26,200 INFO L226 Difference]: Without dead ends: 680 [2024-11-20 17:09:26,200 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-20 17:09:26,201 INFO L432 NwaCegarLoop]: 516 mSDtfsCounter, 417 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 17:09:26,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 1011 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 17:09:26,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2024-11-20 17:09:26,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 583. [2024-11-20 17:09:26,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 373 states have (on average 1.7935656836461127) internal successors, (669), 578 states have internal predecessors, (669), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 17:09:26,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 675 transitions. [2024-11-20 17:09:26,216 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 675 transitions. Word has length 31 [2024-11-20 17:09:26,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:09:26,217 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 675 transitions. [2024-11-20 17:09:26,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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-20 17:09:26,218 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 675 transitions. [2024-11-20 17:09:26,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-20 17:09:26,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:09:26,221 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] [2024-11-20 17:09:26,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 17:09:26,222 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-20 17:09:26,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:09:26,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1848554501, now seen corresponding path program 1 times [2024-11-20 17:09:26,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:09:26,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405915994] [2024-11-20 17:09:26,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:09:26,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:09:26,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:26,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:09:26,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:09:26,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405915994] [2024-11-20 17:09:26,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405915994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:09:26,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:09:26,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:09:26,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210786415] [2024-11-20 17:09:26,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:09:26,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:09:26,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:09:26,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:09:26,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:09:26,333 INFO L87 Difference]: Start difference. First operand 583 states and 675 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-20 17:09:26,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:09:26,378 INFO L93 Difference]: Finished difference Result 583 states and 671 transitions. [2024-11-20 17:09:26,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:09:26,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 65 [2024-11-20 17:09:26,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:09:26,381 INFO L225 Difference]: With dead ends: 583 [2024-11-20 17:09:26,381 INFO L226 Difference]: Without dead ends: 583 [2024-11-20 17:09:26,381 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-20 17:09:26,381 INFO L432 NwaCegarLoop]: 575 mSDtfsCounter, 21 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1694 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-20 17:09:26,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1694 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:09:26,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2024-11-20 17:09:26,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2024-11-20 17:09:26,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 373 states have (on average 1.7828418230563003) internal successors, (665), 578 states have internal predecessors, (665), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 17:09:26,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 671 transitions. [2024-11-20 17:09:26,395 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 671 transitions. Word has length 65 [2024-11-20 17:09:26,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:09:26,397 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 671 transitions. [2024-11-20 17:09:26,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-20 17:09:26,397 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 671 transitions. [2024-11-20 17:09:26,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-20 17:09:26,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:09:26,398 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] [2024-11-20 17:09:26,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 17:09:26,398 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-20 17:09:26,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:09:26,398 INFO L85 PathProgramCache]: Analyzing trace with hash -516543407, now seen corresponding path program 1 times [2024-11-20 17:09:26,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:09:26,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122932269] [2024-11-20 17:09:26,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:09:26,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:09:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:26,528 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-20 17:09:26,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:09:26,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122932269] [2024-11-20 17:09:26,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122932269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:09:26,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:09:26,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:09:26,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926638774] [2024-11-20 17:09:26,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:09:26,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:09:26,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:09:26,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:09:26,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:09:26,531 INFO L87 Difference]: Start difference. First operand 583 states and 671 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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-20 17:09:26,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:09:26,575 INFO L93 Difference]: Finished difference Result 679 states and 794 transitions. [2024-11-20 17:09:26,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:09:26,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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 73 [2024-11-20 17:09:26,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:09:26,578 INFO L225 Difference]: With dead ends: 679 [2024-11-20 17:09:26,578 INFO L226 Difference]: Without dead ends: 679 [2024-11-20 17:09:26,579 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-20 17:09:26,579 INFO L432 NwaCegarLoop]: 590 mSDtfsCounter, 54 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:09:26,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1152 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:09:26,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2024-11-20 17:09:26,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 679. [2024-11-20 17:09:26,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 469 states have (on average 1.6801705756929637) internal successors, (788), 674 states have internal predecessors, (788), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 17:09:26,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 794 transitions. [2024-11-20 17:09:26,591 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 794 transitions. Word has length 73 [2024-11-20 17:09:26,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:09:26,591 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 794 transitions. [2024-11-20 17:09:26,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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-20 17:09:26,592 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 794 transitions. [2024-11-20 17:09:26,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-20 17:09:26,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:09:26,592 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] [2024-11-20 17:09:26,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 17:09:26,593 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-20 17:09:26,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:09:26,593 INFO L85 PathProgramCache]: Analyzing trace with hash 416038488, now seen corresponding path program 1 times [2024-11-20 17:09:26,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:09:26,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264133762] [2024-11-20 17:09:26,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:09:26,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:09:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:27,138 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-20 17:09:27,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:09:27,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264133762] [2024-11-20 17:09:27,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264133762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:09:27,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:09:27,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 17:09:27,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141598537] [2024-11-20 17:09:27,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:09:27,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 17:09:27,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:09:27,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 17:09:27,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:09:27,141 INFO L87 Difference]: Start difference. First operand 679 states and 794 transitions. Second operand has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 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-20 17:09:27,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:09:27,943 INFO L93 Difference]: Finished difference Result 641 states and 756 transitions. [2024-11-20 17:09:27,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:09:27,943 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 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 76 [2024-11-20 17:09:27,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:09:27,946 INFO L225 Difference]: With dead ends: 641 [2024-11-20 17:09:27,946 INFO L226 Difference]: Without dead ends: 641 [2024-11-20 17:09:27,946 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-20 17:09:27,947 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 472 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 17:09:27,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 683 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 17:09:27,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2024-11-20 17:09:27,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 601. [2024-11-20 17:09:27,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 429 states have (on average 1.564102564102564) internal successors, (671), 596 states have internal predecessors, (671), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 17:09:27,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 677 transitions. [2024-11-20 17:09:27,957 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 677 transitions. Word has length 76 [2024-11-20 17:09:27,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:09:27,958 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 677 transitions. [2024-11-20 17:09:27,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 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-20 17:09:27,958 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 677 transitions. [2024-11-20 17:09:27,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-20 17:09:27,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:09:27,961 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] [2024-11-20 17:09:27,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 17:09:27,961 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-20 17:09:27,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:09:27,962 INFO L85 PathProgramCache]: Analyzing trace with hash 157004196, now seen corresponding path program 1 times [2024-11-20 17:09:27,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:09:27,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600597071] [2024-11-20 17:09:27,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:09:27,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:09:27,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:28,273 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-20 17:09:28,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:09:28,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600597071] [2024-11-20 17:09:28,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600597071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:09:28,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:09:28,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:09:28,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283676355] [2024-11-20 17:09:28,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:09:28,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:09:28,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:09:28,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:09:28,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:09:28,277 INFO L87 Difference]: Start difference. First operand 601 states and 677 transitions. Second operand has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 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-20 17:09:28,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:09:28,764 INFO L93 Difference]: Finished difference Result 600 states and 676 transitions. [2024-11-20 17:09:28,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 17:09:28,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 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 81 [2024-11-20 17:09:28,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:09:28,767 INFO L225 Difference]: With dead ends: 600 [2024-11-20 17:09:28,768 INFO L226 Difference]: Without dead ends: 600 [2024-11-20 17:09:28,768 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-20 17:09:28,769 INFO L432 NwaCegarLoop]: 548 mSDtfsCounter, 2 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 17:09:28,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1506 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 17:09:28,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-11-20 17:09:28,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2024-11-20 17:09:28,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 429 states have (on average 1.5617715617715617) internal successors, (670), 595 states have internal predecessors, (670), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 17:09:28,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 676 transitions. [2024-11-20 17:09:28,779 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 676 transitions. Word has length 81 [2024-11-20 17:09:28,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:09:28,780 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 676 transitions. [2024-11-20 17:09:28,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 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-20 17:09:28,780 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 676 transitions. [2024-11-20 17:09:28,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-20 17:09:28,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:09:28,781 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] [2024-11-20 17:09:28,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 17:09:28,782 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-20 17:09:28,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:09:28,782 INFO L85 PathProgramCache]: Analyzing trace with hash 157004197, now seen corresponding path program 1 times [2024-11-20 17:09:28,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:09:28,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292362018] [2024-11-20 17:09:28,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:09:28,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:09:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:29,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-20 17:09:29,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:09:29,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292362018] [2024-11-20 17:09:29,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292362018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:09:29,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:09:29,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:09:29,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121442346] [2024-11-20 17:09:29,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:09:29,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:09:29,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:09:29,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:09:29,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:09:29,247 INFO L87 Difference]: Start difference. First operand 600 states and 676 transitions. Second operand has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 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-20 17:09:29,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:09:29,794 INFO L93 Difference]: Finished difference Result 599 states and 675 transitions. [2024-11-20 17:09:29,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 17:09:29,795 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 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 81 [2024-11-20 17:09:29,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:09:29,797 INFO L225 Difference]: With dead ends: 599 [2024-11-20 17:09:29,797 INFO L226 Difference]: Without dead ends: 599 [2024-11-20 17:09:29,797 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-20 17:09:29,798 INFO L432 NwaCegarLoop]: 548 mSDtfsCounter, 1 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 17:09:29,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1515 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 17:09:29,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2024-11-20 17:09:29,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2024-11-20 17:09:29,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 428 states have (on average 1.5630841121495327) internal successors, (669), 594 states have internal predecessors, (669), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 17:09:29,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 675 transitions. [2024-11-20 17:09:29,808 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 675 transitions. Word has length 81 [2024-11-20 17:09:29,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:09:29,809 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 675 transitions. [2024-11-20 17:09:29,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 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-20 17:09:29,809 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 675 transitions. [2024-11-20 17:09:29,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-20 17:09:29,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:09:29,810 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-20 17:09:29,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 17:09:29,810 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-20 17:09:29,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:09:29,811 INFO L85 PathProgramCache]: Analyzing trace with hash 896889099, now seen corresponding path program 1 times [2024-11-20 17:09:29,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:09:29,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992040543] [2024-11-20 17:09:29,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:09:29,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:09:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:30,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 17:09:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:30,064 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-20 17:09:30,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:09:30,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992040543] [2024-11-20 17:09:30,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992040543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:09:30,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:09:30,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 17:09:30,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716577437] [2024-11-20 17:09:30,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:09:30,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 17:09:30,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:09:30,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 17:09:30,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 17:09:30,068 INFO L87 Difference]: Start difference. First operand 599 states and 675 transitions. Second operand has 7 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 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-20 17:09:30,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:09:30,740 INFO L93 Difference]: Finished difference Result 611 states and 690 transitions. [2024-11-20 17:09:30,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 17:09:30,741 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 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 89 [2024-11-20 17:09:30,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:09:30,746 INFO L225 Difference]: With dead ends: 611 [2024-11-20 17:09:30,746 INFO L226 Difference]: Without dead ends: 611 [2024-11-20 17:09:30,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-20 17:09:30,747 INFO L432 NwaCegarLoop]: 540 mSDtfsCounter, 10 mSDsluCounter, 1782 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2322 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 17:09:30,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2322 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 17:09:30,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2024-11-20 17:09:30,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 605. [2024-11-20 17:09:30,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 433 states have (on average 1.5612009237875288) internal successors, (676), 599 states have internal predecessors, (676), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-20 17:09:30,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 685 transitions. [2024-11-20 17:09:30,760 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 685 transitions. Word has length 89 [2024-11-20 17:09:30,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:09:30,760 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 685 transitions. [2024-11-20 17:09:30,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 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-20 17:09:30,760 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 685 transitions. [2024-11-20 17:09:30,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-20 17:09:30,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:09:30,761 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-20 17:09:30,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 17:09:30,761 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-20 17:09:30,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:09:30,762 INFO L85 PathProgramCache]: Analyzing trace with hash 896889100, now seen corresponding path program 1 times [2024-11-20 17:09:30,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:09:30,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413116261] [2024-11-20 17:09:30,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:09:30,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:09:30,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:31,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 17:09:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:31,316 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-20 17:09:31,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:09:31,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413116261] [2024-11-20 17:09:31,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413116261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:09:31,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:09:31,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 17:09:31,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311881496] [2024-11-20 17:09:31,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:09:31,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 17:09:31,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:09:31,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 17:09:31,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 17:09:31,319 INFO L87 Difference]: Start difference. First operand 605 states and 685 transitions. Second operand has 7 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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-20 17:09:31,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:09:31,922 INFO L93 Difference]: Finished difference Result 605 states and 684 transitions. [2024-11-20 17:09:31,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 17:09:31,923 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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 89 [2024-11-20 17:09:31,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:09:31,926 INFO L225 Difference]: With dead ends: 605 [2024-11-20 17:09:31,926 INFO L226 Difference]: Without dead ends: 605 [2024-11-20 17:09:31,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-20 17:09:31,926 INFO L432 NwaCegarLoop]: 544 mSDtfsCounter, 5 mSDsluCounter, 1406 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 17:09:31,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1950 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 17:09:31,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-20 17:09:31,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2024-11-20 17:09:31,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 433 states have (on average 1.5588914549653579) internal successors, (675), 599 states have internal predecessors, (675), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-20 17:09:31,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 684 transitions. [2024-11-20 17:09:31,938 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 684 transitions. Word has length 89 [2024-11-20 17:09:31,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:09:31,938 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 684 transitions. [2024-11-20 17:09:31,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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-20 17:09:31,938 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 684 transitions. [2024-11-20 17:09:31,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-20 17:09:31,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:09:31,939 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] [2024-11-20 17:09:31,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 17:09:31,940 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-20 17:09:31,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:09:31,940 INFO L85 PathProgramCache]: Analyzing trace with hash -962114482, now seen corresponding path program 1 times [2024-11-20 17:09:31,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:09:31,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202015134] [2024-11-20 17:09:31,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:09:31,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:09:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:32,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 17:09:32,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:32,487 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-20 17:09:32,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:09:32,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202015134] [2024-11-20 17:09:32,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202015134] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:09:32,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139944630] [2024-11-20 17:09:32,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:09:32,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:09:32,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:09:32,491 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-20 17:09:32,492 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-20 17:09:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:32,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-20 17:09:32,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:09:32,834 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 17:09:32,835 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-20 17:09:32,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 17:09:32,929 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:09:32,929 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-20 17:09:32,962 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-20 17:09:32,965 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-20 17:09:32,965 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:09:33,012 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-20 17:09:33,012 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-20 17:09:33,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139944630] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:09:33,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 17:09:33,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 14 [2024-11-20 17:09:33,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8030551] [2024-11-20 17:09:33,054 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 17:09:33,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-20 17:09:33,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:09:33,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-20 17:09:33,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=195, Unknown=7, NotChecked=0, Total=240 [2024-11-20 17:09:33,055 INFO L87 Difference]: Start difference. First operand 605 states and 684 transitions. Second operand has 15 states, 13 states have (on average 8.0) internal successors, (104), 13 states have internal predecessors, (104), 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-20 17:09:34,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:09:34,364 INFO L93 Difference]: Finished difference Result 604 states and 683 transitions. [2024-11-20 17:09:34,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 17:09:34,365 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 8.0) internal successors, (104), 13 states have internal predecessors, (104), 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 90 [2024-11-20 17:09:34,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:09:34,368 INFO L225 Difference]: With dead ends: 604 [2024-11-20 17:09:34,369 INFO L226 Difference]: Without dead ends: 604 [2024-11-20 17:09:34,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=452, Unknown=7, NotChecked=0, Total=552 [2024-11-20 17:09:34,371 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 483 mSDsluCounter, 2451 mSDsCounter, 0 mSdLazyCounter, 2135 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 2776 SdHoareTripleChecker+Invalid, 2152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 17:09:34,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 2776 Invalid, 2152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2135 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 17:09:34,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-11-20 17:09:34,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2024-11-20 17:09:34,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 433 states have (on average 1.556581986143187) internal successors, (674), 598 states have internal predecessors, (674), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-20 17:09:34,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 683 transitions. [2024-11-20 17:09:34,384 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 683 transitions. Word has length 90 [2024-11-20 17:09:34,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:09:34,385 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 683 transitions. [2024-11-20 17:09:34,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 8.0) internal successors, (104), 13 states have internal predecessors, (104), 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-20 17:09:34,385 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 683 transitions. [2024-11-20 17:09:34,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-20 17:09:34,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:09:34,386 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] [2024-11-20 17:09:34,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 17:09:34,590 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,SelfDestructingSolverStorable14 [2024-11-20 17:09:34,592 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-20 17:09:34,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:09:34,592 INFO L85 PathProgramCache]: Analyzing trace with hash -962114481, now seen corresponding path program 1 times [2024-11-20 17:09:34,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:09:34,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949428131] [2024-11-20 17:09:34,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:09:34,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:09:34,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:35,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 17:09:35,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:35,373 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-20 17:09:35,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:09:35,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949428131] [2024-11-20 17:09:35,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949428131] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:09:35,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658358981] [2024-11-20 17:09:35,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:09:35,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:09:35,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:09:35,377 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-20 17:09:35,378 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-20 17:09:35,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:35,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-20 17:09:35,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:09:35,712 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 17:09:35,713 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-20 17:09:35,722 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-20 17:09:35,736 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-20 17:09:35,742 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-20 17:09:35,809 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-20 17:09:35,815 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-20 17:09:35,938 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:09:35,939 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-20 17:09:35,943 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-20 17:09:35,980 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-20 17:09:35,984 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-20 17:09:35,989 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-20 17:09:35,989 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:09:36,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658358981] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:09:36,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 17:09:36,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 15 [2024-11-20 17:09:36,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756787142] [2024-11-20 17:09:36,147 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 17:09:36,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 17:09:36,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:09:36,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 17:09:36,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=272, Unknown=14, NotChecked=0, Total=342 [2024-11-20 17:09:36,148 INFO L87 Difference]: Start difference. First operand 604 states and 683 transitions. Second operand has 16 states, 13 states have (on average 8.384615384615385) internal successors, (109), 15 states have internal predecessors, (109), 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-20 17:09:37,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:09:37,873 INFO L93 Difference]: Finished difference Result 611 states and 690 transitions. [2024-11-20 17:09:37,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 17:09:37,873 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 8.384615384615385) internal successors, (109), 15 states have internal predecessors, (109), 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 90 [2024-11-20 17:09:37,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:09:37,876 INFO L225 Difference]: With dead ends: 611 [2024-11-20 17:09:37,876 INFO L226 Difference]: Without dead ends: 611 [2024-11-20 17:09:37,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=444, Unknown=16, NotChecked=0, Total=552 [2024-11-20 17:09:37,877 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 480 mSDsluCounter, 2715 mSDsCounter, 0 mSdLazyCounter, 2959 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 3042 SdHoareTripleChecker+Invalid, 2974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-20 17:09:37,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 3042 Invalid, 2974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2959 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-20 17:09:37,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2024-11-20 17:09:37,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 602. [2024-11-20 17:09:37,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 432 states have (on average 1.5555555555555556) internal successors, (672), 596 states have internal predecessors, (672), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 17:09:37,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 678 transitions. [2024-11-20 17:09:37,889 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 678 transitions. Word has length 90 [2024-11-20 17:09:37,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:09:37,890 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 678 transitions. [2024-11-20 17:09:37,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 8.384615384615385) internal successors, (109), 15 states have internal predecessors, (109), 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-20 17:09:37,890 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 678 transitions. [2024-11-20 17:09:37,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-20 17:09:37,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:09:37,892 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-20 17:09:37,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 17:09:38,092 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,SelfDestructingSolverStorable15 [2024-11-20 17:09:38,093 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-20 17:09:38,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:09:38,093 INFO L85 PathProgramCache]: Analyzing trace with hash 232210623, now seen corresponding path program 1 times [2024-11-20 17:09:38,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:09:38,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797557946] [2024-11-20 17:09:38,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:09:38,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:09:38,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:38,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 17:09:38,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:38,582 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-20 17:09:38,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:09:38,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797557946] [2024-11-20 17:09:38,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797557946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:09:38,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:09:38,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-20 17:09:38,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476962913] [2024-11-20 17:09:38,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:09:38,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 17:09:38,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:09:38,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 17:09:38,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-20 17:09:38,585 INFO L87 Difference]: Start difference. First operand 602 states and 678 transitions. Second operand has 14 states, 12 states have (on average 7.5) internal successors, (90), 13 states have internal predecessors, (90), 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-20 17:09:39,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:09:39,663 INFO L93 Difference]: Finished difference Result 615 states and 694 transitions. [2024-11-20 17:09:39,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 17:09:39,664 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.5) internal successors, (90), 13 states have internal predecessors, (90), 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 92 [2024-11-20 17:09:39,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:09:39,666 INFO L225 Difference]: With dead ends: 615 [2024-11-20 17:09:39,666 INFO L226 Difference]: Without dead ends: 615 [2024-11-20 17:09:39,666 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-20 17:09:39,667 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 489 mSDsluCounter, 2754 mSDsCounter, 0 mSdLazyCounter, 2386 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 3078 SdHoareTripleChecker+Invalid, 2400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:09:39,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 3078 Invalid, 2400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2386 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-20 17:09:39,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-11-20 17:09:39,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 611. [2024-11-20 17:09:39,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 440 states have (on average 1.55) internal successors, (682), 604 states have internal predecessors, (682), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-20 17:09:39,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 689 transitions. [2024-11-20 17:09:39,677 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 689 transitions. Word has length 92 [2024-11-20 17:09:39,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:09:39,678 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 689 transitions. [2024-11-20 17:09:39,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.5) internal successors, (90), 13 states have internal predecessors, (90), 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-20 17:09:39,678 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 689 transitions. [2024-11-20 17:09:39,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-20 17:09:39,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:09:39,679 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-20 17:09:39,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 17:09:39,679 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-20 17:09:39,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:09:39,680 INFO L85 PathProgramCache]: Analyzing trace with hash 232210624, now seen corresponding path program 1 times [2024-11-20 17:09:39,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:09:39,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335104962] [2024-11-20 17:09:39,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:09:39,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:09:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:40,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 17:09:40,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:40,341 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-20 17:09:40,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:09:40,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335104962] [2024-11-20 17:09:40,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335104962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:09:40,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:09:40,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 17:09:40,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652783565] [2024-11-20 17:09:40,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:09:40,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 17:09:40,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:09:40,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 17:09:40,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-20 17:09:40,343 INFO L87 Difference]: Start difference. First operand 611 states and 689 transitions. Second operand has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 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-20 17:09:41,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:09:41,444 INFO L93 Difference]: Finished difference Result 614 states and 693 transitions. [2024-11-20 17:09:41,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 17:09:41,445 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 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 92 [2024-11-20 17:09:41,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:09:41,448 INFO L225 Difference]: With dead ends: 614 [2024-11-20 17:09:41,448 INFO L226 Difference]: Without dead ends: 614 [2024-11-20 17:09:41,448 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-20 17:09:41,449 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 500 mSDsluCounter, 1552 mSDsCounter, 0 mSdLazyCounter, 1956 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 1880 SdHoareTripleChecker+Invalid, 1970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:09:41,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 1880 Invalid, 1970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1956 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-20 17:09:41,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2024-11-20 17:09:41,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 611. [2024-11-20 17:09:41,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 440 states have (on average 1.5477272727272726) internal successors, (681), 604 states have internal predecessors, (681), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-20 17:09:41,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 688 transitions. [2024-11-20 17:09:41,461 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 688 transitions. Word has length 92 [2024-11-20 17:09:41,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:09:41,462 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 688 transitions. [2024-11-20 17:09:41,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 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-20 17:09:41,462 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 688 transitions. [2024-11-20 17:09:41,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-20 17:09:41,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:09:41,463 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] [2024-11-20 17:09:41,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-20 17:09:41,464 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-20 17:09:41,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:09:41,464 INFO L85 PathProgramCache]: Analyzing trace with hash -2035156324, now seen corresponding path program 1 times [2024-11-20 17:09:41,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:09:41,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265120619] [2024-11-20 17:09:41,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:09:41,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:09:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:41,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 17:09:41,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:41,958 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-20 17:09:41,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:09:41,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265120619] [2024-11-20 17:09:41,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265120619] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:09:41,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196949609] [2024-11-20 17:09:41,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:09:41,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:09:41,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:09:41,977 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-20 17:09:41,978 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-20 17:09:42,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:42,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-20 17:09:42,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:09:42,265 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 17:09:42,266 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-20 17:09:42,272 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-20 17:09:42,354 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:09:42,355 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-20 17:09:42,416 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:09:42,416 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-20 17:09:42,432 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-20 17:09:42,434 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-20 17:09:42,434 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:09:42,444 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_894 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_894) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-20 17:09:42,449 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_894 (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_894) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-20 17:09:42,497 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-20 17:09:42,500 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-20 17:09:42,510 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_897 (Array Int Int)) (v_ArrVal_894 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem51#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~mem51#1.base| v_ArrVal_897))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_894)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-20 17:09:42,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196949609] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:09:42,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 17:09:42,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 17 [2024-11-20 17:09:42,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637812714] [2024-11-20 17:09:42,512 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 17:09:42,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-20 17:09:42,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:09:42,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-20 17:09:42,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=259, Unknown=3, NotChecked=102, Total=420 [2024-11-20 17:09:42,514 INFO L87 Difference]: Start difference. First operand 611 states and 688 transitions. Second operand has 18 states, 16 states have (on average 7.125) internal successors, (114), 17 states have internal predecessors, (114), 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-20 17:09:43,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:09:43,701 INFO L93 Difference]: Finished difference Result 613 states and 692 transitions. [2024-11-20 17:09:43,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 17:09:43,701 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 7.125) internal successors, (114), 17 states have internal predecessors, (114), 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 93 [2024-11-20 17:09:43,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:09:43,703 INFO L225 Difference]: With dead ends: 613 [2024-11-20 17:09:43,704 INFO L226 Difference]: Without dead ends: 613 [2024-11-20 17:09:43,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=546, Unknown=3, NotChecked=150, Total=812 [2024-11-20 17:09:43,704 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 479 mSDsluCounter, 3417 mSDsCounter, 0 mSdLazyCounter, 2807 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 3741 SdHoareTripleChecker+Invalid, 2821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 17:09:43,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 3741 Invalid, 2821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2807 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 17:09:43,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-11-20 17:09:43,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 610. [2024-11-20 17:09:43,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 440 states have (on average 1.5454545454545454) internal successors, (680), 603 states have internal predecessors, (680), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-20 17:09:43,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 687 transitions. [2024-11-20 17:09:43,714 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 687 transitions. Word has length 93 [2024-11-20 17:09:43,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:09:43,715 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 687 transitions. [2024-11-20 17:09:43,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 7.125) internal successors, (114), 17 states have internal predecessors, (114), 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-20 17:09:43,715 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 687 transitions. [2024-11-20 17:09:43,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-20 17:09:43,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:09:43,716 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] [2024-11-20 17:09:43,725 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-20 17:09:43,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:09:43,921 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-20 17:09:43,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:09:43,921 INFO L85 PathProgramCache]: Analyzing trace with hash -2035156323, now seen corresponding path program 1 times [2024-11-20 17:09:43,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:09:43,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856684245] [2024-11-20 17:09:43,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:09:43,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:09:43,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:44,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 17:09:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:44,666 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-20 17:09:44,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:09:44,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856684245] [2024-11-20 17:09:44,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856684245] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:09:44,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802120820] [2024-11-20 17:09:44,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:09:44,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:09:44,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:09:44,669 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-20 17:09:44,670 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-20 17:09:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:44,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-20 17:09:44,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:09:44,952 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 17:09:44,953 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-20 17:09:45,010 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-20 17:09:45,017 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-20 17:09:45,260 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:09:45,261 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-20 17:09:45,265 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-20 17:09:45,328 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:09:45,328 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-20 17:09:45,337 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-20 17:09:45,352 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-20 17:09:45,357 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-20 17:09:45,359 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-20 17:09:45,359 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:09:45,421 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1037 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1037) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1037 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1037) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1038) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-20 17:09:45,432 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_1038 (Array Int Int)) (v_ArrVal_1037 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1037) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1038) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1037 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1037) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4)))))) is different from false [2024-11-20 17:09:45,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 17:09:45,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 84 treesize of output 88 [2024-11-20 17:09:45,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802120820] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:09:45,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 17:09:45,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 20 [2024-11-20 17:09:45,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132832538] [2024-11-20 17:09:45,638 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 17:09:45,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-20 17:09:45,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:09:45,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-20 17:09:45,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=479, Unknown=2, NotChecked=90, Total=650 [2024-11-20 17:09:45,639 INFO L87 Difference]: Start difference. First operand 610 states and 687 transitions. Second operand has 21 states, 18 states have (on average 6.611111111111111) internal successors, (119), 19 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 17:09:46,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:09:46,969 INFO L93 Difference]: Finished difference Result 612 states and 691 transitions. [2024-11-20 17:09:46,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 17:09:46,970 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 6.611111111111111) internal successors, (119), 19 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 93 [2024-11-20 17:09:46,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:09:46,972 INFO L225 Difference]: With dead ends: 612 [2024-11-20 17:09:46,972 INFO L226 Difference]: Without dead ends: 612 [2024-11-20 17:09:46,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=746, Unknown=2, NotChecked=114, Total=992 [2024-11-20 17:09:46,973 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 496 mSDsluCounter, 2512 mSDsCounter, 0 mSdLazyCounter, 2578 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 2834 SdHoareTripleChecker+Invalid, 2599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 17:09:46,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 2834 Invalid, 2599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2578 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 17:09:46,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2024-11-20 17:09:46,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 600. [2024-11-20 17:09:46,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 432 states have (on average 1.5509259259259258) internal successors, (670), 594 states have internal predecessors, (670), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 17:09:46,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 676 transitions. [2024-11-20 17:09:46,983 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 676 transitions. Word has length 93 [2024-11-20 17:09:46,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:09:46,983 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 676 transitions. [2024-11-20 17:09:46,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 6.611111111111111) internal successors, (119), 19 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 17:09:46,983 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 676 transitions. [2024-11-20 17:09:46,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-20 17:09:46,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:09:46,984 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-20 17:09:46,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-20 17:09:47,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:09:47,185 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-20 17:09:47,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:09:47,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1405026382, now seen corresponding path program 1 times [2024-11-20 17:09:47,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:09:47,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231830712] [2024-11-20 17:09:47,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:09:47,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:09:47,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:47,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 17:09:47,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:47,734 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-20 17:09:47,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:09:47,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231830712] [2024-11-20 17:09:47,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231830712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:09:47,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:09:47,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-20 17:09:47,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900787570] [2024-11-20 17:09:47,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:09:47,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-20 17:09:47,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:09:47,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-20 17:09:47,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-20 17:09:47,736 INFO L87 Difference]: Start difference. First operand 600 states and 676 transitions. Second operand has 15 states, 13 states have (on average 7.153846153846154) internal successors, (93), 14 states have internal predecessors, (93), 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-20 17:09:48,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:09:48,964 INFO L93 Difference]: Finished difference Result 616 states and 695 transitions. [2024-11-20 17:09:48,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 17:09:48,964 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.153846153846154) internal successors, (93), 14 states have internal predecessors, (93), 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 95 [2024-11-20 17:09:48,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:09:48,966 INFO L225 Difference]: With dead ends: 616 [2024-11-20 17:09:48,966 INFO L226 Difference]: Without dead ends: 616 [2024-11-20 17:09:48,966 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-20 17:09:48,967 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 502 mSDsluCounter, 3050 mSDsCounter, 0 mSdLazyCounter, 2599 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 3373 SdHoareTripleChecker+Invalid, 2612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 17:09:48,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 3373 Invalid, 2612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2599 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 17:09:48,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2024-11-20 17:09:48,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 612. [2024-11-20 17:09:48,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 443 states have (on average 1.5417607223476297) internal successors, (683), 605 states have internal predecessors, (683), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-20 17:09:48,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 690 transitions. [2024-11-20 17:09:48,975 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 690 transitions. Word has length 95 [2024-11-20 17:09:48,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:09:48,976 INFO L471 AbstractCegarLoop]: Abstraction has 612 states and 690 transitions. [2024-11-20 17:09:48,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.153846153846154) internal successors, (93), 14 states have internal predecessors, (93), 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-20 17:09:48,976 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 690 transitions. [2024-11-20 17:09:48,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-20 17:09:48,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:09:48,977 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-20 17:09:48,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-20 17:09:48,977 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-20 17:09:48,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:09:48,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1405026381, now seen corresponding path program 1 times [2024-11-20 17:09:48,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:09:48,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469440270] [2024-11-20 17:09:48,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:09:48,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:09:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:49,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 17:09:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:49,717 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-20 17:09:49,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:09:49,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469440270] [2024-11-20 17:09:49,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469440270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:09:49,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:09:49,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-20 17:09:49,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900934235] [2024-11-20 17:09:49,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:09:49,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 17:09:49,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:09:49,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 17:09:49,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-20 17:09:49,721 INFO L87 Difference]: Start difference. First operand 612 states and 690 transitions. Second operand has 13 states, 12 states have (on average 7.75) internal successors, (93), 12 states have internal predecessors, (93), 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-20 17:09:50,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:09:50,870 INFO L93 Difference]: Finished difference Result 615 states and 694 transitions. [2024-11-20 17:09:50,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 17:09:50,871 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.75) internal successors, (93), 12 states have internal predecessors, (93), 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 95 [2024-11-20 17:09:50,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:09:50,873 INFO L225 Difference]: With dead ends: 615 [2024-11-20 17:09:50,873 INFO L226 Difference]: Without dead ends: 615 [2024-11-20 17:09:50,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-20 17:09:50,874 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 483 mSDsluCounter, 2153 mSDsCounter, 0 mSdLazyCounter, 2416 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 2480 SdHoareTripleChecker+Invalid, 2428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:09:50,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 2480 Invalid, 2428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2416 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-20 17:09:50,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-11-20 17:09:50,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 612. [2024-11-20 17:09:50,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 443 states have (on average 1.5395033860045146) internal successors, (682), 605 states have internal predecessors, (682), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-20 17:09:50,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 689 transitions. [2024-11-20 17:09:50,892 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 689 transitions. Word has length 95 [2024-11-20 17:09:50,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:09:50,892 INFO L471 AbstractCegarLoop]: Abstraction has 612 states and 689 transitions. [2024-11-20 17:09:50,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.75) internal successors, (93), 12 states have internal predecessors, (93), 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-20 17:09:50,893 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 689 transitions. [2024-11-20 17:09:50,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-20 17:09:50,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:09:50,893 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, 1] [2024-11-20 17:09:50,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-20 17:09:50,894 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-20 17:09:50,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:09:50,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1583080267, now seen corresponding path program 1 times [2024-11-20 17:09:50,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:09:50,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112070357] [2024-11-20 17:09:50,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:09:50,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:09:50,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:51,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 17:09:51,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:51,473 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-20 17:09:51,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:09:51,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112070357] [2024-11-20 17:09:51,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112070357] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:09:51,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089207829] [2024-11-20 17:09:51,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:09:51,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:09:51,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:09:51,477 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-20 17:09:51,478 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-20 17:09:51,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:51,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-20 17:09:51,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:09:51,754 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 17:09:51,754 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-20 17:09:51,759 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-20 17:09:51,809 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:09:51,809 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-20 17:09:51,852 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:09:51,852 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-20 17:09:51,887 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:09:51,887 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-20 17:09:51,897 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-20 17:09:51,913 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-20 17:09:51,914 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:09:51,998 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1322 (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_1322))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1323)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-20 17:09:52,006 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1322 (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| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1322))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1323)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-20 17:09:52,040 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-11-20 17:09:52,041 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 57 treesize of output 56 [2024-11-20 17:09:52,048 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1322 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem51#1.base| (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~mem51#1.base| v_ArrVal_1326))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1322)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1323)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-20 17:09:52,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089207829] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:09:52,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 17:09:52,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 18 [2024-11-20 17:09:52,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122562470] [2024-11-20 17:09:52,050 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 17:09:52,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-20 17:09:52,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:09:52,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-20 17:09:52,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=12, NotChecked=120, Total=552 [2024-11-20 17:09:52,052 INFO L87 Difference]: Start difference. First operand 612 states and 689 transitions. Second operand has 19 states, 17 states have (on average 6.705882352941177) internal successors, (114), 17 states have internal predecessors, (114), 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-20 17:09:53,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:09:53,293 INFO L93 Difference]: Finished difference Result 614 states and 693 transitions. [2024-11-20 17:09:53,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 17:09:53,293 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 6.705882352941177) internal successors, (114), 17 states have internal predecessors, (114), 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 96 [2024-11-20 17:09:53,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:09:53,295 INFO L225 Difference]: With dead ends: 614 [2024-11-20 17:09:53,296 INFO L226 Difference]: Without dead ends: 614 [2024-11-20 17:09:53,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=727, Unknown=12, NotChecked=174, Total=1056 [2024-11-20 17:09:53,297 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 493 mSDsluCounter, 3088 mSDsCounter, 0 mSdLazyCounter, 2585 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 3411 SdHoareTripleChecker+Invalid, 2599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 17:09:53,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 3411 Invalid, 2599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2585 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 17:09:53,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2024-11-20 17:09:53,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 611. [2024-11-20 17:09:53,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 443 states have (on average 1.5372460496613995) internal successors, (681), 604 states have internal predecessors, (681), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-20 17:09:53,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 688 transitions. [2024-11-20 17:09:53,306 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 688 transitions. Word has length 96 [2024-11-20 17:09:53,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:09:53,306 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 688 transitions. [2024-11-20 17:09:53,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 6.705882352941177) internal successors, (114), 17 states have internal predecessors, (114), 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-20 17:09:53,307 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 688 transitions. [2024-11-20 17:09:53,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-20 17:09:53,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:09:53,308 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, 1] [2024-11-20 17:09:53,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-20 17:09:53,508 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,SelfDestructingSolverStorable22 [2024-11-20 17:09:53,509 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-20 17:09:53,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:09:53,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1583080266, now seen corresponding path program 1 times [2024-11-20 17:09:53,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:09:53,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456635718] [2024-11-20 17:09:53,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:09:53,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:09:53,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:54,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 17:09:54,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:54,261 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-20 17:09:54,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:09:54,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456635718] [2024-11-20 17:09:54,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456635718] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:09:54,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606877330] [2024-11-20 17:09:54,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:09:54,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:09:54,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:09:54,265 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-20 17:09:54,268 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-20 17:09:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:54,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-20 17:09:54,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:09:54,583 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-20 17:09:54,587 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 17:09:54,588 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-20 17:09:54,605 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-20 17:09:54,673 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:09:54,673 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-20 17:09:54,722 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-20 17:09:54,723 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 69 treesize of output 41 [2024-11-20 17:09:54,729 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-20 17:09:54,845 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-20 17:09:54,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 66 [2024-11-20 17:09:54,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-20 17:09:54,856 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 51 treesize of output 32 [2024-11-20 17:09:54,894 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 39 treesize of output 21 [2024-11-20 17:09:54,899 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 34 treesize of output 16 [2024-11-20 17:09:54,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-20 17:09:54,917 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:09:55,210 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 891 treesize of output 855 [2024-11-20 17:09:55,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 643 treesize of output 635 [2024-11-20 17:09:55,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 635 treesize of output 627 [2024-11-20 17:09:55,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 627 treesize of output 619 [2024-11-20 17:09:55,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 619 treesize of output 611 [2024-11-20 17:09:55,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606877330] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:09:55,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 17:09:55,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2024-11-20 17:09:55,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968026395] [2024-11-20 17:09:55,420 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 17:09:55,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-20 17:09:55,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:09:55,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-20 17:09:55,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=815, Unknown=4, NotChecked=0, Total=930 [2024-11-20 17:09:55,422 INFO L87 Difference]: Start difference. First operand 611 states and 688 transitions. Second operand has 25 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 24 states have internal predecessors, (127), 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-20 17:09:57,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:09:57,000 INFO L93 Difference]: Finished difference Result 613 states and 692 transitions. [2024-11-20 17:09:57,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 17:09:57,001 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 24 states have internal predecessors, (127), 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 96 [2024-11-20 17:09:57,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:09:57,003 INFO L225 Difference]: With dead ends: 613 [2024-11-20 17:09:57,003 INFO L226 Difference]: Without dead ends: 613 [2024-11-20 17:09:57,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=192, Invalid=1210, Unknown=4, NotChecked=0, Total=1406 [2024-11-20 17:09:57,004 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 495 mSDsluCounter, 3055 mSDsCounter, 0 mSdLazyCounter, 3177 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 3381 SdHoareTripleChecker+Invalid, 3195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-20 17:09:57,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 3381 Invalid, 3195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3177 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-20 17:09:57,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-11-20 17:09:57,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 598. [2024-11-20 17:09:57,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 432 states have (on average 1.5462962962962963) internal successors, (668), 592 states have internal predecessors, (668), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 17:09:57,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 674 transitions. [2024-11-20 17:09:57,013 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 674 transitions. Word has length 96 [2024-11-20 17:09:57,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:09:57,013 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 674 transitions. [2024-11-20 17:09:57,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 24 states have internal predecessors, (127), 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-20 17:09:57,013 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 674 transitions. [2024-11-20 17:09:57,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-20 17:09:57,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:09:57,014 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, 1, 1, 1] [2024-11-20 17:09:57,024 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-20 17:09:57,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:09:57,215 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-20 17:09:57,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:09:57,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1610945286, now seen corresponding path program 1 times [2024-11-20 17:09:57,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:09:57,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442407193] [2024-11-20 17:09:57,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:09:57,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:09:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:57,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 17:09:57,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:57,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:09:57,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:09:57,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442407193] [2024-11-20 17:09:57,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442407193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:09:57,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:09:57,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-20 17:09:57,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096507364] [2024-11-20 17:09:57,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:09:57,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 17:09:57,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:09:57,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 17:09:57,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-20 17:09:57,781 INFO L87 Difference]: Start difference. First operand 598 states and 674 transitions. Second operand has 16 states, 14 states have (on average 6.857142857142857) internal successors, (96), 15 states have internal predecessors, (96), 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-20 17:09:58,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:09:58,924 INFO L93 Difference]: Finished difference Result 617 states and 696 transitions. [2024-11-20 17:09:58,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 17:09:58,925 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.857142857142857) internal successors, (96), 15 states have internal predecessors, (96), 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 98 [2024-11-20 17:09:58,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:09:58,927 INFO L225 Difference]: With dead ends: 617 [2024-11-20 17:09:58,927 INFO L226 Difference]: Without dead ends: 617 [2024-11-20 17:09:58,927 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-20 17:09:58,928 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 507 mSDsluCounter, 2769 mSDsCounter, 0 mSdLazyCounter, 2386 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 3091 SdHoareTripleChecker+Invalid, 2400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:09:58,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 3091 Invalid, 2400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2386 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-20 17:09:58,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-11-20 17:09:58,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 613. [2024-11-20 17:09:58,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 446 states have (on average 1.5336322869955157) internal successors, (684), 606 states have internal predecessors, (684), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-20 17:09:58,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 691 transitions. [2024-11-20 17:09:58,935 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 691 transitions. Word has length 98 [2024-11-20 17:09:58,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:09:58,935 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 691 transitions. [2024-11-20 17:09:58,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.857142857142857) internal successors, (96), 15 states have internal predecessors, (96), 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-20 17:09:58,936 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 691 transitions. [2024-11-20 17:09:58,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-20 17:09:58,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:09:58,937 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, 1, 1, 1] [2024-11-20 17:09:58,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-20 17:09:58,937 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-20 17:09:58,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:09:58,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1610945287, now seen corresponding path program 1 times [2024-11-20 17:09:58,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:09:58,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182556178] [2024-11-20 17:09:58,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:09:58,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:09:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:59,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 17:09:59,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:59,763 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-20 17:09:59,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:09:59,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182556178] [2024-11-20 17:09:59,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182556178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:09:59,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:09:59,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-20 17:09:59,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593956784] [2024-11-20 17:09:59,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:09:59,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 17:09:59,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:09:59,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 17:09:59,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-20 17:09:59,767 INFO L87 Difference]: Start difference. First operand 613 states and 691 transitions. Second operand has 14 states, 13 states have (on average 7.384615384615385) internal successors, (96), 13 states have internal predecessors, (96), 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-20 17:10:00,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:10:00,869 INFO L93 Difference]: Finished difference Result 616 states and 695 transitions. [2024-11-20 17:10:00,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 17:10:00,870 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.384615384615385) internal successors, (96), 13 states have internal predecessors, (96), 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 98 [2024-11-20 17:10:00,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:10:00,872 INFO L225 Difference]: With dead ends: 616 [2024-11-20 17:10:00,872 INFO L226 Difference]: Without dead ends: 616 [2024-11-20 17:10:00,872 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-20 17:10:00,873 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 483 mSDsluCounter, 1789 mSDsCounter, 0 mSdLazyCounter, 2266 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 2115 SdHoareTripleChecker+Invalid, 2280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:10:00,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 2115 Invalid, 2280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2266 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-20 17:10:00,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2024-11-20 17:10:00,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 613. [2024-11-20 17:10:00,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 446 states have (on average 1.531390134529148) internal successors, (683), 606 states have internal predecessors, (683), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-20 17:10:00,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 690 transitions. [2024-11-20 17:10:00,886 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 690 transitions. Word has length 98 [2024-11-20 17:10:00,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:10:00,887 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 690 transitions. [2024-11-20 17:10:00,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.384615384615385) internal successors, (96), 13 states have internal predecessors, (96), 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-20 17:10:00,887 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 690 transitions. [2024-11-20 17:10:00,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-20 17:10:00,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:10:00,888 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, 1, 1, 1, 1] [2024-11-20 17:10:00,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-20 17:10:00,888 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-20 17:10:00,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:10:00,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1492267811, now seen corresponding path program 1 times [2024-11-20 17:10:00,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:10:00,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853473308] [2024-11-20 17:10:00,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:10:00,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:10:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:10:01,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 17:10:01,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:10:01,453 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-20 17:10:01,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:10:01,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853473308] [2024-11-20 17:10:01,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853473308] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:10:01,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453368028] [2024-11-20 17:10:01,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:10:01,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:10:01,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:10:01,455 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-20 17:10:01,456 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-20 17:10:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:10:01,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-20 17:10:01,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:10:01,778 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 17:10:01,778 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-20 17:10:01,783 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-20 17:10:01,840 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:10: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 42 treesize of output 41 [2024-11-20 17:10:01,882 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:10:01,882 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-20 17:10:01,919 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:10:01,920 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-20 17:10:01,961 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:10:01,961 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-20 17:10:01,975 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-20 17:10:01,977 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-20 17:10:01,977 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:10:02,015 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1788 (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_1788) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-20 17:10:02,021 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1788 (Array Int Int)) (v_ArrVal_1787 (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~mem54#1.base| v_ArrVal_1787))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1788)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-20 17:10:02,058 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1788 (Array Int Int)) (v_ArrVal_1787 (Array Int Int)) (v_ArrVal_1786 (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~mem53#1.base| v_ArrVal_1786))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1787)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1788)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-20 17:10:02,066 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1788 (Array Int Int)) (v_ArrVal_1787 (Array Int Int)) (v_ArrVal_1786 (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| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1786))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1787)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1788)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-20 17:10:02,107 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2024-11-20 17:10:02,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 105 treesize of output 104 [2024-11-20 17:10:02,115 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1788 (Array Int Int)) (v_ArrVal_1787 (Array Int Int)) (v_ArrVal_1786 (Array Int Int)) (v_ArrVal_1791 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem51#1.base| (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~mem51#1.base| v_ArrVal_1791))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1786)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1787)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1788)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-20 17:10:02,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453368028] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:10:02,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 17:10:02,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 20 [2024-11-20 17:10:02,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349533736] [2024-11-20 17:10:02,117 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 17:10:02,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-20 17:10:02,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:10:02,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-20 17:10:02,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=415, Unknown=23, NotChecked=230, Total=756 [2024-11-20 17:10:02,120 INFO L87 Difference]: Start difference. First operand 613 states and 690 transitions. Second operand has 21 states, 19 states have (on average 6.2631578947368425) internal successors, (119), 19 states have internal predecessors, (119), 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-20 17:10:03,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:10:03,221 INFO L93 Difference]: Finished difference Result 615 states and 694 transitions. [2024-11-20 17:10:03,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 17:10:03,221 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 6.2631578947368425) internal successors, (119), 19 states have internal predecessors, (119), 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 99 [2024-11-20 17:10:03,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:10:03,223 INFO L225 Difference]: With dead ends: 615 [2024-11-20 17:10:03,223 INFO L226 Difference]: Without dead ends: 615 [2024-11-20 17:10:03,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=877, Unknown=28, NotChecked=330, Total=1406 [2024-11-20 17:10:03,224 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 475 mSDsluCounter, 2747 mSDsCounter, 0 mSdLazyCounter, 2352 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 3069 SdHoareTripleChecker+Invalid, 2366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 17:10:03,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 3069 Invalid, 2366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2352 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 17:10:03,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-11-20 17:10:03,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 612. [2024-11-20 17:10:03,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 446 states have (on average 1.5291479820627802) internal successors, (682), 605 states have internal predecessors, (682), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-20 17:10:03,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 689 transitions. [2024-11-20 17:10:03,232 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 689 transitions. Word has length 99 [2024-11-20 17:10:03,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:10:03,232 INFO L471 AbstractCegarLoop]: Abstraction has 612 states and 689 transitions. [2024-11-20 17:10:03,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 6.2631578947368425) internal successors, (119), 19 states have internal predecessors, (119), 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-20 17:10:03,232 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 689 transitions. [2024-11-20 17:10:03,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-20 17:10:03,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:10:03,234 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, 1, 1, 1, 1] [2024-11-20 17:10:03,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-20 17:10:03,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:10:03,438 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-20 17:10:03,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:10:03,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1492267812, now seen corresponding path program 1 times [2024-11-20 17:10:03,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:10:03,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527452538] [2024-11-20 17:10:03,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:10:03,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:10:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:10:04,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 17:10:04,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:10:04,186 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-20 17:10:04,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:10:04,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527452538] [2024-11-20 17:10:04,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527452538] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:10:04,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876789538] [2024-11-20 17:10:04,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:10:04,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:10:04,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:10:04,188 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 17:10:04,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-20 17:10:04,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:10:04,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-20 17:10:04,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:10:04,469 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-20 17:10:04,476 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 17:10:04,476 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-20 17:10:04,501 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-20 17:10:04,505 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-20 17:10:04,563 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-20 17:10:04,566 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-20 17:10:04,640 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:10:04,641 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-20 17:10:04,648 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-20 17:10:04,718 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:10:04,718 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-20 17:10:04,726 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-20 17:10:04,770 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:10:04,770 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-20 17:10:04,775 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-20 17:10:04,822 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:10:04,823 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-20 17:10:04,825 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-20 17:10:04,843 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-20 17:10:04,848 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-20 17:10:04,866 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-20 17:10:04,866 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:10:04,911 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int))) (<= (+ 24 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1960) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1961 (Array Int Int))) (<= 0 (+ 20 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-20 17:10:04,919 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_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1960) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1961 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20)))))) is different from false [2024-11-20 17:10:04,936 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1959) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1958) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1958))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1959) .cse1 v_ArrVal_1961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1960) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-20 17:10:04,949 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |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|) .cse2))) (and (forall ((v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1958))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1959) .cse1 v_ArrVal_1961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1960) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1959) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1958) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20)))))) is different from false [2024-11-20 17:10:04,973 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1956 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1957))) (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~mem53#1.base| v_ArrVal_1956) .cse0 v_ArrVal_1959) (select (select (store .cse1 .cse0 v_ArrVal_1958) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1961))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (forall ((v_ArrVal_1956 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1957))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1958))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1956) .cse3 v_ArrVal_1959) .cse4 v_ArrVal_1961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1960) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-20 17:10:05,013 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |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|) .cse3))) (and (forall ((v_ArrVal_1956 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1957))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1956) .cse1 v_ArrVal_1959) (select (select (store .cse2 .cse1 v_ArrVal_1958) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1961))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))) (forall ((v_ArrVal_1956 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1957))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_1958))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1956) .cse4 v_ArrVal_1959) .cse5 v_ArrVal_1961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_1960) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))) is different from false [2024-11-20 17:10:05,085 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1967 (Array Int Int)) (v_ArrVal_1956 (Array Int Int)) (v_ArrVal_1966 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1966))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_1957))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_1958))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1967) .cse0 v_ArrVal_1956) .cse1 v_ArrVal_1959) .cse2 v_ArrVal_1961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1960) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_1967 (Array Int Int)) (v_ArrVal_1956 (Array Int Int)) (v_ArrVal_1966 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1966))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_1957))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1967) .cse7 v_ArrVal_1956) .cse8 v_ArrVal_1959) (select (select (store .cse9 .cse8 v_ArrVal_1958) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1961))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))))) is different from false [2024-11-20 17:10:05,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876789538] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:10:05,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 17:10:05,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 24 [2024-11-20 17:10:05,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959596571] [2024-11-20 17:10:05,089 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 17:10:05,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-20 17:10:05,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:10:05,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-20 17:10:05,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=617, Unknown=7, NotChecked=392, Total=1122 [2024-11-20 17:10:05,090 INFO L87 Difference]: Start difference. First operand 612 states and 689 transitions. Second operand has 25 states, 22 states have (on average 6.045454545454546) internal successors, (133), 24 states have internal predecessors, (133), 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-20 17:10:06,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:10:06,779 INFO L93 Difference]: Finished difference Result 614 states and 693 transitions. [2024-11-20 17:10:06,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 17:10:06,779 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 6.045454545454546) internal successors, (133), 24 states have internal predecessors, (133), 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 99 [2024-11-20 17:10:06,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:10:06,781 INFO L225 Difference]: With dead ends: 614 [2024-11-20 17:10:06,781 INFO L226 Difference]: Without dead ends: 614 [2024-11-20 17:10:06,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=1035, Unknown=7, NotChecked=504, Total=1722 [2024-11-20 17:10:06,782 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 477 mSDsluCounter, 2856 mSDsCounter, 0 mSdLazyCounter, 3360 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 3180 SdHoareTripleChecker+Invalid, 3377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-20 17:10:06,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 3180 Invalid, 3377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3360 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-20 17:10:06,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2024-11-20 17:10:06,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 596. [2024-11-20 17:10:06,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 432 states have (on average 1.5416666666666667) internal successors, (666), 590 states have internal predecessors, (666), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 17:10:06,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 672 transitions. [2024-11-20 17:10:06,789 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 672 transitions. Word has length 99 [2024-11-20 17:10:06,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:10:06,789 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 672 transitions. [2024-11-20 17:10:06,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 6.045454545454546) internal successors, (133), 24 states have internal predecessors, (133), 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-20 17:10:06,790 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 672 transitions. [2024-11-20 17:10:06,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-20 17:10:06,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:10:06,791 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:10:06,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-20 17:10:06,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-20 17:10:06,992 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-20 17:10:06,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:10:06,992 INFO L85 PathProgramCache]: Analyzing trace with hash -490544312, now seen corresponding path program 1 times [2024-11-20 17:10:06,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:10:06,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937182258] [2024-11-20 17:10:06,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:10:06,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:10:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:10:07,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 17:10:07,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:10:07,745 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-20 17:10:07,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:10:07,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937182258] [2024-11-20 17:10:07,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937182258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:10:07,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:10:07,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-20 17:10:07,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450245056] [2024-11-20 17:10:07,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:10:07,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-20 17:10:07,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:10:07,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-20 17:10:07,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-20 17:10:07,748 INFO L87 Difference]: Start difference. First operand 596 states and 672 transitions. Second operand has 15 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 states have internal predecessors, (100), 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-20 17:10:08,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:10:08,810 INFO L93 Difference]: Finished difference Result 619 states and 698 transitions. [2024-11-20 17:10:08,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 17:10:08,810 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 states have internal predecessors, (100), 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 102 [2024-11-20 17:10:08,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:10:08,812 INFO L225 Difference]: With dead ends: 619 [2024-11-20 17:10:08,813 INFO L226 Difference]: Without dead ends: 619 [2024-11-20 17:10:08,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2024-11-20 17:10:08,813 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 504 mSDsluCounter, 2450 mSDsCounter, 0 mSdLazyCounter, 2145 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 2774 SdHoareTripleChecker+Invalid, 2161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 17:10:08,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 2774 Invalid, 2161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2145 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 17:10:08,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-11-20 17:10:08,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 615. [2024-11-20 17:10:08,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 450 states have (on average 1.5244444444444445) internal successors, (686), 608 states have internal predecessors, (686), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-20 17:10:08,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 693 transitions. [2024-11-20 17:10:08,821 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 693 transitions. Word has length 102 [2024-11-20 17:10:08,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:10:08,822 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 693 transitions. [2024-11-20 17:10:08,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 states have internal predecessors, (100), 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-20 17:10:08,822 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 693 transitions. [2024-11-20 17:10:08,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-20 17:10:08,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:10:08,823 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:10:08,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-20 17:10:08,823 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-20 17:10:08,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:10:08,824 INFO L85 PathProgramCache]: Analyzing trace with hash -490544311, now seen corresponding path program 1 times [2024-11-20 17:10:08,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:10:08,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011044551] [2024-11-20 17:10:08,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:10:08,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:10:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:10:09,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 17:10:09,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:10:09,820 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-20 17:10:09,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:10:09,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011044551] [2024-11-20 17:10:09,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011044551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:10:09,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:10:09,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-20 17:10:09,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266172307] [2024-11-20 17:10:09,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:10:09,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-20 17:10:09,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:10:09,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-20 17:10:09,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-20 17:10:09,822 INFO L87 Difference]: Start difference. First operand 615 states and 693 transitions. Second operand has 18 states, 16 states have (on average 6.25) internal successors, (100), 17 states have internal predecessors, (100), 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-20 17:10:11,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:10:11,711 INFO L93 Difference]: Finished difference Result 618 states and 697 transitions. [2024-11-20 17:10:11,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 17:10:11,712 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.25) internal successors, (100), 17 states have internal predecessors, (100), 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 102 [2024-11-20 17:10:11,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:10:11,713 INFO L225 Difference]: With dead ends: 618 [2024-11-20 17:10:11,714 INFO L226 Difference]: Without dead ends: 618 [2024-11-20 17:10:11,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2024-11-20 17:10:11,714 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 487 mSDsluCounter, 3051 mSDsCounter, 0 mSdLazyCounter, 3687 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 3373 SdHoareTripleChecker+Invalid, 3705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-20 17:10:11,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 3373 Invalid, 3705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3687 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-20 17:10:11,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-11-20 17:10:11,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 615. [2024-11-20 17:10:11,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 450 states have (on average 1.5222222222222221) internal successors, (685), 608 states have internal predecessors, (685), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-20 17:10:11,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 692 transitions. [2024-11-20 17:10:11,721 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 692 transitions. Word has length 102 [2024-11-20 17:10:11,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:10:11,721 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 692 transitions. [2024-11-20 17:10:11,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.25) internal successors, (100), 17 states have internal predecessors, (100), 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-20 17:10:11,721 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 692 transitions. [2024-11-20 17:10:11,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-20 17:10:11,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:10:11,722 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:10:11,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-20 17:10:11,722 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-20 17:10:11,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:10:11,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1639492837, now seen corresponding path program 1 times [2024-11-20 17:10:11,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:10:11,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286710900] [2024-11-20 17:10:11,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:10:11,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:10:11,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:10:12,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 17:10:12,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:10:12,484 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-20 17:10:12,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:10:12,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286710900] [2024-11-20 17:10:12,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286710900] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:10:12,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028118153] [2024-11-20 17:10:12,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:10:12,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:10:12,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:10:12,486 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 17:10:12,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-20 17:10:12,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:10:12,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-20 17:10:12,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:10:12,796 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 17:10:12,796 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-20 17:10:12,800 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-20 17:10:12,868 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:10:12,869 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-20 17:10:12,913 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:10:12,913 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-20 17:10:12,954 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:10:12,955 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-20 17:10:13,003 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:10:13,003 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-20 17:10:13,055 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:10:13,055 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-20 17:10:13,066 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-20 17:10:13,083 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-20 17:10:13,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-20 17:10:13,087 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-20 17:10:13,087 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:10:13,640 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2024-11-20 17:10:13,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 597 treesize of output 794 [2024-11-20 17:10:13,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028118153] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:10:13,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 17:10:13,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 23 [2024-11-20 17:10:13,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286400824] [2024-11-20 17:10:13,767 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 17:10:13,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-20 17:10:13,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:10:13,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-20 17:10:13,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=985, Unknown=55, NotChecked=0, Total=1190 [2024-11-20 17:10:13,768 INFO L87 Difference]: Start difference. First operand 615 states and 692 transitions. Second operand has 24 states, 22 states have (on average 5.909090909090909) internal successors, (130), 23 states have internal predecessors, (130), 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-20 17:10:15,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:10:15,277 INFO L93 Difference]: Finished difference Result 617 states and 696 transitions. [2024-11-20 17:10:15,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-20 17:10:15,277 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 5.909090909090909) internal successors, (130), 23 states have internal predecessors, (130), 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 103 [2024-11-20 17:10:15,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:10:15,279 INFO L225 Difference]: With dead ends: 617 [2024-11-20 17:10:15,279 INFO L226 Difference]: Without dead ends: 617 [2024-11-20 17:10:15,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=279, Invalid=1736, Unknown=55, NotChecked=0, Total=2070 [2024-11-20 17:10:15,280 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 474 mSDsluCounter, 3334 mSDsCounter, 0 mSdLazyCounter, 2833 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 3655 SdHoareTripleChecker+Invalid, 2851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-20 17:10:15,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 3655 Invalid, 2851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2833 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-20 17:10:15,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-11-20 17:10:15,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 614. [2024-11-20 17:10:15,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 450 states have (on average 1.52) internal successors, (684), 607 states have internal predecessors, (684), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-20 17:10:15,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 691 transitions. [2024-11-20 17:10:15,286 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 691 transitions. Word has length 103 [2024-11-20 17:10:15,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:10:15,287 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 691 transitions. [2024-11-20 17:10:15,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 5.909090909090909) internal successors, (130), 23 states have internal predecessors, (130), 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-20 17:10:15,287 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 691 transitions. [2024-11-20 17:10:15,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-20 17:10:15,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:10:15,288 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:10:15,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-20 17:10:15,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:10:15,489 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-20 17:10:15,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:10:15,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1639492838, now seen corresponding path program 1 times [2024-11-20 17:10:15,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:10:15,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332020260] [2024-11-20 17:10:15,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:10:15,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:10:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:10:16,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 17:10:16,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:10:16,649 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-20 17:10:16,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:10:16,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332020260] [2024-11-20 17:10:16,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332020260] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:10:16,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570675244] [2024-11-20 17:10:16,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:10:16,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:10:16,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:10:16,652 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 17:10:16,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-20 17:10:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:10:16,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-20 17:10:16,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:10:16,958 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 17:10:16,959 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-20 17:10:16,968 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-20 17:10:16,974 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-20 17:10:16,980 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-20 17:10:17,025 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-20 17:10:17,028 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-20 17:10:17,172 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:10:17,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 73 treesize of output 66 [2024-11-20 17:10:17,179 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-20 17:10:17,265 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:10:17,266 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 73 treesize of output 66 [2024-11-20 17:10:17,270 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-20 17:10:17,347 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:10:17,347 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 73 treesize of output 66 [2024-11-20 17:10:17,353 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-20 17:10:17,425 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:10:17,426 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 73 treesize of output 66 [2024-11-20 17:10:17,431 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-20 17:10:17,501 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:10:17,501 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 73 treesize of output 66 [2024-11-20 17:10:17,507 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-20 17:10:17,523 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 42 treesize of output 18 [2024-11-20 17:10:17,527 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-20 17:10:17,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 17:10:17,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-20 17:10:17,544 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 17:10:17,544 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-20 17:10:17,546 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-20 17:10:17,546 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:10:18,793 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |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|) .cse4))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0))) (forall ((v_ArrVal_2490 (Array Int Int)) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2496 (Array Int Int)) (v_ArrVal_2494 (Array Int Int)) (v_ArrVal_2493 (Array Int Int)) (v_ArrVal_2492 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (< 0 (+ (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2490))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2491))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2489) .cse1 v_ArrVal_2492) .cse2 v_ArrVal_2493) (select (select (store .cse3 .cse2 v_ArrVal_2494) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2496))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1)))) (forall ((v_ArrVal_2490 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2496 (Array Int Int)) (v_ArrVal_2495 (Array Int Int)) (v_ArrVal_2494 (Array Int Int)) (v_ArrVal_2493 (Array Int Int)) (v_ArrVal_2492 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (or (forall ((v_ArrVal_2497 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2490))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_2491))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2494))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2489) .cse6 v_ArrVal_2492) .cse7 v_ArrVal_2493) .cse8 v_ArrVal_2496) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_7| v_ArrVal_2497) (select (select (store .cse9 .cse8 v_ArrVal_2495) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0))))))) is different from false [2024-11-20 17:10:18,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 17:10:18,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 604 treesize of output 622 [2024-11-20 17:10:19,026 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc58#1.base_7| |c_ULTIMATE.start_main_#t~mem51#1.base|) (forall ((v_ArrVal_2490 (Array Int Int)) (v_ArrVal_2503 (Array Int Int)) (v_ArrVal_2502 (Array Int Int)) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2497 Int) (v_ArrVal_2496 (Array Int Int)) (v_ArrVal_2495 (Array Int Int)) (v_ArrVal_2494 (Array Int Int)) (v_ArrVal_2493 (Array Int Int)) (v_ArrVal_2492 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2502))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_2490))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_2491))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_2494))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ 3 (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2503) .cse0 v_ArrVal_2489) .cse1 v_ArrVal_2492) .cse2 v_ArrVal_2493) .cse3 v_ArrVal_2496) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_7| v_ArrVal_2497) (select (select (store .cse5 .cse3 v_ArrVal_2495) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))))) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_16 (Array Int Int))) (< 0 (+ (select (select (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_19))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse9 v_prenex_16))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_prenex_25))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_18) .cse9 v_prenex_20) .cse10 v_prenex_24) .cse11 v_prenex_23) (select (select (store .cse12 .cse11 v_prenex_22) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_prenex_21))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))))) is different from false [2024-11-20 17:10:19,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570675244] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:10:19,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 17:10:19,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 25 [2024-11-20 17:10:19,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433721357] [2024-11-20 17:10:19,031 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 17:10:19,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-20 17:10:19,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:10:19,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-20 17:10:19,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1070, Unknown=45, NotChecked=138, Total=1406 [2024-11-20 17:10:19,032 INFO L87 Difference]: Start difference. First operand 614 states and 691 transitions. Second operand has 26 states, 24 states have (on average 5.375) internal successors, (129), 24 states have internal predecessors, (129), 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-20 17:10:22,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:10:22,514 INFO L93 Difference]: Finished difference Result 616 states and 695 transitions. [2024-11-20 17:10:22,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-20 17:10:22,515 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 5.375) internal successors, (129), 24 states have internal predecessors, (129), 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 103 [2024-11-20 17:10:22,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:10:22,517 INFO L225 Difference]: With dead ends: 616 [2024-11-20 17:10:22,517 INFO L226 Difference]: Without dead ends: 616 [2024-11-20 17:10:22,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 102 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=292, Invalid=2117, Unknown=49, NotChecked=194, Total=2652 [2024-11-20 17:10:22,518 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 495 mSDsluCounter, 4074 mSDsCounter, 0 mSdLazyCounter, 5233 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 4393 SdHoareTripleChecker+Invalid, 5251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 5233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:10:22,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 4393 Invalid, 5251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 5233 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-20 17:10:22,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2024-11-20 17:10:22,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 594. [2024-11-20 17:10:22,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 432 states have (on average 1.537037037037037) internal successors, (664), 588 states have internal predecessors, (664), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 17:10:22,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 670 transitions. [2024-11-20 17:10:22,523 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 670 transitions. Word has length 103 [2024-11-20 17:10:22,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:10:22,524 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 670 transitions. [2024-11-20 17:10:22,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 5.375) internal successors, (129), 24 states have internal predecessors, (129), 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-20 17:10:22,524 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 670 transitions. [2024-11-20 17:10:22,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-20 17:10:22,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:10:22,524 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:10:22,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-20 17:10:22,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-20 17:10:22,725 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-20 17:10:22,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:10:22,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1968749023, now seen corresponding path program 1 times [2024-11-20 17:10:22,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:10:22,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327597940] [2024-11-20 17:10:22,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:10:22,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:10:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:10:23,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 17:10:23,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:10:23,272 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-20 17:10:23,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:10:23,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327597940] [2024-11-20 17:10:23,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327597940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:10:23,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:10:23,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-20 17:10:23,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588599795] [2024-11-20 17:10:23,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:10:23,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 17:10:23,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:10:23,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 17:10:23,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-20 17:10:23,274 INFO L87 Difference]: Start difference. First operand 594 states and 670 transitions. Second operand has 16 states, 15 states have (on average 6.866666666666666) internal successors, (103), 15 states have internal predecessors, (103), 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-20 17:10:24,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:10:24,746 INFO L93 Difference]: Finished difference Result 620 states and 699 transitions. [2024-11-20 17:10:24,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 17:10:24,747 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.866666666666666) internal successors, (103), 15 states have internal predecessors, (103), 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 105 [2024-11-20 17:10:24,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:10:24,748 INFO L225 Difference]: With dead ends: 620 [2024-11-20 17:10:24,748 INFO L226 Difference]: Without dead ends: 620 [2024-11-20 17:10:24,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2024-11-20 17:10:24,749 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 488 mSDsluCounter, 3353 mSDsCounter, 0 mSdLazyCounter, 2808 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 3676 SdHoareTripleChecker+Invalid, 2823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-20 17:10:24,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 3676 Invalid, 2823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2808 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-20 17:10:24,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2024-11-20 17:10:24,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 616. [2024-11-20 17:10:24,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 453 states have (on average 1.5165562913907285) internal successors, (687), 609 states have internal predecessors, (687), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-20 17:10:24,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 694 transitions. [2024-11-20 17:10:24,755 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 694 transitions. Word has length 105 [2024-11-20 17:10:24,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:10:24,755 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 694 transitions. [2024-11-20 17:10:24,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.866666666666666) internal successors, (103), 15 states have internal predecessors, (103), 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-20 17:10:24,756 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 694 transitions. [2024-11-20 17:10:24,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-20 17:10:24,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:10:24,756 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:10:24,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-20 17:10:24,756 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-20 17:10:24,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:10:24,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1968749024, now seen corresponding path program 1 times [2024-11-20 17:10:24,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:10:24,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612506700] [2024-11-20 17:10:24,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:10:24,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:10:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:10:25,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 17:10:25,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:10:25,812 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-20 17:10:25,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:10:25,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612506700] [2024-11-20 17:10:25,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612506700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:10:25,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:10:25,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-20 17:10:25,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531513174] [2024-11-20 17:10:25,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:10:25,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-20 17:10:25,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:10:25,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-20 17:10:25,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2024-11-20 17:10:25,814 INFO L87 Difference]: Start difference. First operand 616 states and 694 transitions. Second operand has 19 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 18 states have internal predecessors, (103), 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-20 17:10:27,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:10:27,662 INFO L93 Difference]: Finished difference Result 619 states and 698 transitions. [2024-11-20 17:10:27,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-20 17:10:27,663 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 18 states have internal predecessors, (103), 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 105 [2024-11-20 17:10:27,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:10:27,664 INFO L225 Difference]: With dead ends: 619 [2024-11-20 17:10:27,664 INFO L226 Difference]: Without dead ends: 619 [2024-11-20 17:10:27,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=778, Unknown=0, NotChecked=0, Total=930 [2024-11-20 17:10:27,665 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 504 mSDsluCounter, 2594 mSDsCounter, 0 mSdLazyCounter, 3050 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 2915 SdHoareTripleChecker+Invalid, 3067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-20 17:10:27,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 2915 Invalid, 3067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3050 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-20 17:10:27,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-11-20 17:10:27,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 616. [2024-11-20 17:10:27,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 453 states have (on average 1.5143487858719646) internal successors, (686), 609 states have internal predecessors, (686), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-20 17:10:27,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 693 transitions. [2024-11-20 17:10:27,671 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 693 transitions. Word has length 105 [2024-11-20 17:10:27,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:10:27,671 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 693 transitions. [2024-11-20 17:10:27,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 18 states have internal predecessors, (103), 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-20 17:10:27,671 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 693 transitions. [2024-11-20 17:10:27,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-20 17:10:27,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:10:27,672 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:10:27,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-20 17:10:27,672 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-20 17:10:27,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:10:27,672 INFO L85 PathProgramCache]: Analyzing trace with hash -236343518, now seen corresponding path program 1 times [2024-11-20 17:10:27,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:10:27,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423347465] [2024-11-20 17:10:27,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:10:27,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:10:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:10:28,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 17:10:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:10:28,352 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-20 17:10:28,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:10:28,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423347465] [2024-11-20 17:10:28,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423347465] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:10:28,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804526087] [2024-11-20 17:10:28,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:10:28,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:10:28,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:10:28,355 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 17:10:28,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-20 17:10:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:10:28,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-20 17:10:28,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:10:28,690 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 17:10:28,690 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-20 17:10:28,694 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-20 17:10:28,734 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:10:28,734 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-20 17:10:28,781 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:10:28,781 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-20 17:10:28,831 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:10:28,832 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-20 17:10:28,878 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:10:28,878 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-20 17:10:28,923 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:10:28,924 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-20 17:10:28,960 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:10:28,961 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-20 17:10:29,000 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-20 17:10:29,002 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-20 17:10:29,002 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:10:29,017 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-20 17:10:29,017 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-20 17:10:29,022 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2865 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem57#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2865) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)))) is different from false [2024-11-20 17:10:29,043 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2864 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2864) |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-20 17:10:29,056 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2863 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2863) |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-20 17:10:29,069 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2862 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~user~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2862) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))))) is different from false [2024-11-20 17:10:29,075 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2862 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~user~0#1.base| (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_2862) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) is different from false [2024-11-20 17:10:29,084 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2862 (Array Int Int)) (v_ArrVal_2861 (Array Int Int))) (not (= (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_2861))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2862)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-20 17:10:29,090 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2862 (Array Int Int)) (v_ArrVal_2861 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2861))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2862)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-20 17:10:29,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804526087] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:10:29,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 17:10:29,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 22 [2024-11-20 17:10:29,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611294305] [2024-11-20 17:10:29,172 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 17:10:29,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-20 17:10:29,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:10:29,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-20 17:10:29,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=489, Unknown=10, NotChecked=350, Total=930 [2024-11-20 17:10:29,173 INFO L87 Difference]: Start difference. First operand 616 states and 693 transitions. Second operand has 23 states, 21 states have (on average 6.142857142857143) internal successors, (129), 22 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)