./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/packet_filter.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/packet_filter.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 d604fdd8f7c4d34db0106d8a0ff422218ae80e9ee6eb03f691b84d2fcc8ad49f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 20:42:28,440 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 20:42:28,487 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 20:42:28,491 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 20:42:28,492 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 20:42:28,515 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 20:42:28,516 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 20:42:28,517 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 20:42:28,517 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 20:42:28,518 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 20:42:28,518 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 20:42:28,519 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 20:42:28,519 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 20:42:28,519 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 20:42:28,520 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 20:42:28,520 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 20:42:28,522 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 20:42:28,522 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 20:42:28,522 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 20:42:28,522 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 20:42:28,522 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 20:42:28,525 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 20:42:28,525 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 20:42:28,525 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 20:42:28,525 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 20:42:28,525 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 20:42:28,526 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 20:42:28,526 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 20:42:28,526 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 20:42:28,526 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 20:42:28,526 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 20:42:28,526 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 20:42:28,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 20:42:28,527 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 20:42:28,527 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 20:42:28,527 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 20:42:28,527 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 20:42:28,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 20:42:28,528 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 20:42:28,528 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 20:42:28,528 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 20:42:28,528 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 20:42:28,529 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 -> d604fdd8f7c4d34db0106d8a0ff422218ae80e9ee6eb03f691b84d2fcc8ad49f [2024-11-19 20:42:28,731 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 20:42:28,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 20:42:28,757 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 20:42:28,758 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 20:42:28,758 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 20:42:28,759 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/packet_filter.i [2024-11-19 20:42:29,973 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 20:42:30,159 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 20:42:30,159 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/packet_filter.i [2024-11-19 20:42:30,170 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e7b073fd/fab4e401340343f39fad54fbb87a5b15/FLAG283b94555 [2024-11-19 20:42:30,531 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e7b073fd/fab4e401340343f39fad54fbb87a5b15 [2024-11-19 20:42:30,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 20:42:30,535 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 20:42:30,537 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 20:42:30,537 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 20:42:30,542 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 20:42:30,543 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:42:30" (1/1) ... [2024-11-19 20:42:30,545 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@449e3eea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:30, skipping insertion in model container [2024-11-19 20:42:30,545 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:42:30" (1/1) ... [2024-11-19 20:42:30,579 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 20:42:30,903 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/heap-data/packet_filter.i[23925,23938] [2024-11-19 20:42:30,910 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/heap-data/packet_filter.i[24159,24172] [2024-11-19 20:42:30,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 20:42:30,927 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 20:42:30,966 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/heap-data/packet_filter.i[23925,23938] [2024-11-19 20:42:30,968 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/heap-data/packet_filter.i[24159,24172] [2024-11-19 20:42:30,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 20:42:31,005 INFO L204 MainTranslator]: Completed translation [2024-11-19 20:42:31,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:31 WrapperNode [2024-11-19 20:42:31,005 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 20:42:31,007 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 20:42:31,007 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 20:42:31,007 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 20:42:31,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:31" (1/1) ... [2024-11-19 20:42:31,024 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:31" (1/1) ... [2024-11-19 20:42:31,054 INFO L138 Inliner]: procedures = 130, calls = 85, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 164 [2024-11-19 20:42:31,054 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 20:42:31,055 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 20:42:31,055 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 20:42:31,055 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 20:42:31,064 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:31" (1/1) ... [2024-11-19 20:42:31,064 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:31" (1/1) ... [2024-11-19 20:42:31,067 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:31" (1/1) ... [2024-11-19 20:42:31,084 INFO L175 MemorySlicer]: Split 57 memory accesses to 7 slices as follows [2, 6, 6, 15, 6, 16, 6]. 28 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 2, 3, 0, 0, 0]. The 14 writes are split as follows [0, 3, 1, 0, 3, 4, 3]. [2024-11-19 20:42:31,085 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:31" (1/1) ... [2024-11-19 20:42:31,085 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:31" (1/1) ... [2024-11-19 20:42:31,097 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:31" (1/1) ... [2024-11-19 20:42:31,100 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:31" (1/1) ... [2024-11-19 20:42:31,103 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:31" (1/1) ... [2024-11-19 20:42:31,104 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:31" (1/1) ... [2024-11-19 20:42:31,109 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 20:42:31,110 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 20:42:31,110 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 20:42:31,110 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 20:42:31,111 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:31" (1/1) ... [2024-11-19 20:42:31,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 20:42:31,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:42:31,137 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 20:42:31,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 20:42:31,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 20:42:31,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 20:42:31,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 20:42:31,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 20:42:31,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-19 20:42:31,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-19 20:42:31,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-19 20:42:31,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 20:42:31,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 20:42:31,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 20:42:31,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 20:42:31,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-19 20:42:31,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-19 20:42:31,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-19 20:42:31,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 20:42:31,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 20:42:31,182 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_queue [2024-11-19 20:42:31,183 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_queue [2024-11-19 20:42:31,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 20:42:31,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 20:42:31,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 20:42:31,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-19 20:42:31,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-19 20:42:31,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-19 20:42:31,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-19 20:42:31,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 20:42:31,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 20:42:31,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 20:42:31,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 20:42:31,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-19 20:42:31,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-19 20:42:31,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-19 20:42:31,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-19 20:42:31,184 INFO L130 BoogieDeclarations]: Found specification of procedure send [2024-11-19 20:42:31,184 INFO L138 BoogieDeclarations]: Found implementation of procedure send [2024-11-19 20:42:31,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 20:42:31,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 20:42:31,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 20:42:31,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-19 20:42:31,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-19 20:42:31,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-11-19 20:42:31,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-11-19 20:42:31,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-11-19 20:42:31,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 20:42:31,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 20:42:31,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 20:42:31,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 20:42:31,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 20:42:31,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-19 20:42:31,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-19 20:42:31,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 20:42:31,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 20:42:31,316 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 20:42:31,318 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 20:42:31,557 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-11-19 20:42:31,557 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 20:42:31,567 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 20:42:31,567 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-19 20:42:31,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:42:31 BoogieIcfgContainer [2024-11-19 20:42:31,567 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 20:42:31,569 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 20:42:31,569 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 20:42:31,573 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 20:42:31,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:42:30" (1/3) ... [2024-11-19 20:42:31,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16964588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:42:31, skipping insertion in model container [2024-11-19 20:42:31,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:31" (2/3) ... [2024-11-19 20:42:31,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16964588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:42:31, skipping insertion in model container [2024-11-19 20:42:31,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:42:31" (3/3) ... [2024-11-19 20:42:31,577 INFO L112 eAbstractionObserver]: Analyzing ICFG packet_filter.i [2024-11-19 20:42:31,591 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 20:42:31,592 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 20:42:31,644 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 20:42:31,649 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;@956eaae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 20:42:31,650 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 20:42:31,653 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 39 states have internal predecessors, (52), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 20:42:31,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 20:42:31,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:42:31,659 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:42:31,659 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:42:31,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:42:31,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1092262807, now seen corresponding path program 1 times [2024-11-19 20:42:31,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:42:31,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547700976] [2024-11-19 20:42:31,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:42:31,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:42:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:31,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:42:31,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:42:31,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547700976] [2024-11-19 20:42:31,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547700976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:42:31,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:42:31,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 20:42:31,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843032899] [2024-11-19 20:42:31,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:42:31,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 20:42:31,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:42:31,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 20:42:31,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 20:42:31,832 INFO L87 Difference]: Start difference. First operand has 47 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 39 states have internal predecessors, (52), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:42:31,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:42:31,848 INFO L93 Difference]: Finished difference Result 76 states and 99 transitions. [2024-11-19 20:42:31,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 20:42:31,850 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-19 20:42:31,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:42:31,855 INFO L225 Difference]: With dead ends: 76 [2024-11-19 20:42:31,855 INFO L226 Difference]: Without dead ends: 42 [2024-11-19 20:42:31,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 20:42:31,860 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:42:31,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:42:31,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-19 20:42:31,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-19 20:42:31,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 20:42:31,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2024-11-19 20:42:31,927 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 8 [2024-11-19 20:42:31,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:42:31,928 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2024-11-19 20:42:31,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:42:31,928 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2024-11-19 20:42:31,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 20:42:31,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:42:31,933 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:42:31,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 20:42:31,933 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:42:31,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:42:31,938 INFO L85 PathProgramCache]: Analyzing trace with hash 353124844, now seen corresponding path program 1 times [2024-11-19 20:42:31,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:42:31,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429528159] [2024-11-19 20:42:31,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:42:31,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:42:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:32,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:42:32,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:42:32,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429528159] [2024-11-19 20:42:32,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429528159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:42:32,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:42:32,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 20:42:32,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252783172] [2024-11-19 20:42:32,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:42:32,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 20:42:32,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:42:32,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 20:42:32,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 20:42:32,141 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-19 20:42:32,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:42:32,227 INFO L93 Difference]: Finished difference Result 77 states and 99 transitions. [2024-11-19 20:42:32,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 20:42:32,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-19 20:42:32,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:42:32,229 INFO L225 Difference]: With dead ends: 77 [2024-11-19 20:42:32,229 INFO L226 Difference]: Without dead ends: 54 [2024-11-19 20:42:32,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 20:42:32,231 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 9 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 20:42:32,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 135 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 20:42:32,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-19 20:42:32,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2024-11-19 20:42:32,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.275) internal successors, (51), 41 states have internal predecessors, (51), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 20:42:32,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2024-11-19 20:42:32,247 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 9 [2024-11-19 20:42:32,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:42:32,247 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2024-11-19 20:42:32,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-19 20:42:32,247 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2024-11-19 20:42:32,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 20:42:32,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:42:32,248 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:42:32,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 20:42:32,248 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:42:32,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:42:32,250 INFO L85 PathProgramCache]: Analyzing trace with hash 380446450, now seen corresponding path program 1 times [2024-11-19 20:42:32,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:42:32,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973596598] [2024-11-19 20:42:32,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:42:32,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:42:32,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:32,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:42:32,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:42:32,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973596598] [2024-11-19 20:42:32,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973596598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:42:32,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:42:32,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 20:42:32,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953113826] [2024-11-19 20:42:32,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:42:32,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 20:42:32,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:42:32,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 20:42:32,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 20:42:32,406 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:42:32,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:42:32,465 INFO L93 Difference]: Finished difference Result 69 states and 87 transitions. [2024-11-19 20:42:32,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 20:42:32,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-19 20:42:32,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:42:32,466 INFO L225 Difference]: With dead ends: 69 [2024-11-19 20:42:32,466 INFO L226 Difference]: Without dead ends: 52 [2024-11-19 20:42:32,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 20:42:32,467 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 9 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:42:32,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 141 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:42:32,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-19 20:42:32,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2024-11-19 20:42:32,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.263157894736842) internal successors, (48), 39 states have internal predecessors, (48), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 20:42:32,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2024-11-19 20:42:32,476 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 12 [2024-11-19 20:42:32,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:42:32,476 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2024-11-19 20:42:32,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:42:32,476 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2024-11-19 20:42:32,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 20:42:32,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:42:32,477 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:42:32,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 20:42:32,477 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:42:32,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:42:32,478 INFO L85 PathProgramCache]: Analyzing trace with hash 707816306, now seen corresponding path program 1 times [2024-11-19 20:42:32,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:42:32,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902922387] [2024-11-19 20:42:32,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:42:32,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:42:32,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:32,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 20:42:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:32,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 20:42:32,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:42:32,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902922387] [2024-11-19 20:42:32,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902922387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:42:32,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:42:32,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 20:42:32,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206238323] [2024-11-19 20:42:32,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:42:32,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 20:42:32,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:42:32,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 20:42:32,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 20:42:32,655 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 20:42:32,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:42:32,742 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2024-11-19 20:42:32,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 20:42:32,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-11-19 20:42:32,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:42:32,744 INFO L225 Difference]: With dead ends: 50 [2024-11-19 20:42:32,744 INFO L226 Difference]: Without dead ends: 48 [2024-11-19 20:42:32,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 20:42:32,748 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 20:42:32,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 20:42:32,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-19 20:42:32,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-19 20:42:32,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 40 states have internal predecessors, (49), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 20:42:32,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2024-11-19 20:42:32,754 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 20 [2024-11-19 20:42:32,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:42:32,755 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2024-11-19 20:42:32,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 20:42:32,756 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2024-11-19 20:42:32,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 20:42:32,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:42:32,757 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:42:32,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 20:42:32,757 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:42:32,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:42:32,759 INFO L85 PathProgramCache]: Analyzing trace with hash 707818228, now seen corresponding path program 1 times [2024-11-19 20:42:32,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:42:32,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464056931] [2024-11-19 20:42:32,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:42:32,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:42:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:33,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 20:42:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:34,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:42:34,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:42:34,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464056931] [2024-11-19 20:42:34,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464056931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:42:34,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:42:34,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 20:42:34,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441364688] [2024-11-19 20:42:34,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:42:34,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 20:42:34,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:42:34,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 20:42:34,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-19 20:42:34,123 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 20:42:34,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:42:34,744 INFO L93 Difference]: Finished difference Result 93 states and 118 transitions. [2024-11-19 20:42:34,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 20:42:34,744 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-11-19 20:42:34,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:42:34,745 INFO L225 Difference]: With dead ends: 93 [2024-11-19 20:42:34,745 INFO L226 Difference]: Without dead ends: 69 [2024-11-19 20:42:34,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2024-11-19 20:42:34,746 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 16 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 20:42:34,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 288 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 20:42:34,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-19 20:42:34,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 56. [2024-11-19 20:42:34,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 48 states have internal predecessors, (60), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 20:42:34,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2024-11-19 20:42:34,752 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 20 [2024-11-19 20:42:34,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:42:34,752 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2024-11-19 20:42:34,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 20:42:34,753 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2024-11-19 20:42:34,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 20:42:34,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:42:34,753 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] [2024-11-19 20:42:34,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 20:42:34,754 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:42:34,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:42:34,754 INFO L85 PathProgramCache]: Analyzing trace with hash -626681606, now seen corresponding path program 1 times [2024-11-19 20:42:34,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:42:34,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049795443] [2024-11-19 20:42:34,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:42:34,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:42:34,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:34,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 20:42:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:35,102 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-19 20:42:35,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:42:35,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049795443] [2024-11-19 20:42:35,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049795443] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:42:35,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111053413] [2024-11-19 20:42:35,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:42:35,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:42:35,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:42:35,105 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:42:35,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 20:42:35,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:35,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-19 20:42:35,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:42:35,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 10 treesize of output 8 [2024-11-19 20:42:36,121 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) (or (and (or .cse0 (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_#memory_$Pointer$#2.offset|))) (and (not (= .cse1 |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1))))))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_#memory_$Pointer$#2.base|))) (and (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_#memory_$Pointer$#2.offset|))) (and (= .cse2 .cse3) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| .cse2 (select |c_#memory_$Pointer$#2.offset| .cse2)))))) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| .cse3 (select |c_#memory_$Pointer$#2.base| .cse3)) |c_#memory_$Pointer$#2.base|) (= 0 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#prio_queue~0#1.base| .cse3))))) (and .cse0 (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| .cse4 (select |c_#memory_$Pointer$#2.base| .cse4)) |c_#memory_$Pointer$#2.base|) (= 0 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#prio_queue~0#1.base| .cse4)))))))) is different from false [2024-11-19 20:42:36,128 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) (or (and (or .cse0 (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_#memory_$Pointer$#2.offset|))) (and (not (= .cse1 |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1))))))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_#memory_$Pointer$#2.base|))) (and (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_#memory_$Pointer$#2.offset|))) (and (= .cse2 .cse3) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| .cse2 (select |c_#memory_$Pointer$#2.offset| .cse2)))))) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| .cse3 (select |c_#memory_$Pointer$#2.base| .cse3)) |c_#memory_$Pointer$#2.base|) (= 0 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#prio_queue~0#1.base| .cse3))))) (and .cse0 (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| .cse4 (select |c_#memory_$Pointer$#2.base| .cse4)) |c_#memory_$Pointer$#2.base|) (= 0 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#prio_queue~0#1.base| .cse4)))))))) is different from true [2024-11-19 20:42:36,183 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-19 20:42:36,183 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:42:36,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111053413] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:42:36,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:42:36,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 9 [2024-11-19 20:42:36,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450597277] [2024-11-19 20:42:36,290 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:42:36,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 20:42:36,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:42:36,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 20:42:36,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=4, NotChecked=14, Total=90 [2024-11-19 20:42:36,292 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 20:42:36,513 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (.cse2 (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) (and .cse0 (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (or (and (or .cse0 (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_#memory_$Pointer$#2.offset|))) (and (not (= .cse1 |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1))))))) .cse2) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_#memory_$Pointer$#2.base|))) (and (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_#memory_$Pointer$#2.offset|))) (and (= .cse3 .cse4) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| .cse3 (select |c_#memory_$Pointer$#2.offset| .cse3)))))) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| .cse4 (select |c_#memory_$Pointer$#2.base| .cse4)) |c_#memory_$Pointer$#2.base|) (= 0 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#prio_queue~0#1.base| .cse4))))) (and .cse0 (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| .cse5 (select |c_#memory_$Pointer$#2.base| .cse5)) |c_#memory_$Pointer$#2.base|) (= 0 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#prio_queue~0#1.base| .cse5))))))) .cse2)) is different from false [2024-11-19 20:42:36,518 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (.cse2 (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) (and .cse0 (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (or (and (or .cse0 (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_#memory_$Pointer$#2.offset|))) (and (not (= .cse1 |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1))))))) .cse2) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_#memory_$Pointer$#2.base|))) (and (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_#memory_$Pointer$#2.offset|))) (and (= .cse3 .cse4) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| .cse3 (select |c_#memory_$Pointer$#2.offset| .cse3)))))) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| .cse4 (select |c_#memory_$Pointer$#2.base| .cse4)) |c_#memory_$Pointer$#2.base|) (= 0 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#prio_queue~0#1.base| .cse4))))) (and .cse0 (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| .cse5 (select |c_#memory_$Pointer$#2.base| .cse5)) |c_#memory_$Pointer$#2.base|) (= 0 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#prio_queue~0#1.base| .cse5))))))) .cse2)) is different from true [2024-11-19 20:42:36,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:42:36,571 INFO L93 Difference]: Finished difference Result 98 states and 129 transitions. [2024-11-19 20:42:36,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 20:42:36,571 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-11-19 20:42:36,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:42:36,573 INFO L225 Difference]: With dead ends: 98 [2024-11-19 20:42:36,574 INFO L226 Difference]: Without dead ends: 74 [2024-11-19 20:42:36,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=24, Invalid=50, Unknown=6, NotChecked=30, Total=110 [2024-11-19 20:42:36,575 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 14 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 20:42:36,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 270 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 114 Invalid, 0 Unknown, 93 Unchecked, 0.2s Time] [2024-11-19 20:42:36,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-19 20:42:36,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 67. [2024-11-19 20:42:36,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 58 states have internal predecessors, (74), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 20:42:36,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2024-11-19 20:42:36,583 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 21 [2024-11-19 20:42:36,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:42:36,583 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2024-11-19 20:42:36,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 20:42:36,583 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2024-11-19 20:42:36,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 20:42:36,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:42:36,584 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] [2024-11-19 20:42:36,599 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-19 20:42:36,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-19 20:42:36,785 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:42:36,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:42:36,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1015269178, now seen corresponding path program 1 times [2024-11-19 20:42:36,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:42:36,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510310552] [2024-11-19 20:42:36,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:42:36,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:42:36,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:37,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 20:42:37,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:37,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:42:37,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:42:37,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510310552] [2024-11-19 20:42:37,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510310552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:42:37,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:42:37,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 20:42:37,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899499811] [2024-11-19 20:42:37,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:42:37,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 20:42:37,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:42:37,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 20:42:37,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-19 20:42:37,553 INFO L87 Difference]: Start difference. First operand 67 states and 86 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 20:42:37,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:42:37,983 INFO L93 Difference]: Finished difference Result 88 states and 117 transitions. [2024-11-19 20:42:37,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 20:42:37,984 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-11-19 20:42:37,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:42:37,985 INFO L225 Difference]: With dead ends: 88 [2024-11-19 20:42:37,985 INFO L226 Difference]: Without dead ends: 86 [2024-11-19 20:42:37,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-19 20:42:37,986 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 13 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 20:42:37,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 362 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 20:42:37,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-19 20:42:37,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 75. [2024-11-19 20:42:37,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 65 states have (on average 1.323076923076923) internal successors, (86), 66 states have internal predecessors, (86), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 20:42:37,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 98 transitions. [2024-11-19 20:42:37,993 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 98 transitions. Word has length 21 [2024-11-19 20:42:37,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:42:37,993 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 98 transitions. [2024-11-19 20:42:37,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 20:42:37,993 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 98 transitions. [2024-11-19 20:42:37,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 20:42:37,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:42:37,994 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] [2024-11-19 20:42:37,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 20:42:37,994 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:42:37,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:42:37,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1374242732, now seen corresponding path program 1 times [2024-11-19 20:42:37,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:42:37,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547277153] [2024-11-19 20:42:37,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:42:37,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:42:38,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:38,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 20:42:38,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:38,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:42:38,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:42:38,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547277153] [2024-11-19 20:42:38,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547277153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:42:38,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:42:38,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 20:42:38,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154008717] [2024-11-19 20:42:38,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:42:38,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 20:42:38,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:42:38,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 20:42:38,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 20:42:38,196 INFO L87 Difference]: Start difference. First operand 75 states and 98 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 20:42:38,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:42:38,414 INFO L93 Difference]: Finished difference Result 100 states and 130 transitions. [2024-11-19 20:42:38,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 20:42:38,414 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-11-19 20:42:38,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:42:38,415 INFO L225 Difference]: With dead ends: 100 [2024-11-19 20:42:38,415 INFO L226 Difference]: Without dead ends: 86 [2024-11-19 20:42:38,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 20:42:38,416 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 15 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 20:42:38,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 229 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 20:42:38,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-19 20:42:38,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 75. [2024-11-19 20:42:38,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 66 states have internal predecessors, (84), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 20:42:38,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 96 transitions. [2024-11-19 20:42:38,424 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 96 transitions. Word has length 23 [2024-11-19 20:42:38,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:42:38,424 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 96 transitions. [2024-11-19 20:42:38,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 20:42:38,425 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 96 transitions. [2024-11-19 20:42:38,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 20:42:38,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:42:38,427 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-19 20:42:38,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 20:42:38,427 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:42:38,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:42:38,427 INFO L85 PathProgramCache]: Analyzing trace with hash -493020186, now seen corresponding path program 1 times [2024-11-19 20:42:38,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:42:38,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954117460] [2024-11-19 20:42:38,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:42:38,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:42:38,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:38,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 20:42:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:39,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:42:39,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:42:39,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954117460] [2024-11-19 20:42:39,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954117460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:42:39,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:42:39,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 20:42:39,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974529146] [2024-11-19 20:42:39,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:42:39,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 20:42:39,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:42:39,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 20:42:39,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 20:42:39,018 INFO L87 Difference]: Start difference. First operand 75 states and 96 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 20:42:39,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:42:39,397 INFO L93 Difference]: Finished difference Result 104 states and 135 transitions. [2024-11-19 20:42:39,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 20:42:39,398 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-11-19 20:42:39,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:42:39,399 INFO L225 Difference]: With dead ends: 104 [2024-11-19 20:42:39,399 INFO L226 Difference]: Without dead ends: 102 [2024-11-19 20:42:39,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-19 20:42:39,400 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 25 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 20:42:39,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 488 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 20:42:39,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-19 20:42:39,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 88. [2024-11-19 20:42:39,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 77 states have (on average 1.2987012987012987) internal successors, (100), 78 states have internal predecessors, (100), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-19 20:42:39,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 114 transitions. [2024-11-19 20:42:39,410 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 114 transitions. Word has length 24 [2024-11-19 20:42:39,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:42:39,410 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 114 transitions. [2024-11-19 20:42:39,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 20:42:39,411 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 114 transitions. [2024-11-19 20:42:39,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 20:42:39,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:42:39,411 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-19 20:42:39,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 20:42:39,412 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:42:39,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:42:39,412 INFO L85 PathProgramCache]: Analyzing trace with hash -493018264, now seen corresponding path program 1 times [2024-11-19 20:42:39,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:42:39,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155655888] [2024-11-19 20:42:39,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:42:39,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:42:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:40,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 20:42:40,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:40,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:42:40,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:42:40,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155655888] [2024-11-19 20:42:40,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155655888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:42:40,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:42:40,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 20:42:40,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344298100] [2024-11-19 20:42:40,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:42:40,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 20:42:40,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:42:40,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 20:42:40,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-19 20:42:40,169 INFO L87 Difference]: Start difference. First operand 88 states and 114 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 20:42:41,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:42:41,038 INFO L93 Difference]: Finished difference Result 116 states and 148 transitions. [2024-11-19 20:42:41,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 20:42:41,039 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-11-19 20:42:41,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:42:41,039 INFO L225 Difference]: With dead ends: 116 [2024-11-19 20:42:41,040 INFO L226 Difference]: Without dead ends: 104 [2024-11-19 20:42:41,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2024-11-19 20:42:41,040 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 24 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 20:42:41,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 561 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 20:42:41,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-19 20:42:41,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 88. [2024-11-19 20:42:41,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 77 states have (on average 1.2857142857142858) internal successors, (99), 78 states have internal predecessors, (99), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-19 20:42:41,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 113 transitions. [2024-11-19 20:42:41,052 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 113 transitions. Word has length 24 [2024-11-19 20:42:41,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:42:41,052 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 113 transitions. [2024-11-19 20:42:41,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 20:42:41,052 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 113 transitions. [2024-11-19 20:42:41,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 20:42:41,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:42:41,053 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:42:41,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 20:42:41,054 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:42:41,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:42:41,054 INFO L85 PathProgramCache]: Analyzing trace with hash -854763749, now seen corresponding path program 1 times [2024-11-19 20:42:41,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:42:41,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83255428] [2024-11-19 20:42:41,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:42:41,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:42:41,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:41,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 20:42:41,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:41,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 20:42:41,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:41,713 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:42:41,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:42:41,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83255428] [2024-11-19 20:42:41,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83255428] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:42:41,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021581285] [2024-11-19 20:42:41,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:42:41,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:42:41,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:42:41,717 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:42:41,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 20:42:41,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:41,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-19 20:42:41,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:42:41,931 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 30 treesize of output 31 [2024-11-19 20:42:41,936 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 15 treesize of output 11 [2024-11-19 20:42:41,942 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 34 treesize of output 15 [2024-11-19 20:42:41,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-19 20:42:41,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-19 20:42:42,037 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 30 treesize of output 18 [2024-11-19 20:42:42,128 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:42:42,129 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:42:42,372 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:42:42,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021581285] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:42:42,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:42:42,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 16 [2024-11-19 20:42:42,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044881480] [2024-11-19 20:42:42,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:42:42,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 20:42:42,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:42:42,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 20:42:42,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-11-19 20:42:42,376 INFO L87 Difference]: Start difference. First operand 88 states and 113 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-19 20:42:43,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:42:43,476 INFO L93 Difference]: Finished difference Result 159 states and 203 transitions. [2024-11-19 20:42:43,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 20:42:43,477 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 30 [2024-11-19 20:42:43,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:42:43,477 INFO L225 Difference]: With dead ends: 159 [2024-11-19 20:42:43,478 INFO L226 Difference]: Without dead ends: 135 [2024-11-19 20:42:43,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2024-11-19 20:42:43,478 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 38 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 20:42:43,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 506 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 20:42:43,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-19 20:42:43,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 126. [2024-11-19 20:42:43,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 110 states have (on average 1.2636363636363637) internal successors, (139), 111 states have internal predecessors, (139), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 20:42:43,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 161 transitions. [2024-11-19 20:42:43,487 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 161 transitions. Word has length 30 [2024-11-19 20:42:43,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:42:43,488 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 161 transitions. [2024-11-19 20:42:43,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-19 20:42:43,488 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 161 transitions. [2024-11-19 20:42:43,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 20:42:43,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:42:43,491 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:42:43,501 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-19 20:42:43,691 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,SelfDestructingSolverStorable10 [2024-11-19 20:42:43,692 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:42:43,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:42:43,692 INFO L85 PathProgramCache]: Analyzing trace with hash 778676608, now seen corresponding path program 1 times [2024-11-19 20:42:43,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:42:43,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684631043] [2024-11-19 20:42:43,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:42:43,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:42:43,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:45,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 20:42:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:45,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 20:42:45,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:45,998 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 20:42:45,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:42:45,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684631043] [2024-11-19 20:42:45,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684631043] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:42:45,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630133200] [2024-11-19 20:42:45,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:42:45,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:42:45,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:42:46,001 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:42:46,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 20:42:46,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:46,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 98 conjuncts are in the unsatisfiable core [2024-11-19 20:42:46,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:42:46,224 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 10 treesize of output 8 [2024-11-19 20:42:46,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 46 [2024-11-19 20:42:46,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 77 [2024-11-19 20:42:46,251 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 46 treesize of output 36 [2024-11-19 20:42:46,274 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 20:42:46,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 28 [2024-11-19 20:42:46,334 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 40 treesize of output 16 [2024-11-19 20:42:46,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 20:42:46,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 31 [2024-11-19 20:42:46,388 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-11-19 20:42:46,388 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 2 case distinctions, treesize of input 33 treesize of output 21 [2024-11-19 20:42:46,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 20:42:46,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:42:46,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 20:42:46,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:42:46,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 20:42:46,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:42:46,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:42:46,511 INFO L349 Elim1Store]: treesize reduction 49, result has 2.0 percent of original size [2024-11-19 20:42:46,512 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 2 case distinctions, treesize of input 28 treesize of output 1 [2024-11-19 20:42:46,702 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 29 treesize of output 22 [2024-11-19 20:42:46,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:42:46,708 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 20 treesize of output 15 [2024-11-19 20:42:46,723 INFO L349 Elim1Store]: treesize reduction 13, result has 60.6 percent of original size [2024-11-19 20:42:46,723 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 33 treesize of output 42 [2024-11-19 20:42:46,736 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-19 20:42:46,758 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 19 treesize of output 11 [2024-11-19 20:42:46,798 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:42:46,798 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:42:47,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630133200] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:42:47,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:42:47,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 26 [2024-11-19 20:42:47,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743483912] [2024-11-19 20:42:47,008 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:42:47,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 20:42:47,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:42:47,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 20:42:47,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2024-11-19 20:42:47,009 INFO L87 Difference]: Start difference. First operand 126 states and 161 transitions. Second operand has 26 states, 24 states have (on average 1.75) internal successors, (42), 24 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 20:42:48,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:42:48,596 INFO L93 Difference]: Finished difference Result 197 states and 253 transitions. [2024-11-19 20:42:48,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-19 20:42:48,597 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 1.75) internal successors, (42), 24 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2024-11-19 20:42:48,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:42:48,598 INFO L225 Difference]: With dead ends: 197 [2024-11-19 20:42:48,598 INFO L226 Difference]: Without dead ends: 170 [2024-11-19 20:42:48,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=287, Invalid=1783, Unknown=0, NotChecked=0, Total=2070 [2024-11-19 20:42:48,599 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 86 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 20:42:48,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 401 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 20:42:48,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-19 20:42:48,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 138. [2024-11-19 20:42:48,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 121 states have (on average 1.28099173553719) internal successors, (155), 122 states have internal predecessors, (155), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 20:42:48,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 179 transitions. [2024-11-19 20:42:48,610 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 179 transitions. Word has length 32 [2024-11-19 20:42:48,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:42:48,610 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 179 transitions. [2024-11-19 20:42:48,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 1.75) internal successors, (42), 24 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 20:42:48,610 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 179 transitions. [2024-11-19 20:42:48,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 20:42:48,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:42:48,611 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:42:48,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 20:42:48,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:42:48,816 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:42:48,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:42:48,816 INFO L85 PathProgramCache]: Analyzing trace with hash -649880027, now seen corresponding path program 1 times [2024-11-19 20:42:48,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:42:48,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733053380] [2024-11-19 20:42:48,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:42:48,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:42:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:49,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 20:42:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:49,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 20:42:49,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:49,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 20:42:49,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:42:49,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733053380] [2024-11-19 20:42:49,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733053380] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:42:49,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337012230] [2024-11-19 20:42:49,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:42:49,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:42:49,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:42:49,174 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:42:49,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 20:42:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:49,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-19 20:42:49,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:42:49,398 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 10 treesize of output 8 [2024-11-19 20:42:49,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 20:42:49,556 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:42:49,627 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1850 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base| v_ArrVal_1850) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (forall ((v_ArrVal_1849 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base| v_ArrVal_1849) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) is different from false [2024-11-19 20:42:49,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337012230] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:42:49,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:42:49,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2024-11-19 20:42:49,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405268983] [2024-11-19 20:42:49,629 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:42:49,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 20:42:49,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:42:49,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 20:42:49,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=68, Unknown=1, NotChecked=16, Total=110 [2024-11-19 20:42:49,629 INFO L87 Difference]: Start difference. First operand 138 states and 179 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 20:42:49,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:42:49,986 INFO L93 Difference]: Finished difference Result 197 states and 253 transitions. [2024-11-19 20:42:49,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 20:42:49,987 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2024-11-19 20:42:49,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:42:49,988 INFO L225 Difference]: With dead ends: 197 [2024-11-19 20:42:49,988 INFO L226 Difference]: Without dead ends: 154 [2024-11-19 20:42:49,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=136, Unknown=1, NotChecked=24, Total=210 [2024-11-19 20:42:49,988 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 37 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 20:42:49,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 228 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 20:42:49,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-19 20:42:50,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 149. [2024-11-19 20:42:50,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 131 states have (on average 1.3053435114503817) internal successors, (171), 132 states have internal predecessors, (171), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 20:42:50,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 197 transitions. [2024-11-19 20:42:50,003 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 197 transitions. Word has length 33 [2024-11-19 20:42:50,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:42:50,003 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 197 transitions. [2024-11-19 20:42:50,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 20:42:50,004 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 197 transitions. [2024-11-19 20:42:50,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 20:42:50,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:42:50,005 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:42:50,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 20:42:50,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:42:50,206 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:42:50,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:42:50,206 INFO L85 PathProgramCache]: Analyzing trace with hash -513280378, now seen corresponding path program 2 times [2024-11-19 20:42:50,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:42:50,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136918559] [2024-11-19 20:42:50,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:42:50,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:42:50,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:50,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 20:42:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:50,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 20:42:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:50,718 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-19 20:42:50,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:42:50,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136918559] [2024-11-19 20:42:50,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136918559] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:42:50,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485292413] [2024-11-19 20:42:50,719 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 20:42:50,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:42:50,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:42:50,721 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:42:50,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 20:42:50,972 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 20:42:50,972 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 20:42:50,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-19 20:42:50,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:42:50,987 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 10 treesize of output 8 [2024-11-19 20:42:51,101 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (or (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_11| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_11| |c_#memory_$Pointer$#2.base|))) (and (= |c_#memory_$Pointer$#2.base| (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_11| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0))) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| .cse0))))) (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_11| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_11| |c_#memory_$Pointer$#2.offset|))) (and (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_11| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1))) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= .cse1 |c_ULTIMATE.start_main_~#normal_queue~0#1.base|)))))) is different from false [2024-11-19 20:42:51,105 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (or (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_11| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_11| |c_#memory_$Pointer$#2.base|))) (and (= |c_#memory_$Pointer$#2.base| (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_11| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0))) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| .cse0))))) (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_11| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_11| |c_#memory_$Pointer$#2.offset|))) (and (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_11| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1))) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= .cse1 |c_ULTIMATE.start_main_~#normal_queue~0#1.base|)))))) is different from true [2024-11-19 20:42:51,211 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 1 not checked. [2024-11-19 20:42:51,212 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:42:51,257 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2234 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_2234) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (forall ((v_ArrVal_2235 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_2235) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) is different from false [2024-11-19 20:42:51,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485292413] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:42:51,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:42:51,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 9 [2024-11-19 20:42:51,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478799578] [2024-11-19 20:42:51,259 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:42:51,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 20:42:51,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:42:51,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 20:42:51,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=40, Unknown=3, NotChecked=26, Total=90 [2024-11-19 20:42:51,260 INFO L87 Difference]: Start difference. First operand 149 states and 197 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 20:42:51,359 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) (and .cse0 (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (or .cse1 (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_11| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_11| |c_#memory_$Pointer$#2.base|))) (and (= |c_#memory_$Pointer$#2.base| (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_11| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2))) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| .cse2))))) .cse1 (or .cse0 (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_11| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_11| |c_#memory_$Pointer$#2.offset|))) (and (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_11| .cse3 (select |c_#memory_$Pointer$#2.offset| .cse3))) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= .cse3 |c_ULTIMATE.start_main_~#normal_queue~0#1.base|))))))) is different from false [2024-11-19 20:42:51,362 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) (and .cse0 (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (or .cse1 (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_11| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_11| |c_#memory_$Pointer$#2.base|))) (and (= |c_#memory_$Pointer$#2.base| (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_11| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2))) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| .cse2))))) .cse1 (or .cse0 (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_11| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_11| |c_#memory_$Pointer$#2.offset|))) (and (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_11| .cse3 (select |c_#memory_$Pointer$#2.offset| .cse3))) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= .cse3 |c_ULTIMATE.start_main_~#normal_queue~0#1.base|))))))) is different from true [2024-11-19 20:42:51,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:42:51,445 INFO L93 Difference]: Finished difference Result 189 states and 249 transitions. [2024-11-19 20:42:51,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 20:42:51,445 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2024-11-19 20:42:51,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:42:51,447 INFO L225 Difference]: With dead ends: 189 [2024-11-19 20:42:51,447 INFO L226 Difference]: Without dead ends: 162 [2024-11-19 20:42:51,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=40, Unknown=5, NotChecked=42, Total=110 [2024-11-19 20:42:51,447 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 20:42:51,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 233 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 82 Invalid, 0 Unknown, 76 Unchecked, 0.2s Time] [2024-11-19 20:42:51,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-19 20:42:51,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 151. [2024-11-19 20:42:51,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 133 states have (on average 1.3157894736842106) internal successors, (175), 134 states have internal predecessors, (175), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 20:42:51,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 201 transitions. [2024-11-19 20:42:51,462 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 201 transitions. Word has length 33 [2024-11-19 20:42:51,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:42:51,462 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 201 transitions. [2024-11-19 20:42:51,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 20:42:51,462 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 201 transitions. [2024-11-19 20:42:51,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 20:42:51,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:42:51,463 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:42:51,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 20:42:51,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-19 20:42:51,664 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:42:51,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:42:51,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1842166586, now seen corresponding path program 1 times [2024-11-19 20:42:51,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:42:51,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489267642] [2024-11-19 20:42:51,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:42:51,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:42:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:52,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 20:42:52,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:52,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 20:42:52,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:53,131 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 20:42:53,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:42:53,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489267642] [2024-11-19 20:42:53,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489267642] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:42:53,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399544290] [2024-11-19 20:42:53,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:42:53,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:42:53,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:42:53,134 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:42:53,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 20:42:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:53,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-11-19 20:42:53,543 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:42:53,551 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 10 treesize of output 8 [2024-11-19 20:42:53,594 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 17 treesize of output 9 [2024-11-19 20:42:53,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 20:42:53,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 15 [2024-11-19 20:42:53,652 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-11-19 20:42:53,653 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 2 case distinctions, treesize of input 33 treesize of output 21 [2024-11-19 20:42:53,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 20:42:53,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:42:53,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 20:42:53,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:42:53,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 20:42:53,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:42:53,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:42:53,838 INFO L349 Elim1Store]: treesize reduction 49, result has 2.0 percent of original size [2024-11-19 20:42:53,838 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 2 case distinctions, treesize of input 28 treesize of output 1 [2024-11-19 20:42:54,003 INFO L349 Elim1Store]: treesize reduction 13, result has 60.6 percent of original size [2024-11-19 20:42:54,004 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 33 treesize of output 42 [2024-11-19 20:42:54,011 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 38 treesize of output 29 [2024-11-19 20:42:54,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-11-19 20:42:54,025 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-19 20:42:54,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-19 20:42:54,095 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:42:54,095 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:42:54,216 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2644 (Array Int Int)) (v_ArrVal_2643 (Array Int Int)) (|v_append_to_queue_~#p.base_76| Int) (v_ArrVal_2646 Int) (v_append_to_queue_~node~0.base_55 Int)) (or (not (= 0 (select |c_#valid| |v_append_to_queue_~#p.base_76|))) (< (mod (select (select (store |c_#memory_int#5| v_append_to_queue_~node~0.base_55 v_ArrVal_2643) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_2644) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_2645) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) 4294967296) 500) (not (= (select (store |c_#valid| |v_append_to_queue_~#p.base_76| v_ArrVal_2646) v_append_to_queue_~node~0.base_55) 0)))) is different from false [2024-11-19 20:42:54,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399544290] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:42:54,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:42:54,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 26 [2024-11-19 20:42:54,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23349343] [2024-11-19 20:42:54,217 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:42:54,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 20:42:54,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:42:54,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 20:42:54,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=660, Unknown=1, NotChecked=52, Total=812 [2024-11-19 20:42:54,218 INFO L87 Difference]: Start difference. First operand 151 states and 201 transitions. Second operand has 26 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 20:42:55,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:42:55,382 INFO L93 Difference]: Finished difference Result 190 states and 259 transitions. [2024-11-19 20:42:55,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-19 20:42:55,383 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 33 [2024-11-19 20:42:55,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:42:55,384 INFO L225 Difference]: With dead ends: 190 [2024-11-19 20:42:55,384 INFO L226 Difference]: Without dead ends: 188 [2024-11-19 20:42:55,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=298, Invalid=1775, Unknown=1, NotChecked=88, Total=2162 [2024-11-19 20:42:55,385 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 92 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 20:42:55,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 457 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 20:42:55,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-19 20:42:55,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 163. [2024-11-19 20:42:55,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 144 states have (on average 1.3333333333333333) internal successors, (192), 145 states have internal predecessors, (192), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 20:42:55,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 220 transitions. [2024-11-19 20:42:55,396 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 220 transitions. Word has length 33 [2024-11-19 20:42:55,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:42:55,397 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 220 transitions. [2024-11-19 20:42:55,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 20:42:55,397 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 220 transitions. [2024-11-19 20:42:55,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 20:42:55,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:42:55,398 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:42:55,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 20:42:55,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-19 20:42:55,602 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:42:55,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:42:55,602 INFO L85 PathProgramCache]: Analyzing trace with hash 764333101, now seen corresponding path program 1 times [2024-11-19 20:42:55,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:42:55,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688950646] [2024-11-19 20:42:55,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:42:55,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:42:55,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:56,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 20:42:56,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:56,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 20:42:56,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:56,168 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:42:56,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:42:56,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688950646] [2024-11-19 20:42:56,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688950646] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:42:56,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991503501] [2024-11-19 20:42:56,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:42:56,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:42:56,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:42:56,171 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:42:56,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 20:42:56,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:56,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-19 20:42:56,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:42:56,448 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 30 treesize of output 31 [2024-11-19 20:42:56,452 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 34 treesize of output 15 [2024-11-19 20:42:56,455 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 15 treesize of output 11 [2024-11-19 20:42:56,464 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_append_to_queue_~q.offset_49 Int)) (let ((.cse0 (select |c_old(#memory_$Pointer$#2.offset)| |c_append_to_queue_#in~q.base|)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_append_to_queue_#in~q.base|) v_append_to_queue_~q.offset_49)) (.cse2 (select |c_old(#memory_$Pointer$#2.base)| |c_append_to_queue_#in~q.base|))) (and (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |c_append_to_queue_#in~q.base| (store .cse0 v_append_to_queue_~q.offset_49 0))) (= (select (select |c_#memory_$Pointer$#5.offset| .cse1) 12) (select .cse0 v_append_to_queue_~q.offset_49)) (= (store |c_old(#memory_$Pointer$#2.base)| |c_append_to_queue_#in~q.base| (store .cse2 v_append_to_queue_~q.offset_49 .cse1)) |c_#memory_$Pointer$#2.base|) (= (select (select |c_#memory_$Pointer$#5.base| .cse1) 12) (select .cse2 v_append_to_queue_~q.offset_49))))) is different from true [2024-11-19 20:42:56,497 INFO L349 Elim1Store]: treesize reduction 16, result has 50.0 percent of original size [2024-11-19 20:42:56,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 37 [2024-11-19 20:42:56,515 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2024-11-19 20:42:56,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 34 [2024-11-19 20:42:56,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:42:56,868 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 106 treesize of output 102 [2024-11-19 20:42:56,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:42:56,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 82 treesize of output 114 [2024-11-19 20:42:57,297 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:42:57,298 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:42:57,491 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 225 treesize of output 205 [2024-11-19 20:42:57,499 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 152 treesize of output 148 [2024-11-19 20:42:57,506 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 292 treesize of output 272 [2024-11-19 20:42:57,738 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 20:42:57,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 60 [2024-11-19 20:42:57,745 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 30 treesize of output 26 [2024-11-19 20:42:57,765 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 418 treesize of output 378 [2024-11-19 20:42:57,834 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 20:42:57,835 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 76 treesize of output 56 [2024-11-19 20:42:57,850 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 426 treesize of output 386 [2024-11-19 20:42:57,860 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 104 [2024-11-19 20:42:58,020 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:42:58,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991503501] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:42:58,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:42:58,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 19 [2024-11-19 20:42:58,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55277703] [2024-11-19 20:42:58,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:42:58,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-19 20:42:58,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:42:58,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-19 20:42:58,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=257, Unknown=1, NotChecked=32, Total=342 [2024-11-19 20:42:58,022 INFO L87 Difference]: Start difference. First operand 163 states and 220 transitions. Second operand has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 15 states have internal predecessors, (60), 3 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-19 20:42:58,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:42:58,806 INFO L93 Difference]: Finished difference Result 210 states and 284 transitions. [2024-11-19 20:42:58,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 20:42:58,806 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 15 states have internal predecessors, (60), 3 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 34 [2024-11-19 20:42:58,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:42:58,807 INFO L225 Difference]: With dead ends: 210 [2024-11-19 20:42:58,807 INFO L226 Difference]: Without dead ends: 183 [2024-11-19 20:42:58,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=96, Invalid=507, Unknown=1, NotChecked=46, Total=650 [2024-11-19 20:42:58,808 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 40 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 20:42:58,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 483 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 257 Invalid, 0 Unknown, 116 Unchecked, 0.5s Time] [2024-11-19 20:42:58,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-19 20:42:58,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 170. [2024-11-19 20:42:58,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 150 states have (on average 1.3266666666666667) internal successors, (199), 151 states have internal predecessors, (199), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 20:42:58,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 229 transitions. [2024-11-19 20:42:58,820 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 229 transitions. Word has length 34 [2024-11-19 20:42:58,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:42:58,821 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 229 transitions. [2024-11-19 20:42:58,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 15 states have internal predecessors, (60), 3 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-19 20:42:58,821 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 229 transitions. [2024-11-19 20:42:58,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-19 20:42:58,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:42:58,823 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:42:58,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-19 20:42:59,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:42:59,024 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:42:59,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:42:59,024 INFO L85 PathProgramCache]: Analyzing trace with hash -347308715, now seen corresponding path program 2 times [2024-11-19 20:42:59,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:42:59,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422012321] [2024-11-19 20:42:59,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:42:59,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:42:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:43:00,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 20:43:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:43:00,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 20:43:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:43:01,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-19 20:43:01,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:43:01,048 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 20:43:01,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:43:01,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422012321] [2024-11-19 20:43:01,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422012321] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:43:01,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852758008] [2024-11-19 20:43:01,048 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 20:43:01,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:43:01,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:43:01,050 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:43:01,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 20:43:01,331 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 20:43:01,331 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 20:43:01,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-11-19 20:43:01,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:43:01,349 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 1 [2024-11-19 20:43:01,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 20:43:01,545 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2024-11-19 20:43:01,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:43:01,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 37 [2024-11-19 20:43:01,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 20:43:01,705 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-11-19 20:43:01,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 69 [2024-11-19 20:43:01,715 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:43:01,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 59 [2024-11-19 20:43:01,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 69 [2024-11-19 20:43:01,895 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-19 20:43:01,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 19 [2024-11-19 20:43:01,941 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 30 treesize of output 31 [2024-11-19 20:43:01,948 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 15 treesize of output 11 [2024-11-19 20:43:01,956 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 34 treesize of output 15 [2024-11-19 20:43:02,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-19 20:43:02,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 19 [2024-11-19 20:43:02,041 INFO L349 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2024-11-19 20:43:02,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 30 [2024-11-19 20:43:02,097 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 45 treesize of output 29 [2024-11-19 20:43:02,251 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 19 treesize of output 11 [2024-11-19 20:43:02,253 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 7 treesize of output 3 [2024-11-19 20:43:02,295 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:43:02,295 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:43:02,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852758008] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:43:02,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:43:02,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 35 [2024-11-19 20:43:02,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644872621] [2024-11-19 20:43:02,747 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:43:02,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-19 20:43:02,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:43:02,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-19 20:43:02,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1357, Unknown=0, NotChecked=0, Total=1482 [2024-11-19 20:43:02,748 INFO L87 Difference]: Start difference. First operand 170 states and 229 transitions. Second operand has 35 states, 32 states have (on average 2.0) internal successors, (64), 31 states have internal predecessors, (64), 5 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 20:43:07,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:43:07,797 INFO L93 Difference]: Finished difference Result 476 states and 610 transitions. [2024-11-19 20:43:07,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-11-19 20:43:07,797 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 2.0) internal successors, (64), 31 states have internal predecessors, (64), 5 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 41 [2024-11-19 20:43:07,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:43:07,799 INFO L225 Difference]: With dead ends: 476 [2024-11-19 20:43:07,799 INFO L226 Difference]: Without dead ends: 441 [2024-11-19 20:43:07,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1640 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=526, Invalid=5480, Unknown=0, NotChecked=0, Total=6006 [2024-11-19 20:43:07,802 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 188 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 1329 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 1384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-19 20:43:07,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 1096 Invalid, 1384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1329 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-19 20:43:07,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-11-19 20:43:07,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 264. [2024-11-19 20:43:07,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 231 states have (on average 1.29004329004329) internal successors, (298), 232 states have internal predecessors, (298), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-19 20:43:07,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 346 transitions. [2024-11-19 20:43:07,831 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 346 transitions. Word has length 41 [2024-11-19 20:43:07,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:43:07,832 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 346 transitions. [2024-11-19 20:43:07,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 2.0) internal successors, (64), 31 states have internal predecessors, (64), 5 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 20:43:07,835 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 346 transitions. [2024-11-19 20:43:07,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-19 20:43:07,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:43:07,836 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:43:07,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-19 20:43:08,036 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,SelfDestructingSolverStorable16 [2024-11-19 20:43:08,037 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:43:08,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:43:08,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1221381799, now seen corresponding path program 1 times [2024-11-19 20:43:08,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:43:08,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194573261] [2024-11-19 20:43:08,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:43:08,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:43:08,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:43:08,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 20:43:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:43:09,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 20:43:09,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:43:09,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 20:43:09,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:43:09,608 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 20:43:09,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:43:09,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194573261] [2024-11-19 20:43:09,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194573261] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:43:09,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045961892] [2024-11-19 20:43:09,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:43:09,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:43:09,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:43:09,609 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:43:09,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-19 20:43:09,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:43:09,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 108 conjuncts are in the unsatisfiable core [2024-11-19 20:43:09,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:43:09,908 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 10 treesize of output 8 [2024-11-19 20:43:09,952 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 34 treesize of output 15 [2024-11-19 20:43:09,957 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 30 treesize of output 31 [2024-11-19 20:43:09,960 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 15 treesize of output 11 [2024-11-19 20:43:09,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-19 20:43:10,004 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 3 [2024-11-19 20:43:10,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 46 [2024-11-19 20:43:10,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 77 [2024-11-19 20:43:10,081 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 46 treesize of output 36 [2024-11-19 20:43:10,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 11 [2024-11-19 20:43:10,546 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 24 [2024-11-19 20:43:10,559 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-19 20:43:10,559 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 20 treesize of output 23 [2024-11-19 20:43:10,572 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-19 20:43:10,572 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 20 treesize of output 23 [2024-11-19 20:43:10,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 20:43:10,681 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 50 treesize of output 34 [2024-11-19 20:43:10,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:43:10,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 48 [2024-11-19 20:43:10,918 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:43:10,918 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:43:11,320 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 3410 treesize of output 3330 [2024-11-19 20:43:11,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045961892] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:43:11,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:43:11,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19] total 28 [2024-11-19 20:43:11,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948940891] [2024-11-19 20:43:11,745 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:43:11,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-19 20:43:11,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:43:11,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-19 20:43:11,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=852, Unknown=26, NotChecked=0, Total=992 [2024-11-19 20:43:11,746 INFO L87 Difference]: Start difference. First operand 264 states and 346 transitions. Second operand has 28 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 24 states have internal predecessors, (65), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 20:43:15,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:43:15,101 INFO L93 Difference]: Finished difference Result 614 states and 816 transitions. [2024-11-19 20:43:15,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-19 20:43:15,101 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 24 states have internal predecessors, (65), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 42 [2024-11-19 20:43:15,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:43:15,104 INFO L225 Difference]: With dead ends: 614 [2024-11-19 20:43:15,104 INFO L226 Difference]: Without dead ends: 557 [2024-11-19 20:43:15,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=282, Invalid=2227, Unknown=41, NotChecked=0, Total=2550 [2024-11-19 20:43:15,106 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 119 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 1188 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-19 20:43:15,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 839 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1188 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-19 20:43:15,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-11-19 20:43:15,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 419. [2024-11-19 20:43:15,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 370 states have (on average 1.2972972972972974) internal successors, (480), 371 states have internal predecessors, (480), 38 states have call successors, (38), 9 states have call predecessors, (38), 9 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-19 20:43:15,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 556 transitions. [2024-11-19 20:43:15,143 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 556 transitions. Word has length 42 [2024-11-19 20:43:15,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:43:15,144 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 556 transitions. [2024-11-19 20:43:15,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 24 states have internal predecessors, (65), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 20:43:15,144 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 556 transitions. [2024-11-19 20:43:15,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-19 20:43:15,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:43:15,145 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:43:15,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-19 20:43:15,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-19 20:43:15,345 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:43:15,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:43:15,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1099551513, now seen corresponding path program 1 times [2024-11-19 20:43:15,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:43:15,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448520730] [2024-11-19 20:43:15,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:43:15,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:43:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:43:16,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 20:43:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:43:16,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 20:43:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:43:16,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 20:43:16,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:43:16,218 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 20:43:16,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:43:16,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448520730] [2024-11-19 20:43:16,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448520730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:43:16,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:43:16,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-19 20:43:16,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273438094] [2024-11-19 20:43:16,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:43:16,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 20:43:16,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:43:16,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 20:43:16,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-19 20:43:16,223 INFO L87 Difference]: Start difference. First operand 419 states and 556 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 20:43:17,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:43:17,167 INFO L93 Difference]: Finished difference Result 522 states and 680 transitions. [2024-11-19 20:43:17,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 20:43:17,167 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 42 [2024-11-19 20:43:17,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:43:17,169 INFO L225 Difference]: With dead ends: 522 [2024-11-19 20:43:17,169 INFO L226 Difference]: Without dead ends: 461 [2024-11-19 20:43:17,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2024-11-19 20:43:17,170 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 14 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 20:43:17,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 406 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 20:43:17,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2024-11-19 20:43:17,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 419. [2024-11-19 20:43:17,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 370 states have (on average 1.2864864864864864) internal successors, (476), 371 states have internal predecessors, (476), 38 states have call successors, (38), 9 states have call predecessors, (38), 9 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-19 20:43:17,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 552 transitions. [2024-11-19 20:43:17,210 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 552 transitions. Word has length 42 [2024-11-19 20:43:17,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:43:17,210 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 552 transitions. [2024-11-19 20:43:17,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 20:43:17,210 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 552 transitions. [2024-11-19 20:43:17,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-19 20:43:17,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:43:17,211 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:43:17,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 20:43:17,211 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:43:17,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:43:17,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1686357527, now seen corresponding path program 1 times [2024-11-19 20:43:17,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:43:17,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508183437] [2024-11-19 20:43:17,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:43:17,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:43:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:43:18,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 20:43:18,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:43:18,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 20:43:18,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:43:18,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 20:43:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:43:18,863 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 20:43:18,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:43:18,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508183437] [2024-11-19 20:43:18,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508183437] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:43:18,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332867666] [2024-11-19 20:43:18,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:43:18,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:43:18,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:43:18,864 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:43:18,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-19 20:43:19,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:43:19,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 125 conjuncts are in the unsatisfiable core [2024-11-19 20:43:19,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:43:19,301 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 21 treesize of output 9 [2024-11-19 20:43:19,380 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 15 [2024-11-19 20:43:19,388 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2024-11-19 20:43:19,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 31 [2024-11-19 20:43:19,400 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 15 treesize of output 11 [2024-11-19 20:43:19,414 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-19 20:43:19,414 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 1 case distinctions, treesize of input 15 treesize of output 17 [2024-11-19 20:43:19,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-19 20:43:19,495 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 3 [2024-11-19 20:43:19,563 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-19 20:43:19,563 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 26 treesize of output 29 [2024-11-19 20:43:19,650 INFO L349 Elim1Store]: treesize reduction 20, result has 60.0 percent of original size [2024-11-19 20:43:19,650 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 2 case distinctions, treesize of input 31 treesize of output 44 [2024-11-19 20:43:19,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:43:19,675 INFO L349 Elim1Store]: treesize reduction 49, result has 2.0 percent of original size [2024-11-19 20:43:19,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 1 [2024-11-19 20:43:19,744 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 61 treesize of output 37 [2024-11-19 20:43:19,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-19 20:43:19,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 20:43:19,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 20:43:19,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-11-19 20:43:19,800 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 20 [2024-11-19 20:43:19,806 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 20 [2024-11-19 20:43:19,811 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 20 treesize of output 25 [2024-11-19 20:43:19,819 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 20 treesize of output 25 [2024-11-19 20:43:40,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:43:40,619 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 28 treesize of output 15 [2024-11-19 20:43:40,768 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2024-11-19 20:43:40,769 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 91 treesize of output 67 [2024-11-19 20:43:40,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:43:40,787 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 26 treesize of output 13 [2024-11-19 20:43:40,843 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-19 20:43:40,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 19 treesize of output 19 [2024-11-19 20:43:40,958 INFO L349 Elim1Store]: treesize reduction 16, result has 50.0 percent of original size [2024-11-19 20:43:40,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 37 [2024-11-19 20:43:40,979 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 24 treesize of output 11 [2024-11-19 20:43:42,326 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:43:42,326 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 200 treesize of output 152 [2024-11-19 20:43:42,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:43:42,414 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 132 treesize of output 144 [2024-11-19 20:43:45,143 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-19 20:43:45,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 72 [2024-11-19 20:43:45,177 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 20:43:45,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 59 [2024-11-19 20:43:45,713 INFO L349 Elim1Store]: treesize reduction 17, result has 41.4 percent of original size [2024-11-19 20:43:45,713 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 68 treesize of output 59 [2024-11-19 20:43:45,936 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:43:45,936 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:43:47,702 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 162 [2024-11-19 20:43:47,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:43:47,743 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 2 case distinctions, treesize of input 162 treesize of output 158 [2024-11-19 20:43:47,755 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 142 treesize of output 134 [2024-11-19 20:43:47,792 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:43:47,793 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 2 case distinctions, treesize of input 134 treesize of output 130 [2024-11-19 20:43:48,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332867666] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:43:48,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:43:48,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 32 [2024-11-19 20:43:48,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63778542] [2024-11-19 20:43:48,831 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:43:48,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-19 20:43:48,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:43:48,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-19 20:43:48,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1160, Unknown=5, NotChecked=0, Total=1260 [2024-11-19 20:43:48,832 INFO L87 Difference]: Start difference. First operand 419 states and 552 transitions. Second operand has 32 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 28 states have internal predecessors, (69), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)