./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-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 1ccd4b93de7420a1f7847638daedeeee3b82eb082e434a23182d7e5e0aee2085 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:04:38,262 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:04:38,338 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:04:38,342 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:04:38,343 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:04:38,364 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:04:38,366 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:04:38,366 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:04:38,366 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:04:38,366 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:04:38,367 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:04:38,367 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:04:38,367 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:04:38,367 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:04:38,368 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:04:38,368 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:04:38,368 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:04:38,368 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:04:38,368 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:04:38,369 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:04:38,369 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:04:38,372 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:04:38,372 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:04:38,373 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:04:38,375 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:04:38,375 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:04:38,375 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:04:38,376 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:04:38,376 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:04:38,376 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:04:38,376 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:04:38,376 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:04:38,376 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:04:38,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:04:38,377 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:04:38,377 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:04:38,377 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:04:38,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:04:38,377 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:04:38,377 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:04:38,377 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:04:38,378 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:04:38,379 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 -> 1ccd4b93de7420a1f7847638daedeeee3b82eb082e434a23182d7e5e0aee2085 [2024-11-19 09:04:38,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:04:38,605 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:04:38,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:04:38,609 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:04:38,609 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:04:38,610 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-1.i [2024-11-19 09:04:39,855 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:04:40,082 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:04:40,083 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-1.i [2024-11-19 09:04:40,109 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dc052f33/354749e6e59b46fe8bff57da698d447a/FLAGc2a61c260 [2024-11-19 09:04:40,417 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dc052f33/354749e6e59b46fe8bff57da698d447a [2024-11-19 09:04:40,419 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:04:40,421 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:04:40,422 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:04:40,422 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:04:40,432 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:04:40,433 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:04:40" (1/1) ... [2024-11-19 09:04:40,434 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66882368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:40, skipping insertion in model container [2024-11-19 09:04:40,434 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:04:40" (1/1) ... [2024-11-19 09:04:40,478 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:04:40,828 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-19 09:04:40,863 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-19 09:04:40,866 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-19 09:04:40,869 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-19 09:04:40,875 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-19 09:04:40,905 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-19 09:04:40,906 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-19 09:04:40,910 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-19 09:04:40,910 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-19 09:04:40,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:04:40,953 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:04:41,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:04:41,081 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:04:41,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:41 WrapperNode [2024-11-19 09:04:41,082 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:04:41,083 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:04:41,083 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:04:41,083 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:04:41,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:41" (1/1) ... [2024-11-19 09:04:41,115 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:41" (1/1) ... [2024-11-19 09:04:41,169 INFO L138 Inliner]: procedures = 208, calls = 229, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1312 [2024-11-19 09:04:41,170 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:04:41,171 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:04:41,171 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:04:41,171 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:04:41,184 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:41" (1/1) ... [2024-11-19 09:04:41,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:41" (1/1) ... [2024-11-19 09:04:41,191 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:41" (1/1) ... [2024-11-19 09:04:41,245 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 172, 34]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 42, 4]. [2024-11-19 09:04:41,246 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:41" (1/1) ... [2024-11-19 09:04:41,246 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:41" (1/1) ... [2024-11-19 09:04:41,270 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:41" (1/1) ... [2024-11-19 09:04:41,278 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:41" (1/1) ... [2024-11-19 09:04:41,283 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:41" (1/1) ... [2024-11-19 09:04:41,288 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:41" (1/1) ... [2024-11-19 09:04:41,296 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:04:41,297 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:04:41,297 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:04:41,297 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:04:41,298 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:41" (1/1) ... [2024-11-19 09:04:41,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:04:41,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:04:41,340 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-19 09:04:41,342 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-19 09:04:41,384 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-19 09:04:41,384 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-19 09:04:41,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-19 09:04:41,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-19 09:04:41,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-19 09:04:41,385 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-19 09:04:41,385 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-19 09:04:41,385 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-19 09:04:41,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 09:04:41,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 09:04:41,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 09:04:41,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 09:04:41,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 09:04:41,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 09:04:41,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 09:04:41,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 09:04:41,387 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 09:04:41,387 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 09:04:41,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 09:04:41,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 09:04:41,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 09:04:41,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 09:04:41,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:04:41,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 09:04:41,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 09:04:41,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 09:04:41,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 09:04:41,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 09:04:41,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 09:04:41,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:04:41,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:04:41,564 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:04:41,565 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:04:41,583 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 09:04:41,600 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 09:04:41,615 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 09:04:43,012 INFO L? ?]: Removed 1042 outVars from TransFormulas that were not future-live. [2024-11-19 09:04:43,013 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:04:43,043 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:04:43,043 INFO L316 CfgBuilder]: Removed 54 assume(true) statements. [2024-11-19 09:04:43,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:04:43 BoogieIcfgContainer [2024-11-19 09:04:43,044 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:04:43,045 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:04:43,045 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:04:43,047 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:04:43,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:04:40" (1/3) ... [2024-11-19 09:04:43,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b9e384c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:04:43, skipping insertion in model container [2024-11-19 09:04:43,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:41" (2/3) ... [2024-11-19 09:04:43,049 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b9e384c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:04:43, skipping insertion in model container [2024-11-19 09:04:43,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:04:43" (3/3) ... [2024-11-19 09:04:43,050 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test2-1.i [2024-11-19 09:04:43,062 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:04:43,063 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 424 error locations. [2024-11-19 09:04:43,111 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:04:43,117 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;@68ee7ea2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:04:43,118 INFO L334 AbstractCegarLoop]: Starting to check reachability of 424 error locations. [2024-11-19 09:04:43,128 INFO L276 IsEmpty]: Start isEmpty. Operand has 1076 states, 641 states have (on average 2.012480499219969) internal successors, (1290), 1069 states have internal predecessors, (1290), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-19 09:04:43,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-19 09:04:43,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:43,136 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-19 09:04:43,137 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-19 09:04:43,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:43,142 INFO L85 PathProgramCache]: Analyzing trace with hash 65605, now seen corresponding path program 1 times [2024-11-19 09:04:43,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:43,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502653239] [2024-11-19 09:04:43,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:43,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:43,318 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-19 09:04:43,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:43,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502653239] [2024-11-19 09:04:43,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502653239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:43,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:43,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:04:43,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887875737] [2024-11-19 09:04:43,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:43,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:04:43,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:43,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:04:43,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:04:43,344 INFO L87 Difference]: Start difference. First operand has 1076 states, 641 states have (on average 2.012480499219969) internal successors, (1290), 1069 states have internal predecessors, (1290), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:43,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:43,899 INFO L93 Difference]: Finished difference Result 1062 states and 1236 transitions. [2024-11-19 09:04:43,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:04:43,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-19 09:04:43,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:43,922 INFO L225 Difference]: With dead ends: 1062 [2024-11-19 09:04:43,924 INFO L226 Difference]: Without dead ends: 1060 [2024-11-19 09:04:43,926 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-19 09:04:43,930 INFO L432 NwaCegarLoop]: 847 mSDtfsCounter, 1101 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1109 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:43,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1109 Valid, 899 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 09:04:43,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2024-11-19 09:04:43,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 1060. [2024-11-19 09:04:43,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1060 states, 643 states have (on average 1.8911353032659408) internal successors, (1216), 1053 states have internal predecessors, (1216), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 09:04:44,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1234 transitions. [2024-11-19 09:04:44,003 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1234 transitions. Word has length 3 [2024-11-19 09:04:44,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:44,004 INFO L471 AbstractCegarLoop]: Abstraction has 1060 states and 1234 transitions. [2024-11-19 09:04:44,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:44,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1234 transitions. [2024-11-19 09:04:44,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-19 09:04:44,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:44,005 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-19 09:04:44,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 09:04:44,005 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-19 09:04:44,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:44,006 INFO L85 PathProgramCache]: Analyzing trace with hash 65606, now seen corresponding path program 1 times [2024-11-19 09:04:44,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:44,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46722742] [2024-11-19 09:04:44,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:44,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:44,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:44,087 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-19 09:04:44,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:44,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46722742] [2024-11-19 09:04:44,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46722742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:44,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:44,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:04:44,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455777415] [2024-11-19 09:04:44,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:44,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:04:44,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:44,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:04:44,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:04:44,091 INFO L87 Difference]: Start difference. First operand 1060 states and 1234 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:44,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:44,633 INFO L93 Difference]: Finished difference Result 1379 states and 1641 transitions. [2024-11-19 09:04:44,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:04:44,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-19 09:04:44,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:44,637 INFO L225 Difference]: With dead ends: 1379 [2024-11-19 09:04:44,637 INFO L226 Difference]: Without dead ends: 1379 [2024-11-19 09:04:44,638 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-19 09:04:44,639 INFO L432 NwaCegarLoop]: 1129 mSDtfsCounter, 396 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 1926 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:44,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 1926 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 09:04:44,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2024-11-19 09:04:44,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1291. [2024-11-19 09:04:44,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 870 states have (on average 1.8517241379310345) internal successors, (1611), 1284 states have internal predecessors, (1611), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 09:04:44,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1639 transitions. [2024-11-19 09:04:44,658 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1639 transitions. Word has length 3 [2024-11-19 09:04:44,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:44,658 INFO L471 AbstractCegarLoop]: Abstraction has 1291 states and 1639 transitions. [2024-11-19 09:04:44,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:44,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1639 transitions. [2024-11-19 09:04:44,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 09:04:44,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:44,659 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:44,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 09:04:44,659 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-19 09:04:44,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:44,660 INFO L85 PathProgramCache]: Analyzing trace with hash 458521935, now seen corresponding path program 1 times [2024-11-19 09:04:44,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:44,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703088611] [2024-11-19 09:04:44,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:44,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:44,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:44,856 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-19 09:04:44,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:44,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703088611] [2024-11-19 09:04:44,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703088611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:44,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:44,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:04:44,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197450741] [2024-11-19 09:04:44,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:44,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:04:44,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:44,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:04:44,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:04:44,860 INFO L87 Difference]: Start difference. First operand 1291 states and 1639 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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-19 09:04:45,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:45,741 INFO L93 Difference]: Finished difference Result 1368 states and 1629 transitions. [2024-11-19 09:04:45,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:04:45,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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 7 [2024-11-19 09:04:45,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:45,746 INFO L225 Difference]: With dead ends: 1368 [2024-11-19 09:04:45,746 INFO L226 Difference]: Without dead ends: 1368 [2024-11-19 09:04:45,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:04:45,747 INFO L432 NwaCegarLoop]: 883 mSDtfsCounter, 2203 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2208 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:45,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2208 Valid, 1195 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1100 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 09:04:45,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2024-11-19 09:04:45,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1048. [2024-11-19 09:04:45,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 643 states have (on average 1.8709175738724728) internal successors, (1203), 1041 states have internal predecessors, (1203), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 09:04:45,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1221 transitions. [2024-11-19 09:04:45,766 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1221 transitions. Word has length 7 [2024-11-19 09:04:45,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:45,767 INFO L471 AbstractCegarLoop]: Abstraction has 1048 states and 1221 transitions. [2024-11-19 09:04:45,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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-19 09:04:45,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1221 transitions. [2024-11-19 09:04:45,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 09:04:45,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:45,768 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:45,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 09:04:45,768 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-19 09:04:45,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:45,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1329278099, now seen corresponding path program 1 times [2024-11-19 09:04:45,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:45,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973510088] [2024-11-19 09:04:45,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:45,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:45,842 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-19 09:04:45,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:45,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973510088] [2024-11-19 09:04:45,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973510088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:45,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:45,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:04:45,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533057149] [2024-11-19 09:04:45,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:45,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:04:45,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:45,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:04:45,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:04:45,844 INFO L87 Difference]: Start difference. First operand 1048 states and 1221 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-19 09:04:46,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:46,381 INFO L93 Difference]: Finished difference Result 1348 states and 1608 transitions. [2024-11-19 09:04:46,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:04:46,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2024-11-19 09:04:46,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:46,388 INFO L225 Difference]: With dead ends: 1348 [2024-11-19 09:04:46,388 INFO L226 Difference]: Without dead ends: 1348 [2024-11-19 09:04:46,388 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-19 09:04:46,390 INFO L432 NwaCegarLoop]: 1322 mSDtfsCounter, 867 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 1764 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:46,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 1764 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 09:04:46,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2024-11-19 09:04:46,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 1023. [2024-11-19 09:04:46,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 643 states have (on average 1.8320373250388802) internal successors, (1178), 1016 states have internal predecessors, (1178), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 09:04:46,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1196 transitions. [2024-11-19 09:04:46,409 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1196 transitions. Word has length 8 [2024-11-19 09:04:46,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:46,409 INFO L471 AbstractCegarLoop]: Abstraction has 1023 states and 1196 transitions. [2024-11-19 09:04:46,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-19 09:04:46,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1196 transitions. [2024-11-19 09:04:46,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 09:04:46,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:46,410 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:46,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 09:04:46,411 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-19 09:04:46,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:46,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1329278098, now seen corresponding path program 1 times [2024-11-19 09:04:46,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:46,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404342754] [2024-11-19 09:04:46,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:46,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:46,453 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-19 09:04:46,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:46,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404342754] [2024-11-19 09:04:46,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404342754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:46,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:46,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:04:46,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34336180] [2024-11-19 09:04:46,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:46,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:04:46,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:46,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:04:46,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:04:46,455 INFO L87 Difference]: Start difference. First operand 1023 states and 1196 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-19 09:04:46,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:46,898 INFO L93 Difference]: Finished difference Result 1296 states and 1557 transitions. [2024-11-19 09:04:46,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:04:46,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2024-11-19 09:04:46,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:46,903 INFO L225 Difference]: With dead ends: 1296 [2024-11-19 09:04:46,903 INFO L226 Difference]: Without dead ends: 1296 [2024-11-19 09:04:46,903 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-19 09:04:46,904 INFO L432 NwaCegarLoop]: 1166 mSDtfsCounter, 1075 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 1491 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:46,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1083 Valid, 1491 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 09:04:46,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2024-11-19 09:04:46,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 976. [2024-11-19 09:04:46,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 643 states have (on average 1.7589424572317263) internal successors, (1131), 969 states have internal predecessors, (1131), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 09:04:46,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1149 transitions. [2024-11-19 09:04:46,918 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1149 transitions. Word has length 8 [2024-11-19 09:04:46,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:46,918 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1149 transitions. [2024-11-19 09:04:46,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-19 09:04:46,919 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1149 transitions. [2024-11-19 09:04:46,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 09:04:46,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:46,919 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:46,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 09:04:46,919 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr422ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-19 09:04:46,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:46,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1321547200, now seen corresponding path program 1 times [2024-11-19 09:04:46,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:46,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283610110] [2024-11-19 09:04:46,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:46,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:46,978 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-19 09:04:46,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:46,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283610110] [2024-11-19 09:04:46,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283610110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:46,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:46,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:04:46,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759192457] [2024-11-19 09:04:46,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:46,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:04:46,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:46,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:04:46,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:04:46,981 INFO L87 Difference]: Start difference. First operand 976 states and 1149 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-19 09:04:47,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:47,091 INFO L93 Difference]: Finished difference Result 1930 states and 2278 transitions. [2024-11-19 09:04:47,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:04:47,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2024-11-19 09:04:47,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:47,096 INFO L225 Difference]: With dead ends: 1930 [2024-11-19 09:04:47,097 INFO L226 Difference]: Without dead ends: 1930 [2024-11-19 09:04:47,097 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-19 09:04:47,098 INFO L432 NwaCegarLoop]: 1104 mSDtfsCounter, 1100 mSDsluCounter, 2194 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1108 SdHoareTripleChecker+Valid, 3298 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:47,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1108 Valid, 3298 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 09:04:47,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2024-11-19 09:04:47,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 978. [2024-11-19 09:04:47,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 645 states have (on average 1.7565891472868218) internal successors, (1133), 971 states have internal predecessors, (1133), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 09:04:47,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1151 transitions. [2024-11-19 09:04:47,119 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1151 transitions. Word has length 10 [2024-11-19 09:04:47,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:47,119 INFO L471 AbstractCegarLoop]: Abstraction has 978 states and 1151 transitions. [2024-11-19 09:04:47,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-19 09:04:47,119 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1151 transitions. [2024-11-19 09:04:47,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 09:04:47,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:47,120 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:47,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 09:04:47,120 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-19 09:04:47,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:47,121 INFO L85 PathProgramCache]: Analyzing trace with hash 183846334, now seen corresponding path program 1 times [2024-11-19 09:04:47,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:47,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202639972] [2024-11-19 09:04:47,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:47,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:47,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:47,171 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-19 09:04:47,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:47,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202639972] [2024-11-19 09:04:47,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202639972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:47,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:47,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:04:47,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307481061] [2024-11-19 09:04:47,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:47,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:04:47,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:47,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:04:47,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:04:47,173 INFO L87 Difference]: Start difference. First operand 978 states and 1151 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:47,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:47,679 INFO L93 Difference]: Finished difference Result 1004 states and 1204 transitions. [2024-11-19 09:04:47,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:04:47,680 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-19 09:04:47,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:47,682 INFO L225 Difference]: With dead ends: 1004 [2024-11-19 09:04:47,683 INFO L226 Difference]: Without dead ends: 1004 [2024-11-19 09:04:47,683 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-19 09:04:47,683 INFO L432 NwaCegarLoop]: 737 mSDtfsCounter, 1340 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1348 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:47,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1348 Valid, 1336 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 09:04:47,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2024-11-19 09:04:47,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 955. [2024-11-19 09:04:47,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 645 states have (on average 1.7209302325581395) internal successors, (1110), 948 states have internal predecessors, (1110), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 09:04:47,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1128 transitions. [2024-11-19 09:04:47,696 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1128 transitions. Word has length 18 [2024-11-19 09:04:47,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:47,696 INFO L471 AbstractCegarLoop]: Abstraction has 955 states and 1128 transitions. [2024-11-19 09:04:47,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:47,696 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1128 transitions. [2024-11-19 09:04:47,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 09:04:47,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:47,697 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:47,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 09:04:47,697 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-19 09:04:47,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:47,698 INFO L85 PathProgramCache]: Analyzing trace with hash 183846335, now seen corresponding path program 1 times [2024-11-19 09:04:47,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:47,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876619337] [2024-11-19 09:04:47,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:47,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:47,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:47,738 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-19 09:04:47,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:47,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876619337] [2024-11-19 09:04:47,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876619337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:47,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:47,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:04:47,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204839205] [2024-11-19 09:04:47,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:47,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:04:47,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:47,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:04:47,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:04:47,740 INFO L87 Difference]: Start difference. First operand 955 states and 1128 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:47,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:47,759 INFO L93 Difference]: Finished difference Result 880 states and 1025 transitions. [2024-11-19 09:04:47,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:04:47,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-19 09:04:47,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:47,762 INFO L225 Difference]: With dead ends: 880 [2024-11-19 09:04:47,762 INFO L226 Difference]: Without dead ends: 880 [2024-11-19 09:04:47,762 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-19 09:04:47,763 INFO L432 NwaCegarLoop]: 1003 mSDtfsCounter, 61 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1953 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-19 09:04:47,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1953 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:04:47,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2024-11-19 09:04:47,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 880. [2024-11-19 09:04:47,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 582 states have (on average 1.7302405498281788) internal successors, (1007), 873 states have internal predecessors, (1007), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 09:04:47,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1025 transitions. [2024-11-19 09:04:47,773 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1025 transitions. Word has length 18 [2024-11-19 09:04:47,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:47,774 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 1025 transitions. [2024-11-19 09:04:47,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:47,774 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1025 transitions. [2024-11-19 09:04:47,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 09:04:47,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:47,775 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:47,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 09:04:47,775 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-19 09:04:47,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:47,775 INFO L85 PathProgramCache]: Analyzing trace with hash 582825947, now seen corresponding path program 1 times [2024-11-19 09:04:47,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:47,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770006977] [2024-11-19 09:04:47,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:47,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:47,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:47,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-19 09:04:47,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:47,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770006977] [2024-11-19 09:04:47,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770006977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:47,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:47,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:04:47,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794231095] [2024-11-19 09:04:47,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:47,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:04:47,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:47,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:04:47,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:04:47,813 INFO L87 Difference]: Start difference. First operand 880 states and 1025 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:47,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:47,859 INFO L93 Difference]: Finished difference Result 862 states and 1000 transitions. [2024-11-19 09:04:47,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:04:47,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-19 09:04:47,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:47,861 INFO L225 Difference]: With dead ends: 862 [2024-11-19 09:04:47,862 INFO L226 Difference]: Without dead ends: 862 [2024-11-19 09:04:47,862 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-19 09:04:47,862 INFO L432 NwaCegarLoop]: 968 mSDtfsCounter, 41 mSDsluCounter, 1908 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 2876 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-19 09:04:47,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 2876 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:04:47,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2024-11-19 09:04:47,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 859. [2024-11-19 09:04:47,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 568 states have (on average 1.7235915492957747) internal successors, (979), 852 states have internal predecessors, (979), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 09:04:47,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 997 transitions. [2024-11-19 09:04:47,874 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 997 transitions. Word has length 20 [2024-11-19 09:04:47,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:47,875 INFO L471 AbstractCegarLoop]: Abstraction has 859 states and 997 transitions. [2024-11-19 09:04:47,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:47,875 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 997 transitions. [2024-11-19 09:04:47,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 09:04:47,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:47,875 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:47,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 09:04:47,876 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-19 09:04:47,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:47,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1292750889, now seen corresponding path program 1 times [2024-11-19 09:04:47,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:47,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535672671] [2024-11-19 09:04:47,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:47,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:47,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:47,973 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-19 09:04:47,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:47,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535672671] [2024-11-19 09:04:47,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535672671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:47,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:47,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:04:47,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517431711] [2024-11-19 09:04:47,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:47,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:04:47,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:47,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:04:47,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:04:47,975 INFO L87 Difference]: Start difference. First operand 859 states and 997 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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-19 09:04:48,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:48,525 INFO L93 Difference]: Finished difference Result 1315 states and 1572 transitions. [2024-11-19 09:04:48,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:04:48,525 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 34 [2024-11-19 09:04:48,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:48,529 INFO L225 Difference]: With dead ends: 1315 [2024-11-19 09:04:48,529 INFO L226 Difference]: Without dead ends: 1315 [2024-11-19 09:04:48,530 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-19 09:04:48,530 INFO L432 NwaCegarLoop]: 809 mSDtfsCounter, 816 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 1913 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:48,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 1913 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 09:04:48,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2024-11-19 09:04:48,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 855. [2024-11-19 09:04:48,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 568 states have (on average 1.716549295774648) internal successors, (975), 848 states have internal predecessors, (975), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 09:04:48,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 993 transitions. [2024-11-19 09:04:48,546 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 993 transitions. Word has length 34 [2024-11-19 09:04:48,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:48,547 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 993 transitions. [2024-11-19 09:04:48,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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-19 09:04:48,547 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 993 transitions. [2024-11-19 09:04:48,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-19 09:04:48,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:48,549 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] [2024-11-19 09:04:48,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 09:04:48,549 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-19 09:04:48,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:48,549 INFO L85 PathProgramCache]: Analyzing trace with hash 808848765, now seen corresponding path program 1 times [2024-11-19 09:04:48,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:48,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157324821] [2024-11-19 09:04:48,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:48,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:48,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:48,640 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-19 09:04:48,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:48,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157324821] [2024-11-19 09:04:48,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157324821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:48,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:48,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:04:48,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396585942] [2024-11-19 09:04:48,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:48,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:04:48,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:48,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:04:48,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:04:48,642 INFO L87 Difference]: Start difference. First operand 855 states and 993 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-19 09:04:48,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:48,682 INFO L93 Difference]: Finished difference Result 855 states and 989 transitions. [2024-11-19 09:04:48,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:04:48,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-19 09:04:48,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:48,686 INFO L225 Difference]: With dead ends: 855 [2024-11-19 09:04:48,687 INFO L226 Difference]: Without dead ends: 855 [2024-11-19 09:04:48,687 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-19 09:04:48,688 INFO L432 NwaCegarLoop]: 963 mSDtfsCounter, 21 mSDsluCounter, 1895 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2858 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-19 09:04:48,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2858 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:04:48,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2024-11-19 09:04:48,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 855. [2024-11-19 09:04:48,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 568 states have (on average 1.7095070422535212) internal successors, (971), 848 states have internal predecessors, (971), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 09:04:48,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 989 transitions. [2024-11-19 09:04:48,699 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 989 transitions. Word has length 68 [2024-11-19 09:04:48,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:48,699 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 989 transitions. [2024-11-19 09:04:48,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-19 09:04:48,699 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 989 transitions. [2024-11-19 09:04:48,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-19 09:04:48,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:48,702 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-19 09:04:48,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 09:04:48,702 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-19 09:04:48,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:48,702 INFO L85 PathProgramCache]: Analyzing trace with hash -324916151, now seen corresponding path program 1 times [2024-11-19 09:04:48,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:48,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211267145] [2024-11-19 09:04:48,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:48,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:48,814 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-19 09:04:48,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:48,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211267145] [2024-11-19 09:04:48,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211267145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:48,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:48,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:04:48,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613568500] [2024-11-19 09:04:48,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:48,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:04:48,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:48,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:04:48,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:04:48,816 INFO L87 Difference]: Start difference. First operand 855 states and 989 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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-19 09:04:48,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:48,861 INFO L93 Difference]: Finished difference Result 1194 states and 1432 transitions. [2024-11-19 09:04:48,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:04:48,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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-19 09:04:48,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:48,865 INFO L225 Difference]: With dead ends: 1194 [2024-11-19 09:04:48,865 INFO L226 Difference]: Without dead ends: 1194 [2024-11-19 09:04:48,865 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-19 09:04:48,865 INFO L432 NwaCegarLoop]: 1259 mSDtfsCounter, 361 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 2192 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:48,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 2192 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:04:48,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2024-11-19 09:04:48,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1140. [2024-11-19 09:04:48,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 848 states have (on average 1.6521226415094339) internal successors, (1401), 1133 states have internal predecessors, (1401), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 09:04:48,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1429 transitions. [2024-11-19 09:04:48,880 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1429 transitions. Word has length 76 [2024-11-19 09:04:48,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:48,880 INFO L471 AbstractCegarLoop]: Abstraction has 1140 states and 1429 transitions. [2024-11-19 09:04:48,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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-19 09:04:48,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1429 transitions. [2024-11-19 09:04:48,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 09:04:48,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:48,881 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] [2024-11-19 09:04:48,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 09:04:48,882 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-19 09:04:48,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:48,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1012783132, now seen corresponding path program 1 times [2024-11-19 09:04:48,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:48,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329732397] [2024-11-19 09:04:48,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:48,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:48,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:49,115 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-19 09:04:49,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:49,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329732397] [2024-11-19 09:04:49,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329732397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:49,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:49,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:04:49,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119958626] [2024-11-19 09:04:49,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:49,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:04:49,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:49,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:04:49,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:04:49,118 INFO L87 Difference]: Start difference. First operand 1140 states and 1429 transitions. Second operand has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 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-19 09:04:49,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:49,625 INFO L93 Difference]: Finished difference Result 1139 states and 1428 transitions. [2024-11-19 09:04:49,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:04:49,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 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 84 [2024-11-19 09:04:49,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:49,629 INFO L225 Difference]: With dead ends: 1139 [2024-11-19 09:04:49,629 INFO L226 Difference]: Without dead ends: 1139 [2024-11-19 09:04:49,629 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-19 09:04:49,630 INFO L432 NwaCegarLoop]: 974 mSDtfsCounter, 2 mSDsluCounter, 1931 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2905 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:49,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2905 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 09:04:49,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2024-11-19 09:04:49,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1139. [2024-11-19 09:04:49,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 848 states have (on average 1.650943396226415) internal successors, (1400), 1132 states have internal predecessors, (1400), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 09:04:49,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1428 transitions. [2024-11-19 09:04:49,644 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1428 transitions. Word has length 84 [2024-11-19 09:04:49,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:49,645 INFO L471 AbstractCegarLoop]: Abstraction has 1139 states and 1428 transitions. [2024-11-19 09:04:49,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 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-19 09:04:49,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1428 transitions. [2024-11-19 09:04:49,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 09:04:49,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:49,646 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] [2024-11-19 09:04:49,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 09:04:49,646 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-19 09:04:49,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:49,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1012783133, now seen corresponding path program 1 times [2024-11-19 09:04:49,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:49,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462721466] [2024-11-19 09:04:49,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:49,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:49,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:50,024 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-19 09:04:50,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:50,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462721466] [2024-11-19 09:04:50,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462721466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:50,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:50,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:04:50,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426472959] [2024-11-19 09:04:50,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:50,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:04:50,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:50,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:04:50,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:04:50,027 INFO L87 Difference]: Start difference. First operand 1139 states and 1428 transitions. Second operand has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 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-19 09:04:50,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:50,619 INFO L93 Difference]: Finished difference Result 1138 states and 1427 transitions. [2024-11-19 09:04:50,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:04:50,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 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 84 [2024-11-19 09:04:50,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:50,622 INFO L225 Difference]: With dead ends: 1138 [2024-11-19 09:04:50,622 INFO L226 Difference]: Without dead ends: 1138 [2024-11-19 09:04:50,623 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-19 09:04:50,623 INFO L432 NwaCegarLoop]: 974 mSDtfsCounter, 1 mSDsluCounter, 1902 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2876 SdHoareTripleChecker+Invalid, 1025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:50,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2876 Invalid, 1025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 09:04:50,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2024-11-19 09:04:50,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1138. [2024-11-19 09:04:50,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 847 states have (on average 1.6517119244391971) internal successors, (1399), 1131 states have internal predecessors, (1399), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 09:04:50,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1427 transitions. [2024-11-19 09:04:50,637 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1427 transitions. Word has length 84 [2024-11-19 09:04:50,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:50,638 INFO L471 AbstractCegarLoop]: Abstraction has 1138 states and 1427 transitions. [2024-11-19 09:04:50,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 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-19 09:04:50,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1427 transitions. [2024-11-19 09:04:50,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-19 09:04:50,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:50,638 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-19 09:04:50,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 09:04:50,639 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-19 09:04:50,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:50,639 INFO L85 PathProgramCache]: Analyzing trace with hash 243663683, now seen corresponding path program 1 times [2024-11-19 09:04:50,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:50,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939425892] [2024-11-19 09:04:50,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:50,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:50,852 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-19 09:04:50,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:50,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939425892] [2024-11-19 09:04:50,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939425892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:50,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:50,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 09:04:50,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893690258] [2024-11-19 09:04:50,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:50,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 09:04:50,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:50,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 09:04:50,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:04:50,854 INFO L87 Difference]: Start difference. First operand 1138 states and 1427 transitions. Second operand has 7 states, 5 states have (on average 18.0) internal successors, (90), 6 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-19 09:04:51,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:51,467 INFO L93 Difference]: Finished difference Result 1150 states and 1442 transitions. [2024-11-19 09:04:51,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 09:04:51,468 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 18.0) internal successors, (90), 6 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-19 09:04:51,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:51,472 INFO L225 Difference]: With dead ends: 1150 [2024-11-19 09:04:51,472 INFO L226 Difference]: Without dead ends: 1150 [2024-11-19 09:04:51,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-19 09:04:51,474 INFO L432 NwaCegarLoop]: 959 mSDtfsCounter, 13 mSDsluCounter, 2906 mSDsCounter, 0 mSdLazyCounter, 1017 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3865 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:51,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3865 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1017 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 09:04:51,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2024-11-19 09:04:51,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1144. [2024-11-19 09:04:51,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 852 states have (on average 1.6502347417840375) internal successors, (1406), 1136 states have internal predecessors, (1406), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (16), 6 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-19 09:04:51,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1437 transitions. [2024-11-19 09:04:51,488 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1437 transitions. Word has length 92 [2024-11-19 09:04:51,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:51,489 INFO L471 AbstractCegarLoop]: Abstraction has 1144 states and 1437 transitions. [2024-11-19 09:04:51,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 18.0) internal successors, (90), 6 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-19 09:04:51,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1437 transitions. [2024-11-19 09:04:51,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-19 09:04:51,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:51,490 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-19 09:04:51,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 09:04:51,490 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-19 09:04:51,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:51,490 INFO L85 PathProgramCache]: Analyzing trace with hash 243663684, now seen corresponding path program 1 times [2024-11-19 09:04:51,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:51,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003560407] [2024-11-19 09:04:51,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:51,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:51,929 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-19 09:04:51,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:51,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003560407] [2024-11-19 09:04:51,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003560407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:51,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:51,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:04:51,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062112712] [2024-11-19 09:04:51,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:51,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:04:51,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:51,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:04:51,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:04:51,933 INFO L87 Difference]: Start difference. First operand 1144 states and 1437 transitions. Second operand has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 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-19 09:04:52,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:52,570 INFO L93 Difference]: Finished difference Result 1144 states and 1436 transitions. [2024-11-19 09:04:52,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:04:52,570 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 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-19 09:04:52,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:52,573 INFO L225 Difference]: With dead ends: 1144 [2024-11-19 09:04:52,574 INFO L226 Difference]: Without dead ends: 1144 [2024-11-19 09:04:52,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:04:52,574 INFO L432 NwaCegarLoop]: 963 mSDtfsCounter, 8 mSDsluCounter, 2702 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3665 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:52,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3665 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 09:04:52,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2024-11-19 09:04:52,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1144. [2024-11-19 09:04:52,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 852 states have (on average 1.6490610328638498) internal successors, (1405), 1136 states have internal predecessors, (1405), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (16), 6 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-19 09:04:52,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1436 transitions. [2024-11-19 09:04:52,588 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1436 transitions. Word has length 92 [2024-11-19 09:04:52,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:52,589 INFO L471 AbstractCegarLoop]: Abstraction has 1144 states and 1436 transitions. [2024-11-19 09:04:52,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 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-19 09:04:52,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1436 transitions. [2024-11-19 09:04:52,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-19 09:04:52,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:52,590 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-19 09:04:52,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 09:04:52,590 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-19 09:04:52,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:52,590 INFO L85 PathProgramCache]: Analyzing trace with hash -461782989, now seen corresponding path program 1 times [2024-11-19 09:04:52,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:52,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708238643] [2024-11-19 09:04:52,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:52,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:52,949 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-19 09:04:52,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:52,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708238643] [2024-11-19 09:04:52,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708238643] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:04:52,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166225245] [2024-11-19 09:04:52,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:52,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:04:52,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:04:52,952 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-19 09:04:52,953 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-19 09:04:53,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:53,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-19 09:04:53,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:04:53,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:04:53,300 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-19 09:04:53,300 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 17 treesize of output 21 [2024-11-19 09:04:53,333 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-19 09:04:53,398 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-19 09:04:53,546 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:04:53,546 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-19 09:04:53,578 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-19 09:04:53,601 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-19 09:04:53,601 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:04:53,626 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_596 (Array Int Int))) (= 1 (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_596) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))))) is different from false [2024-11-19 09:04:53,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166225245] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:04:53,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:04:53,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-19 09:04:53,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568697190] [2024-11-19 09:04:53,628 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:04:53,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-19 09:04:53,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:53,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-19 09:04:53,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=290, Unknown=1, NotChecked=34, Total=380 [2024-11-19 09:04:53,632 INFO L87 Difference]: Start difference. First operand 1144 states and 1436 transitions. Second operand has 19 states, 16 states have (on average 9.1875) internal successors, (147), 18 states have internal predecessors, (147), 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-19 09:04:55,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:55,618 INFO L93 Difference]: Finished difference Result 1151 states and 1443 transitions. [2024-11-19 09:04:55,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 09:04:55,619 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.1875) internal successors, (147), 18 states have internal predecessors, (147), 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 93 [2024-11-19 09:04:55,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:55,621 INFO L225 Difference]: With dead ends: 1151 [2024-11-19 09:04:55,622 INFO L226 Difference]: Without dead ends: 1151 [2024-11-19 09:04:55,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=427, Unknown=1, NotChecked=42, Total=552 [2024-11-19 09:04:55,622 INFO L432 NwaCegarLoop]: 626 mSDtfsCounter, 870 mSDsluCounter, 6620 mSDsCounter, 0 mSdLazyCounter, 4443 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 7246 SdHoareTripleChecker+Invalid, 4465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 4443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:55,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 7246 Invalid, 4465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 4443 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-19 09:04:55,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2024-11-19 09:04:55,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 1148. [2024-11-19 09:04:55,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 856 states have (on average 1.6460280373831775) internal successors, (1409), 1139 states have internal predecessors, (1409), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 09:04:55,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1438 transitions. [2024-11-19 09:04:55,634 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1438 transitions. Word has length 93 [2024-11-19 09:04:55,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:55,634 INFO L471 AbstractCegarLoop]: Abstraction has 1148 states and 1438 transitions. [2024-11-19 09:04:55,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.1875) internal successors, (147), 18 states have internal predecessors, (147), 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-19 09:04:55,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1438 transitions. [2024-11-19 09:04:55,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-19 09:04:55,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:55,635 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-19 09:04:55,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 09:04:55,839 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,SelfDestructingSolverStorable16 [2024-11-19 09:04:55,840 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-19 09:04:55,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:55,840 INFO L85 PathProgramCache]: Analyzing trace with hash -461782988, now seen corresponding path program 1 times [2024-11-19 09:04:55,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:55,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984808503] [2024-11-19 09:04:55,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:55,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:56,517 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-19 09:04:56,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:56,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984808503] [2024-11-19 09:04:56,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984808503] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:04:56,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791598882] [2024-11-19 09:04:56,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:56,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:04:56,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:04:56,520 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-19 09:04:56,521 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-19 09:04:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:56,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-19 09:04:56,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:04:56,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:04:56,805 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 09:04:56,806 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-19 09:04:56,810 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-19 09:04:56,822 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-19 09:04:56,825 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-19 09:04:56,884 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-19 09:04:56,888 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-19 09:04:56,965 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:04:56,966 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-19 09:04:56,971 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-19 09:04:56,994 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-19 09:04:57,001 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-19 09:04:57,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-19 09:04:57,002 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:04:57,078 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_740 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_740) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_740 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (<= (+ 20 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_740) |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~mem54#1.base| v_ArrVal_741) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-19 09:04:57,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791598882] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:04:57,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:04:57,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2024-11-19 09:04:57,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823719059] [2024-11-19 09:04:57,081 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:04:57,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 09:04:57,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:57,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 09:04:57,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=225, Unknown=1, NotChecked=30, Total=306 [2024-11-19 09:04:57,082 INFO L87 Difference]: Start difference. First operand 1148 states and 1438 transitions. Second operand has 15 states, 12 states have (on average 11.75) internal successors, (141), 15 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 09:04:59,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:59,168 INFO L93 Difference]: Finished difference Result 1150 states and 1442 transitions. [2024-11-19 09:04:59,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 09:04:59,168 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 11.75) internal successors, (141), 15 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 93 [2024-11-19 09:04:59,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:59,171 INFO L225 Difference]: With dead ends: 1150 [2024-11-19 09:04:59,171 INFO L226 Difference]: Without dead ends: 1150 [2024-11-19 09:04:59,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=345, Unknown=1, NotChecked=38, Total=462 [2024-11-19 09:04:59,172 INFO L432 NwaCegarLoop]: 629 mSDtfsCounter, 869 mSDsluCounter, 5305 mSDsCounter, 0 mSdLazyCounter, 4708 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 5934 SdHoareTripleChecker+Invalid, 4727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:59,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 5934 Invalid, 4727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4708 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-19 09:04:59,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2024-11-19 09:04:59,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1141. [2024-11-19 09:04:59,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 851 states have (on average 1.6474735605170387) internal successors, (1402), 1133 states have internal predecessors, (1402), 15 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 09:04:59,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1430 transitions. [2024-11-19 09:04:59,183 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1430 transitions. Word has length 93 [2024-11-19 09:04:59,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:59,184 INFO L471 AbstractCegarLoop]: Abstraction has 1141 states and 1430 transitions. [2024-11-19 09:04:59,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 11.75) internal successors, (141), 15 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 09:04:59,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1430 transitions. [2024-11-19 09:04:59,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 09:04:59,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:59,184 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-19 09:04:59,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 09:04:59,388 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,SelfDestructingSolverStorable17 [2024-11-19 09:04:59,389 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-19 09:04:59,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:59,391 INFO L85 PathProgramCache]: Analyzing trace with hash 490689540, now seen corresponding path program 1 times [2024-11-19 09:04:59,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:59,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009949002] [2024-11-19 09:04:59,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:59,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:59,788 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-19 09:04:59,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:59,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009949002] [2024-11-19 09:04:59,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009949002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:59,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:59,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-19 09:04:59,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060274202] [2024-11-19 09:04:59,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:59,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 09:04:59,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:59,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 09:04:59,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-19 09:04:59,789 INFO L87 Difference]: Start difference. First operand 1141 states and 1430 transitions. Second operand has 14 states, 12 states have (on average 7.75) internal successors, (93), 13 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-19 09:05:00,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:00,999 INFO L93 Difference]: Finished difference Result 1154 states and 1446 transitions. [2024-11-19 09:05:00,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 09:05:01,000 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.75) internal successors, (93), 13 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-19 09:05:01,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:01,003 INFO L225 Difference]: With dead ends: 1154 [2024-11-19 09:05:01,003 INFO L226 Difference]: Without dead ends: 1154 [2024-11-19 09:05:01,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-11-19 09:05:01,003 INFO L432 NwaCegarLoop]: 626 mSDtfsCounter, 906 mSDsluCounter, 4843 mSDsCounter, 0 mSdLazyCounter, 3335 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 5469 SdHoareTripleChecker+Invalid, 3354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:01,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [915 Valid, 5469 Invalid, 3354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3335 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 09:05:01,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2024-11-19 09:05:01,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1150. [2024-11-19 09:05:01,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 859 states have (on average 1.6437718277066355) internal successors, (1412), 1141 states have internal predecessors, (1412), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 09:05:01,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1441 transitions. [2024-11-19 09:05:01,014 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1441 transitions. Word has length 95 [2024-11-19 09:05:01,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:01,015 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1441 transitions. [2024-11-19 09:05:01,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.75) internal successors, (93), 13 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-19 09:05:01,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1441 transitions. [2024-11-19 09:05:01,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 09:05:01,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:01,016 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:05:01,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 09:05:01,016 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-19 09:05:01,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:01,016 INFO L85 PathProgramCache]: Analyzing trace with hash 490689541, now seen corresponding path program 1 times [2024-11-19 09:05:01,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:05:01,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897300875] [2024-11-19 09:05:01,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:01,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:05:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:01,498 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-19 09:05:01,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:05:01,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897300875] [2024-11-19 09:05:01,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897300875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:05:01,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:05:01,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 09:05:01,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641267701] [2024-11-19 09:05:01,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:05:01,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 09:05:01,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:05:01,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 09:05:01,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-19 09:05:01,501 INFO L87 Difference]: Start difference. First operand 1150 states and 1441 transitions. Second operand has 11 states, 10 states have (on average 9.3) internal successors, (93), 11 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-19 09:05:02,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:02,724 INFO L93 Difference]: Finished difference Result 1153 states and 1445 transitions. [2024-11-19 09:05:02,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 09:05:02,724 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.3) internal successors, (93), 11 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-19 09:05:02,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:02,727 INFO L225 Difference]: With dead ends: 1153 [2024-11-19 09:05:02,727 INFO L226 Difference]: Without dead ends: 1153 [2024-11-19 09:05:02,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-19 09:05:02,728 INFO L432 NwaCegarLoop]: 630 mSDtfsCounter, 901 mSDsluCounter, 3159 mSDsCounter, 0 mSdLazyCounter, 3048 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 3789 SdHoareTripleChecker+Invalid, 3065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:02,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 3789 Invalid, 3065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3048 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 09:05:02,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2024-11-19 09:05:02,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1150. [2024-11-19 09:05:02,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 859 states have (on average 1.6426076833527357) internal successors, (1411), 1141 states have internal predecessors, (1411), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 09:05:02,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1440 transitions. [2024-11-19 09:05:02,739 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1440 transitions. Word has length 95 [2024-11-19 09:05:02,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:02,740 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1440 transitions. [2024-11-19 09:05:02,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.3) internal successors, (93), 11 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-19 09:05:02,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1440 transitions. [2024-11-19 09:05:02,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-19 09:05:02,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:02,741 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-19 09:05:02,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 09:05:02,741 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-19 09:05:02,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:02,741 INFO L85 PathProgramCache]: Analyzing trace with hash -196136684, now seen corresponding path program 1 times [2024-11-19 09:05:02,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:05:02,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646406147] [2024-11-19 09:05:02,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:02,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:05:02,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:03,184 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-19 09:05:03,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:05:03,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646406147] [2024-11-19 09:05:03,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646406147] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:05:03,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573664795] [2024-11-19 09:05:03,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:03,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:05:03,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:05:03,187 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-19 09:05:03,189 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-19 09:05:03,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:03,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-19 09:05:03,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:05:03,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:05:03,474 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-19 09:05:03,474 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 17 treesize of output 21 [2024-11-19 09:05:03,499 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-19 09:05:03,564 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-19 09:05:03,668 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:05:03,669 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-19 09:05:03,740 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:05:03,741 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-19 09:05:03,757 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-19 09:05:03,788 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-19 09:05:03,789 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:05:03,870 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1025 (Array Int Int)) (v_ArrVal_1022 (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_1025))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1022)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-19 09:05:03,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573664795] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:05:03,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:05:03,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2024-11-19 09:05:03,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669164519] [2024-11-19 09:05:03,871 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:05:03,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-19 09:05:03,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:05:03,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-19 09:05:03,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=456, Unknown=18, NotChecked=44, Total=600 [2024-11-19 09:05:03,873 INFO L87 Difference]: Start difference. First operand 1150 states and 1440 transitions. Second operand has 22 states, 19 states have (on average 8.052631578947368) internal successors, (153), 21 states have internal predecessors, (153), 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-19 09:05:05,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:05,837 INFO L93 Difference]: Finished difference Result 1152 states and 1444 transitions. [2024-11-19 09:05:05,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 09:05:05,838 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.052631578947368) internal successors, (153), 21 states have internal predecessors, (153), 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-19 09:05:05,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:05,841 INFO L225 Difference]: With dead ends: 1152 [2024-11-19 09:05:05,841 INFO L226 Difference]: Without dead ends: 1152 [2024-11-19 09:05:05,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=584, Unknown=18, NotChecked=50, Total=756 [2024-11-19 09:05:05,842 INFO L432 NwaCegarLoop]: 625 mSDtfsCounter, 865 mSDsluCounter, 7813 mSDsCounter, 0 mSdLazyCounter, 5080 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 8438 SdHoareTripleChecker+Invalid, 5100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 5080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:05,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 8438 Invalid, 5100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 5080 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-19 09:05:05,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2024-11-19 09:05:05,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1149. [2024-11-19 09:05:05,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 859 states have (on average 1.6414435389988358) internal successors, (1410), 1140 states have internal predecessors, (1410), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 09:05:05,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1439 transitions. [2024-11-19 09:05:05,857 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1439 transitions. Word has length 96 [2024-11-19 09:05:05,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:05,857 INFO L471 AbstractCegarLoop]: Abstraction has 1149 states and 1439 transitions. [2024-11-19 09:05:05,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.052631578947368) internal successors, (153), 21 states have internal predecessors, (153), 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-19 09:05:05,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1439 transitions. [2024-11-19 09:05:05,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-19 09:05:05,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:05,858 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-19 09:05:05,872 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-19 09:05:06,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:05:06,059 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-19 09:05:06,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:06,060 INFO L85 PathProgramCache]: Analyzing trace with hash -196136683, now seen corresponding path program 1 times [2024-11-19 09:05:06,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:05:06,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106712823] [2024-11-19 09:05:06,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:06,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:05:06,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:06,651 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-19 09:05:06,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:05:06,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106712823] [2024-11-19 09:05:06,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106712823] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:05:06,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476038188] [2024-11-19 09:05:06,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:06,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:05:06,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:05:06,653 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-19 09:05:06,654 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-19 09:05:06,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:06,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-19 09:05:06,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:05:06,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:05:06,920 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-19 09:05:06,928 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 09:05:06,929 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-19 09:05:06,937 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-19 09:05:06,941 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-19 09:05:06,988 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-19 09:05:06,991 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-19 09:05:07,060 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:05:07,060 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-19 09:05:07,064 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-19 09:05:07,117 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:05:07,118 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-19 09:05:07,123 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-19 09:05:07,147 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-19 09:05:07,151 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-19 09:05:07,153 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-19 09:05:07,154 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:05:07,198 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1177 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1177) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1178 (Array Int Int)) (v_ArrVal_1177 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1177) |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~mem56#1.base| v_ArrVal_1178) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-19 09:05:07,206 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_1177 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1177) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1178 (Array Int Int)) (v_ArrVal_1177 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1177) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1178) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-19 09:05:07,250 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1184 (Array Int Int)) (v_ArrVal_1183 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1184) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1183) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1177) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1178 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1184 (Array Int Int)) (v_ArrVal_1183 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1183))) (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_1184) .cse1 v_ArrVal_1177) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1178) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-19 09:05:07,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476038188] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:05:07,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:05:07,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2024-11-19 09:05:07,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010554010] [2024-11-19 09:05:07,252 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:05:07,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 09:05:07,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:05:07,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 09:05:07,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=286, Unknown=3, NotChecked=108, Total=462 [2024-11-19 09:05:07,253 INFO L87 Difference]: Start difference. First operand 1149 states and 1439 transitions. Second operand has 17 states, 14 states have (on average 10.428571428571429) internal successors, (146), 17 states have internal predecessors, (146), 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-19 09:05:09,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:09,324 INFO L93 Difference]: Finished difference Result 1151 states and 1443 transitions. [2024-11-19 09:05:09,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 09:05:09,326 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 10.428571428571429) internal successors, (146), 17 states have internal predecessors, (146), 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 96 [2024-11-19 09:05:09,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:09,329 INFO L225 Difference]: With dead ends: 1151 [2024-11-19 09:05:09,329 INFO L226 Difference]: Without dead ends: 1151 [2024-11-19 09:05:09,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=459, Unknown=3, NotChecked=138, Total=702 [2024-11-19 09:05:09,330 INFO L432 NwaCegarLoop]: 628 mSDtfsCounter, 868 mSDsluCounter, 5218 mSDsCounter, 0 mSdLazyCounter, 4844 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 877 SdHoareTripleChecker+Valid, 5846 SdHoareTripleChecker+Invalid, 4865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:09,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [877 Valid, 5846 Invalid, 4865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4844 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-19 09:05:09,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2024-11-19 09:05:09,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 1139. [2024-11-19 09:05:09,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 851 states have (on average 1.645123384253819) internal successors, (1400), 1131 states have internal predecessors, (1400), 15 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 09:05:09,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1428 transitions. [2024-11-19 09:05:09,345 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1428 transitions. Word has length 96 [2024-11-19 09:05:09,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:09,345 INFO L471 AbstractCegarLoop]: Abstraction has 1139 states and 1428 transitions. [2024-11-19 09:05:09,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 10.428571428571429) internal successors, (146), 17 states have internal predecessors, (146), 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-19 09:05:09,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1428 transitions. [2024-11-19 09:05:09,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-19 09:05:09,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:09,346 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-19 09:05:09,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 09:05:09,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:05:09,550 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-19 09:05:09,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:09,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1935942966, now seen corresponding path program 1 times [2024-11-19 09:05:09,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:05:09,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158326934] [2024-11-19 09:05:09,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:09,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:05:09,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:10,001 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-19 09:05:10,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:05:10,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158326934] [2024-11-19 09:05:10,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158326934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:05:10,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:05:10,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-19 09:05:10,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008453503] [2024-11-19 09:05:10,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:05:10,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 09:05:10,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:05:10,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 09:05:10,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-19 09:05:10,003 INFO L87 Difference]: Start difference. First operand 1139 states and 1428 transitions. Second operand has 15 states, 13 states have (on average 7.384615384615385) internal successors, (96), 14 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-19 09:05:11,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:11,270 INFO L93 Difference]: Finished difference Result 1155 states and 1447 transitions. [2024-11-19 09:05:11,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 09:05:11,270 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.384615384615385) internal successors, (96), 14 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-19 09:05:11,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:11,283 INFO L225 Difference]: With dead ends: 1155 [2024-11-19 09:05:11,283 INFO L226 Difference]: Without dead ends: 1155 [2024-11-19 09:05:11,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2024-11-19 09:05:11,284 INFO L432 NwaCegarLoop]: 625 mSDtfsCounter, 889 mSDsluCounter, 5412 mSDsCounter, 0 mSdLazyCounter, 3706 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 6037 SdHoareTripleChecker+Invalid, 3725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:11,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 6037 Invalid, 3725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3706 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-19 09:05:11,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2024-11-19 09:05:11,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1151. [2024-11-19 09:05:11,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 862 states have (on average 1.6392111368909512) internal successors, (1413), 1142 states have internal predecessors, (1413), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 09:05:11,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1442 transitions. [2024-11-19 09:05:11,299 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1442 transitions. Word has length 98 [2024-11-19 09:05:11,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:11,300 INFO L471 AbstractCegarLoop]: Abstraction has 1151 states and 1442 transitions. [2024-11-19 09:05:11,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.384615384615385) internal successors, (96), 14 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-19 09:05:11,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1442 transitions. [2024-11-19 09:05:11,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-19 09:05:11,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:11,300 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-19 09:05:11,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 09:05:11,301 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-19 09:05:11,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:11,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1935942965, now seen corresponding path program 1 times [2024-11-19 09:05:11,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:05:11,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859838950] [2024-11-19 09:05:11,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:11,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:05:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:11,809 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-19 09:05:11,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:05:11,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859838950] [2024-11-19 09:05:11,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859838950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:05:11,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:05:11,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 09:05:11,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416722519] [2024-11-19 09:05:11,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:05:11,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 09:05:11,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:05:11,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 09:05:11,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-19 09:05:11,811 INFO L87 Difference]: Start difference. First operand 1151 states and 1442 transitions. Second operand has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 12 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-19 09:05:13,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:13,345 INFO L93 Difference]: Finished difference Result 1154 states and 1446 transitions. [2024-11-19 09:05:13,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 09:05:13,346 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 12 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-19 09:05:13,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:13,348 INFO L225 Difference]: With dead ends: 1154 [2024-11-19 09:05:13,348 INFO L226 Difference]: Without dead ends: 1154 [2024-11-19 09:05:13,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-19 09:05:13,349 INFO L432 NwaCegarLoop]: 629 mSDtfsCounter, 901 mSDsluCounter, 4132 mSDsCounter, 0 mSdLazyCounter, 4007 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 4761 SdHoareTripleChecker+Invalid, 4024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 4007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:13,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 4761 Invalid, 4024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 4007 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-19 09:05:13,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2024-11-19 09:05:13,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1151. [2024-11-19 09:05:13,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 862 states have (on average 1.6380510440835268) internal successors, (1412), 1142 states have internal predecessors, (1412), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 09:05:13,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1441 transitions. [2024-11-19 09:05:13,360 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1441 transitions. Word has length 98 [2024-11-19 09:05:13,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:13,360 INFO L471 AbstractCegarLoop]: Abstraction has 1151 states and 1441 transitions. [2024-11-19 09:05:13,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 12 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-19 09:05:13,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1441 transitions. [2024-11-19 09:05:13,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-19 09:05:13,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:13,361 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-19 09:05:13,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 09:05:13,361 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-19 09:05:13,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:13,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1951784006, now seen corresponding path program 1 times [2024-11-19 09:05:13,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:05:13,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420747911] [2024-11-19 09:05:13,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:13,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:05:13,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:13,772 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-19 09:05:13,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:05:13,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420747911] [2024-11-19 09:05:13,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420747911] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:05:13,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674963993] [2024-11-19 09:05:13,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:13,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:05:13,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:05:13,775 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-19 09:05:13,776 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-19 09:05:13,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:13,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 09:05:13,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:05:13,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:05:14,036 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-19 09:05:14,037 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 17 treesize of output 21 [2024-11-19 09:05:14,060 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-19 09:05:14,114 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-19 09:05:14,198 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:05:14,198 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-19 09:05:14,265 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:05:14,265 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-19 09:05:14,301 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:05:14,302 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-19 09:05:14,311 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-19 09:05:14,330 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-19 09:05:14,330 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:05:14,341 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1490 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1490) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-19 09:05:14,369 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1489 (Array Int Int)) (v_ArrVal_1490 (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~mem56#1.base| v_ArrVal_1489))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1490)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-19 09:05:18,432 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1489 (Array Int Int)) (v_ArrVal_1493 (Array Int Int)) (v_ArrVal_1490 (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~mem54#1.base| v_ArrVal_1493))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1489)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1490)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-19 09:05:18,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674963993] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:05:18,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:05:18,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2024-11-19 09:05:18,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319669337] [2024-11-19 09:05:18,434 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:05:18,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-19 09:05:18,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:05:18,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 09:05:18,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=541, Unknown=16, NotChecked=150, Total=812 [2024-11-19 09:05:18,436 INFO L87 Difference]: Start difference. First operand 1151 states and 1441 transitions. Second operand has 24 states, 21 states have (on average 7.571428571428571) internal successors, (159), 23 states have internal predecessors, (159), 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-19 09:05:21,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:21,633 INFO L93 Difference]: Finished difference Result 1153 states and 1445 transitions. [2024-11-19 09:05:21,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 09:05:21,634 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.571428571428571) internal successors, (159), 23 states have internal predecessors, (159), 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-19 09:05:21,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:21,636 INFO L225 Difference]: With dead ends: 1153 [2024-11-19 09:05:21,637 INFO L226 Difference]: Without dead ends: 1153 [2024-11-19 09:05:21,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=128, Invalid=680, Unknown=16, NotChecked=168, Total=992 [2024-11-19 09:05:21,638 INFO L432 NwaCegarLoop]: 624 mSDtfsCounter, 858 mSDsluCounter, 10801 mSDsCounter, 0 mSdLazyCounter, 6989 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 11425 SdHoareTripleChecker+Invalid, 7007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 6989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:21,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 11425 Invalid, 7007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 6989 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-19 09:05:21,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2024-11-19 09:05:21,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1150. [2024-11-19 09:05:21,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 862 states have (on average 1.636890951276102) internal successors, (1411), 1141 states have internal predecessors, (1411), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 09:05:21,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1440 transitions. [2024-11-19 09:05:21,651 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1440 transitions. Word has length 99 [2024-11-19 09:05:21,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:21,652 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1440 transitions. [2024-11-19 09:05:21,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.571428571428571) internal successors, (159), 23 states have internal predecessors, (159), 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-19 09:05:21,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1440 transitions. [2024-11-19 09:05:21,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-19 09:05:21,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:21,653 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 09:05:21,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 09:05:21,853 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,SelfDestructingSolverStorable24 [2024-11-19 09:05:21,854 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-19 09:05:21,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:21,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1951784005, now seen corresponding path program 1 times [2024-11-19 09:05:21,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:05:21,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996109055] [2024-11-19 09:05:21,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:21,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:05:21,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:22,548 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-19 09:05:22,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:05:22,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996109055] [2024-11-19 09:05:22,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996109055] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:05:22,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225603051] [2024-11-19 09:05:22,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:22,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:05:22,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:05:22,550 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-19 09:05:22,553 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-19 09:05:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:22,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-19 09:05:22,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:05:22,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:05:22,978 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 09:05:22,978 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-19 09:05:23,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 09:05:23,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 09:05:23,089 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 09:05:23,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-19 09:05:23,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-19 09:05:23,145 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 09:05:23,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-19 09:05:23,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-19 09:05:23,222 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 09:05:23,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 54 [2024-11-19 09:05:23,231 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 35 treesize of output 11 [2024-11-19 09:05:23,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-19 09:05:23,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 09:05:23,274 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-19 09:05:23,274 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:05:23,449 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:05:23,450 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 140 treesize of output 144 [2024-11-19 09:05:23,582 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_7 Int) (v_ArrVal_1657 (Array Int Int)) (v_ArrVal_1656 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1656))) (let ((.cse0 (+ (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4))) (or (< .cse0 0) (< 0 (+ (select (select (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1657) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse0 v_prenex_7))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 9)))))) (forall ((v_ArrVal_1657 (Array Int Int)) (v_ArrVal_1656 (Array Int Int)) (v_ArrVal_1659 Int)) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1656))) (let ((.cse4 (+ (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4))) (or (< .cse4 0) (< (select (select (let ((.cse6 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1657) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store .cse5 .cse6 (store (select .cse5 .cse6) .cse4 v_ArrVal_1659))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ |c_ULTIMATE.start_main_#t~mem56#1.offset| 9)))))) (forall ((v_ArrVal_1657 (Array Int Int)) (v_ArrVal_1660 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1657))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (= (select (select (store .cse7 .cse8 v_ArrVal_1660) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~mem56#1.base|) (forall ((v_ArrVal_1656 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1656))) (let ((.cse9 (+ (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4))) (or (< .cse9 0) (forall ((v_prenex_7 Int)) (<= 0 (+ (select (select (store .cse10 .cse8 (store (select .cse10 .cse8) .cse9 v_prenex_7)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 8))))))))))) (or (forall ((v_ArrVal_1657 (Array Int Int)) (v_ArrVal_1660 (Array Int Int))) (= (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1657))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1660)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~mem56#1.base|)) (forall ((v_ArrVal_1656 (Array Int Int))) (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1656) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) 0))))) is different from false [2024-11-19 09:05:23,644 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_1657 (Array Int Int)) (v_ArrVal_1656 (Array Int Int)) (v_ArrVal_1659 Int)) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_1656))) (let ((.cse0 (+ (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4))) (or (< .cse0 0) (< (select (select (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_1657) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse0 v_ArrVal_1659))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 9)))))) (or (forall ((v_ArrVal_1657 (Array Int Int)) (v_ArrVal_1660 (Array Int Int))) (= .cse3 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_1657))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_1660)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (forall ((v_ArrVal_1656 (Array Int Int))) (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_1656) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4) 0))) (forall ((v_prenex_7 Int) (v_ArrVal_1657 (Array Int Int)) (v_ArrVal_1656 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_1656))) (let ((.cse6 (+ (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4))) (or (< .cse6 0) (< 0 (+ 9 (select (select (let ((.cse8 (select (select (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_1657) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store .cse7 .cse8 (store (select .cse7 .cse8) .cse6 v_prenex_7))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))) (forall ((v_prenex_7 Int) (v_ArrVal_1657 (Array Int Int)) (v_ArrVal_1656 (Array Int Int)) (v_ArrVal_1660 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_1656)) (.cse10 (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_1657))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse9 (+ (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4))) (or (< .cse9 0) (= .cse3 (select (select (store .cse10 .cse11 v_ArrVal_1660) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (< 0 (+ 9 (select (select (store .cse12 .cse11 (store (select .cse12 .cse11) .cse9 v_prenex_7)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) is different from false [2024-11-19 09:05:23,780 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1657 (Array Int Int)) (v_ArrVal_1656 (Array Int Int)) (v_ArrVal_1666 (Array Int Int)) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1659 Int)) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1665))) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1666)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse0 (store .cse6 .cse4 v_ArrVal_1656))) (let ((.cse2 (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 4))) (or (< (select (select (let ((.cse1 (select (select (store .cse3 .cse4 v_ArrVal_1657) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_1659))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) (+ (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 9)) (< .cse2 0))))))) (forall ((v_ArrVal_1666 (Array Int Int)) (v_ArrVal_1665 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1665))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (or (forall ((v_ArrVal_1657 (Array Int Int)) (v_ArrVal_1660 (Array Int Int))) (= .cse7 (select (select (let ((.cse8 (store .cse9 .cse7 v_ArrVal_1657))) (store .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_1660)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (forall ((v_ArrVal_1656 (Array Int Int))) (< (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1666) .cse7 v_ArrVal_1656) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 4) 0)))))) (forall ((v_prenex_7 Int) (v_ArrVal_1657 (Array Int Int)) (v_ArrVal_1656 (Array Int Int)) (v_ArrVal_1666 (Array Int Int)) (v_ArrVal_1665 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1665))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse10 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1666) .cse14 v_ArrVal_1656))) (let ((.cse12 (+ (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 4))) (or (< 0 (+ 9 (select (select (let ((.cse11 (select (select (store .cse13 .cse14 v_ArrVal_1657) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 v_prenex_7))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (< .cse12 0))))))) (forall ((v_prenex_7 Int) (v_ArrVal_1657 (Array Int Int)) (v_ArrVal_1656 (Array Int Int)) (v_ArrVal_1666 (Array Int Int)) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1660 (Array Int Int))) (let ((.cse20 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1665))) (let ((.cse15 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse18 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1666) .cse15 v_ArrVal_1656)) (.cse16 (store .cse20 .cse15 v_ArrVal_1657))) (let ((.cse17 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse19 (+ (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 4))) (or (= .cse15 (select (select (store .cse16 .cse17 v_ArrVal_1660) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (< 0 (+ 9 (select (select (store .cse18 .cse17 (store (select .cse18 .cse17) .cse19 v_prenex_7)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (< .cse19 0))))))))) is different from false [2024-11-19 09:05:23,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225603051] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:05:23,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:05:23,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2024-11-19 09:05:23,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337789212] [2024-11-19 09:05:23,786 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:05:23,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-19 09:05:23,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:05:23,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-19 09:05:23,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=572, Unknown=3, NotChecked=150, Total=812 [2024-11-19 09:05:23,787 INFO L87 Difference]: Start difference. First operand 1150 states and 1440 transitions. Second operand has 22 states, 19 states have (on average 9.736842105263158) internal successors, (185), 22 states have internal predecessors, (185), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 09:05:26,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:26,447 INFO L93 Difference]: Finished difference Result 1663 states and 2171 transitions. [2024-11-19 09:05:26,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 09:05:26,447 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 9.736842105263158) internal successors, (185), 22 states have internal predecessors, (185), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 99 [2024-11-19 09:05:26,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:26,451 INFO L225 Difference]: With dead ends: 1663 [2024-11-19 09:05:26,451 INFO L226 Difference]: Without dead ends: 1663 [2024-11-19 09:05:26,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=163, Invalid=902, Unknown=3, NotChecked=192, Total=1260 [2024-11-19 09:05:26,452 INFO L432 NwaCegarLoop]: 628 mSDtfsCounter, 1284 mSDsluCounter, 6804 mSDsCounter, 0 mSdLazyCounter, 5728 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1298 SdHoareTripleChecker+Valid, 7432 SdHoareTripleChecker+Invalid, 5773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 5728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:26,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1298 Valid, 7432 Invalid, 5773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 5728 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-19 09:05:26,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2024-11-19 09:05:26,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1137. [2024-11-19 09:05:26,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1137 states, 851 states have (on average 1.6427732079905992) internal successors, (1398), 1129 states have internal predecessors, (1398), 15 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 09:05:26,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1426 transitions. [2024-11-19 09:05:26,463 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 1426 transitions. Word has length 99 [2024-11-19 09:05:26,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:26,464 INFO L471 AbstractCegarLoop]: Abstraction has 1137 states and 1426 transitions. [2024-11-19 09:05:26,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 9.736842105263158) internal successors, (185), 22 states have internal predecessors, (185), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 09:05:26,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1426 transitions. [2024-11-19 09:05:26,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-19 09:05:26,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:26,464 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] [2024-11-19 09:05:26,478 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-19 09:05:26,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-19 09:05:26,669 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-19 09:05:26,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:26,669 INFO L85 PathProgramCache]: Analyzing trace with hash -855395989, now seen corresponding path program 1 times [2024-11-19 09:05:26,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:05:26,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268520713] [2024-11-19 09:05:26,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:26,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:05:26,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:27,044 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-19 09:05:27,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:05:27,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268520713] [2024-11-19 09:05:27,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268520713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:05:27,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:05:27,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 09:05:27,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793679121] [2024-11-19 09:05:27,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:05:27,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 09:05:27,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:05:27,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 09:05:27,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-19 09:05:27,046 INFO L87 Difference]: Start difference. First operand 1137 states and 1426 transitions. Second operand has 13 states, 12 states have (on average 8.25) internal successors, (99), 13 states have internal predecessors, (99), 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-19 09:05:28,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:28,598 INFO L93 Difference]: Finished difference Result 1156 states and 1448 transitions. [2024-11-19 09:05:28,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 09:05:28,598 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.25) internal successors, (99), 13 states have internal predecessors, (99), 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 101 [2024-11-19 09:05:28,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:28,600 INFO L225 Difference]: With dead ends: 1156 [2024-11-19 09:05:28,600 INFO L226 Difference]: Without dead ends: 1156 [2024-11-19 09:05:28,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2024-11-19 09:05:28,601 INFO L432 NwaCegarLoop]: 627 mSDtfsCounter, 909 mSDsluCounter, 5468 mSDsCounter, 0 mSdLazyCounter, 3633 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 6095 SdHoareTripleChecker+Invalid, 3652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:28,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 6095 Invalid, 3652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3633 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-19 09:05:28,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2024-11-19 09:05:28,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1152. [2024-11-19 09:05:28,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 865 states have (on average 1.6346820809248555) internal successors, (1414), 1143 states have internal predecessors, (1414), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 09:05:28,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1443 transitions. [2024-11-19 09:05:28,610 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1443 transitions. Word has length 101 [2024-11-19 09:05:28,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:28,610 INFO L471 AbstractCegarLoop]: Abstraction has 1152 states and 1443 transitions. [2024-11-19 09:05:28,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.25) internal successors, (99), 13 states have internal predecessors, (99), 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-19 09:05:28,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1443 transitions. [2024-11-19 09:05:28,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-19 09:05:28,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:28,611 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] [2024-11-19 09:05:28,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-19 09:05:28,611 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-19 09:05:28,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:28,612 INFO L85 PathProgramCache]: Analyzing trace with hash -855395988, now seen corresponding path program 1 times [2024-11-19 09:05:28,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:05:28,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973740737] [2024-11-19 09:05:28,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:28,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:05:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:29,204 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-19 09:05:29,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:05:29,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973740737] [2024-11-19 09:05:29,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973740737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:05:29,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:05:29,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 09:05:29,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050665108] [2024-11-19 09:05:29,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:05:29,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 09:05:29,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:05:29,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 09:05:29,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-19 09:05:29,207 INFO L87 Difference]: Start difference. First operand 1152 states and 1443 transitions. Second operand has 13 states, 12 states have (on average 8.25) internal successors, (99), 13 states have internal predecessors, (99), 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-19 09:05:30,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:30,629 INFO L93 Difference]: Finished difference Result 1155 states and 1447 transitions. [2024-11-19 09:05:30,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 09:05:30,630 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.25) internal successors, (99), 13 states have internal predecessors, (99), 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 101 [2024-11-19 09:05:30,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:30,632 INFO L225 Difference]: With dead ends: 1155 [2024-11-19 09:05:30,632 INFO L226 Difference]: Without dead ends: 1155 [2024-11-19 09:05:30,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2024-11-19 09:05:30,633 INFO L432 NwaCegarLoop]: 628 mSDtfsCounter, 903 mSDsluCounter, 3254 mSDsCounter, 0 mSdLazyCounter, 2893 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 3882 SdHoareTripleChecker+Invalid, 2910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:30,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 3882 Invalid, 2910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2893 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 09:05:30,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2024-11-19 09:05:30,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1152. [2024-11-19 09:05:30,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 865 states have (on average 1.6335260115606935) internal successors, (1413), 1143 states have internal predecessors, (1413), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 09:05:30,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1442 transitions. [2024-11-19 09:05:30,643 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1442 transitions. Word has length 101 [2024-11-19 09:05:30,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:30,643 INFO L471 AbstractCegarLoop]: Abstraction has 1152 states and 1442 transitions. [2024-11-19 09:05:30,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.25) internal successors, (99), 13 states have internal predecessors, (99), 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-19 09:05:30,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1442 transitions. [2024-11-19 09:05:30,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-19 09:05:30,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:30,644 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-19 09:05:30,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-19 09:05:30,644 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-19 09:05:30,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:30,645 INFO L85 PathProgramCache]: Analyzing trace with hash -329416069, now seen corresponding path program 1 times [2024-11-19 09:05:30,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:05:30,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212997864] [2024-11-19 09:05:30,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:30,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:05:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:31,145 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-19 09:05:31,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:05:31,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212997864] [2024-11-19 09:05:31,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212997864] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:05:31,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46691047] [2024-11-19 09:05:31,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:31,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:05:31,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:05:31,147 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-19 09:05:31,148 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-19 09:05:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:31,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-19 09:05:31,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:05:31,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:05:31,462 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-19 09:05:31,462 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 17 treesize of output 21 [2024-11-19 09:05:31,488 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-19 09:05:31,560 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-19 09:05:31,670 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:05:31,671 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-19 09:05:31,754 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:05:31,755 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-19 09:05:31,802 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:05:31,802 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-19 09:05:31,851 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:05:31,851 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-19 09:05:31,863 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-19 09:05:31,893 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-19 09:05:31,893 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:05:36,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46691047] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:05:36,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:05:36,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2024-11-19 09:05:36,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940557810] [2024-11-19 09:05:36,229 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:05:36,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 09:05:36,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:05:36,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 09:05:36,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=802, Unknown=113, NotChecked=0, Total=1056 [2024-11-19 09:05:36,230 INFO L87 Difference]: Start difference. First operand 1152 states and 1442 transitions. Second operand has 26 states, 23 states have (on average 7.173913043478261) internal successors, (165), 25 states have internal predecessors, (165), 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-19 09:05:38,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:38,405 INFO L93 Difference]: Finished difference Result 1154 states and 1446 transitions. [2024-11-19 09:05:38,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 09:05:38,405 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.173913043478261) internal successors, (165), 25 states have internal predecessors, (165), 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 102 [2024-11-19 09:05:38,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:38,408 INFO L225 Difference]: With dead ends: 1154 [2024-11-19 09:05:38,408 INFO L226 Difference]: Without dead ends: 1154 [2024-11-19 09:05:38,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=165, Invalid=977, Unknown=118, NotChecked=0, Total=1260 [2024-11-19 09:05:38,408 INFO L432 NwaCegarLoop]: 623 mSDtfsCounter, 853 mSDsluCounter, 6631 mSDsCounter, 0 mSdLazyCounter, 4367 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 7254 SdHoareTripleChecker+Invalid, 4388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:38,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 7254 Invalid, 4388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4367 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-19 09:05:38,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2024-11-19 09:05:38,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1151. [2024-11-19 09:05:38,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 865 states have (on average 1.6323699421965319) internal successors, (1412), 1142 states have internal predecessors, (1412), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 09:05:38,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1441 transitions. [2024-11-19 09:05:38,419 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1441 transitions. Word has length 102 [2024-11-19 09:05:38,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:38,419 INFO L471 AbstractCegarLoop]: Abstraction has 1151 states and 1441 transitions. [2024-11-19 09:05:38,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.173913043478261) internal successors, (165), 25 states have internal predecessors, (165), 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-19 09:05:38,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1441 transitions. [2024-11-19 09:05:38,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-19 09:05:38,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:38,420 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-19 09:05:38,435 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-19 09:05:38,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:05:38,621 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-19 09:05:38,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:38,622 INFO L85 PathProgramCache]: Analyzing trace with hash -329416068, now seen corresponding path program 1 times [2024-11-19 09:05:38,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:05:38,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828262559] [2024-11-19 09:05:38,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:38,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:05:38,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:39,374 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-19 09:05:39,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:05:39,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828262559] [2024-11-19 09:05:39,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828262559] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:05:39,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062516147] [2024-11-19 09:05:39,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:39,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:05:39,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:05:39,375 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-19 09:05:39,376 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-19 09:05:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:39,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-19 09:05:39,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:05:39,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:05:39,683 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 09:05:39,684 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-19 09:05:39,691 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-19 09:05:39,697 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-19 09:05:39,702 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-19 09:05:39,760 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-19 09:05:39,763 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-19 09:05:39,844 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:05:39,844 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-19 09:05:39,848 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-19 09:05:39,899 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:05:39,900 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-19 09:05:39,903 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-19 09:05:39,947 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:05:39,947 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-19 09:05:39,951 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-19 09:05:40,002 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:05:40,002 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-19 09:05:40,007 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-19 09:05:40,022 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-19 09:05:40,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-19 09:05:40,030 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-19 09:05:40,030 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:05:40,080 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2181 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2181) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_2181 (Array Int Int)) (v_ArrVal_2180 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2181) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2180) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-19 09:05:40,153 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2181 (Array Int Int)) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2178 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2178) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2179) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2181) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_2181 (Array Int Int)) (v_ArrVal_2180 (Array Int Int)) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2178 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2179))) (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~mem57#1.base| v_ArrVal_2178) .cse1 v_ArrVal_2181) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_2180) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-19 09:05:40,165 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_2181 (Array Int Int)) (v_ArrVal_2180 (Array Int Int)) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2178 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2179))) (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_2178) .cse1 v_ArrVal_2181) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2180) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2181 (Array Int Int)) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2178 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2178) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2179) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2181) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20)))))) is different from false [2024-11-19 09:05:40,186 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2181 (Array Int Int)) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2176 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2177))) (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~mem56#1.base| v_ArrVal_2176) .cse0 v_ArrVal_2178) (select (select (store .cse1 .cse0 v_ArrVal_2179) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2181))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))) (forall ((v_ArrVal_2181 (Array Int Int)) (v_ArrVal_2180 (Array Int Int)) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2176 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2177))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2179))) (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~mem56#1.base| v_ArrVal_2176) .cse3 v_ArrVal_2178) .cse4 v_ArrVal_2181) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_2180) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-19 09:05:40,307 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2181 (Array Int Int)) (v_ArrVal_2180 (Array Int Int)) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2187 (Array Int Int)) (v_ArrVal_2176 (Array Int Int)) (v_ArrVal_2186 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2186))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2177))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2179))) (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~mem54#1.base| v_ArrVal_2187) .cse0 v_ArrVal_2176) .cse1 v_ArrVal_2178) .cse2 v_ArrVal_2181) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2180) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_2181 (Array Int Int)) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2187 (Array Int Int)) (v_ArrVal_2176 (Array Int Int)) (v_ArrVal_2186 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2186))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2177))) (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~mem54#1.base| v_ArrVal_2187) .cse7 v_ArrVal_2176) .cse8 v_ArrVal_2178) (select (select (store .cse9 .cse8 v_ArrVal_2179) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2181))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))))) is different from false [2024-11-19 09:05:40,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062516147] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:05:40,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:05:40,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 20 [2024-11-19 09:05:40,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736663905] [2024-11-19 09:05:40,311 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:05:40,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-19 09:05:40,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:05:40,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-19 09:05:40,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=485, Unknown=24, NotChecked=250, Total=870 [2024-11-19 09:05:40,312 INFO L87 Difference]: Start difference. First operand 1151 states and 1441 transitions. Second operand has 21 states, 18 states have (on average 8.666666666666666) internal successors, (156), 21 states have internal predecessors, (156), 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-19 09:05:42,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:42,457 INFO L93 Difference]: Finished difference Result 1153 states and 1445 transitions. [2024-11-19 09:05:42,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 09:05:42,458 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 8.666666666666666) internal successors, (156), 21 states have internal predecessors, (156), 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 102 [2024-11-19 09:05:42,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:42,460 INFO L225 Difference]: With dead ends: 1153 [2024-11-19 09:05:42,460 INFO L226 Difference]: Without dead ends: 1153 [2024-11-19 09:05:42,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=178, Invalid=808, Unknown=26, NotChecked=320, Total=1332 [2024-11-19 09:05:42,461 INFO L432 NwaCegarLoop]: 626 mSDtfsCounter, 868 mSDsluCounter, 4225 mSDsCounter, 0 mSdLazyCounter, 3871 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 877 SdHoareTripleChecker+Valid, 4851 SdHoareTripleChecker+Invalid, 3901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 3871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:42,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [877 Valid, 4851 Invalid, 3901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 3871 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-19 09:05:42,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2024-11-19 09:05:42,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1135. [2024-11-19 09:05:42,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 851 states have (on average 1.6404230317273796) internal successors, (1396), 1127 states have internal predecessors, (1396), 15 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 09:05:42,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1424 transitions. [2024-11-19 09:05:42,471 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1424 transitions. Word has length 102 [2024-11-19 09:05:42,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:42,471 INFO L471 AbstractCegarLoop]: Abstraction has 1135 states and 1424 transitions. [2024-11-19 09:05:42,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 8.666666666666666) internal successors, (156), 21 states have internal predecessors, (156), 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-19 09:05:42,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1424 transitions. [2024-11-19 09:05:42,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-19 09:05:42,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:42,472 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-19 09:05:42,488 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-19 09:05:42,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:05:42,677 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-19 09:05:42,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:42,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1491035757, now seen corresponding path program 1 times [2024-11-19 09:05:42,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:05:42,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436739411] [2024-11-19 09:05:42,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:42,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:05:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:43,247 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-19 09:05:43,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:05:43,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436739411] [2024-11-19 09:05:43,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436739411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:05:43,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:05:43,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-19 09:05:43,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010991877] [2024-11-19 09:05:43,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:05:43,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 09:05:43,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:05:43,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 09:05:43,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-19 09:05:43,248 INFO L87 Difference]: Start difference. First operand 1135 states and 1424 transitions. Second operand has 14 states, 13 states have (on average 7.923076923076923) internal successors, (103), 14 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-19 09:05:44,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:44,482 INFO L93 Difference]: Finished difference Result 1158 states and 1450 transitions. [2024-11-19 09:05:44,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 09:05:44,482 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.923076923076923) internal successors, (103), 14 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-19 09:05:44,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:44,484 INFO L225 Difference]: With dead ends: 1158 [2024-11-19 09:05:44,484 INFO L226 Difference]: Without dead ends: 1158 [2024-11-19 09:05:44,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2024-11-19 09:05:44,485 INFO L432 NwaCegarLoop]: 626 mSDtfsCounter, 889 mSDsluCounter, 3612 mSDsCounter, 0 mSdLazyCounter, 2620 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 4238 SdHoareTripleChecker+Invalid, 2640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:44,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 4238 Invalid, 2640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2620 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 09:05:44,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2024-11-19 09:05:44,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1154. [2024-11-19 09:05:44,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 869 states have (on average 1.6294591484464902) internal successors, (1416), 1145 states have internal predecessors, (1416), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 09:05:44,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1445 transitions. [2024-11-19 09:05:44,493 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1445 transitions. Word has length 105 [2024-11-19 09:05:44,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:44,494 INFO L471 AbstractCegarLoop]: Abstraction has 1154 states and 1445 transitions. [2024-11-19 09:05:44,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.923076923076923) internal successors, (103), 14 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-19 09:05:44,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1445 transitions. [2024-11-19 09:05:44,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-19 09:05:44,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:44,494 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-19 09:05:44,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-19 09:05:44,494 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-19 09:05:44,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:44,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1491035758, now seen corresponding path program 1 times [2024-11-19 09:05:44,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:05:44,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794625839] [2024-11-19 09:05:44,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:44,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:05:44,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:45,253 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-19 09:05:45,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:05:45,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794625839] [2024-11-19 09:05:45,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794625839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:05:45,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:05:45,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-19 09:05:45,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730974227] [2024-11-19 09:05:45,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:05:45,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 09:05:45,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:05:45,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 09:05:45,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-19 09:05:45,255 INFO L87 Difference]: Start difference. First operand 1154 states and 1445 transitions. Second operand has 18 states, 16 states have (on average 6.4375) internal successors, (103), 17 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-19 09:05:47,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:47,242 INFO L93 Difference]: Finished difference Result 1157 states and 1449 transitions. [2024-11-19 09:05:47,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 09:05:47,242 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.4375) internal successors, (103), 17 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-19 09:05:47,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:47,244 INFO L225 Difference]: With dead ends: 1157 [2024-11-19 09:05:47,244 INFO L226 Difference]: Without dead ends: 1157 [2024-11-19 09:05:47,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2024-11-19 09:05:47,246 INFO L432 NwaCegarLoop]: 623 mSDtfsCounter, 890 mSDsluCounter, 5059 mSDsCounter, 0 mSdLazyCounter, 4066 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 5682 SdHoareTripleChecker+Invalid, 4089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 4066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:47,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 5682 Invalid, 4089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 4066 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-19 09:05:47,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2024-11-19 09:05:47,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1154. [2024-11-19 09:05:47,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 869 states have (on average 1.6283084004602992) internal successors, (1415), 1145 states have internal predecessors, (1415), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 09:05:47,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1444 transitions. [2024-11-19 09:05:47,255 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1444 transitions. Word has length 105 [2024-11-19 09:05:47,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:47,256 INFO L471 AbstractCegarLoop]: Abstraction has 1154 states and 1444 transitions. [2024-11-19 09:05:47,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.4375) internal successors, (103), 17 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-19 09:05:47,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1444 transitions. [2024-11-19 09:05:47,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-19 09:05:47,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:47,257 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-19 09:05:47,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-19 09:05:47,257 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-19 09:05:47,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:47,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1513476227, now seen corresponding path program 1 times [2024-11-19 09:05:47,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:05:47,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058187665] [2024-11-19 09:05:47,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:47,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:05:47,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:47,871 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-19 09:05:47,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:05:47,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058187665] [2024-11-19 09:05:47,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058187665] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:05:47,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870567074] [2024-11-19 09:05:47,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:47,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:05:47,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:05:47,873 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-19 09:05:47,874 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-19 09:05:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:48,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-19 09:05:48,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:05:48,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:05:48,185 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-19 09:05:48,185 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 17 treesize of output 21 [2024-11-19 09:05:48,211 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-19 09:05:48,268 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-19 09:05:48,375 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:05:48,375 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-19 09:05:48,453 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:05:48,453 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-19 09:05:48,496 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:05:48,496 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-19 09:05:48,541 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:05:48,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-19 09:05:48,587 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:05:48,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-19 09:05:48,598 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-19 09:05:48,658 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-11-19 09:05:48,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2024-11-19 09:05:48,664 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-19 09:05:48,664 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:05:49,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870567074] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:05:49,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:05:49,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 27 [2024-11-19 09:05:49,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646795740] [2024-11-19 09:05:49,357 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:05:49,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-19 09:05:49,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:05:49,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-19 09:05:49,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1231, Unknown=57, NotChecked=0, Total=1482 [2024-11-19 09:05:49,359 INFO L87 Difference]: Start difference. First operand 1154 states and 1444 transitions. Second operand has 28 states, 25 states have (on average 6.92) internal successors, (173), 27 states have internal predecessors, (173), 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-19 09:05:52,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:52,089 INFO L93 Difference]: Finished difference Result 1156 states and 1448 transitions. [2024-11-19 09:05:52,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 09:05:52,089 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 6.92) internal successors, (173), 27 states have internal predecessors, (173), 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 106 [2024-11-19 09:05:52,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:52,091 INFO L225 Difference]: With dead ends: 1156 [2024-11-19 09:05:52,091 INFO L226 Difference]: Without dead ends: 1156 [2024-11-19 09:05:52,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=221, Invalid=1444, Unknown=57, NotChecked=0, Total=1722 [2024-11-19 09:05:52,094 INFO L432 NwaCegarLoop]: 622 mSDtfsCounter, 852 mSDsluCounter, 8416 mSDsCounter, 0 mSdLazyCounter, 5517 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 9038 SdHoareTripleChecker+Invalid, 5540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 5517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:52,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 9038 Invalid, 5540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 5517 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-19 09:05:52,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2024-11-19 09:05:52,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1153. [2024-11-19 09:05:52,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 869 states have (on average 1.6271576524741083) internal successors, (1414), 1144 states have internal predecessors, (1414), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 09:05:52,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1443 transitions. [2024-11-19 09:05:52,103 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1443 transitions. Word has length 106 [2024-11-19 09:05:52,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:52,103 INFO L471 AbstractCegarLoop]: Abstraction has 1153 states and 1443 transitions. [2024-11-19 09:05:52,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 6.92) internal successors, (173), 27 states have internal predecessors, (173), 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-19 09:05:52,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1443 transitions. [2024-11-19 09:05:52,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-19 09:05:52,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:52,104 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-19 09:05:52,119 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-19 09:05:52,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:05:52,305 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-19 09:05:52,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:52,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1513476226, now seen corresponding path program 1 times [2024-11-19 09:05:52,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:05:52,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259768170] [2024-11-19 09:05:52,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:52,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:05:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:53,146 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-19 09:05:53,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:05:53,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259768170] [2024-11-19 09:05:53,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259768170] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:05:53,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883962591] [2024-11-19 09:05:53,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:53,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:05:53,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:05:53,148 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-19 09:05:53,148 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-19 09:05:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:53,370 INFO L255 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-19 09:05:53,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:05:53,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:05:53,456 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-19 09:05:53,456 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 17 treesize of output 21 [2024-11-19 09:05:53,462 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-19 09:05:53,495 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-19 09:05:53,503 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-19 09:05:53,610 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 33 treesize of output 15 [2024-11-19 09:05:53,613 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-19 09:05:53,762 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:05:53,762 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-19 09:05:53,770 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-19 09:05:53,852 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:05:53,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 73 treesize of output 66 [2024-11-19 09:05:53,859 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-19 09:05:53,931 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:05:53,931 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-19 09:05:53,936 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-19 09:05:53,994 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:05:53,994 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-19 09:05:53,997 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-19 09:05:54,065 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:05:54,066 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-19 09:05:54,072 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-19 09:05:54,095 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-19 09:05:54,099 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-19 09:05:54,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:05:54,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 09:05:54,154 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-19 09:05:54,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-19 09:05:54,158 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-19 09:05:54,158 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:05:54,650 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_2755 (Array Int Int)) (v_ArrVal_2753 (Array Int Int)) (v_ArrVal_2752 (Array Int Int)) (v_ArrVal_2751 (Array Int Int)) (v_ArrVal_2750 (Array Int Int))) (< 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2750))) (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~mem57#1.base| v_ArrVal_2751) .cse0 v_ArrVal_2752) (select (select (store .cse1 .cse0 v_ArrVal_2753) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2755))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)))) (forall ((v_ArrVal_2755 (Array Int Int)) (v_ArrVal_2754 (Array Int Int)) (v_ArrVal_2753 (Array Int Int)) (v_ArrVal_2752 (Array Int Int)) (v_ArrVal_2751 (Array Int Int)) (v_ArrVal_2750 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2756 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2750))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2753))) (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~mem57#1.base| v_ArrVal_2751) .cse3 v_ArrVal_2752) .cse4 v_ArrVal_2755) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2756) (select (select (store .cse5 .cse4 v_ArrVal_2754) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))))) is different from false [2024-11-19 09:05:54,665 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 (or (forall ((v_ArrVal_2755 (Array Int Int)) (v_ArrVal_2753 (Array Int Int)) (v_ArrVal_2752 (Array Int Int)) (v_ArrVal_2751 (Array Int Int)) (v_ArrVal_2750 (Array Int Int))) (< 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2750))) (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_2751) .cse1 v_ArrVal_2752) (select (select (store .cse2 .cse1 v_ArrVal_2753) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2755))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)))) (forall ((v_ArrVal_2755 (Array Int Int)) (v_ArrVal_2754 (Array Int Int)) (v_ArrVal_2753 (Array Int Int)) (v_ArrVal_2752 (Array Int Int)) (v_ArrVal_2751 (Array Int Int)) (v_ArrVal_2750 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2756 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2750))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2753))) (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_2751) .cse4 v_ArrVal_2752) .cse5 v_ArrVal_2755) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2756) (select (select (store .cse6 .cse5 v_ArrVal_2754) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))))) is different from false [2024-11-19 09:05:54,846 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~malloc61#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0))) (forall ((v_ArrVal_2748 (Array Int Int)) (v_ArrVal_2755 (Array Int Int)) (v_ArrVal_2753 (Array Int Int)) (v_ArrVal_2752 (Array Int Int)) (v_ArrVal_2751 (Array Int Int)) (v_ArrVal_2750 (Array Int Int)) (v_ArrVal_2749 (Array Int Int))) (< 0 (+ (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2748))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2750))) (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_2749) .cse1 v_ArrVal_2751) .cse2 v_ArrVal_2752) (select (select (store .cse3 .cse2 v_ArrVal_2753) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2755))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1)))) (forall ((v_ArrVal_2748 (Array Int Int)) (v_ArrVal_2755 (Array Int Int)) (v_ArrVal_2754 (Array Int Int)) (v_ArrVal_2753 (Array Int Int)) (v_ArrVal_2752 (Array Int Int)) (v_ArrVal_2751 (Array Int Int)) (v_ArrVal_2750 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int) (v_ArrVal_2749 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2756 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2748))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_2750))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2753))) (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_2749) .cse6 v_ArrVal_2751) .cse7 v_ArrVal_2752) .cse8 v_ArrVal_2755) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2756) (select (select (store .cse9 .cse8 v_ArrVal_2754) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))))) is different from false [2024-11-19 09:05:54,900 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_2748 (Array Int Int)) (v_ArrVal_2755 (Array Int Int)) (v_ArrVal_2753 (Array Int Int)) (v_ArrVal_2752 (Array Int Int)) (v_ArrVal_2762 (Array Int Int)) (v_ArrVal_2751 (Array Int Int)) (v_ArrVal_2761 (Array Int Int)) (v_ArrVal_2750 (Array Int Int)) (v_ArrVal_2749 (Array Int Int))) (< 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2762))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2748))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2750))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2761) .cse0 v_ArrVal_2749) .cse1 v_ArrVal_2751) .cse2 v_ArrVal_2752) (select (select (store .cse3 .cse2 v_ArrVal_2753) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2755))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)))) (forall ((v_ArrVal_2748 (Array Int Int)) (v_ArrVal_2755 (Array Int Int)) (v_ArrVal_2754 (Array Int Int)) (v_ArrVal_2753 (Array Int Int)) (v_ArrVal_2752 (Array Int Int)) (v_ArrVal_2762 (Array Int Int)) (v_ArrVal_2751 (Array Int Int)) (v_ArrVal_2761 (Array Int Int)) (v_ArrVal_2750 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int) (v_ArrVal_2749 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2756 Int)) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2762))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_2748))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_2750))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_2753))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2761) .cse7 v_ArrVal_2749) .cse8 v_ArrVal_2751) .cse9 v_ArrVal_2752) .cse10 v_ArrVal_2755) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2756) (select (select (store .cse11 .cse10 v_ArrVal_2754) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))))))) is different from false [2024-11-19 09:05:54,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883962591] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:05:54,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:05:54,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 25 [2024-11-19 09:05:54,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648020064] [2024-11-19 09:05:54,904 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:05:54,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 09:05:54,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:05:54,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 09:05:54,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=970, Unknown=23, NotChecked=268, Total=1406 [2024-11-19 09:05:54,905 INFO L87 Difference]: Start difference. First operand 1153 states and 1443 transitions. Second operand has 26 states, 23 states have (on average 7.478260869565218) internal successors, (172), 26 states have internal predecessors, (172), 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-19 09:05:57,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:57,313 INFO L93 Difference]: Finished difference Result 1155 states and 1447 transitions. [2024-11-19 09:05:57,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 09:05:57,313 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.478260869565218) internal successors, (172), 26 states have internal predecessors, (172), 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 106 [2024-11-19 09:05:57,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:57,315 INFO L225 Difference]: With dead ends: 1155 [2024-11-19 09:05:57,315 INFO L226 Difference]: Without dead ends: 1155 [2024-11-19 09:05:57,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=158, Invalid=1025, Unknown=23, NotChecked=276, Total=1482 [2024-11-19 09:05:57,316 INFO L432 NwaCegarLoop]: 625 mSDtfsCounter, 846 mSDsluCounter, 4737 mSDsCounter, 0 mSdLazyCounter, 4370 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 5362 SdHoareTripleChecker+Invalid, 4392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 4370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:57,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [855 Valid, 5362 Invalid, 4392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 4370 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-19 09:05:57,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2024-11-19 09:05:57,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1133. [2024-11-19 09:05:57,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 851 states have (on average 1.6380728554641597) internal successors, (1394), 1125 states have internal predecessors, (1394), 15 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 09:05:57,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1422 transitions. [2024-11-19 09:05:57,323 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1422 transitions. Word has length 106 [2024-11-19 09:05:57,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:57,324 INFO L471 AbstractCegarLoop]: Abstraction has 1133 states and 1422 transitions. [2024-11-19 09:05:57,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.478260869565218) internal successors, (172), 26 states have internal predecessors, (172), 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-19 09:05:57,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1422 transitions. [2024-11-19 09:05:57,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-19 09:05:57,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:57,324 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:05:57,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-19 09:05:57,524 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,SelfDestructingSolverStorable33 [2024-11-19 09:05:57,525 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-19 09:05:57,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:57,525 INFO L85 PathProgramCache]: Analyzing trace with hash 895129879, now seen corresponding path program 1 times [2024-11-19 09:05:57,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:05:57,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068297166] [2024-11-19 09:05:57,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:57,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:05:57,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:57,911 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-19 09:05:57,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:05:57,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068297166] [2024-11-19 09:05:57,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068297166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:05:57,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:05:57,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:05:57,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682834479] [2024-11-19 09:05:57,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:05:57,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:05:57,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:05:57,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:05:57,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:05:57,914 INFO L87 Difference]: Start difference. First operand 1133 states and 1422 transitions. Second operand has 6 states, 5 states have (on average 21.2) internal successors, (106), 6 states have internal predecessors, (106), 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-19 09:05:58,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:58,444 INFO L93 Difference]: Finished difference Result 1132 states and 1421 transitions. [2024-11-19 09:05:58,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:05:58,445 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.2) internal successors, (106), 6 states have internal predecessors, (106), 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 108 [2024-11-19 09:05:58,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:58,447 INFO L225 Difference]: With dead ends: 1132 [2024-11-19 09:05:58,447 INFO L226 Difference]: Without dead ends: 1132 [2024-11-19 09:05:58,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:05:58,447 INFO L432 NwaCegarLoop]: 962 mSDtfsCounter, 2 mSDsluCounter, 2095 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3057 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:58,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3057 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 09:05:58,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2024-11-19 09:05:58,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1132. [2024-11-19 09:05:58,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 851 states have (on average 1.63689776733255) internal successors, (1393), 1124 states have internal predecessors, (1393), 15 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 09:05:58,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1421 transitions. [2024-11-19 09:05:58,456 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1421 transitions. Word has length 108 [2024-11-19 09:05:58,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:58,457 INFO L471 AbstractCegarLoop]: Abstraction has 1132 states and 1421 transitions. [2024-11-19 09:05:58,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.2) internal successors, (106), 6 states have internal predecessors, (106), 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-19 09:05:58,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1421 transitions. [2024-11-19 09:05:58,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-19 09:05:58,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:58,457 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, 1, 1] [2024-11-19 09:05:58,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-19 09:05:58,458 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-19 09:05:58,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:58,458 INFO L85 PathProgramCache]: Analyzing trace with hash 895129880, now seen corresponding path program 1 times [2024-11-19 09:05:58,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:05:58,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665326048] [2024-11-19 09:05:58,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:58,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:05:58,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:59,438 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-19 09:05:59,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:05:59,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665326048] [2024-11-19 09:05:59,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665326048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:05:59,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:05:59,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-19 09:05:59,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91368506] [2024-11-19 09:05:59,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:05:59,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-19 09:05:59,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:05:59,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-19 09:05:59,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-11-19 09:05:59,440 INFO L87 Difference]: Start difference. First operand 1132 states and 1421 transitions. Second operand has 19 states, 17 states have (on average 6.235294117647059) internal successors, (106), 18 states have internal predecessors, (106), 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)