./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/sll-buckets-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/sll-buckets-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c6b726a83620fff2a21a6dbfdec50e244c1786dd86dd76b1719515a59b3627ac --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 13:53:49,324 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 13:53:49,382 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 13:53:49,385 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 13:53:49,386 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 13:53:49,404 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 13:53:49,405 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 13:53:49,406 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 13:53:49,406 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 13:53:49,410 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 13:53:49,410 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 13:53:49,411 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 13:53:49,411 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 13:53:49,411 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 13:53:49,411 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 13:53:49,412 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 13:53:49,412 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 13:53:49,412 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 13:53:49,412 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 13:53:49,414 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 13:53:49,414 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 13:53:49,414 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 13:53:49,415 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 13:53:49,415 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 13:53:49,415 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 13:53:49,416 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 13:53:49,416 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 13:53:49,417 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 13:53:49,417 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 13:53:49,417 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 13:53:49,417 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 13:53:49,417 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 13:53:49,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:53:49,418 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 13:53:49,418 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 13:53:49,418 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 13:53:49,418 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 13:53:49,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 13:53:49,418 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 13:53:49,418 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 13:53:49,419 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 13:53:49,420 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 13:53:49,420 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c6b726a83620fff2a21a6dbfdec50e244c1786dd86dd76b1719515a59b3627ac [2024-11-08 13:53:49,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 13:53:49,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 13:53:49,656 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 13:53:49,657 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 13:53:49,657 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 13:53:49,658 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-buckets-1.i [2024-11-08 13:53:50,894 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 13:53:51,068 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 13:53:51,069 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i [2024-11-08 13:53:51,087 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32fb26592/5955b620845341bdbdd37d4e8fcc6f13/FLAG8e004484e [2024-11-08 13:53:51,442 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32fb26592/5955b620845341bdbdd37d4e8fcc6f13 [2024-11-08 13:53:51,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 13:53:51,445 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 13:53:51,448 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 13:53:51,448 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 13:53:51,456 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 13:53:51,457 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:53:51" (1/1) ... [2024-11-08 13:53:51,458 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44385e20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:53:51, skipping insertion in model container [2024-11-08 13:53:51,458 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:53:51" (1/1) ... [2024-11-08 13:53:51,502 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 13:53:51,785 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22663,22676] [2024-11-08 13:53:51,791 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22734,22747] [2024-11-08 13:53:51,792 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22862,22875] [2024-11-08 13:53:51,795 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[23275,23288] [2024-11-08 13:53:51,796 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[23364,23377] [2024-11-08 13:53:51,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:53:51,808 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 13:53:51,873 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22663,22676] [2024-11-08 13:53:51,874 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22734,22747] [2024-11-08 13:53:51,876 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22862,22875] [2024-11-08 13:53:51,894 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[23275,23288] [2024-11-08 13:53:51,894 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[23364,23377] [2024-11-08 13:53:51,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:53:51,926 INFO L204 MainTranslator]: Completed translation [2024-11-08 13:53:51,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:53:51 WrapperNode [2024-11-08 13:53:51,927 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 13:53:51,927 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 13:53:51,928 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 13:53:51,928 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 13:53:51,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:53:51" (1/1) ... [2024-11-08 13:53:51,943 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:53:51" (1/1) ... [2024-11-08 13:53:51,963 INFO L138 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 155 [2024-11-08 13:53:51,963 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 13:53:51,964 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 13:53:51,964 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 13:53:51,964 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 13:53:51,972 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:53:51" (1/1) ... [2024-11-08 13:53:51,973 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:53:51" (1/1) ... [2024-11-08 13:53:51,976 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:53:51" (1/1) ... [2024-11-08 13:53:51,989 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 16 writes are split as follows [0, 16]. [2024-11-08 13:53:51,989 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:53:51" (1/1) ... [2024-11-08 13:53:51,989 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:53:51" (1/1) ... [2024-11-08 13:53:51,995 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:53:51" (1/1) ... [2024-11-08 13:53:51,998 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:53:51" (1/1) ... [2024-11-08 13:53:51,999 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:53:51" (1/1) ... [2024-11-08 13:53:52,000 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:53:51" (1/1) ... [2024-11-08 13:53:52,002 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 13:53:52,003 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 13:53:52,003 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 13:53:52,003 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 13:53:52,004 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:53:51" (1/1) ... [2024-11-08 13:53:52,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:53:52,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:53:52,030 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-08 13:53:52,032 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-08 13:53:52,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 13:53:52,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 13:53:52,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 13:53:52,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 13:53:52,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 13:53:52,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 13:53:52,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 13:53:52,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 13:53:52,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 13:53:52,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 13:53:52,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 13:53:52,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 13:53:52,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 13:53:52,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 13:53:52,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 13:53:52,166 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 13:53:52,168 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 13:53:52,430 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2024-11-08 13:53:52,431 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 13:53:52,446 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 13:53:52,446 INFO L316 CfgBuilder]: Removed 15 assume(true) statements. [2024-11-08 13:53:52,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:53:52 BoogieIcfgContainer [2024-11-08 13:53:52,447 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 13:53:52,450 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 13:53:52,451 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 13:53:52,454 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 13:53:52,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 01:53:51" (1/3) ... [2024-11-08 13:53:52,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@466cecd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:53:52, skipping insertion in model container [2024-11-08 13:53:52,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:53:51" (2/3) ... [2024-11-08 13:53:52,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@466cecd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:53:52, skipping insertion in model container [2024-11-08 13:53:52,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:53:52" (3/3) ... [2024-11-08 13:53:52,457 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-buckets-1.i [2024-11-08 13:53:52,473 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 13:53:52,473 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-11-08 13:53:52,530 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 13:53:52,539 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@77da3271, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 13:53:52,539 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-08 13:53:52,543 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 38 states have (on average 1.868421052631579) internal successors, (71), 43 states have internal predecessors, (71), 0 states have call successors, (0), 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-08 13:53:52,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 13:53:52,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:53:52,548 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:53:52,549 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 13:53:52,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:53:52,555 INFO L85 PathProgramCache]: Analyzing trace with hash 179510098, now seen corresponding path program 1 times [2024-11-08 13:53:52,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:53:52,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292808705] [2024-11-08 13:53:52,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:53:52,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:53:52,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:53:52,850 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-08 13:53:52,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:53:52,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292808705] [2024-11-08 13:53:52,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292808705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:53:52,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:53:52,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:53:52,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427888644] [2024-11-08 13:53:52,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:53:52,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:53:52,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:53:52,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:53:52,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:53:52,879 INFO L87 Difference]: Start difference. First operand has 44 states, 38 states have (on average 1.868421052631579) internal successors, (71), 43 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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-08 13:53:52,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:53:52,956 INFO L93 Difference]: Finished difference Result 103 states and 173 transitions. [2024-11-08 13:53:52,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 13:53:52,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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-08 13:53:52,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:53:52,966 INFO L225 Difference]: With dead ends: 103 [2024-11-08 13:53:52,967 INFO L226 Difference]: Without dead ends: 57 [2024-11-08 13:53:52,970 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-08 13:53:52,974 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 57 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:53:52,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 81 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:53:52,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-08 13:53:53,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2024-11-08 13:53:53,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 40 states have internal predecessors, (49), 0 states have call successors, (0), 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-08 13:53:53,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2024-11-08 13:53:53,006 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 8 [2024-11-08 13:53:53,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:53:53,007 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2024-11-08 13:53:53,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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-08 13:53:53,008 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2024-11-08 13:53:53,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 13:53:53,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:53:53,009 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:53:53,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 13:53:53,009 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 13:53:53,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:53:53,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1306111283, now seen corresponding path program 1 times [2024-11-08 13:53:53,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:53:53,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569428556] [2024-11-08 13:53:53,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:53:53,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:53:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:53:53,154 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-08 13:53:53,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:53:53,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569428556] [2024-11-08 13:53:53,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569428556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:53:53,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:53:53,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 13:53:53,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45549363] [2024-11-08 13:53:53,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:53:53,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 13:53:53,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:53:53,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 13:53:53,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:53:53,160 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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-08 13:53:53,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:53:53,190 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2024-11-08 13:53:53,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 13:53:53,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2024-11-08 13:53:53,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:53:53,192 INFO L225 Difference]: With dead ends: 42 [2024-11-08 13:53:53,192 INFO L226 Difference]: Without dead ends: 40 [2024-11-08 13:53:53,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:53:53,193 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 4 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:53:53,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 70 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:53:53,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-08 13:53:53,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2024-11-08 13:53:53,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 38 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:53:53,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2024-11-08 13:53:53,199 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 9 [2024-11-08 13:53:53,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:53:53,199 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2024-11-08 13:53:53,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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-08 13:53:53,200 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2024-11-08 13:53:53,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 13:53:53,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:53:53,201 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:53:53,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 13:53:53,202 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 13:53:53,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:53:53,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1834780084, now seen corresponding path program 1 times [2024-11-08 13:53:53,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:53:53,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200361497] [2024-11-08 13:53:53,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:53:53,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:53:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:53:53,781 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-08 13:53:53,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:53:53,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200361497] [2024-11-08 13:53:53,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200361497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:53:53,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:53:53,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 13:53:53,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110139214] [2024-11-08 13:53:53,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:53:53,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 13:53:53,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:53:53,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 13:53:53,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 13:53:53,784 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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-08 13:53:53,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:53:53,895 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2024-11-08 13:53:53,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 13:53:53,896 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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-08 13:53:53,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:53:53,896 INFO L225 Difference]: With dead ends: 58 [2024-11-08 13:53:53,897 INFO L226 Difference]: Without dead ends: 47 [2024-11-08 13:53:53,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-08 13:53:53,898 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 17 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:53:53,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 94 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:53:53,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-08 13:53:53,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2024-11-08 13:53:53,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 43 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:53:53,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2024-11-08 13:53:53,910 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 10 [2024-11-08 13:53:53,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:53:53,910 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2024-11-08 13:53:53,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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-08 13:53:53,911 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2024-11-08 13:53:53,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 13:53:53,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:53:53,911 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:53:53,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 13:53:53,912 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 13:53:53,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:53:53,914 INFO L85 PathProgramCache]: Analyzing trace with hash 710639734, now seen corresponding path program 1 times [2024-11-08 13:53:53,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:53:53,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686786450] [2024-11-08 13:53:53,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:53:53,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:53:53,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:53:53,958 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-08 13:53:53,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:53:53,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686786450] [2024-11-08 13:53:53,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686786450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:53:53,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:53:53,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 13:53:53,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941745975] [2024-11-08 13:53:53,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:53:53,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 13:53:53,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:53:53,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 13:53:53,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:53:53,963 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-08 13:53:53,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:53:53,993 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2024-11-08 13:53:53,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 13:53:53,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-08 13:53:53,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:53:53,994 INFO L225 Difference]: With dead ends: 44 [2024-11-08 13:53:53,994 INFO L226 Difference]: Without dead ends: 42 [2024-11-08 13:53:53,994 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-08 13:53:53,995 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 17 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:53:53,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 47 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:53:53,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-08 13:53:54,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-08 13:53:54,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 40 states have (on average 1.275) internal successors, (51), 41 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:53:54,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2024-11-08 13:53:54,006 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 10 [2024-11-08 13:53:54,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:53:54,006 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2024-11-08 13:53:54,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-08 13:53:54,007 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2024-11-08 13:53:54,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 13:53:54,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:53:54,007 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:53:54,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 13:53:54,008 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 13:53:54,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:53:54,008 INFO L85 PathProgramCache]: Analyzing trace with hash 625501225, now seen corresponding path program 1 times [2024-11-08 13:53:54,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:53:54,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003800559] [2024-11-08 13:53:54,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:53:54,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:53:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:53:54,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:53:54,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:53:54,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003800559] [2024-11-08 13:53:54,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003800559] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:53:54,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382795441] [2024-11-08 13:53:54,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:53:54,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:53:54,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:53:54,601 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-08 13:53:54,603 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-08 13:53:54,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:53:54,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-08 13:53:54,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:53:54,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2024-11-08 13:53:54,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2024-11-08 13:53:54,858 INFO L349 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2024-11-08 13:53:54,859 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 2 case distinctions, treesize of input 85 treesize of output 84 [2024-11-08 13:53:54,871 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 23 treesize of output 11 [2024-11-08 13:53:54,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:53:54,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:53:54,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:53:54,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2024-11-08 13:53:54,888 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 23 treesize of output 11 [2024-11-08 13:53:54,910 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 13:53:54,911 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 35 treesize of output 27 [2024-11-08 13:53:54,924 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 11 treesize of output 15 [2024-11-08 13:53:54,934 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 11 treesize of output 15 [2024-11-08 13:53:55,230 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-08 13:53:55,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 75 treesize of output 59 [2024-11-08 13:53:55,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2024-11-08 13:53:55,516 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:53:55,517 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:53:55,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:53:55,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382795441] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:53:55,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:53:55,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-11-08 13:53:55,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890345355] [2024-11-08 13:53:55,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:53:55,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 13:53:55,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:53:55,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 13:53:55,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-08 13:53:55,750 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 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-08 13:53:56,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:53:56,263 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2024-11-08 13:53:56,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 13:53:56,264 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-08 13:53:56,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:53:56,264 INFO L225 Difference]: With dead ends: 64 [2024-11-08 13:53:56,266 INFO L226 Difference]: Without dead ends: 53 [2024-11-08 13:53:56,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-11-08 13:53:56,267 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 28 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 13:53:56,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 249 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 13:53:56,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-08 13:53:56,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2024-11-08 13:53:56,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 46 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:53:56,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2024-11-08 13:53:56,274 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 15 [2024-11-08 13:53:56,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:53:56,275 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2024-11-08 13:53:56,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 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-08 13:53:56,275 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2024-11-08 13:53:56,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 13:53:56,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:53:56,276 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:53:56,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 13:53:56,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:53:56,477 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 13:53:56,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:53:56,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1157082046, now seen corresponding path program 1 times [2024-11-08 13:53:56,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:53:56,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333686226] [2024-11-08 13:53:56,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:53:56,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:53:56,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:53:56,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:53:56,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:53:56,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333686226] [2024-11-08 13:53:56,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333686226] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:53:56,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908696465] [2024-11-08 13:53:56,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:53:56,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:53:56,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:53:56,699 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-08 13:53:56,700 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-08 13:53:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:53:56,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-08 13:53:56,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:53:56,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2024-11-08 13:53:56,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:53:56,848 INFO L349 Elim1Store]: treesize reduction 41, result has 10.9 percent of original size [2024-11-08 13:53:56,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 33 [2024-11-08 13:53:56,865 INFO L349 Elim1Store]: treesize reduction 44, result has 10.2 percent of original size [2024-11-08 13:53:56,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 36 [2024-11-08 13:53:56,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:53:56,899 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 34 treesize of output 25 [2024-11-08 13:53:56,912 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-08 13:53:56,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-08 13:53:56,935 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 33 treesize of output 24 [2024-11-08 13:53:56,986 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 24 treesize of output 12 [2024-11-08 13:53:56,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:53:56,992 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:53:57,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:53:57,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908696465] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:53:57,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:53:57,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2024-11-08 13:53:57,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107076274] [2024-11-08 13:53:57,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:53:57,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 13:53:57,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:53:57,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 13:53:57,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=114, Unknown=5, NotChecked=0, Total=156 [2024-11-08 13:53:57,061 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:53:57,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:53:57,296 INFO L93 Difference]: Finished difference Result 104 states and 125 transitions. [2024-11-08 13:53:57,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 13:53:57,296 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-08 13:53:57,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:53:57,297 INFO L225 Difference]: With dead ends: 104 [2024-11-08 13:53:57,297 INFO L226 Difference]: Without dead ends: 102 [2024-11-08 13:53:57,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=207, Unknown=5, NotChecked=0, Total=306 [2024-11-08 13:53:57,298 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 157 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:53:57,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 154 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:53:57,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-08 13:53:57,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 62. [2024-11-08 13:53:57,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 61 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-08 13:53:57,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2024-11-08 13:53:57,306 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 16 [2024-11-08 13:53:57,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:53:57,307 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. [2024-11-08 13:53:57,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:53:57,307 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2024-11-08 13:53:57,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 13:53:57,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:53:57,307 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:53:57,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 13:53:57,511 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,SelfDestructingSolverStorable5 [2024-11-08 13:53:57,512 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 13:53:57,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:53:57,512 INFO L85 PathProgramCache]: Analyzing trace with hash 442135079, now seen corresponding path program 2 times [2024-11-08 13:53:57,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:53:57,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785305997] [2024-11-08 13:53:57,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:53:57,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:53:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:53:57,895 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:53:57,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:53:57,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785305997] [2024-11-08 13:53:57,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785305997] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:53:57,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620777670] [2024-11-08 13:53:57,896 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 13:53:57,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:53:57,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:53:57,899 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-08 13:53:57,909 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-08 13:53:58,209 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 13:53:58,209 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 13:53:58,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-08 13:53:58,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:53:58,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:53:58,252 INFO L349 Elim1Store]: treesize reduction 35, result has 12.5 percent of original size [2024-11-08 13:53:58,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 20 [2024-11-08 13:53:58,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2024-11-08 13:53:58,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2024-11-08 13:53:58,283 INFO L349 Elim1Store]: treesize reduction 21, result has 4.5 percent of original size [2024-11-08 13:53:58,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 1 [2024-11-08 13:53:58,307 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 13:53:58,307 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-08 13:53:58,311 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 16 treesize of output 11 [2024-11-08 13:53:58,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-08 13:53:58,420 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 13:53:58,421 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 13:53:58,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620777670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:53:58,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 13:53:58,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2024-11-08 13:53:58,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598404954] [2024-11-08 13:53:58,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:53:58,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 13:53:58,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:53:58,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 13:53:58,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-08 13:53:58,422 INFO L87 Difference]: Start difference. First operand 62 states and 76 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:53:58,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:53:58,626 INFO L93 Difference]: Finished difference Result 141 states and 175 transitions. [2024-11-08 13:53:58,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 13:53:58,627 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 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-08 13:53:58,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:53:58,627 INFO L225 Difference]: With dead ends: 141 [2024-11-08 13:53:58,627 INFO L226 Difference]: Without dead ends: 106 [2024-11-08 13:53:58,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-11-08 13:53:58,628 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 84 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:53:58,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 134 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:53:58,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-08 13:53:58,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 76. [2024-11-08 13:53:58,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 75 states have internal predecessors, (93), 0 states have call successors, (0), 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-08 13:53:58,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2024-11-08 13:53:58,636 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 18 [2024-11-08 13:53:58,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:53:58,637 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2024-11-08 13:53:58,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 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-08 13:53:58,637 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2024-11-08 13:53:58,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-08 13:53:58,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:53:58,638 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:53:58,652 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-08 13:53:58,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:53:58,838 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 13:53:58,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:53:58,839 INFO L85 PathProgramCache]: Analyzing trace with hash -482453053, now seen corresponding path program 1 times [2024-11-08 13:53:58,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:53:58,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265783867] [2024-11-08 13:53:58,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:53:58,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:53:58,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:53:59,163 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:53:59,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:53:59,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265783867] [2024-11-08 13:53:59,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265783867] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:53:59,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15003365] [2024-11-08 13:53:59,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:53:59,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:53:59,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:53:59,166 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-08 13:53:59,166 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-08 13:53:59,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:53:59,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-08 13:53:59,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:53:59,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2024-11-08 13:53:59,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 28 treesize of output 32 [2024-11-08 13:53:59,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:53:59,338 INFO L349 Elim1Store]: treesize reduction 39, result has 11.4 percent of original size [2024-11-08 13:53:59,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 38 [2024-11-08 13:53:59,361 INFO L349 Elim1Store]: treesize reduction 36, result has 32.1 percent of original size [2024-11-08 13:53:59,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 83 [2024-11-08 13:53:59,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 52 [2024-11-08 13:53:59,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 16 [2024-11-08 13:53:59,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2024-11-08 13:53:59,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 13:53:59,506 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-08 13:53:59,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 20 [2024-11-08 13:53:59,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:53:59,531 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2024-11-08 13:53:59,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 70 [2024-11-08 13:53:59,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:53:59,549 INFO L349 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2024-11-08 13:53:59,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2024-11-08 13:53:59,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-08 13:53:59,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-08 13:53:59,671 INFO L349 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2024-11-08 13:53:59,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 100 treesize of output 71 [2024-11-08 13:53:59,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-08 13:54:00,008 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2024-11-08 13:54:00,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 92 treesize of output 43 [2024-11-08 13:54:00,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-08 13:54:00,081 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:54:00,081 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:54:00,185 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_832 (Array Int Int)) (v_ArrVal_830 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (or (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~item~0#1.base|) .cse0 1)) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_832) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_830) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 8)) 1) (not (= v_ArrVal_832 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) .cse0 (select v_ArrVal_832 .cse0))))))) is different from false [2024-11-08 13:54:00,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:54:00,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2024-11-08 13:54:00,216 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_832 (Array Int Int)) (v_arrayElimArr_8 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_36| Int) (v_ArrVal_830 (Array Int Int))) (or (= (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_main_~item~0#1.base_36| v_arrayElimArr_8) (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~item~0#1.base_36| v_ArrVal_832) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~item~0#1.base_36| v_ArrVal_830) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) 1) (not (= v_ArrVal_832 (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~item~0#1.base_36|) 0 0) 4 (select v_ArrVal_832 4)))) (not (= (select v_arrayElimArr_8 4) 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_36|) 0)))) is different from false [2024-11-08 13:54:00,253 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:54:00,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15003365] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:54:00,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:54:00,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2024-11-08 13:54:00,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725157520] [2024-11-08 13:54:00,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:54:00,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 13:54:00,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:54:00,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 13:54:00,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=269, Unknown=2, NotChecked=66, Total=380 [2024-11-08 13:54:00,256 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:54:01,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:54:01,766 INFO L93 Difference]: Finished difference Result 238 states and 300 transitions. [2024-11-08 13:54:01,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-08 13:54:01,766 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-08 13:54:01,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:54:01,767 INFO L225 Difference]: With dead ends: 238 [2024-11-08 13:54:01,767 INFO L226 Difference]: Without dead ends: 203 [2024-11-08 13:54:01,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=260, Invalid=936, Unknown=2, NotChecked=134, Total=1332 [2024-11-08 13:54:01,768 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 334 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 297 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 13:54:01,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 414 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 579 Invalid, 0 Unknown, 297 Unchecked, 0.6s Time] [2024-11-08 13:54:01,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-08 13:54:01,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 130. [2024-11-08 13:54:01,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 128 states have (on average 1.28125) internal successors, (164), 129 states have internal predecessors, (164), 0 states have call successors, (0), 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-08 13:54:01,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 164 transitions. [2024-11-08 13:54:01,785 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 164 transitions. Word has length 19 [2024-11-08 13:54:01,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:54:01,785 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 164 transitions. [2024-11-08 13:54:01,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:54:01,785 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 164 transitions. [2024-11-08 13:54:01,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 13:54:01,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:54:01,786 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:54:01,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-08 13:54:01,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:54:01,986 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 13:54:01,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:54:01,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1136543444, now seen corresponding path program 2 times [2024-11-08 13:54:01,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:54:01,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182726804] [2024-11-08 13:54:01,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:54:01,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:54:02,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:54:02,671 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:54:02,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:54:02,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182726804] [2024-11-08 13:54:02,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182726804] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:54:02,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676674185] [2024-11-08 13:54:02,671 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 13:54:02,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:54:02,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:54:02,673 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-08 13:54:02,674 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-08 13:54:02,989 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 13:54:02,989 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 13:54:02,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-08 13:54:02,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:54:03,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2024-11-08 13:54:03,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 40 [2024-11-08 13:54:03,039 INFO L349 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2024-11-08 13:54:03,039 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 2 case distinctions, treesize of input 78 treesize of output 79 [2024-11-08 13:54:03,043 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 19 treesize of output 31 [2024-11-08 13:54:03,071 INFO L349 Elim1Store]: treesize reduction 94, result has 34.3 percent of original size [2024-11-08 13:54:03,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 73 [2024-11-08 13:54:03,074 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 19 treesize of output 31 [2024-11-08 13:54:03,087 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 15 treesize of output 23 [2024-11-08 13:54:03,094 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 31 treesize of output 1 [2024-11-08 13:54:03,100 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-08 13:54:03,101 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 59 treesize of output 43 [2024-11-08 13:54:03,277 INFO L349 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2024-11-08 13:54:03,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 126 treesize of output 77 [2024-11-08 13:54:03,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:54:03,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 75 [2024-11-08 13:54:03,429 INFO L349 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2024-11-08 13:54:03,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 133 treesize of output 80 [2024-11-08 13:54:03,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:54:03,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2024-11-08 13:54:03,616 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:54:03,616 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:54:07,491 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:54:07,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676674185] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:54:07,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:54:07,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 19 [2024-11-08 13:54:07,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625174561] [2024-11-08 13:54:07,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:54:07,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 13:54:07,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:54:07,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 13:54:07,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2024-11-08 13:54:07,493 INFO L87 Difference]: Start difference. First operand 130 states and 164 transitions. Second operand has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 states have internal predecessors, (49), 0 states have call successors, (0), 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-08 13:54:08,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:54:08,200 INFO L93 Difference]: Finished difference Result 156 states and 194 transitions. [2024-11-08 13:54:08,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 13:54:08,201 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 states have internal predecessors, (49), 0 states have call successors, (0), 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-08 13:54:08,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:54:08,202 INFO L225 Difference]: With dead ends: 156 [2024-11-08 13:54:08,203 INFO L226 Difference]: Without dead ends: 145 [2024-11-08 13:54:08,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2024-11-08 13:54:08,204 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 42 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 13:54:08,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 215 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 13:54:08,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-08 13:54:08,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 135. [2024-11-08 13:54:08,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 133 states have (on average 1.2706766917293233) internal successors, (169), 134 states have internal predecessors, (169), 0 states have call successors, (0), 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-08 13:54:08,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 169 transitions. [2024-11-08 13:54:08,226 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 169 transitions. Word has length 20 [2024-11-08 13:54:08,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:54:08,227 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 169 transitions. [2024-11-08 13:54:08,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 states have internal predecessors, (49), 0 states have call successors, (0), 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-08 13:54:08,227 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 169 transitions. [2024-11-08 13:54:08,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 13:54:08,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:54:08,228 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:54:08,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-08 13:54:08,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:54:08,432 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 13:54:08,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:54:08,433 INFO L85 PathProgramCache]: Analyzing trace with hash -800532698, now seen corresponding path program 1 times [2024-11-08 13:54:08,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:54:08,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613026551] [2024-11-08 13:54:08,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:54:08,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:54:08,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:54:08,950 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:54:08,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:54:08,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613026551] [2024-11-08 13:54:08,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613026551] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:54:08,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046923447] [2024-11-08 13:54:08,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:54:08,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:54:08,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:54:08,952 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-08 13:54:08,953 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-08 13:54:09,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:54:09,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-11-08 13:54:09,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:54:09,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2024-11-08 13:54:09,107 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2024-11-08 13:54:09,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 28 treesize of output 32 [2024-11-08 13:54:09,145 INFO L349 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2024-11-08 13:54:09,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 2 case distinctions, treesize of input 172 treesize of output 148 [2024-11-08 13:54:09,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:54:09,163 INFO L349 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2024-11-08 13:54:09,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 23 [2024-11-08 13:54:09,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 25 [2024-11-08 13:54:09,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:54:09,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:54:09,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:54:09,188 INFO L349 Elim1Store]: treesize reduction 31, result has 13.9 percent of original size [2024-11-08 13:54:09,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 46 [2024-11-08 13:54:09,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 13:54:09,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:54:09,274 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-08 13:54:09,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 71 [2024-11-08 13:54:09,291 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2024-11-08 13:54:09,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 41 [2024-11-08 13:54:09,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:54:09,309 INFO L349 Elim1Store]: treesize reduction 32, result has 45.8 percent of original size [2024-11-08 13:54:09,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 41 [2024-11-08 13:54:09,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-08 13:54:09,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2024-11-08 13:54:09,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:54:09,353 INFO L349 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2024-11-08 13:54:09,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2024-11-08 13:54:09,429 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-08 13:54:09,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 69 [2024-11-08 13:54:09,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2024-11-08 13:54:09,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:54:09,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2024-11-08 13:54:09,763 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-11-08 13:54:09,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 114 treesize of output 53 [2024-11-08 13:54:09,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2024-11-08 13:54:09,820 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:54:09,820 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:54:10,028 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:54:10,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 63 [2024-11-08 13:54:10,102 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:54:10,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046923447] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:54:10,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:54:10,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2024-11-08 13:54:10,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74940569] [2024-11-08 13:54:10,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:54:10,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-08 13:54:10,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:54:10,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-08 13:54:10,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=433, Unknown=14, NotChecked=0, Total=506 [2024-11-08 13:54:10,103 INFO L87 Difference]: Start difference. First operand 135 states and 169 transitions. Second operand has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:54:11,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:54:11,598 INFO L93 Difference]: Finished difference Result 309 states and 388 transitions. [2024-11-08 13:54:11,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 13:54:11,598 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-08 13:54:11,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:54:11,599 INFO L225 Difference]: With dead ends: 309 [2024-11-08 13:54:11,599 INFO L226 Difference]: Without dead ends: 274 [2024-11-08 13:54:11,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=241, Invalid=1002, Unknown=17, NotChecked=0, Total=1260 [2024-11-08 13:54:11,600 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 260 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 13:54:11,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 499 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 13:54:11,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-08 13:54:11,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 191. [2024-11-08 13:54:11,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 189 states have (on average 1.291005291005291) internal successors, (244), 190 states have internal predecessors, (244), 0 states have call successors, (0), 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-08 13:54:11,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 244 transitions. [2024-11-08 13:54:11,635 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 244 transitions. Word has length 21 [2024-11-08 13:54:11,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:54:11,635 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 244 transitions. [2024-11-08 13:54:11,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:54:11,635 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 244 transitions. [2024-11-08 13:54:11,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 13:54:11,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:54:11,636 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:54:11,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 13:54:11,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:54:11,837 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 13:54:11,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:54:11,837 INFO L85 PathProgramCache]: Analyzing trace with hash -962615628, now seen corresponding path program 1 times [2024-11-08 13:54:11,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:54:11,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391269576] [2024-11-08 13:54:11,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:54:11,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:54:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:54:12,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:54:12,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:54:12,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391269576] [2024-11-08 13:54:12,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391269576] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:54:12,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748062997] [2024-11-08 13:54:12,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:54:12,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:54:12,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:54:12,410 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-08 13:54:12,410 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-08 13:54:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:54:12,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-08 13:54:12,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:54:12,552 INFO L349 Elim1Store]: treesize reduction 33, result has 13.2 percent of original size [2024-11-08 13:54:12,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 18 [2024-11-08 13:54:12,570 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-08 13:54:12,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-11-08 13:54:12,662 INFO L349 Elim1Store]: treesize reduction 4, result has 91.8 percent of original size [2024-11-08 13:54:12,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 67 [2024-11-08 13:54:12,733 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 11 treesize of output 7 [2024-11-08 13:54:12,950 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-08 13:54:12,952 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-08 13:54:12,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-08 13:54:13,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-08 13:54:13,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-08 13:54:13,040 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-08 13:54:13,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:54:13,099 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:54:13,145 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1324 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4))) (or (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1324) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse0)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse0) 4)) (select v_ArrVal_1324 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 8))) (not (= v_ArrVal_1324 (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse0 (select v_ArrVal_1324 .cse0))))))) is different from false [2024-11-08 13:54:13,155 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1324 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4))) (or (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_1324) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse0)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse0) 4)) (select v_ArrVal_1324 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 8))) (not (= (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse0 (select v_ArrVal_1324 .cse0)) v_ArrVal_1324))))) is different from false [2024-11-08 13:54:13,176 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 108 treesize of output 102 [2024-11-08 13:54:13,182 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 170 treesize of output 158 [2024-11-08 13:54:13,284 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4)) (.cse8 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 8)) (.cse7 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) (.cse9 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base|)) (.cse10 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4))) (let ((.cse11 (forall ((v_ArrVal_1324 (Array Int Int)) (v_arrayElimCell_122 Int) (v_arrayElimCell_121 Int) (v_ArrVal_1323 Int)) (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse9 .cse10 v_ArrVal_1323)))) (or (= (select v_ArrVal_1324 .cse8) (select (select (store .cse17 |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_1324) v_arrayElimCell_121) (+ v_arrayElimCell_122 4))) (not (= (store (select .cse17 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse7 (select v_ArrVal_1324 .cse7)) v_ArrVal_1324)))))) (.cse0 (= |c_ULTIMATE.start_main_~bcki~0#1.offset| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse12 (= |c_ULTIMATE.start_main_~bcki~0#1.base| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse1 (forall ((v_ArrVal_1324 (Array Int Int)) (v_arrayElimCell_122 Int) (v_arrayElimCell_121 Int) (v_ArrVal_1323 Int)) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse9 .cse10 v_ArrVal_1323)))) (let ((.cse15 (select v_ArrVal_1324 .cse8)) (.cse14 (select (store .cse16 |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_1324) v_arrayElimCell_121))) (or (= (select .cse14 .cse3) .cse15) (= .cse15 (select .cse14 (+ v_arrayElimCell_122 4))) (not (= (store (select .cse16 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse7 (select v_ArrVal_1324 .cse7)) v_ArrVal_1324)))))))) (and (or .cse0 .cse1) (forall ((v_ArrVal_1324 (Array Int Int)) (v_arrayElimCell_122 Int) (v_arrayElimCell_121 Int) (v_ArrVal_1323 Int)) (let ((.cse6 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse9 .cse10 v_ArrVal_1323)))) (let ((.cse5 (store .cse6 |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_1324))) (let ((.cse4 (select v_ArrVal_1324 .cse8)) (.cse2 (select .cse5 v_arrayElimCell_121))) (or (= (select .cse2 .cse3) .cse4) (= .cse4 (select (select .cse5 |c_ULTIMATE.start_main_~item~0#1.base|) .cse3)) (= .cse4 (select .cse2 (+ v_arrayElimCell_122 4))) (not (= (store (select .cse6 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse7 (select v_ArrVal_1324 .cse7)) v_ArrVal_1324))))))) (or .cse0 .cse11) (or .cse12 .cse11) (or (forall ((v_ArrVal_1324 (Array Int Int)) (v_ArrVal_1323 Int)) (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse9 .cse10 v_ArrVal_1323)))) (or (= (select v_ArrVal_1324 .cse8) (select (select (store .cse13 |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~item~0#1.base|) .cse3)) (not (= (store (select .cse13 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse7 (select v_ArrVal_1324 .cse7)) v_ArrVal_1324))))) (not .cse0) (not .cse12)) (or .cse12 .cse1)))) is different from false [2024-11-08 13:54:14,306 INFO L349 Elim1Store]: treesize reduction 31, result has 40.4 percent of original size [2024-11-08 13:54:14,307 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 2 case distinctions, treesize of input 190 treesize of output 144 [2024-11-08 13:54:14,327 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-08 13:54:14,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 208 treesize of output 204 [2024-11-08 13:54:14,418 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:54:14,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 156 treesize of output 169 [2024-11-08 13:54:14,690 INFO L349 Elim1Store]: treesize reduction 6, result has 95.4 percent of original size [2024-11-08 13:54:14,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 334 treesize of output 326 [2024-11-08 13:54:14,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-08 13:54:14,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748062997] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:54:14,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:54:14,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 32 [2024-11-08 13:54:14,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885381269] [2024-11-08 13:54:14,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:54:14,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-08 13:54:14,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:54:14,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-08 13:54:14,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=703, Unknown=3, NotChecked=168, Total=992 [2024-11-08 13:54:14,905 INFO L87 Difference]: Start difference. First operand 191 states and 244 transitions. Second operand has 32 states, 32 states have (on average 2.09375) internal successors, (67), 32 states have internal predecessors, (67), 0 states have call successors, (0), 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-08 13:54:15,626 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4)) (.cse11 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 8)) (.cse13 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) (.cse1 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base|)) (.cse14 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4))) (let ((.cse9 (= |c_ULTIMATE.start_main_~bcki~0#1.base| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse16 (forall ((v_ArrVal_1324 (Array Int Int)) (v_arrayElimCell_122 Int) (v_arrayElimCell_121 Int) (v_ArrVal_1323 Int)) (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse1 .cse14 v_ArrVal_1323)))) (or (= (select v_ArrVal_1324 .cse11) (select (select (store .cse24 |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_1324) v_arrayElimCell_121) (+ v_arrayElimCell_122 4))) (not (= (store (select .cse24 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse13 (select v_ArrVal_1324 .cse13)) v_ArrVal_1324)))))) (.cse15 (= |c_ULTIMATE.start_main_~bcki~0#1.offset| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse10 (forall ((v_ArrVal_1324 (Array Int Int)) (v_arrayElimCell_122 Int) (v_arrayElimCell_121 Int) (v_ArrVal_1323 Int)) (let ((.cse23 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse1 .cse14 v_ArrVal_1323)))) (let ((.cse22 (select v_ArrVal_1324 .cse11)) (.cse21 (select (store .cse23 |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_1324) v_arrayElimCell_121))) (or (= (select .cse21 .cse0) .cse22) (= .cse22 (select .cse21 (+ v_arrayElimCell_122 4))) (not (= (store (select .cse23 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse13 (select v_ArrVal_1324 .cse13)) v_ArrVal_1324)))))))) (let ((.cse3 (or .cse15 .cse10)) (.cse4 (forall ((v_ArrVal_1324 (Array Int Int)) (v_arrayElimCell_122 Int) (v_arrayElimCell_121 Int) (v_ArrVal_1323 Int)) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse1 .cse14 v_ArrVal_1323)))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_1324))) (let ((.cse18 (select v_ArrVal_1324 .cse11)) (.cse17 (select .cse19 v_arrayElimCell_121))) (or (= (select .cse17 .cse0) .cse18) (= .cse18 (select (select .cse19 |c_ULTIMATE.start_main_~item~0#1.base|) .cse0)) (= .cse18 (select .cse17 (+ v_arrayElimCell_122 4))) (not (= (store (select .cse20 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse13 (select v_ArrVal_1324 .cse13)) v_ArrVal_1324)))))))) (.cse5 (or .cse15 .cse16)) (.cse6 (or .cse9 .cse16)) (.cse7 (or (forall ((v_ArrVal_1324 (Array Int Int)) (v_ArrVal_1323 Int)) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse1 .cse14 v_ArrVal_1323)))) (or (= (select v_ArrVal_1324 .cse11) (select (select (store .cse12 |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~item~0#1.base|) .cse0)) (not (= (store (select .cse12 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse13 (select v_ArrVal_1324 .cse13)) v_ArrVal_1324))))) (not .cse15) (not .cse9))) (.cse8 (or .cse9 .cse10))) (let ((.cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) (and (or (not (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~item~0#1.base|) .cse0) (select .cse1 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 8)))) .cse2) (not (= |c_ULTIMATE.start_main_~bucket~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) .cse3 (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~bucket~0#1.base|) 8) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~bucket~0#1.base|) 1) .cse4 .cse5 (= |c_ULTIMATE.start_main_~bucket~0#1.offset| 0) .cse6 .cse7 (or (not (= |c_ULTIMATE.start_main_#t~mem11#1| |c_ULTIMATE.start_main_#t~mem10#1|)) .cse2) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) .cse8))))) is different from false [2024-11-08 13:54:16,867 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4)) (.cse12 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 8)) (.cse14 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) (.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base|)) (.cse15 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4))) (let ((.cse10 (= |c_ULTIMATE.start_main_~bcki~0#1.base| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse17 (forall ((v_ArrVal_1324 (Array Int Int)) (v_arrayElimCell_122 Int) (v_arrayElimCell_121 Int) (v_ArrVal_1323 Int)) (let ((.cse25 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse2 .cse15 v_ArrVal_1323)))) (or (= (select v_ArrVal_1324 .cse12) (select (select (store .cse25 |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_1324) v_arrayElimCell_121) (+ v_arrayElimCell_122 4))) (not (= (store (select .cse25 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse14 (select v_ArrVal_1324 .cse14)) v_ArrVal_1324)))))) (.cse16 (= |c_ULTIMATE.start_main_~bcki~0#1.offset| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse11 (forall ((v_ArrVal_1324 (Array Int Int)) (v_arrayElimCell_122 Int) (v_arrayElimCell_121 Int) (v_ArrVal_1323 Int)) (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse2 .cse15 v_ArrVal_1323)))) (let ((.cse23 (select v_ArrVal_1324 .cse12)) (.cse22 (select (store .cse24 |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_1324) v_arrayElimCell_121))) (or (= (select .cse22 .cse1) .cse23) (= .cse23 (select .cse22 (+ v_arrayElimCell_122 4))) (not (= (store (select .cse24 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse14 (select v_ArrVal_1324 .cse14)) v_ArrVal_1324)))))))) (let ((.cse4 (or .cse16 .cse11)) (.cse5 (forall ((v_ArrVal_1324 (Array Int Int)) (v_arrayElimCell_122 Int) (v_arrayElimCell_121 Int) (v_ArrVal_1323 Int)) (let ((.cse21 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse2 .cse15 v_ArrVal_1323)))) (let ((.cse20 (store .cse21 |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_1324))) (let ((.cse19 (select v_ArrVal_1324 .cse12)) (.cse18 (select .cse20 v_arrayElimCell_121))) (or (= (select .cse18 .cse1) .cse19) (= .cse19 (select (select .cse20 |c_ULTIMATE.start_main_~item~0#1.base|) .cse1)) (= .cse19 (select .cse18 (+ v_arrayElimCell_122 4))) (not (= (store (select .cse21 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse14 (select v_ArrVal_1324 .cse14)) v_ArrVal_1324)))))))) (.cse6 (or .cse16 .cse17)) (.cse7 (or .cse10 .cse17)) (.cse8 (or (forall ((v_ArrVal_1324 (Array Int Int)) (v_ArrVal_1323 Int)) (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse2 .cse15 v_ArrVal_1323)))) (or (= (select v_ArrVal_1324 .cse12) (select (select (store .cse13 |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~item~0#1.base|) .cse1)) (not (= (store (select .cse13 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse14 (select v_ArrVal_1324 .cse14)) v_ArrVal_1324))))) (not .cse16) (not .cse10))) (.cse9 (or .cse10 .cse11))) (let ((.cse3 (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~bucket~0#1.base|) 1))) (or (and (exists ((|v_ULTIMATE.start_main_#t~malloc2#1.base_36| Int)) (and (not (= |v_ULTIMATE.start_main_#t~malloc2#1.base_36| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc2#1.base_36|) 1))) .cse0) (and (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_68| Int)) (= (select |c_#valid| |v_ULTIMATE.start_main_~bcki~0#1.base_68|) 1)) .cse0))) (or (not (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~item~0#1.base|) .cse1) (select .cse2 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 8)))) .cse3) (not (= |c_ULTIMATE.start_main_~bucket~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) .cse4 .cse5 .cse6 (= |c_ULTIMATE.start_main_~bucket~0#1.offset| 0) .cse7 .cse8 (or (not (= |c_ULTIMATE.start_main_#t~mem11#1| |c_ULTIMATE.start_main_#t~mem10#1|)) .cse3) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) .cse9))))) is different from false [2024-11-08 13:54:17,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:54:17,040 INFO L93 Difference]: Finished difference Result 406 states and 514 transitions. [2024-11-08 13:54:17,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-08 13:54:17,040 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.09375) internal successors, (67), 32 states have internal predecessors, (67), 0 states have call successors, (0), 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 24 [2024-11-08 13:54:17,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:54:17,042 INFO L225 Difference]: With dead ends: 406 [2024-11-08 13:54:17,042 INFO L226 Difference]: Without dead ends: 371 [2024-11-08 13:54:17,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=428, Invalid=1843, Unknown=5, NotChecked=480, Total=2756 [2024-11-08 13:54:17,044 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 386 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 21 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 1399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 803 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 13:54:17,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 446 Invalid, 1399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 562 Invalid, 13 Unknown, 803 Unchecked, 0.9s Time] [2024-11-08 13:54:17,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-08 13:54:17,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 287. [2024-11-08 13:54:17,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 285 states have (on average 1.2912280701754386) internal successors, (368), 286 states have internal predecessors, (368), 0 states have call successors, (0), 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-08 13:54:17,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 368 transitions. [2024-11-08 13:54:17,092 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 368 transitions. Word has length 24 [2024-11-08 13:54:17,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:54:17,092 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 368 transitions. [2024-11-08 13:54:17,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.09375) internal successors, (67), 32 states have internal predecessors, (67), 0 states have call successors, (0), 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-08 13:54:17,092 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 368 transitions. [2024-11-08 13:54:17,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 13:54:17,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:54:17,093 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:54:17,107 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-08 13:54:17,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:54:17,294 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 13:54:17,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:54:17,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1317906679, now seen corresponding path program 3 times [2024-11-08 13:54:17,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:54:17,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278281614] [2024-11-08 13:54:17,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:54:17,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:54:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:54:17,956 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:54:17,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:54:17,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278281614] [2024-11-08 13:54:17,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278281614] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:54:17,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198898512] [2024-11-08 13:54:17,957 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 13:54:17,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:54:17,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:54:17,958 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-08 13:54:17,959 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-08 13:54:18,963 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-08 13:54:18,963 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 13:54:18,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-08 13:54:18,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:54:18,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2024-11-08 13:54:18,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2024-11-08 13:54:19,018 INFO L349 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2024-11-08 13:54:19,018 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 2 case distinctions, treesize of input 78 treesize of output 79 [2024-11-08 13:54:19,022 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 31 treesize of output 1 [2024-11-08 13:54:19,024 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 31 treesize of output 15 [2024-11-08 13:54:19,036 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-08 13:54:19,037 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 59 treesize of output 43 [2024-11-08 13:54:19,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:54:19,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 45 [2024-11-08 13:54:19,049 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 23 treesize of output 11 [2024-11-08 13:54:19,056 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 31 treesize of output 15 [2024-11-08 13:54:19,150 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-08 13:54:19,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 53 [2024-11-08 13:54:19,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:54:19,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2024-11-08 13:54:19,259 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-08 13:54:19,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 56 [2024-11-08 13:54:19,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:54:19,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2024-11-08 13:54:19,375 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-08 13:54:19,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 56 [2024-11-08 13:54:19,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:54:19,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2024-11-08 13:54:19,455 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:54:19,455 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:54:20,063 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:54:20,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198898512] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:54:20,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:54:20,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 9] total 18 [2024-11-08 13:54:20,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254610696] [2024-11-08 13:54:20,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:54:20,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 13:54:20,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:54:20,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 13:54:20,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2024-11-08 13:54:20,066 INFO L87 Difference]: Start difference. First operand 287 states and 368 transitions. Second operand has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 0 states have call successors, (0), 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-08 13:54:20,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:54:20,467 INFO L93 Difference]: Finished difference Result 302 states and 384 transitions. [2024-11-08 13:54:20,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 13:54:20,468 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 0 states have call successors, (0), 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 25 [2024-11-08 13:54:20,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:54:20,469 INFO L225 Difference]: With dead ends: 302 [2024-11-08 13:54:20,469 INFO L226 Difference]: Without dead ends: 274 [2024-11-08 13:54:20,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2024-11-08 13:54:20,470 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 13:54:20,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 267 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 13:54:20,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-08 13:54:20,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2024-11-08 13:54:20,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 272 states have (on average 1.3014705882352942) internal successors, (354), 273 states have internal predecessors, (354), 0 states have call successors, (0), 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-08 13:54:20,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 354 transitions. [2024-11-08 13:54:20,510 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 354 transitions. Word has length 25 [2024-11-08 13:54:20,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:54:20,511 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 354 transitions. [2024-11-08 13:54:20,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 0 states have call successors, (0), 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-08 13:54:20,511 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 354 transitions. [2024-11-08 13:54:20,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 13:54:20,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:54:20,512 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:54:20,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-08 13:54:20,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-08 13:54:20,712 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 13:54:20,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:54:20,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1702665013, now seen corresponding path program 1 times [2024-11-08 13:54:20,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:54:20,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24725971] [2024-11-08 13:54:20,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:54:20,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:54:20,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:54:21,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:54:21,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:54:21,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24725971] [2024-11-08 13:54:21,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24725971] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:54:21,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144117549] [2024-11-08 13:54:21,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:54:21,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:54:21,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:54:21,333 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-08 13:54:21,334 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-08 13:54:21,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:54:21,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-08 13:54:21,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:54:21,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2024-11-08 13:54:21,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2024-11-08 13:54:21,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 24 treesize of output 28 [2024-11-08 13:54:21,545 INFO L349 Elim1Store]: treesize reduction 62, result has 7.5 percent of original size [2024-11-08 13:54:21,545 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 2 case distinctions, treesize of input 110 treesize of output 83 [2024-11-08 13:54:21,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:54:21,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:54:21,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2024-11-08 13:54:21,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:54:21,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-11-08 13:54:21,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2024-11-08 13:54:21,578 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 11 treesize of output 15 [2024-11-08 13:54:21,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2024-11-08 13:54:21,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2024-11-08 13:54:21,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2024-11-08 13:54:21,615 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-08 13:54:21,615 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 68 treesize of output 61 [2024-11-08 13:54:21,626 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-08 13:54:21,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2024-11-08 13:54:21,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2024-11-08 13:54:21,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2024-11-08 13:54:21,643 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 15 treesize of output 23 [2024-11-08 13:54:21,795 INFO L349 Elim1Store]: treesize reduction 92, result has 38.7 percent of original size [2024-11-08 13:54:21,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 127 treesize of output 165 [2024-11-08 13:54:21,815 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-08 13:54:21,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 128 [2024-11-08 13:54:21,830 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-08 13:54:21,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 97 [2024-11-08 13:54:24,234 INFO L349 Elim1Store]: treesize reduction 1668, result has 12.6 percent of original size [2024-11-08 13:54:24,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 28 select indices, 28 select index equivalence classes, 1 disjoint index pairs (out of 378 index pairs), introduced 28 new quantified variables, introduced 389 case distinctions, treesize of input 641 treesize of output 763 [2024-11-08 13:54:24,300 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2024-11-08 13:54:24,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 560 treesize of output 458 [2024-11-08 13:54:24,332 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 466 treesize of output 441